Ozturk, CemalettinTunali S.Hnich B.Örnek, Mustafa Arslan2023-06-162023-06-1620129.78E+121474-6670https://doi.org/10.3182/20120523-3-RO-2023.00160https://hdl.handle.net/20.500.14365/3756et al.;IFAC Technical Committee - TC1.3;IFAC Technical Committee - TC2.4;IFAC Technical Committee - TC4.2;IFAC Technical Committee - TC4.3;TC5.1 - Manufacturing Plant Control14th IFAC Symposium on Information Control Problems in Manufacturing, INCOM'12 -- 23 May 2012 through 25 May 2012 -- Bucharest -- 92587In this paper, we study flexible mixed model assembly lines with serially connected stages where stages may have one or more parallel stations. Station parallelism in flexible mixed model assembly lines improves system reliability and enables rapid adaptability to customer demand fluctuations. In this paper we consider task assignment, model and task scheduling problems simultaneously. Due to its success in solving combinatorial problems, we develop a Constraint Programming model for the problem and test its performance using various size instances. The results reveal that, the model outperforms a Mixed Integer Programming model and a decomposition scheme given in the literature. © 2012 IFAC.eninfo:eu-repo/semantics/closedAccessBalancingConstraint programmingFlexible manufacturingMixed model assembly LinesSchedulingAssemblyAssembly machinesBalancingComputer programmingConstraint theoryManufactureSchedulingCombinatorial problemConstraint programmingConstraint programming modelDecomposition schemeFlexible manufacturingMixed integer programming modelMixed-model assembly linesTask scheduling problemInteger programmingConference Object10.3182/20120523-3-RO-2023.001602-s2.0-84866128818