Matthias Kaiserswerth
IEEE/ACM Transactions on Networking
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.
Matthias Kaiserswerth
IEEE/ACM Transactions on Networking
Minkyong Kim, Zhen Liu, et al.
INFOCOM 2008
Rolf Clauberg
IBM J. Res. Dev
Frank R. Libsch, Takatoshi Tsujimura
Active Matrix Liquid Crystal Displays Technology and Applications 1997