Conference paper
Failure diagnosis with incomplete information in cable networks
Yun Mao, Hani Jamjoom, et al.
CoNEXT 2006
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.
Yun Mao, Hani Jamjoom, et al.
CoNEXT 2006
M.J. Slattery, Joan L. Mitchell
IBM J. Res. Dev
Yigal Hoffner, Simon Field, et al.
EDOC 2004
Thomas M. Cheng
IT Professional