Victor Valls, Panagiotis Promponas, et al.
IEEE Communications Magazine
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.
Victor Valls, Panagiotis Promponas, et al.
IEEE Communications Magazine
Khaled A.S. Abdel-Ghaffar
IEEE Trans. Inf. Theory
Bowen Zhou, Bing Xiang, et al.
SSST 2008
Chidanand Apté, Fred Damerau, et al.
ACM Transactions on Information Systems (TOIS)