Exact solution approaches for the discrete lot-sizing and scheduling problem with parallel resources

International Journal of Production Research

Volumn 49, Issue 9, 2011, Pages 2587-2603

  Gicquel, Celine ^a   Minoux, Michel ^b   Dallery, Yves ^a  

^a LGI   (France)

^b UNIVERSITÉ PIERRE ET MARIE CURIE   (France)

Author keywords

lot sizing and scheduling; mixed integer linear programming; parallel resources; valid inequalities

Indexed keywords

COMPUTATIONAL RESULTS; DISCRETE OPTIMISATION; EXACT SOLUTION; LOT SIZING; LOT-SIZING AND SCHEDULING; MIXED INTEGER LINEAR PROGRAM; MIXED INTEGER LINEAR PROGRAMMING; OPTIMAL SOLUTIONS; PARALLEL RESOURCES; PRODUCTION PLANNING; SCHEDULING PROBLEM; SEPARATION PROBLEMS; SOLUTION ALGORITHMS; VALID INEQUALITY;

LINEAR PROGRAMMING; OPTIMIZATION; PRODUCTION CONTROL;

INTEGER PROGRAMMING;

EID: 79951848495     PISSN: 00207543     EISSN: 1366588X     Source Type: Journal    
DOI: 10.1080/00207543.2010.532927     Document Type: Article

References (30)

1. Almada-Lobo, B., et al., 2010. Multiple machine continuous setup lotsizing with sequencedependent setups. Accepted for publication in Computational Optimization and Applications, DOI: 10.1007/s10589-009-9235-8
2. Beraldi, P., et al., 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 (1), 3644-3656. (Pubitemid 351443068)
3. Brggemann, W. and Jahnke, H., 1997. Remarks on: "Some extensions of the discrete lot-sizing and scheduling problem". Management Science, 43 (1), 122.
4. Bruggemann, W. and Jahnke, H., 2000. The discrete lot-sizing and scheduling problem: Complexity and modification for batch availability. European Journal of Operational Research, 124 (3), 511-529.
5. Busacker, R.G. and Gowen, P.J. 1961. A procedure for determining a family of minimal cost network flow patterns. O.R.O. TechnicalReport, 15, Johns Hopkins University.
6. Cattrysse, D., et al., 1993. A dual ascent and column generation heuristic for the discrete lotsizing and scheduling problem with setup times. Management Science, 39 (4), 477-486.
7. Chopra, S. and Meindl, P., 2004. Supply chain management: strategy, planning and operations. 2nd ed. New Jersey, USA: Pearson Education International.
8. Clark, A.R. and Clark, S.J., 2000. Rolling-horizon lot-sizing when set-up times are sequencedependent. International Journal of Production Research, 38 (10), 2287-2307. (Pubitemid 35401851)
9. Dastidar, S.G. and Nagi, R., 2005. Scheduling injection molding operations with multiple resource constraints and sequence dependent setup times and costs. Computers & Operations Research, 32 (11), 2987-3005. (Pubitemid 40244558)
10. De Matta, R. and Guignard, M., 1994. Dynamic production scheduling for a process industry. Operations Research, 42 (3), 492-503.
11. Doganis, P. and Sarimveis, H., 2008. Optimal production scheduling for the dairy industry. Annals of Operations Research, 159 (1), 315-331.
12. Drexl, A. and Kimms, A., 1997. Lot sizing and scheduling-Survey and extensions. European Journal of Operational Research, 99 (2), 221-235.
13. Edmonds, J. and Karp, R.M., 1972. Theoretical improvements in algorithmic efficiency for network flow problems. Journal of the A.C.M., 19 (2), 248-264.
14. Fleischmann, B., 1990. The discrete lot sizing and scheduling problem. European Journal of Operational Research, 44 (3), 337-348. (Pubitemid 20705770)
15. Jans, R., 2009. Solving lotsizing problems on parallel identical machines using symmetry breaking constraints. INFORMS Journal on Computing, 21 (1), 123-136.
16. Jans, R. and Degraeve, Z., 2004. An industrial extension of the discrete lot-sizing and scheduling problem. IIE Transactions, 36 (1), 47-58.
17. Jans, R. and Degraeve, Z., 2007. Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches. European Journal ofOperational Research, 177 (3), 1855-1875. (Pubitemid 44709458)
18. Jans, R. and Degraeve, Z., 2008. Modeling industrial lot sizing problems: a review. International Journal of Production Research, 46 (6), 1619-1643. (Pubitemid 350161679)
19. Johnson, D. B., 1977. Efficient algorithms for shortest paths in sparse networks. Journal of the ACM, 24 (1), 113.
20. Kang, S., Malik, K., and Thomas, L.J., 1999. Lotsizing and scheduling on parallel machines with sequence-dependent setup costs. Management Science, 45 (2), 273-289.
21. Meyr, H., 2002. Simultaneous lotsizing and scheduling on parallel machines. European Journal of Operational Research, 139 (2), 277-292. (Pubitemid 34201239)
22. Pochet, Y. and Wolsey, L.A., 2006. Productionplanning by mixed integerprogramming. New York: Springer Science.
23. Salomon, M., et al., 1991. Some extensions of the discrete lotsizing and scheduling problem. Management Science, 37 (7), 801-812.
24. Salomon, M., et al., 1997. Solving the discrete lotsizing and scheduling problem with sequence dependent set-up costs and set-up times using the travelling salesman problem with time windows. European Journal of Operational Research, 100 (3), 494-513. (Pubitemid 127392373)
25. Silva, C. and Magalhaes, J.M., 2006. Heuristic lot size scheduling on unrelated parallel machines with applications in the textile industry. Computers & Industrial Engineering, 50 (1-2), 76-89. (Pubitemid 43816789)
26. Stadtler, H., 2005. Supply chain management and advanced planning-basics, overview and challenges. European Journal of Operational Research, 163 (3), 575-588.
27. Van Eijl, C.A. and van Hoesel, C.P.M., 1997. On the discrete lot-sizing and scheduling problem with Wagner-Whitin costs. Operations Research Letters, 20 (1), 7-13. (Pubitemid 127419491)
28. Van Hoesel, S. and Kolen, A., 1994. A linear description of the discrete lot-sizing and scheduling problem. European Journal ofOperational Research, 75 (2), 342-353.
29. Wagner, H.M. and Whitin, T.M., 1958. Dynamic version of the economic lot size model. Management Science, 5 (1), 89-96.
30. Wolsey, L.A., 2002. Solving multi-item lot-sizing problems with an MIP solver using classification and reformulation. Management Science, 48 (12), 1587-1602.