Conference paper
Global routing revisited
Michael D. Moffitt
ICCAD 2009
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.
Michael D. Moffitt
ICCAD 2009
Alfonso P. Cardenas, Larry F. Bowman, et al.
ACM Annual Conference 1975
Frank R. Libsch, S.C. Lien
IBM J. Res. Dev
Zohar Feldman, Avishai Mandelbaum
WSC 2010