| Abstract: | This paper describes an algorithm for solving optimally, the mixed-model sequencing problem when assembly line stations are balanced for each model. An optimal sequence is obtained with the minimization of the overall assembly line length for zero station idle time.The algorithm incorporates two basic steps. The first involves a search procedure that generates all cycle sequences; i.e. sequences having identical ‘start’ and ‘finish’ positions and whose work content can be executed within a defined station length. The second step uses integer programming (IP) to determine the number and combination of the various cycle sequences, such that the production demand is satisfied. |
