Abstract:

Justinsequence(JIS) is a supplement to justintime by providing supplied parts in the right sequence. The successful implementation of JIS depends on stable sequence and reliable delivery. Aiming at the accidents in the process of delivery, we present a method for resequencing mixedmodel assembly lines. Firstly, to minimize the total cost of overload time and free time, we also present a mathematical formulation, and propose three greedy rules and a simulated annealing algorithm.  Numerical examples are designed to verify the performance of these algorithms. Computational experiments show that the four algorithms have the effects of resequencing in short time, and the simulated annealing algorithm is the best and superior to the local search algorithms in literature. We also discuss the factors that affect the numerical examples’ results.

Key words: justinsequence (JIS);accidents;resequencing;simulated annealing