Rescheduling of identical parallel machines under machine eligibility constraints

Alagoz O., Azizoglu M.

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, cilt.149, sa.3, ss.523-532, 2003 (SCI-Expanded) identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 149 Sayı: 3
  • Basım Tarihi: 2003
  • Doi Numarası: 10.1016/s0377-2217(02)00499-x
  • Dergi Adı: EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Sayfa Sayıları: ss.523-532
  • Anahtar Kelimeler: scheduling, rescheduling, parallel machines, eligibility constraints, TIMES, DATES
  • Orta Doğu Teknik Üniversitesi Adresli: Evet

Özet

In this study, we address a rescheduling problem in parallel machine environments under machine eligibility constraints. We consider total flow time as efficiency measure and the number of jobs processed on different machines in the initial and revised schedules as a stability measure. We present an optimizing algorithm for minimizing the stability measure subject to the constraint that the efficiency measure is at its minimum level. We then propose several heuristic procedures to generate a set of approximate efficient schedules relative to efficiency and stability measures. (C) 2002 Elsevier Science B.V. All rights reserved.