A fixed job scheduling problem with machine-dependent job weights

Date

2009-01-01

Author

Eliiyi, D. T.
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

23
views

0
downloads

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 and dominance conditions. Computational experience on large-sized problem examples reveals the satisfactory performance of the BB algorithm.

Subject Keywords

Fixed job scheduling, Machine-dependent job weights, Eligibility constraints

URI

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

Journal

INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH

DOI

https://doi.org/10.1080/00207540701499499

Collections

Department of Industrial Engineering, Article

Suggestions

OpenMETU
Core

Fixed job scheduling on uniform parallel machines Bekki, Özgün Barış; Azizoğlu, Meral; Department of Industrial Engineering (2003) In this study, a fixed job scheduling problem on uniform parallel machines is considered. The objective function is the maximization of the total weight of the jobs processed. We show that it is NP-hard and develop polynomial time algo rithms for some special cases. We propose a branch and bound algorithm that employs dominance conditions and powerful lower and upper bounding proce dures. Computational analysis is conducted to investigate the effects of changing certain parameters on the difficulty of the p...
Spread time considerations in operational fixed job scheduling Eliiyi, D. T.; Azizoğlu, Meral (Informa UK Limited, 2006-10-15) In this study, we consider the operational fixed job scheduling problem on identical parallel machines. We assume that the jobs have fixed ready times and deadlines, and spread time constraints are imposed on machines. Our objective is to select a set of jobs for processing so as to maximise the total weight. We show that the problem is strongly NP-hard, and we investigate several special polynomially solvable cases. We propose a branch and bound algorithm that employs size reduction mechanisms, dominance c...
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.
Rescheduling of identical parallel machines under machine eligibility constraints Alagoz, O; Azizoğlu, Meral (2003-09-16) 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 approxim...
Operational fixed interval scheduling problem on uniform parallel machines Bekki, Oezguen Baris; Azizoğlu, Meral (Elsevier BV, 2008-04-01) In this study, we address an operational fixed interval scheduling problem on uniform parallel machines. Our objective is to maximize the total weight of the jobs processed. We show that the problem is NP-hard in the strong sense and develop polynomial time algorithms for some special cases. We propose a branch and bound algorithm that employs dominance conditions and tight bounds. The results of our computational tests have revealed that the algorithm returns optimal solutions for problem instances with up...

Citation Formats

D. T. Eliiyi and M. Azizoğlu, “A fixed job scheduling problem with machine-dependent job weights,” INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, pp. 2231–2256, 2009, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/33054.