Constraint programming approach for multi-resource-constrained unrelated parallel machine scheduling problem with sequence-dependent setup times

Basit Öğe Kaydı
dc.authoridTopaloglu Yildiz, Seyda / 0000-0001-6827-126X
dc.authoridYunusoglu, Pinar / 0000-0001-8026-4935
dc.authorscopusid57222024508
dc.authorscopusid57217523717
dc.authorwosidTopaloglu Yildiz, Seyda/ABH-3224-2021
dc.contributor.authorYunusoğlu, Pınar
dc.contributor.authorYıldız, Seyda Topaloğlu
dc.date.accessioned2022-02-15T16:59:04Z
dc.date.available2022-02-15T16:59:04Z
dc.date.issued2021
dc.departmentBakırçay Üniversitesien_US
dc.description.abstractThis paper studies the multi-resource-constrained unrelated parallel machine scheduling problem under various operational constraints with the objective of minimising maximum completion time among the scheduled jobs. Sequence-dependent setup times, precedence relations, machine eligibility restrictions and release dates are incorporated into the problem as operational constraints to reflect real-world manufacturing environments. The considered problem is in NP-hard class of problems, which cannot be solved in deterministic polynomial time. Our aim in this study is to develop an exact solution approach based on constraint programming (CP), which shows good performance in solving scheduling problems. In this regard, we propose a CP model and enrich this model by adding lower bound restrictions and redundant constraints. Moreover, to achieve a reduction in computation time, we propose two branching strategies for the proposed CP model. The performance of the CP model is tested using randomly generated and benchmark instances from the literature. The computational results indicate that the proposed CP model outperforms the best solutions with an average gap of 15.52%.en_US
dc.identifier.doi10.1080/00207543.2021.1885068
dc.identifier.issn0020-7543
dc.identifier.issn1366-588X
dc.identifier.scopus2-s2.0-85101004058en_US
dc.identifier.scopusqualityQ1en_US
dc.identifier.urihttps://doi.org/10.1080/00207543.2021.1885068
dc.identifier.urihttps://hdl.handle.net/20.500.14034/509
dc.identifier.wosWOS:000619076400001en_US
dc.identifier.wosqualityQ1en_US
dc.indekslendigikaynakWeb of Scienceen_US
dc.indekslendigikaynakScopusen_US
dc.language.isoenen_US
dc.publisherTaylor & Francis Ltden_US
dc.relation.journalInternational Journal Of Production Researchen_US
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanıen_US
dc.rightsinfo:eu-repo/semantics/closedAccessen_US
dc.subjectUnrelated parallel machinesen_US
dc.subjectschedulingen_US
dc.subjectmultiple resourcesen_US
dc.subjectconstraint programmingen_US
dc.subjectbranching strategiesen_US
dc.subjectGenetic Algorithmen_US
dc.titleConstraint programming approach for multi-resource-constrained unrelated parallel machine scheduling problem with sequence-dependent setup timesen_US
dc.typeArticleen_US

Dosyalar

Orijinal paket
Listeleniyor 1 - 1 / 1
[ X ]
İsim:
Constraint programming approach for multi-resource-constrained unrelated parallel machine scheduling problem with sequence-dependent setup times.pdf
Boyut:
2.09 MB
Biçim:
Adobe Portable Document Format
Açıklama:
Tam Metin / Full Text
İndir

Koleksiyon

WoS İndeksli Yayınlar Koleksiyonu
Endüstri Mühendisliği Bölümü Koleksiyonu
Scopus İndeksli Yayınlar Koleksiyonu