The bounded single-machine parallel-batching scheduling problem with family jobs and release dates to minimize makespan

Authors:
Q. Q. Nong;C. T. Ng;T. C. E. Cheng
Affiliations:
Department of Mathematics, Ocean University of China, Qingdao, Shandong 266071, PR China;Department of Logistics, The Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong, China;Department of Logistics, The Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong, China
Venue:
Operations Research Letters
Year:
2008

Citing 7
Cited 2

Efficient algorithms for scheduling semiconductor burn-in operations

Operations Research
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Approximation Algorithms in Batch Processing

ISAAC '99 Proceedings of the 10th International Symposium on Algorithms and Computation
Approximation Schemes for Minimizing Average Weighted Completion Time with Release Dates

FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
The unbounded single machine parallel batch scheduling problem with family jobs and release dates to minimize makespan

Theoretical Computer Science
Note: Minimizing makespan with release times on identical parallel batching machines

Discrete Applied Mathematics
Minimizing makespan on a single batching machine with release times and non-identical job sizes

Operations Research Letters

Unbounded parallel-batch scheduling with family jobs and delivery coordination

Information Processing Letters
Unbounded parallel-batching scheduling with two competitive agents

Journal of Scheduling

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the problem of scheduling family jobs with release dates on a bounded batching machine to minimize the makespan. A polynomial-time approximation scheme for the identical job size model and an approximation algorithm with a worst-case ratio of 52 for the non-identical job size model will be derived.