Rescheduling of identical parallel machines under machine eligibility constraints

Oǧuzhan G. Alagöz, Meral Azizoǧlu*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

55 Scopus citations


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.

Original languageEnglish (US)
Pages (from-to)523-532
Number of pages10
JournalEuropean Journal of Operational Research
Issue number3
StatePublished - Sep 16 2003
Externally publishedYes


  • Eligibility constraints
  • Parallel machines
  • Rescheduling
  • Scheduling

ASJC Scopus subject areas

  • Computer Science(all)
  • Modeling and Simulation
  • Management Science and Operations Research
  • Information Systems and Management


Dive into the research topics of 'Rescheduling of identical parallel machines under machine eligibility constraints'. Together they form a unique fingerprint.

Cite this