EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, vol.148, no.1, pp.205-210, 2003 (Journal Indexed in SCI)
Article / Article
Title of Journal :
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
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. (C) 2002 Elsevier Science B.V. All rights reserved.