Preemptive scheduling on identical parallel machines subject to deadlines

2003-07-01
We consider the problem of scheduling n preemptive jobs with deadlines on in identical parallel machines so as to minimize total completion time. We show that the problem is polynomially solvable when the processing times and deadlines are agreeable.

Citation Formats
M. Azizoğlu, “Preemptive scheduling on identical parallel machines subject to deadlines,” EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, vol. 148, no. 1, pp. 205–210, 2003, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/46257.