Preemptive scheduling on identical parallel machines subject to deadlines


Azizoglu M.

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, cilt.148, sa.1, ss.205-210, 2003 (SCI İndekslerine Giren Dergi) identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 148 Konu: 1
  • Basım Tarihi: 2003
  • Doi Numarası: 10.1016/s0377-2217(02)00374-0
  • Dergi Adı: EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
  • Sayfa Sayıları: ss.205-210

Özet

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.