Conference paper
A quantitative analysis of OS noise
Alessandro Morari, Roberto Gioiosa, et al.
IPDPS 2011
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.
Alessandro Morari, Roberto Gioiosa, et al.
IPDPS 2011
Chidanand Apté, Fred Damerau, et al.
ACM Transactions on Information Systems (TOIS)
Frank R. Libsch, Takatoshi Tsujimura
Active Matrix Liquid Crystal Displays Technology and Applications 1997
G. Ramalingam
Theoretical Computer Science