Solving the flexible job shop scheduling and lot streaming problem with setup and transport resource constraints

Basit Öğe Kaydı
dc.authoridTopaloğlu, Şeyda/0000-0001-6827-126X
dc.authoridYunusoglu, Pinar/0000-0001-8026-4935
dc.authorwosidTopaloğlu, Şeyda/AAB-3269-2021
dc.contributor.authorYunusoglu, Pinar
dc.contributor.authorTopaloglu Yildiz, Seyda
dc.date.accessioned2024-03-09T18:48:31Z
dc.date.available2024-03-09T18:48:31Z
dc.date.issued2023
dc.departmentİzmir Bakırçay Üniversitesien_US
dc.description.abstractThis article addresses the Flexible Job Shop Scheduling and Lot Streaming Problem (FJSSP-LS) under setup and transport resource constraints. While the related literature emphasises the lot streaming policy for time-based objectives, setup and transport resource constraints were not considered simultaneously with this policy, limiting the resulting schedule's applicability in practice. For this reason, we propose a novel Constraint Programming (CP) model enriched by an efficient variable and value ordering strategy specifically designed for the FJSSP-LS with resource constraints. We also present a CP-based iterative improvement method, CP-based Large Neighbourhood Search (CP-based LNS), that focuses on exploring large neighbourhoods through the CP model. Both models are initially tested for the FJSSP and have been shown to provide the best solutions to well-known benchmark instances. Next, they are used for the FJSSP-LS, and the proposed CP-based LNS improves the objective function value by 4.68 percent on average compared to the CP model for the generated test problems.en_US
dc.identifier.doi10.1080/23302674.2023.2221072
dc.identifier.issn2330-2674
dc.identifier.issn2330-2682
dc.identifier.issue1en_US
dc.identifier.scopus2-s2.0-85163218432en_US
dc.identifier.scopusqualityQ1en_US
dc.identifier.urihttps://doi.org/10.1080/23302674.2023.2221072
dc.identifier.urihttps://hdl.handle.net/20.500.14034/1360
dc.identifier.volume10en_US
dc.identifier.wosWOS:001008394800001en_US
dc.identifier.wosqualityN/Aen_US
dc.indekslendigikaynakWeb of Scienceen_US
dc.indekslendigikaynakScopusen_US
dc.language.isoenen_US
dc.publisherTaylor & Francis Ltden_US
dc.relation.ispartofInternational Journal of Systems Science-Operations & Logisticsen_US
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanıen_US
dc.rightsinfo:eu-repo/semantics/closedAccessen_US
dc.subjectFlexible Job Shop Scheduling; Lot Streaming; Resource Constraints; Constraint Programming; Large Neighbourhood Searchen_US
dc.titleSolving the flexible job shop scheduling and lot streaming problem with setup and transport resource constraintsen_US
dc.typeArticleen_US

Dosyalar

Orijinal paket
Listeleniyor 1 - 1 / 1
[ X ]
İsim:
1360.pdf
Boyut:
411.02 KB
Biçim:
Adobe Portable Document Format
İndir

Koleksiyon

WoS İndeksli Yayınlar Koleksiyonu
Scopus İndeksli Yayınlar Koleksiyonu