Rescheduling of identical parallel machines under machine eligibility constraints

Rescheduling of identical parallel machines under machine eligibility constraints

0.00 Avg rating0 Votes
Article ID: iaor20043081
Country: Netherlands
Volume: 149
Issue: 3
Start Page Number: 523
End Page Number: 532
Publication Date: Sep 2003
Journal: European Journal of Operational Research
Authors: ,
Abstract:

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.

Reviews

Required fields are marked *. Your email address will not be published.