MIP-based fix-and-optimise algorithms for the parallel machine capacitated lot-sizing and scheduling problem

International Journal of Production Research

Volumn 51, Issue 16, 2013, Pages 5011-5028

  Xiao, Jing ^a   Zhang, Canrong ^a   Zheng, Li ^a   Gupta, Jatinder N D ^b  

^a TSINGHUA UNIVERSITY   (China)

^b UNIVERSITY OF ALABAMA IN HUNTSVILLE   (United States)

Author keywords

capacitated lot sizing and scheduling; fix and optimise; preference; sequence dependent setup; time window; unrelated parallel machines

Indexed keywords

CAPACITATED LOT SIZING; FIX-AND-OPTIMISE; PREFERENCE; SEQUENCE DEPENDENT SETUPS; TIME WINDOWS; UNRELATED PARALLEL MACHINES;

DECISION MAKING; SCHEDULING; SEMICONDUCTOR DEVICE MANUFACTURE; VEHICLE ROUTING;

ALGORITHMS;

EID: 84882448391     PISSN: 00207543     EISSN: 1366588X     Source Type: Journal    
DOI: 10.1080/00207543.2013.790570     Document Type: Article

References (39)

1. Absi, N., and, Kedad-Sidhoum, S. 2007. MIP-based Heuristics for Multi-item Capacitated Lot-Sizing Problem with Setup Times and Shortage Costs. RAIRO-Operations Research, 41 (2): 171-192.
2. Absi, N., and, Kedad-Sidhoum, S. 2008. The Multi-Item Capacitated Lot-Sizing Problem with Setup Times and Shortage Costs. European Journal of Operational Research, 185 (3): 1351-1374.
3. Absi, N., Kedad-Sidhoum, S., and, Dauzere-Peres, S. 2011. Uncapacitated Lot-Sizing Problem with Production Time Windows, Early Productions, Backlogs and Lost Sales. International Journal of Production Research, 49 (9): 2551-2566.
4. Akartunal, K., and, Miller, A. J. 2009. A Heuristic Approach for Big Bucket Multi-level Production Planning Problems. European Journal of Operational Research, 193 (2): 396-411.
5. Almada-Lobo, B., Klabjan, D., Antóniacarravilla, M., and, Oliveira, J. F. 2007. Single Machine Multi-Product Capacitated Lot Sizing with Sequence-Dependent Setups. International Journal of Production Research, 45 (20): 4873-4894.
6. Belvaux, G., and, Wolsey, L. A. 2001. Modelling Practical Lot-Sizing Problems as Mixed-integer Programs. Management Science, 47 (7): 993-1007.
7. Beraldi, P., Ghiani, A., Grieco, A., and, Guerriero, E. 2008. Rolling-Horizon and Fix-and-Relax Heuristics for the Parallel Machine Lot-Sizing and Scheduling Problem with Sequence-Dependent Set-up Costs. Computers & Operations Research, 35 (11): 3644-3656.
8. Biskup, D., and, Feldmann, M. 2005. Lot Streaming with Variable Sublots: an Integer Programming Formulation. Journal of the Operational Research Society, 57 (3): 296-303.
9. Brahimi, N., Dauzere-Peres, S., and, Wolsey, L. A. 2010. Polyhedral and Lagrangian Approaches for Lot Sizing with Production Time Windows and Setup Times. Computers & Operations Research, 37 (1): 182-188.
10. Chan, F. T. S., Wong, T. C., and, Chan, L. Y. 2008. Lot Streaming for Product Assembly in Job Shop Environment. Robotics and Computer-integrated Manufacturing, 24 (3): 321-331.
11. Clark, A., Almada-Lobo, B., and, Almeder, C. 2011. Lot Sizing and Scheduling: Industrial Extensions and Research Opportunities. International Journal of Production Research, 49 (9): 2457-2461.
12. Degraeve, Z., and, Jans, R. 2007. A New Dantzig-Wolfe Reformulation and Branch-and-Price Algorithm for the Capacitated Lot-Sizing Problem with Setup Times. Operations Research, 55 (5): 909-920.
13. González-Ramírez, R. G., Smith, N. R., and, Askin, R. G. 2011. A Heuristic Approach for a Multi-Product Capacitated Lot-Sizing Problem with Pricing. International Journal of Production Research, 49 (4): 1173-1196.
14. Haase, K. 1996. Capacitated Lot-Sizing with Sequence Dependent Setup Costs. OR Spektrum, 18 (1): 51-59.
15. Hans, E., and, van de Velde, S. 2011. The Lot Sizing and Scheduling of Sand Casting Operations. International Journal of Production Research, 49 (9): 2481-2499.
16. Hindi, K. S. 1996. Solving the CLSP by a Tabu Search Heuristic. Journal of the Operational Research Society, 47 (1): 151-161.
17. Hindi, K. S., Fleszar, K., and, Charalambous, C. 2003. An Effective Heuristic for the CLSP with Set-up times. Journal of the Operational Research Society, 54 (5): 490-498.
18. James, R. J. W., and, Almada-Lobo, B. 2011. Single and Parallel Machine Capacitated Lotsizing and Scheduling: New Iterative MIP-Based Neighborhood Search Heuristics. Computers & Operations Research, 38 (12): 1816-1825.
19. Jans, R. 2009. Solving Lot-Sizing Problems on Parallel Identical Machines Using Symmetry-Breaking Constraints. INFORMS Journal on Computing, 21 (1): 123-136.
20. Karimi, B., Fatemi Ghomi, S. M. T., and, Wilson, J. M. 2003. The Capacitated Lot Sizing Problem: a Review of Models and Algorithms. Omega, 31 (5): 365-378.
21. Karimi, B., Fatemi-Ghomi, S. M. T., and, Wilson, J. M. 2006. A Tabu Search Heuristic for Solving the CLSP with Backlogging and Set-up Carry-over. Journal of the Operational Research Society, 57 (2): 140-147.
22. Kovács, A., Brown, K. N., and, Tarim, S. A. 2009. An Efficient MIP Model for the Capacitated Lot-Sizing and Scheduling Problem with Sequence-Dependent Setups. International Journal of Production Economics, 118 (1): 282-291.
23. Lang, J. C., and, Shen, Z.-J. M. 2011. Fix-and-Optimize Heuristics for Capacitated Lot-Sizing with Sequence-Dependent Setups and Substitutions. European Journal of Operational Research, 214 (3): 595-605.
24. Meyr, H. 2000. Simultaneous Lotsizing and Scheduling by Combining Local Search with Dual Reoptimization. European Journal of Operational Research, 120 (2): 311-326.
25. Meyr, H. 2002. Simultaneous Lotsizing and Scheduling on Parallel Machines. European Journal of Operational Research, 139 (2): 277-292.
26. Pinedo, M. L. 2008. Scheduling Theory, Algorithms and Systems, 3rd ed., New York: Springer.
27. Quadt, D., and, Kuhn, H. 2009. Capacitated Lot-Sizing and Scheduling with Parallel Machines, Back-Orders, and Setup Carry-over. Naval Research Logistics, 56 (4): 366-384.
28. Sahling, F., Buschkühl, L., Tempelmeier, H., and, Helber, S. 2009. Solving a Multi-Level Capacitated Lot Sizing Problem with Multi-period Setup Carry-over via a Fix-and-optimize Heuristic. Computers & Operations Research, 36 (9): 2546-2553.
29. Song, Y., and, Chan, G. H. 2005. Single Item Lot-Sizing Problems with Backlogging on a Single Machine at a Finite Production Rate. European Journal of Operational Research, 161 (1): 191-202.
30. Stadtler, H. 2003. Multilevel Lot Sizing with Setup Times and Multiple Constrained Resources: Internally Rolling Schedules with Lot-Sizing Windows. Operations Research, 51 (3): 487-502.
31. Tang, L., Meng, Y., and, Liu, J. 2011. An Improved Lagrangean Relaxation Algorithm for the Dynamic Batching Decision Problem. International Journal of Production Research, 49 (9): 2501-2517.
32. Toledo, F. M. B., and, Armentano, V. A. 2006. A Lagrangian-Based Heuristic for the Capacitated Lot-Sizing Problem in Parallel Machines. European Journal of Operational Research, 175 (2): 1070-1083.
33. Transchel, S., Minner, S., Kallrath, J., Löhndorf, N., and, Eberhard, U. 2011. A Hybrid General Lot-Sizing and Scheduling Formulation for a Production Process with a Two-Stage Product Structure. International Journal of Production Research, 49 (9): 2463-2480.
34. Wolsey, L. A. 2002. Solving Multi-item Lot-Sizing Problems with an MIP Solver Using Classification and Reformulation. Management Science, 48 (12): 1587-1602.
35. Wolsey, L. A. 2006. Lot-Sizing with Production and Delivery Time Windows. Mathematical Programming, 107: 471-489.
36. Wu, T., and, Shi, L. 2011. Mathematical Models for Capacitated Multi-Level Production Planning Problems with Linked Lot Sizes. International Journal of Production Research, 49 (20): 6227-6247.
37. Wu, T., Shi, L., and, Duffie, N. A. 2010. An HNP-MP Approach for the Capacitated Multi-Item Lot Sizing Problem with Setup Times. IEEE Transactions on Automation Science and Engineering, 7 (3): 500-511.
38. Wu, T., Shi, L., Geunes, J., and, Akartunali, K. 2011. An Optimization Framework for Solving Capacitated Multi-Level Lot-Sizing Problems with Backlogging. European Journal of Operational Research, 214 (2): 428-441.
39. Wu, T., Shi, L., and, Song, J. 2012. An MIP-Based Interval Heuristic for the Capacitated Multi-Level Lot-Sizing Problem with Setup Times. Annals of Operations Research, 196 (1): 635-650.