Article ID: | iaor2006438 |
Country: | United Kingdom |
Volume: | 18 |
Issue: | 5 |
Start Page Number: | 376 |
End Page Number: | 385 |
Publication Date: | Jul 2005 |
Journal: | International Journal of Computer Integrated Manufacturing |
Authors: | Dolgui A., Levin G., Louly M.-A. |
Keywords: | supply chain, lot sizing |
The paper addresses a problem of optimal lot-sizing and sequencing of manufacturing items for production lines. The following factors are taken into account: processing times, set-up times, random machine breakdowns and rejects. The goal is to maximize the probability of a desired output for a given period. A mathematical model of the problem and an optimization approach are discussed. This approach is based on the decomposition of the initial problem in three subproblems: an enumeration, a travelling salesman problem and a knapsack problem. An iterative optimization procedure is proposed, based on this decomposition.