Please use this identifier to cite or link to this item:
https://hdl.handle.net/20.500.14365/1571
Title: | Working Time Constraints in Operational Fixed Job Scheduling | Authors: | Eliiyi Türsel, Deniz Azizoglu, Meral |
Keywords: | fixed job scheduling working time constraints branch-and-bound Approximation Algorithms Computational-Complexity |
Publisher: | Taylor & Francis Ltd | Abstract: | In this study we consider the operational fixed job scheduling problem under working time limitations. The problem has several practical implications in both production and service operations; however the relevant research is scarce. We analyse pre-emptive and non pre-emptive versions of the problem and its special cases. We provide polynomial-time algorithms for some special cases. We show that the non pre-emptive jobs problem is strongly NP-hard, and propose a branch-and-bound algorithm that employs efficient bounding procedures and dominance properties. We conduct a numerical experiment to observe the effects of parameters on the quality of the solution. The results of our computational tests for the branch-and-bound algorithm reveal that our algorithm can solve the instances with up to 100 jobs in reasonable times. To the best of our knowledge our branch-and-bound algorithm is the first optimisation attempt to solve the problem. | URI: | https://doi.org/10.1080/00207540903289771 https://hdl.handle.net/20.500.14365/1571 |
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
6
checked on Mar 26, 2025
WEB OF SCIENCETM
Citations
6
checked on Mar 26, 2025
Page view(s)
78
checked on Mar 31, 2025
Download(s)
6
checked on Mar 31, 2025
Google ScholarTM
Check
Altmetric
Items in GCRIS Repository are protected by copyright, with all rights reserved, unless otherwise indicated.