This paper investigated the just-in-time material replenishment problem in a mixed-model assembly line. Given the limited vehicle capacities and no stock-outs constraint, an integer programming model was established to minimize the maximum surplus stock of each item of a work center over all tours. To tackle this complex combinatorial optimization problem, an improved artificial bee colony metaheuristic was introduced by applying a novel neighbor search technique based on the critical path method concept. Finally, simulation experiments were carried out and the results demonstrate that the modified metaheuristic is feasible and effective.
展开▼
