A branch-and-cut approach for the distributed no-wait flowshop scheduling problem

Basit Öğe Kaydı
dc.authoridAVCI, MUSTAFA/0000-0001-9049-8292
dc.authorwosidHAMZADAYI, Alper/G-3218-2019
dc.contributor.authorAvci, Mustafa
dc.contributor.authorAvci, Mualla Gonca
dc.contributor.authorHamzadayi, Alper
dc.date.accessioned2023-03-22T19:47:19Z
dc.date.available2023-03-22T19:47:19Z
dc.date.issued2022
dc.departmentBelirleneceken_US
dc.description.abstractThe distributed no-wait flowshop scheduling problem (DNWFSP) is an extension of the permutation flowshop scheduling problem with multiple factories and no-wait constraints. The DNWFSP consists of two decisions, namely, assigning jobs to the factories and sequencing the set of jobs assigned to the same factory. The no -wait constraints require that jobs have to be processed without any interruption between operations. Since the introduction of the DNWFSP, a number of metaheuristic approaches were developed to solve it. However, there exists no exact solution approach for the DNWFSP to the best of our knowledge. In this regard, a branch -and-cut (BC) algorithm is proposed to solve the DNWFSP. The proposed BC is integrated with a heuristic algorithm to obtain good upper bounds. Moreover, a set of symmetry breaking constraints are employed in the models to strengthen the formulations. The performance of BC is evaluated on a set of benchmark problem instances available in the related literature. The proposed BC is numerically compared with mixed-integer programming formulations of the DNWFSP which are solved by a commercial solver. The results obtained from the computational experiments reveal the effectiveness of the proposed approach. The proposed BC is able to solve all small-size instances, as well as, 206 out of 660 large-size instances to optimality. Besides, it is worth to mention that the average percentage gap for the large-size instances with two factories is only 0.43%.en_US
dc.identifier.doi10.1016/j.cor.2022.106009
dc.identifier.issn0305-0548
dc.identifier.issn1873-765X
dc.identifier.scopus2-s2.0-85137613467en_US
dc.identifier.scopusqualityQ1en_US
dc.identifier.urihttps://doi.org/10.1016/j.cor.2022.106009
dc.identifier.urihttps://hdl.handle.net/20.500.14034/613
dc.identifier.volume148en_US
dc.identifier.wosWOS:000864703400002en_US
dc.identifier.wosqualityQ2en_US
dc.indekslendigikaynakWeb of Scienceen_US
dc.indekslendigikaynakScopusen_US
dc.language.isoenen_US
dc.publisherPergamon-Elsevier Science Ltden_US
dc.relation.journalComputers & Operations Researchen_US
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanıen_US
dc.rightsinfo:eu-repo/semantics/closedAccessen_US
dc.subjectSchedulingen_US
dc.subjectFlowshop schedulingen_US
dc.subjectDistributed no-waiten_US
dc.subjectBranch-and-cuten_US
dc.subjectSearch Algorithmen_US
dc.subjectOptimization Algorithmen_US
dc.subjectMakespanen_US
dc.subjectFormulationsen_US
dc.titleA branch-and-cut approach for the distributed no-wait flowshop scheduling problemen_US
dc.typeArticleen_US

Dosyalar

Koleksiyon

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