Please use this identifier to cite or link to this item:
https://hdl.handle.net/20.500.14365/1568
Title: | A Fixed Job Scheduling Problem With Machine-Dependent Job Weights | Authors: | Eliiyi, D. T. Azizoglu, M. |
Keywords: | fixed job scheduling machine-dependent job weights eligibility constraints Computational-Complexity Approximation Algorithms |
Publisher: | Taylor & Francis Ltd | Abstract: | 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. | URI: | https://doi.org/10.1080/00207540701499499 https://hdl.handle.net/20.500.14365/1568 |
ISSN: | 0020-7543 1366-588X |
Appears in Collections: | Scopus İndeksli Yayınlar Koleksiyonu / Scopus Indexed Publications Collection WoS İndeksli Yayınlar Koleksiyonu / WoS Indexed Publications Collection |
Show full item record
CORE Recommender
SCOPUSTM
Citations
8
checked on Mar 26, 2025
WEB OF SCIENCETM
Citations
9
checked on Mar 26, 2025
Page view(s)
52
checked on Mar 31, 2025
Download(s)
4
checked on Mar 31, 2025
Google ScholarTM
Check
Altmetric
Items in GCRIS Repository are protected by copyright, with all rights reserved, unless otherwise indicated.