Please use this identifier to cite or link to this item:
https://hdl.handle.net/20.500.14365/1610
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Eliiyi Türsel, Deniz | - |
dc.date.accessioned | 2023-06-16T14:18:53Z | - |
dc.date.available | 2023-06-16T14:18:53Z | - |
dc.date.issued | 2013 | - |
dc.identifier.issn | 0305-215X | - |
dc.identifier.issn | 1029-0273 | - |
dc.identifier.uri | https://doi.org/10.1080/0305215X.2012.743532 | - |
dc.identifier.uri | https://hdl.handle.net/20.500.14365/1610 | - |
dc.description.abstract | Two different problems are introduced in this article to handle capacity and scheduling decisions simultaneously in the fixed job scheduling framework. The combined fixed job scheduling (CFJS) problem integrates these decisions assuming fixed costs for the usage of identical parallel machines, whereas the working time determination (WTD) problem involves unit-time operating or rental costs. Mathematical models for both problems are presented along with the worst case time complexities. While an exact polynomial-time algorithm is proposed for the CFJS problem, a heuristic algorithm is developed for the WTD problem as it is shown to be strongly NP hard. Computational experiments are carried out for evaluating the performance of the algorithms. The results reveal that the solutions by the exact algorithm for the CFJS problem are much faster than a state-of-the-art commercial solver, particularly for large instances. For the WTD problem, the developed heuristic provides high-quality solutions in very short computation times. | en_US |
dc.description.sponsorship | Scientific and Technological Research Council of Turkey (TUBITAK) [109M576] | en_US |
dc.description.sponsorship | The study is supported by the Scientific and Technological Research Council of Turkey (TUBITAK, Project No: 109M576). The author would like to also thank Ugur Eliiyi in assisting in the coding of algorithms in Visual Studio and OPL environments. | en_US |
dc.language.iso | en | en_US |
dc.publisher | Taylor & Francis Ltd | en_US |
dc.relation.ispartof | Engıneerıng Optımızatıon | en_US |
dc.rights | info:eu-repo/semantics/closedAccess | en_US |
dc.subject | tactical fixed job scheduling | en_US |
dc.subject | operational fixed job scheduling | en_US |
dc.subject | capacity planning | en_US |
dc.subject | working time | en_US |
dc.subject | Spread-Time Constraints | en_US |
dc.subject | Computational-Complexity | en_US |
dc.subject | Approximation Algorithms | en_US |
dc.subject | Working | en_US |
dc.title | Integrating tactical and operational decisions in fixed job scheduling | en_US |
dc.type | Article | en_US |
dc.identifier.doi | 10.1080/0305215X.2012.743532 | - |
dc.identifier.scopus | 2-s2.0-84886097602 | en_US |
dc.department | İzmir Ekonomi Üniversitesi | en_US |
dc.authorid | Eliiyi, Deniz Türsel/0000-0001-7693-3980 | - |
dc.authorwosid | Eliiyi, Deniz Türsel/J-9518-2014 | - |
dc.authorscopusid | 14521079300 | - |
dc.identifier.volume | 45 | en_US |
dc.identifier.issue | 12 | en_US |
dc.identifier.startpage | 1449 | en_US |
dc.identifier.endpage | 1467 | en_US |
dc.identifier.wos | WOS:000325602500004 | en_US |
dc.relation.publicationcategory | Makale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanı | en_US |
dc.identifier.scopusquality | Q2 | - |
dc.identifier.wosquality | Q2 | - |
item.grantfulltext | reserved | - |
item.openairetype | Article | - |
item.openairecristype | http://purl.org/coar/resource_type/c_18cf | - |
item.fulltext | With Fulltext | - |
item.languageiso639-1 | en | - |
item.cerifentitytype | Publications | - |
crisitem.author.dept | 05.09. Industrial Engineering | - |
Appears in Collections: | Scopus İndeksli Yayınlar Koleksiyonu / Scopus Indexed Publications Collection WoS İndeksli Yayınlar Koleksiyonu / WoS Indexed Publications Collection |
Files in This Item:
File | Size | Format | |
---|---|---|---|
1610.pdf Restricted Access | 361.73 kB | Adobe PDF | View/Open Request a copy |
CORE Recommender
SCOPUSTM
Citations
6
checked on Nov 20, 2024
WEB OF SCIENCETM
Citations
8
checked on Nov 20, 2024
Page view(s)
62
checked on Nov 18, 2024
Download(s)
6
checked on Nov 18, 2024
Google ScholarTM
Check
Altmetric
Items in GCRIS Repository are protected by copyright, with all rights reserved, unless otherwise indicated.