Rescheduling of identical parallel machines under machine eligibility constraints

Date

2003-09-16

Author

Alagoz, O
Azizoğlu, Meral

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

150
views

0
downloads

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.

Subject Keywords

Scheduling, Rescheduling, Parallel machines, Eligibility constraints

URI

https://hdl.handle.net/11511/39320

Journal

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH

DOI

https://doi.org/10.1016/s0377-2217(02)00499-x

Collections

Department of Industrial Engineering, Article

Suggestions

OpenMETU
Core

Rescheduling with total flow time and number of disrupted jobs criteria Özlen, Melih; Azizoğlu, Meral (2005-12-01) This study considers a rescheduling problem on parallel unrelated machines. We assume there is a disruption of known duration on one machine. After disruption, we aim to reschedule so as to minimize total flow time and number of disrupted jobs. We generate all efficient schedules with respect to these criteria.
On the minimization of total weighted flow time with identical and uniform parallel machines Azizoğlu, Meral (1999-02-16) We consider the NP-hard problem of scheduling jobs on identical parallel machines to minimize total weighted flow time. We discuss the properties that characterize the structure of an optimal solution, present a lower bound and propose a branch and bound algorithm. The algorithm is superior to prior methods presented in the literature. We also extend the algorithm to uniform parallel machines and solve medium-sized problem instances.
Uniform Parallel machine scheduling with family set-up times Tamer, Meral; Azizoğlu, Meral; Azizoğlu, Meral; Department of Industrial Engineering (2003) In this study, we address the scheduling problem of uniform parallel machines with family set-up times so as to minimize the total completion time. We develop a branch and jound algorithm that employs an efficient branching scheme. A bounding mechanism is jroposed to increase the efficiency of this algorithm. Our computational experiment shows hat the optimal solution is found in reasonable CPU times up to 15 jobs. Further experiments »re conducted to test the bounding mechanisms and this experiment indicat...
A fixed job scheduling problem with machine-dependent job weights Eliiyi, D. T.; Azizoğlu, Meral (2009-01-01) This study considers the identical parallel machines operational fixed job scheduling problem with machine-dependent job weights. A job is either processed in a fixed interval or is not processed at all. Our aim is to maximise the total weight of the processed jobs. We show that the problem with machine eligibility constraints resides as a special case of this problem. We identify some special polynomially solvable cases and propose a branch-and-bound (BB) algorithm that employs efficient bounding schemes a...
Preemptive scheduling on identical parallel machines subject to deadlines Azizoğlu, Meral (2003-07-01) 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.

Citation Formats

O. Alagoz and M. Azizoğlu, “Rescheduling of identical parallel machines under machine eligibility constraints,” EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, pp. 523–532, 2003, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/39320.