An efficient MIP model for the capacitated lot-sizing and scheduling problem with sequence-dependent setups

Bellman, 1962, Dynamic programming treatment of the travelling salesman problem, Journal of the ACM, 9, 61, 10.1145/321105.321111 Belvaux, 2001, Modelling practical lot-sizing problems as mixed-integer programs, Management Science, 47, 993, 10.1287/mnsc.47.7.993.9800 Chen, 1990, Analysis of relaxations for the multi-item capacitated lot-sizing problem, Annals of Operations Research, 26, 29, 10.1007/BF02248584 Drexl, 1997, Lot-sizing and scheduling—survey and extensions, European Journal of Operational Research, 99, 221, 10.1016/S0377-2217(97)00030-1 Gupta, 2005, The capacitated lot-sizing and scheduling problem with sequence-dependent setup costs and setup times, Computers & Operations Research, 32, 727, 10.1016/j.cor.2003.08.014 Haase, 2000, Lot sizing and scheduling with sequence-dependent setup costs and times and efficient rescheduling opportunities, International Journal of Production Economics, 66, 159, 10.1016/S0925-5273(99)00119-X Kämpf, 2006, Simulation-based sequencing and lot size optimisation for a production-and-inventory system with multiple items, International Journal of Production Economics, 104, 191, 10.1016/j.ijpe.2006.02.008 Karimi, 2003, The capacitated lot-sizing problem: A review of models and algorithms, Omega, 31, 365, 10.1016/S0305-0483(03)00059-8 Marchand, 2002, Cutting planes in integer and mixed integer programming, Discrete Applied Mathematics, 123, 397, 10.1016/S0166-218X(01)00348-1 Meyr, 2000, Simultaneous lotsizing and scheduling by combining local search with dual reoptimization, European Journal of Operational Research, 120, 311, 10.1016/S0377-2217(99)00159-9 Meyr, 2002, Simultaneous lotsizing and scheduling on parallel machines, European Journal of Operational Research, 139, 277, 10.1016/S0377-2217(01)00373-3 Tarim, 2006, Stochastic constraint programming: A scenario-based approach, Constraints, 11, 53, 10.1007/s10601-006-6849-7 Williams, 1999