[Session B4. 일정계획(1)] A Quick Sequencing Algorithm for a Mixed Model Assembly Line with Multiple Stations

This paper addresses a quick sequencing algorithm for a mixed assembly line with multiple work stations where each product is characterized by the presence or absence of each of a set of available options. We compare the proposed algorithm with several heuristics of the sequencing problem that minimize the total utility works and show the computational experiences of the proposed heuristics.