Hybrid Flowshop Scheduling with Setups to Minimize Makespan of Rubber Coating Line for a Cable Manufacturer

Basit Öğe Kaydı
dc.authoridDuzgit, Zehra/0000-0003-0686-1672
dc.contributor.authorBalci, Diyar
dc.contributor.authorYuksel, Burak
dc.contributor.authorTaskiran, Eda
dc.contributor.authorAslim, Guliz Hande
dc.contributor.authorOzkorkmaz, Hande
dc.contributor.authorDuzgit, Zehra
dc.date.accessioned2024-07-18T20:40:05Z
dc.date.available2024-07-18T20:40:05Z
dc.date.issued2022
dc.departmentİstanbul Bilgi Üniversitesien_US
dc.description21st International Symposium on Production Research (ISPR) - Digitizing Production System -- OCT 07-09, 2021 -- ELECTR NETWORKen_US
dc.description.abstractWe consider the hybrid flowshop scheduling problem of a cable manufacturing company. We focus on rubber coating line to minimize the makespan. Industrial cables differ based on the number of cores and core colors. The rubber coating line is composed of three stages with two identical parallel machines in each stage. These stages are i) Isolation; ii) Bunching; iii) Sheathing. The input of the isolation stage is copper wire whereas the output of the isolation stage is cores with different colors. Before the isolation stage, a sequence-dependent setup time is required based on a cross-section of cables and a sequence-independent setup time is required to change the color of cores. The input of the bunching stage is cores with different colors whereas the output of the bunching stage is bunched cores. Before the bunching stage, a sequence-independent setup time is necessary based on the number of cores. The input of the sheathing stage is bunched cores whereas the output of the sheathing stage is rubber-coated cables. Before the sheathing stage, a sequence-dependent setup time is needed based on area. Since the problem is NP-hard, genetic algorithm is employed. With the help of genetic algorithm, we can determine the best job-machine assignments for each stage, the best job sequence on each machine at each stage, start and completion times of jobs on each stage, and the best makespan.en_US
dc.description.sponsorshipSoc Prod Res,TU Wienen_US
dc.identifier.doi10.1007/978-3-030-90421-0_35
dc.identifier.endpage435en_US
dc.identifier.isbn978-3-030-90421-0
dc.identifier.isbn978-3-030-90420-3
dc.identifier.issn2195-4356
dc.identifier.issn2195-4364
dc.identifier.scopus2-s2.0-85119847803en_US
dc.identifier.scopusqualityQ4en_US
dc.identifier.startpage421en_US
dc.identifier.urihttps://doi.org/10.1007/978-3-030-90421-0_35
dc.identifier.urihttps://hdl.handle.net/11411/6966
dc.identifier.wosWOS:000797796900037en_US
dc.identifier.wosqualityN/Aen_US
dc.indekslendigikaynakWeb of Scienceen_US
dc.indekslendigikaynakScopusen_US
dc.language.isoenen_US
dc.publisherSpringer-Verlag Singapore Pte Ltden_US
dc.relation.ispartofDigitizing Production Systems, Ispr2021en_US
dc.relation.publicationcategoryKonferans Öğesi - Uluslararası - Kurum Öğretim Elemanıen_US
dc.rightsinfo:eu-repo/semantics/closedAccessen_US
dc.subjectSchedulingen_US
dc.subjectHybrid Flowshopen_US
dc.subjectSequence-İndependent Setup Timesen_US
dc.subjectSequence-Dependent Setup Timesen_US
dc.subjectMakespanen_US
dc.subjectGenetic Algorithmen_US
dc.subjectGenetic Algorithmsen_US
dc.titleHybrid Flowshop Scheduling with Setups to Minimize Makespan of Rubber Coating Line for a Cable Manufactureren_US
dc.typeConference Objecten_US

Dosyalar

Koleksiyon

Web of Science Indexed Publications
Scopus Indexed Publications