Dense open-shop schedules with release times

  • Authors:

  • Rongjun Chen;Wanzhen Huang;Guochun Tang

  • Affiliations:

  • School of Sciences, Changzhou Institute of Technology, Changzhou, Jiangsu, 213002, China;Department of Mathematical Sciences, Lakehead University, Thunder Bay, Ontario, Canada P7B5E1;Institute of Management Engineering, Shanghai Second Polytechnic University, Shanghai, 201209, China

  • Venue:
  • Theoretical Computer Science
  • Year:
  • 2008

Quantified Score

Hi-index 5.23

Visualization

Abstract

We study open-shop scheduling problems with job release times. The objective is to minimize the makespan. Dense schedules, easy to construct, are often used as approximate solutions. Performance ratios of the makespans from dense schedules and that of the optimal schedule of the problem are used to evaluate the quality of approximate schedules. It is conjectured (proved for a limited number of machines) that this performance ratio is bounded above by (2-1/m) for m-machine open-shop problems without job release times. In this paper, we extend the conjecture to open-shop problems with job release times. The results proved in this paper are: 1. Dense schedule performance ratio is bounded above by 2 for three-machine open-shop problems with job release times; 2. The conjectured performance ratio upper bound of 5/3 is proved for two special cases of three-machine open-shop problems with job release times; 3. A performance ratio upper bound of 7/4 is proved for three-machine problems.