Three is easy, two is hard: open shop sum-batch scheduling problem refined

Authors:
Irina V. Gribkovskaia;Chung-Yee Lee;Vitaly A. Strusevich;Dominique De Werra
Affiliations:
Molde University College, Molde, Norway;Hong Kong University of Science and Technology, Hong Kong;University of Greenwich, London, UK;ícole Polytechnique Fédérale de Lausanne, Lausanne, Switzerland
Venue:
Operations Research Letters
Year:
2006

Citing 3
Cited 2

Open Shop Scheduling to Minimize Finish Time

Journal of the ACM (JACM)
Linear time algorithms for knapsack problems with bounded weights

Journal of Algorithms
Scheduling Batches with Sequential Job Processing for Two-Machine Flow and Open Shops

INFORMS Journal on Computing

Minimizing makespan for multi-spindle head machines with a mobile table

Computers and Operations Research
Enhanced mixed integer programming model for a transfer line design problem

Computers and Industrial Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

For the two-machine open shop sum-batch problem to minimize the makespan an optimal schedule is known to contain one, two or three batches on each machine, and finding a two-batch optimal schedule is NP-hard. We adapt the open shop algorithm by de Werra for finding a three-batch optimal schedule in linear time.