Rescheduling of identical parallel machines under machine eligibility constraints

被引：43

作者：

Alagöz, O

Azizoglu, M ^{[1
]}

机构：

[1] Middle E Tech Univ, Dept Ind Engn, TR-06531 Ankara, Turkey

[2] Univ Pittsburgh, Dept Ind Engn, Pittsburgh, PA 15261 USA

来源：

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH | 2003年 / 149卷 / 03期

关键词：

scheduling; rescheduling; parallel machines; eligibility constraints;

D O I：

10.1016/S0377-2217(02)00499-X

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

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.

引用

页码：523 / 532

页数：10

共 15 条

[1] Match-up scheduling under a machine breakdown [J].