Open-shop dense schedules: properties and worst-case performance ratio

Authors:
Rongjun Chen;Wanzhen Huang;Zhongxian Men;Guochun Tang
Affiliations:
School of Sciences, Changzhou Institute of Technology, Changzhou, China 213002;Department of Mathematical Sciences, Lakehead University, Thunder Bay, Canada P7B5E1;Department of Mathematical Sciences, Lakehead University, Thunder Bay, Canada P7B5E1;Institute of Management Engineering, Shanghai Second Polytechnic University, Shanghai, China 201209
Venue:
Journal of Scheduling
Year:
2012

Citing 2
Cited 0

A branch & bound algorithm for the open-shop problem

GO-II Meeting Proceedings of the second international colloquium on Graphs and optimization
Open Shop Scheduling to Minimize Finish Time

Journal of the ACM (JACM)

Quantified Score

Hi-index	0.00

Visualization

Abstract

Dense schedules are easy to construct and can be used as heuristic solutions for open-shop problems. It is conjectured that in the worst-case a dense schedule will result in a makespan no more than $(2-\frac{1}{m})$ times of the makespan of the optimal schedule, where m is the number of machines. Different approaches have been used in proofs for different number of machines. The conjecture has been proved for the number of machines m驴6, and for some special types of dense schedules. In this paper, we first summarize some useful properties of dense schedules, and then provide some special types of dense schedules that make the conjecture hold. Finally, we give complete proofs of the conjecture for m=7 and 8.