The Coordination of Two Parallel Machines Scheduling and Batch Deliveries

Authors:
Hua Gong;Lixin Tang
Affiliations:
The Logistics Institute, Northeastern University, Shenyang, China and College of Science, Shenyang Ligong University, Shenyang, China;The Logistics Institute, Northeastern University, Shenyang, China
Venue:
COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
Year:
2008

Citing 4
Cited 0

A Fully Polynomial Approximation Scheme for Minimizing Makespan of Deteriorating Jobs

Journal of Heuristics
Scheduling with Fixed Delivery Dates

Operations Research
Supply chain scheduling: Batching and delivery

Operations Research
Improved algorithms for two single machine scheduling problems

Theoretical Computer Science - Algorithmic applications in management

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we consider a two-identical-parallel-machine scheduling problem with batch delivery. Although NP-hardness of this problem has been already proved by Hall and Potts, but they did not give the pseudo-polynomial-time algorithm for the problem. We prove the problem is NP-hard in the ordinary sense by constructing a pseudo-polynomial-time algorithm for the problem. We also give a polynomial-time algorithm to solve the case when the job assignment to parallel machines is given.