Level scheduling of mixed-model assembly lines under storage constraints

Abstract

In a mixed-model assembly line, different models of a common base product can be manufactured in intermixed production sequences. A famous solution approach for the resulting short-term sequencing problem is the so-called level scheduling problem, which aims at evenly smoothing the material requirements over time in order to facilitate a just-in-time supply. However, if materials are delivered in discrete quantities, the resulting spread of material usages implies that issued cargo carriers of a respective material remain at a station for a longer period of time. In practical applications with many materials required per station, this procedure might lead to bottlenecks with respect to the scarce storage space at stations. This paper investigates level scheduling under the constraint that the induced part usage patterns may not violate given storage constraints. The resulting sequencing problem is formalised and solved by suitable exact and heuristic solution approaches.