Article ID: | iaor2007629 |
Country: | United Kingdom |
Volume: | 44 |
Issue: | 15 |
Start Page Number: | 3061 |
End Page Number: | 3081 |
Publication Date: | Jan 2006 |
Journal: | International Journal of Production Research |
Authors: | Akali Elif, Yavuz Mesut, Tfeki Sleyman |
Keywords: | programming: dynamic, heuristics |
This paper is concerned with the production smoothing problem that arises in the context of just-in-time manufacturing systems. The production smoothing problem can be solved by employing a two-phase solution methodology, where optimal batch sizes for the products and a sequence for these batches are specified in the first and second phases, respectively. In this paper, we focus on the problem of selecting optimal batch sizes for the products. We propose a dynamic programming (DP) algorithm for the exact solution of the problem. Our computational experiments demonstrate that the DP approach requires significant computational effort, rendering its use in a real environment impractical. We develop three meta-heuristics for the near-optimal solution of the problem, namely strategic oscillation, scatter search and path relinking. The efficiency and efficacy of the methods are tested via a computational study. The computational results show that the meta-heuristic methods considered in this paper provide near-optimal solutions for the problem within several minutes. In particular, the path relinking method can be used for the planning of mixed-model manufacturing systems in real time with its negligible computational requirement and high solution quality.