Solving lot-sizing problems on parallel identical machines using symmetry-breaking constraints

INFORMS Journal on Computing

Volumn 21, Issue 1, 2009, Pages 123-136

  Jans, Raf ^a  

^a HEC MONTRÉAL   (Canada)

Author keywords

Formulations; Lot sizing; Mixed integer programming; Symmetry

Indexed keywords

EID: 67649921386     PISSN: 10919856     EISSN: 15265528     Source Type: Journal    
DOI: 10.1287/ijoc.1080.0283     Document Type: Article

References (78)

1. Ahmadi, R. H., S. Dasu, C. S. Tang. 1992. The dynamic line allocation problem. Management Sci. 38(9) 1341-1353.
2. Artiouchine, K., P. Baptiste. 2005. Inter-distance constraint: An extension of the all-different constraint for scheduling equal length jobs. P. van Beek, ed. Principles and Practice of Constraint Programming (CP 2005), Lecture Notes in Computer Science, Vol. 3709. Springer, Berlin, 62-76.
3. Barnhart, C., E. L. Johnson, G. L. Nemhauser, M. W. P. Savelsbergh, P. H. Vance. 1998. Branch-and-price: Column generation for solving huge integer programs. Oper. Res. 46(3) 316-329.
4. Baptiste, P., C. Le Pape, W. Nuijten. 2001. Constraint-Based Scheduling Applying Constraint Programming to Scheduling Problems. Kluwer Academic Publishers, Boston.
5. Belvaux, G., L. A. Wolsey. 2001. Modelling practical lot-sizing problems as mixed-integer programs. Management Sci. 47(7) 993-1007.
6. Ben Amor, H., J. V. de Carvalho. 2005. Cutting stock problems. G. Desaulniers, J. Desrosiers, M. Solomon, eds. Column Generation. Springer, New York, 131-162.
7. Brailsford, S., C. Potts, B. M. Smith. 1999. Constraint satisfaction problems: Algorithms and applications. Eur. J. Oper. Res. 119557-581.
8. Caseau, Y., F. Laburthe. 1995. Improving branch and bound for jobshop scheduling with constraint propagation. M. Deza, R. Euler, I. Manoussakis, eds. Combinatorics and Computer Science: 8th Franco-Japanese and 4th Franco-Chinese Conf., Lecture Notes in Computer Science, Vol. 1120. Springer, Berlin, 129-149.
9. Cheng, C.-C., S. F. Smith. 1997. Applying constraint satisfaction techniques to job shop scheduling. Ann. Oper. Res. 70 327-357.
10. Clark, A. R. 2003. Optimization approximations for capacity constrained material requirements planning. Internat. J. Production Econom. 84(2) 115-131.
11. Clark, A. R., S. J. Clark. 2000. Rolling-horizon lot-sizing when setup times are sequence-dependent. Internat. J. Production Res.38(10) 2287-2307.
12. Darby-Dowman, K., J. Little. 1998. Properties of some combinatorial optimization problems and their effect on the performance of integer programming and constraint logic programming. INFORMS J. Comput. 10(3) 276-286.
13. Dastidar, S. G., R. Nagi. 2005. Scheduling injection molding operations with multiple resource constraints and sequence dependent setup times and costs. Comput. Oper. Res. 32 2987-3005.
14. Degraeve, Z., R. Jans. 2007. A new Dantzig-Wolfe reformulation and branch-and-price algorithm for the capacitated lot sizing problem with set up times. Oper. Res. 55(5) 909-920.
15. Degraeve, Z., W. Gochet, R. Jans. 2002. Alternative formulations for a layout problem in the fashion industry. Eur. J. Oper. Res.143(1) 80-93.
16. De Matta, R., M. Guignard. 1994a. Dynamic production scheduling for a process industry. Oper. Res. 42(3) 492-503.
17. De Matta, R., M. Guignard. 1994b. Studying the effects of production loss due to setup in dynamic production scheduling. Eur. J. Oper. Res. 72 62-73.
18. De Matta, R., M. Guignard. 1995. The performance of rolling production schedules in a process industry. IIE Trans. 27(5) 564-573.
19. Dillenberger, C., L. F. Escudero, A. Wollensak, W. Zhang. 1994. On practical resource allocation for production planning and scheduling with period overlapping setups. Eur. J. Oper. Res.75 275-286.
20. Dos Santos-Meza, E., M. O. Dos Santos, M. N. Arenales. 2002. A lotsizing problem in an automated foundry. Eur. J. Oper. Res. 139490-500.
21. Dumoulin, A., C. Vercellis. 2000. Tactical models for hierarchical capacitated lot-sizing problems with set-ups and changeovers. Internat. J. Production Res. 38(1) 51-67.
22. Eppen, G. D., R. K. Martin. 1987. Solving multi-item capacitated lot-sizing problems using variable redefinition. Oper. Res. 35(6) 832-848.
23. Fahle, T., S. Schambergerm, M. Sellmann. 2001. Symmetry breaking. T. Walsh, ed. Principles and Practice of Constraint Programming (CP 2001), Lecture Notes in Computer Science, Vol. 2239. Springer, Berlin, 93-107.
24. Focacci, F., M. Milano. 2001. Global cut framework for removing symmetries. T. Walsh, ed. Principles and Practice of Constraint Programming (CP 2001), Lecture Notes in Computer Science, Vol. 2239. Springer, Berlin, 77-92.
25. Frisch, A. M., I. Miguel, T. Walsh. 2001. Symmetry and implied constraints in the steel mill slab design problem. Proc. CP-2001 Workshop on Modelling and Problem Formulation (Formul'01), Paphos, Cyprus, 8-15.
26. Gent, I. P., B. Smith. 1999. Symmetry during search in constraint programming. Research Report 99.02, School of Computer Studies, University of Leeds, Leeds, UK.
27. Gent, I. P., K. E. Petrie, J.-F. Puget. 2006. Symmetry in constraint programming. F. Rossi, P. van Beek, T. Walsh, eds. Handbookof Constraint Programming. Elsevier, New York, 329-376. Gent, I. P., T. Kelsey, S. A. Linton, I. McDonald, I. Miguel, B. M.
28. Smith. 2005. Conditional symmetry breaking. P. van Beek, ed. Principles and Practice of Constraint Programming (CP 2005), Lecture Notes in Computer Science, Vol. 3709. Springer, Berlin, 256-270.
29. Gopalakrishnan, M., D. M. Miller, C. P. Schmidt. 1995. A framework for modeling setup carryover in the capacitated lot sizing problem. Internat. J. Production Res. 33(7) 1973-1988.
30. Gopalakrishnan, M., K. Ding, J. M. Bourjolly, S. Mohanm. 2001. A tabu-search heuristic for the capacitated lot-sizing problem with set-up carryover. Management Sci. 47(6) 851-863.
31. Hooker, J. N. 2002. Logic, optimization and constraint programming. INFORMS J. Comput. 14(4) 295-321.
32. Hooker, J. N. 2005. A hybrid method for planning and scheduling. Constraints 10 385-401.
33. Hooker, J. N. 2006. An integrated method for planning and scheduling to minimize tardiness. Constraints 11 139-157.
34. Hung, Y. F., G. J. Cheng. 2002. Hybrid capacity modeling for alternative machine types in linear programming production planning. IIE Trans. 34(2) 157-165.
35. Jain, V., I. E. Grossmann. 2001. Algorithms for hybrid MILP/CP models for a class of optimization problems. INFORMS J. Comput.13(4) 258-276.
36. Jans, R., Z. Degraeve. 2004a. Improved lower bounds for the capacitated lotsizing problem with setup times. Oper. Res. Lett. 32185-195.
37. Jans, R., Z. Degraeve. 2004b. An industrial extension of the discrete lot sizing and scheduling problem. IIE Trans. 36(1) 47-58.
38. Jans, R., Z. Degraeve. 2007. Meta-heuristics for lot sizing problems: Review and comparison of solution approaches. Eur. J. Oper. Res. 177 1855-1875.
39. Jans, R., Z. Degraeve. 2008. Modeling industrial lot sizing problems: A review. Internat. J. Production Res. 46(6) 1619-1643.
40. Jordan, C., A. Drexl. 1995. A comparison of constraint and mixed-integer programming solvers for batch sequencing with sequence-dependent setups. INFORMS J. Comput. 7(2) 180-185.
41. Kaibel, V., M. E. Pfetsch. 2008. Packing and partitioning orbitopes. Math. Programming 114 1-36.
42. Kang, S., K. Malik, L. J. Thomas. 1999. Lotsizing and scheduling on parallel machines with sequence-dependent setup costs. Management Sci. 45(2) 273-289.
43. Kimms, A., A. Drexl. 1998. Proportional lot sizing and scheduling: Some extenstions. Networks 32 85-101.
44. Law, Y. C., J. H. M. Lee. 2006. Symmetry breaking constraints for value symmetries in constraint satisfaction. Constraints 11221-267.
45. Leachman, R. C., T. F. Carmon. 1992. On capacity modeling for production planning with alternative machine types. IIE Trans.24(4) 62-72.
46. Le Pape, C., P. Baptiste. 1998. Resource constraints for preemptive job-shop scheduling. Constraints 3 263-287.
47. Madan, M. S., K. C. Gilbert. 1992. An exact solution algorithm for a class of production planning and scheduling problems. J. Oper. Res. Soc. 43(10) 961-970.
48. Margot, F. 2002. Pruning by isomorphism in branch-and-cut. Math. Programming Ser. A 94 71-90.
49. Margot, F. 2003. Exploiting orbits in symmetric ILP. Math. Programming Ser. B 98 3-21.
50. Margot, F. 2007. Symmetric ILP: Coloring and small integers. Discrete Optim. 4 40-62.
51. Mehrotra, A., M. A. Trick. 1996. A column generation approach for graph coloring. INFORMS J. Comput. 8(4) 344-354.
52. Meyr, H. 2002. Simultaneous lotsizing and scheduling on parallel machines. Eur. J. Oper. Res. 139 277-292.
53. Nuijten, W., C. Le Pape. 1998. Constraint-based job shop scheduling with ILOG scheduler. J. Heuristics 3 271-286.
54. Nuijten, W. P. M., E. H. L. Aarts. 1996. A computational study of constraint satisfaction for multiple capacitated job shop scheduling. Eur. J. Oper. Res. 90 269-284.
55. Ottosson, G., E. S. Thorsteinsson, J. N. Hooker. 2002. Mixed global constraints and inference in hybrid CLP-IP solvers. Ann. Math. Artificial Intelligence 34 271-290.
56. Özdamar, L., G. Barbarosǒ glu. 1999. Hybrid heuristics for the multistage capacitated lot sizing and loading problem. J. Oper. Res. Soc. 50 810-825.
57. Özdamar, L., S. I. Birbil. 1998. Hybrid heuristics for the capacitated lot sizing and loading problem with setup times and overtime decisions. Eur. J. Oper. Res. 110 525-547.
58. Plastria, F. 2002. Formulating logical implications in combinatorial optimization. Eur. J. Oper. Res. 140 338-353.
59. Pochet, Y., L. A. Wolsey. 2006. Production Planning by Mixed Integer Programming. Springer, New York.
60. Proll, L., B. Smith. 1998. Integer linear programming and constraint programming approaches to a template design problem. INFORMS J. Comput. 10(3) 265-275.
61. Puget, J.-F. 2005a. Symmetry breaking revisited. Constraints 1023-46.
62. Puget, J.-F. 2005b. Automatic detection of variable and value symmetry. P. van Beek, ed. Principles and Practice of Constraint Programming (CP 2005), Lecture Notes in Computer Science, Vol. 3709. Springer, Berlin, 475-489.
63. Sadykov, R., L. A.Wolsey. 2006. Integer programming and constraint programming solving a multimachine assignment scheduling problem with deadlines and release dates. INFORMS J. Comput.18(2) 209-217.
64. Salomon, M., L. G. Kroon, R. Kuik, L. N. Van Wassenhove. 1991. Some extensions of the discrete lotsizing and scheduling problem. Management Sci. 37(7) 801-812.
65. Sellmann, M., P. Van Hentenryck. 2005. Structural symmetry breaking. Proc. Joint Internat. Conf. Artificial Intelligence (IJCAI'05), Edinburgh, UK, 298-303.
66. Sherali, H. D., J. C. Smith. 2001. Improving discrete model representations via symmetry considerations. Management Sci. 47(10) 1396-1407.
67. Sherali, H. D., B. M. P. Fraticelli, R. D. Meller. 2003. Enhanced model formulation for optimal facility layout. Oper. Res. 51(4) 629-644.
68. Sherali, H. D., J. C. Smith, Y. Lee. 2000. Enhanced model representations for an intra-ring synchronous optical network design problem allowing demand splitting. INFORMS J. Comput. 12(4) 284-298.
69. Smith, B. 2001. Reducing symmetry in a combinatorial design problem. Proc. CP-AI-OR'01, Third Internat. Workshop Integration AI OR Techniques Constraint Programming Combin. Optim. Problems, Wye College (Imperial College), Ashford, Kent, UK.
70. Sox, C. R., Y. Gao. 1999. The capacitated lot sizing problem with setup carry-over. IIE Trans. 31(2) 173-181.
71. Stadtler, H. 2003. Multilevel lot sizing with setup times and multiple constrained resources: Internally rolling schedules with lot-sizing windows. Oper. Res. 51(3) 487-502.
72. Suerie, C., H. Stadtler. 2003. The capacitated lot-sizing problem with linked lot sizes. Management Sci. 49(8) 1039-1054.
73. Timpe, C. 2002. Solving planning and scheduling problems with combined integer and constraint programming. OR Spectrum24 431-448.
74. Trigeiro, W., L. J. Thomas, J. O. McClain. 1989. Capacitated lot sizing with set-up times. Management Sci. 35(3) 353-366.
75. Vanderbeck, F. 1998. Lot-sizing with start-up times. Management Sci.44(10) 1409-1425.
76. Van Hentenryck, P. 2002. Constraint and integer programming in OPL. INFORMS J. Comput. 14(4) 345-372.
77. Wagner, H. M., T. M. Whitin. 1958. Dynamic version of the economic lot size model. Management Sci. 5(1) 89-96.
78. Wolsey, L. A. 2002. Solving multi-item lot-sizing problems with an MIP solver using classification and reformulation. Management Sci. 48(12) 1587-1602.