Chi-Leung Wong, Zehra Sura, et al.
I-SPAN 2002
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.
Chi-Leung Wong, Zehra Sura, et al.
I-SPAN 2002
T.S. Jayram, Andrew McGregor, et al.
ACM TODS
B.K. Boguraev, Mary S. Neff
HICSS 2000
Renu Tewari, Richard P. King, et al.
IS&T/SPIE Electronic Imaging 1996