Balci, DiyarYuksel, BurakTaskiran, EdaAslim, Guliz HandeOzkorkmaz, HandeDuzgit, Zehra2024-07-182024-07-182022978-3-030-90421-0978-3-030-90420-32195-43562195-4364https://doi.org/10.1007/978-3-030-90421-0_35https://hdl.handle.net/11411/696621st International Symposium on Production Research (ISPR) - Digitizing Production System -- OCT 07-09, 2021 -- ELECTR NETWORKWe 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.eninfo:eu-repo/semantics/closedAccessSchedulingHybrid FlowshopSequence-İndependent Setup TimesSequence-Dependent Setup TimesMakespanGenetic AlgorithmGenetic AlgorithmsConference Object2-s2.0-8511984780310.1007/978-3-030-90421-0_35435Q4421N/AWOS:000797796900037