Article ID: | iaor20023216 |
Country: | Netherlands |
Volume: | 139 |
Issue: | 2 |
Start Page Number: | 277 |
End Page Number: | 292 |
Publication Date: | Jun 2002 |
Journal: | European Journal of Operational Research |
Authors: | Meyr Herbert |
Keywords: | heuristics, programming: integer, location |
This paper addresses the simultaneous lotsizing and scheduling of several products on non-identical parallel production lines (heterogeneous machines). The limited capacity of the production lines may be further reduced by sequence dependent setup times. Deterministic, dynamic demand of standard products has to be met without back-logging with the objective of minimizing sequence dependent setup, holding and production costs. The problem is heuristically solved by combining the local search metastrategies threshold accepting and simulated annealing, respectively, with dual reoptimization. Such a solution approach has already proved to be successful for the single machine case. The solution quality and computational performance of the new heuristics are tested by means of real-world problems gathered from industry.