Please use this identifier to cite or link to this item: https://hdl.handle.net/20.500.14365/1610
Full metadata record
DC FieldValueLanguage
dc.contributor.authorEliiyi Türsel, Deniz-
dc.date.accessioned2023-06-16T14:18:53Z-
dc.date.available2023-06-16T14:18:53Z-
dc.date.issued2013-
dc.identifier.issn0305-215X-
dc.identifier.issn1029-0273-
dc.identifier.urihttps://doi.org/10.1080/0305215X.2012.743532-
dc.identifier.urihttps://hdl.handle.net/20.500.14365/1610-
dc.description.abstractTwo 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.sponsorshipScientific and Technological Research Council of Turkey (TUBITAK) [109M576]en_US
dc.description.sponsorshipThe 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.isoenen_US
dc.publisherTaylor & Francis Ltden_US
dc.relation.ispartofEngıneerıng Optımızatıonen_US
dc.rightsinfo:eu-repo/semantics/closedAccessen_US
dc.subjecttactical fixed job schedulingen_US
dc.subjectoperational fixed job schedulingen_US
dc.subjectcapacity planningen_US
dc.subjectworking timeen_US
dc.subjectSpread-Time Constraintsen_US
dc.subjectComputational-Complexityen_US
dc.subjectApproximation Algorithmsen_US
dc.subjectWorkingen_US
dc.titleIntegrating tactical and operational decisions in fixed job schedulingen_US
dc.typeArticleen_US
dc.identifier.doi10.1080/0305215X.2012.743532-
dc.identifier.scopus2-s2.0-84886097602en_US
dc.departmentİzmir Ekonomi Üniversitesien_US
dc.authoridEliiyi, Deniz Türsel/0000-0001-7693-3980-
dc.authorwosidEliiyi, Deniz Türsel/J-9518-2014-
dc.authorscopusid14521079300-
dc.identifier.volume45en_US
dc.identifier.issue12en_US
dc.identifier.startpage1449en_US
dc.identifier.endpage1467en_US
dc.identifier.wosWOS:000325602500004en_US
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanıen_US
dc.identifier.scopusqualityQ2-
dc.identifier.wosqualityQ2-
item.grantfulltextreserved-
item.openairetypeArticle-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.fulltextWith Fulltext-
item.languageiso639-1en-
item.cerifentitytypePublications-
crisitem.author.dept05.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 SizeFormat 
1610.pdf
  Restricted Access
361.73 kBAdobe PDFView/Open    Request a copy
Show simple item record



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.