Analytics Branching and Selection for the Capacitated Multi-Item Lot Sizing Problem with Nonidentical Machines

References

• Akartunalı K, Miller AJ (2012) A computational analysis of lower bounds for big bucket production planning problems. Comput. Optim. Appl. 53(3):729–753.Crossref, Google Scholar
• Akartunalı K, Fragkos I, Miller AJ, Wu T (2016) Local cuts and two-period convex hull closures for big-bucket lot-sizing problems. INFORMS J. Comput. 28(4):766–780.Link, Google Scholar
• Akbalik A, Penz B (2009) Exact methods for single-item capacitated lot sizing problem with alternative machines and piece-wise linear production costs. Internat. J. Production Econom. 119(2):367–379.Crossref, Google Scholar
• Bahl HC (1983) Column generation based heuristic algorithm for multi-item scheduling. IIE Trans. 15(2):136–141.Crossref, Google Scholar
• Belvaux G, Wolsey LA (2000) bc—prod: A specialized branch-and-cut system for lot-sizing problems. Management Sci. 46(5):724–738.Link, Google Scholar
• Beraldi P, Ghiani G, Grieco A, 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. Comput. Oper. Res. 35(11):3644–3656.Crossref, Google Scholar
• Bitran GR, Matsuo H (1986) The multi-item capacitated lot size problem: Error bounds of Manne’s formulations. Management Sci. 32(3):350–359.Link, Google Scholar
• Carreno JJ (1990) Economic lot scheduling for multiple products on parallel identical processors. Management Sci. 36(3):348–358.Link, Google Scholar
• Cattrysse D, Maes J, Van Vassenhove LN (1990) Set partitioning and column generation heuristics for capacitated dynamic lot sizing. Eur. J. Oper. Res. 46(1):38–47.Crossref, Google Scholar
• Chen TY, Huang JH (2013) Application of data mining in a global optimization algorithm. Adv. Engrg. Software 66:24–33.Crossref, Google Scholar
• Chen W, Song J, Shi L, Pi L, Sun P (2013) Data mining-based dispatching system for solving the local pickup and delivery problem. Ann. Oper. Res. 203(1):351–370.Crossref, Google Scholar
• Danna E, Rothberg E, Le Pape C (2005) Exploring relaxation induced neighborhoods to improve MIP solution. Math. Programming, Ser. A 102(1):71–90.Crossref, Google Scholar
• de Araujo SA, De Reyck B, Degraeve Z, Fragkos I, Jans R (2015) Period decompositions for the capacitated lot sizing problem with setup times. INFORMS J. Comput. 27(3):431–448.Link, Google Scholar
• Degraeve Z, Jans R (2007) A new Dantzig-Wolfe reformulation and branch-and-price algorithm for the capacitated lot-sizing problem with setup times. Oper. Res. 55(5):909–920.Link, Google Scholar
• Degraeve Z, Peeters M (2003) Optimal integer solutions to industrial cutting-stock problems: Part 2, benchmark results. INFORMS J. Comput. 15(1):58–81.Link, Google Scholar
• de Matta R, Guignard M (1994) Dynamic production scheduling for a process industry. Oper. Res. 42(3):492–503.Link, Google Scholar
• de Matta R, Guignard M (1995) The performance of rolling production schedules in a process industry. IIE Trans. 27(5):564–573.Crossref, Google Scholar
• du Merle O, Villeneuve D, Desrosiers J, Hansen P (1999) Stabilized column generation. Discrete Math. 194(1–3):229–237.Crossref, Google Scholar
• Dzielinski BP, Gomory RE (1965) Optimal programming of lot sizes, inventory and labor allocations. Management Sci. 11(9):874–890.Link, Google Scholar
• Eppen GD, Martin RK (1987) Solving multi-item lot-sizing problems using variable redefinition. Oper. Res. 35(6):832–848.Link, Google Scholar
• Federgruen A, Meissner J, Tzur M (2007) Progressive interval heuristics for multi-item capacitated lot-sizing problems. Oper. Res. 55(3):490–502.Link, Google Scholar
• Fiorotto DJ, de Araujo SA (2014) Reformulation and a Lagrangian heuristic for lot sizing problem on parallel machines. Ann. Oper. Res. 217(1):213–231.Crossref, Google Scholar
• Fiorotto DJ, Araujo SA, Jans R (2015) Hybrid methods for lot sizing on parallel machines. Comput. Oper. Res. 63(2):136–148.Crossref, Google Scholar
• Fischetti M, Lodi A (2003) Local branching. Math. Programming 98(1):23–47.Crossref, Google Scholar
• Fischetti M, Glover F, Lodi A (2005) The feasibility pump. Math. Programming 104(1):91–104.Crossref, Google Scholar
• Fragkos I, Degraeve Z, De Reyck B (2016) A horizon decomposition approach for the capacitated lot-sizing problem with setup times. INFORMS J. Comput. 28(3):465–482.Link, Google Scholar
• Geoffrion AM (1974) Lagrangean relaxation for integer programming. Math. Programming Study 2:82–114.Crossref, Google Scholar
• Hindi KS (1995) Computationally efficient solution of the multi-item, capacitated lot-sizing problem. Comput. Indust. Engrg. 28(4):709–719.Crossref, Google Scholar
• Hindi KS (1996) Solving the CLSP by a Tabu search heuristic. J. Oper. Res. Soc. 47(1):151–161.Crossref, Google Scholar
• James RJW, Almada-Lobo B (2011) Single and parallel machine capacitated lot sizing and scheduling: New iterative MIP-based neighborhood search heuristics. Comput. Oper. Res. 38(12):1816–1825.Crossref, Google Scholar
• Jans R (2009) Solving lot-sizing problems on parallel identical machines using symmetry-breaking constraints. INFORMS J. Comput. 21(1):123–136.Link, Google Scholar
• Jans R, Degraeve Z (2004) Improved lower bounds for the capacitated lot sizing problem with setup times. Oper. Res. Lett. 32(2):185–195.Crossref, Google Scholar
• Kaczmarczyk W (2011) Proportional lot-sizing and scheduling problem with identical parallel machines. Internat. J. Production Res. 49(9):2605–2623.Crossref, Google Scholar
• Krarup J, Bilde O (1977) Plant location, set covering and economic lot sizes: An O(mn) algorithm for structured problems. Numerische Methoden bei Optimierungsaufgaben Band 3: Optimierung bei graphentheoretischen und ganzzahligen Problemen (Birkhäuser, Basel, Switzerland), 155–180.Crossref, Google Scholar
• Lasdon LS, Terjung RC (1971) An efficient algorithm for multi-item scheduling. Oper. Res. 19(4):946–969.Link, Google Scholar
• Lübbecke ME, Desrosiers J (2005) Selected topics in column generation. Oper. Res. 53(6):1007–1023.Link, Google Scholar
• Manne AS (1958) Programming of economic lot sizes. Management Sci. 4(2):115–135.Link, Google Scholar
• Marinelli F, Nenni ME, Sforza A (2007) Capacitated lot sizing and scheduling with parallel machines and shared buffers: A case study in a packaging company. Ann. Oper. Res. 150(1):177–192.Crossref, Google Scholar
• McGill R, Tukey JW, Larsen WA (1978) Variations of box plots. Amer. Statistician 32(1):12–16.Crossref, Google Scholar
• Meyr H (2002) Simultaneous lot sizing and scheduling on parallel machines. Eur. J. Oper. Res. 139(2):277–292.Crossref, Google Scholar
• Montgomery DC (2008) Design and Analysis of Experiments (John Wiley & Sons, Hoboken, NJ).Google Scholar
• Pimentel CMO, Alvelos FP, Carvalho JMV (2010) Comparing Dantzig–Wolfe decompositions and branch-and-price algorithms for the multi-item capacitated lot sizing problem. Optim. Methods Software 25(2):299–319.Crossref, Google Scholar
• Pochet Y, Wolsey LA, eds. (2006) Production Planning by Mixed Integer Programming (Springer, New York).Google Scholar
• Scott DW (1979) On optimal and data-based histograms. Biometrika 66(3):605–610.Crossref, Google Scholar
• Silva C, Magalhães JM (2006) Heuristic lot size scheduling on unrelated parallel machines with applications in the textile industry. Comput. Indust. Engrg. 50(1–2):76–89.Crossref, Google Scholar
• Stadtler H (1996) Mixed integer programming model formulations for dynamic multi-item multi-level capacitated lot sizing. Eur. J. Oper. Res. 94(3):561–581.Crossref, Google Scholar
• 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.Link, Google Scholar
• Toledo FMB, Armentano VA (2006) A Lagrangian-based heuristic for the capacitated lot-sizing problem in parallel machines. Eur. J. Oper. Res. 175(2):1070–1083.Crossref, Google Scholar
• Trigeiro W, Thomas LJ, John OM (1989) Capacitated lot sizing with setup times. Management Sci. 35(3):353–366.Link, Google Scholar
• Vanderbeck F (2000) On Dantzig–Wolfe decomposition in integer programming and ways to perform branching in a branch-and-price algorithm. Oper. Res. 48(1):111–128.Link, Google Scholar
• Vanderbeck F (2005) Implementing mixed integer column generation. Desaulniers G, Desrosiers J, Solomon MM, eds. (2005) Column Generation (Springer, New York), 331–358.Crossref, Google Scholar
• Vanderbeck F, Savelsbergh MWP (2005) A generic view of Dantzig–Wolfe decomposition in mixed integer programming. Oper. Res. Lett. 34(3):296–306.Crossref, Google Scholar
• Wu T, Shi L, Duffie NA (2010) An HNP-MP approach for the capacitated multi-item lot sizing problem with setup times. IEEE Trans. Automation Sci. Engrg. 7(3):500–511.Crossref, Google Scholar
• Wu T, Akartunalı K, Jans R, Liang Z (2017) Progressive selection method for the coupled lot-sizing and cutting-stock problem. INFORMS J. Comput. 29(3):523–543.Link, Google Scholar
• Wu T, Shi L, Akartunalı K, Geunes J (2011) An optimization framework for solving capacitated multi-level lot-sizing problems with backlogging. Eur. J. Oper. Res. 214(2):428–441.Crossref, Google Scholar
• Wu T, Shi L, Geunes J, Akartunalı K (2012) On the equivalence of strong formulations for capacitated multi-level lot sizing problems with setup times. J. Global Optim. 53(4):615–639.Crossref, Google Scholar
• Xiao J, Yang H, Zhang C, Zheng L, Gupta JND (2015) A hybrid Lagrangian-simulated annealing-based heuristic for the parallel-machine capacitated lot-sizing and scheduling problem with sequence-dependent setup times. Comput. Oper. Res. 63(2):72–82.Crossref, Google Scholar
• Ye P, Pan G (2015) A novel sequential approximate optimization approach using data mining for engineering design optimization. Optim. Methods Software 30(6):24–33.Crossref, Google Scholar