Tighter bounds on preemptive job shop scheduling with two machines

Tighter bounds on preemptive job shop scheduling with two machines

0.00 Avg rating0 Votes
Article ID: iaor20033136
Country: United States
Volume: 67
Issue: 1
Start Page Number: 83
End Page Number: 90
Publication Date: Jan 2001
Journal: Computing
Authors: , ,
Abstract:

We consider the preemptive job shop scheduling problem with two machines, with the objective to minimize the makespan. We present an algorithm that finds a schedule of length at most Pmax/12 greater than the optimal schedule length, where Pmax is the length of the longest job.

Reviews

Required fields are marked *. Your email address will not be published.