Article ID: | iaor19992845 |
Country: | United Kingdom |
Volume: | 36 |
Issue: | 9 |
Start Page Number: | 2463 |
End Page Number: | 2477 |
Publication Date: | Sep 1998 |
Journal: | International Journal of Production Research |
Authors: | Aghezzaf E.H., Artiba Abdelhakim |
Keywords: | heuristics, programming: linear |
We present a linear programming based heuristic for the solution of a class of aggregate level planning problems in hybrid flowshops (flowshops with several machines per stage). First, the general planning problem is modelled as multi-level with parallel processors, multi-item, capacitated, lot-sizing with set up times. We suggest a hierarchical approach which sequentially loads the stages; each stage is constrained by the solution of its preceding stage and each stage is treated as a multi-item, capacitated, lot-sizing problem with setup times on parallel processors. We show how this latter problem may be reformulated and solved heuristically as a sequence of network problems (trans-shipment problems) in which the amount of capacity lost in setups is fixed for each period and each processor. The model is within the computing reach of a PC.