Indranil R. Bardhan, Sugato Bagchi, et al.
JMIS
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.
Indranil R. Bardhan, Sugato Bagchi, et al.
JMIS
Hendrik F. Hamann
InterPACK 2013
Israel Cidon, Leonidas Georgiadis, et al.
IEEE/ACM Transactions on Networking
Liat Ein-Dor, Y. Goldschmidt, et al.
IBM J. Res. Dev