Article ID: | iaor20071160 |
Country: | Netherlands |
Volume: | 51 |
Issue: | 1 |
Start Page Number: | 2 |
End Page Number: | 13 |
Publication Date: | Sep 2006 |
Journal: | Computers & Industrial Engineering |
Authors: | Takahashi Katsuhiko, Morikawa Katsumi, Rong Chao |
Keywords: | scheduling, heuristics |
The multi-stage, multi-machine capacitated lot-sizing problem (MSMMCLSP) consists of scheduling the production of one product in a multi-machine production system with a multi-stage structure. Machine capacity is reserved for the production of the end item but can be extended by working overtime (overtime capacity). When a lot size is positive in a specific period, it can be loaded on all machines without exceeding the sum of the regular and overtime capacity limits. In previous research, we have proposed a rescheduling heuristic to determine a feasible and sufficient solution for the MSMMCLSP with only regular capacity limits, in comparison with Franca