Unbounded parallel batch scheduling with job delivery to minimize makespan

Authors:
Lingfa Lu;Jinjiang Yuan
Affiliations:
Department of Mathematics, Zhengzhou University, Zhengzhou, Henan 450052, People's Republic of China;Department of Mathematics, Zhengzhou University, Zhengzhou, Henan 450052, People's Republic of China
Venue:
Operations Research Letters
Year:
2008

Citing 4
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
Minimizing mean response time in batch processing system

COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
On scheduling an unbounded batch machine

Operations Research Letters

Unbounded parallel-batch scheduling with family jobs and delivery coordination

Information Processing Letters
On-line integrated production and outbound distribution scheduling to minimize the maximum delivery completion time

Journal of Scheduling

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider unbounded parallel batch scheduling with job delivery to minimize makespan. When the jobs have identical size, we provide a polynomial-time algorithm. When the jobs have non-identical sizes, we provide a heuristic with a worst-case performance ratio 7/4.