Heinz Koeppl, Marc Hafner, et al.
BMC Bioinformatics
The preemptive job shop scheduling problem with two machines, with the objective to minimize the makespan is studied. An algorithm to find a schedule of length greater than the optimal schedule length is also discussed. The results showed that the maximum job length is bounded by a constant and algorithm finds a schedule whose length is within an additive constant of the optimal length.
Heinz Koeppl, Marc Hafner, et al.
BMC Bioinformatics
David S. Kung
DAC 1998
Yigal Hoffner, Simon Field, et al.
EDOC 2004
A. Gupta, R. Gross, et al.
SPIE Advances in Semiconductors and Superconductors 1990