Optimization of Sequencing Problem for Automobile Manufacturing Based on Sorting Buffer

Abstract

Painted Body Store(PBS) buffer can change the loading sequence of the vehicles, which can meet the requirements of the subsequent production requirements. In this paper, an optimization model of in-and-out vehicle scheduling in PBS is considered, and the vehicle scheduling at the entrance and exit of the buffer is realized respectively. At the entrance of the delivery lane, a heuristic rule is set up to select the optimal lane according to the congestion degree of each available. At the exit of the delivery lane, based on the greedy criterion, it determines whether the vehicle should be taken out, or sent back to the return lane for re-scheduling. In addition, to avoid getting caught in loop scheduling, the penalty term is given to the number of allowed uses of the return path according to the scheduling time cost at the current moment, so that the performance and time cost can be balanced to some extent.