Dense open-shop schedules with release times

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

• Type: Journal
• Year: 2008
• Where: TCS
• Authors: Rongjun Chen, Wanzhen Huang, Guochun Tang
• Keywords: Dense Schedules, Job Release Times, Open-shop Scheduling Problems, TCS 2008, Theoretical Computer Science