Predictive Search for Capacitated Multi-Item Lot Sizing Problems

References

• Absi N, Kedad-Sidhoum S (2007) MIP-based heuristics for multi-item capacitated lot-sizing problem with setup times and shortage costs. RAIRO Oper. Res. 41:171–192.Crossref, Google Scholar
• Akartunali K, Miller AJ (2009) A heuristic approach for big bucket multi-level production planning problems. Eur. J. Oper. Res. 193:396–411.Crossref, Google Scholar
• Akartunali 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
• Almeder C (2010) A hybrid optimization approach for multi-level capacitated lot-sizing problems. Eur. J. Oper. Res. 200:599–606.Crossref, Google Scholar
• Barany I, Van Roy TJ, Wolsey LA (1984) Strong formulations for multi-item capacitated lot-sizing. Management Sci. 30(10):1255–1261.Link, 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
• Berretta R, Rodrigues LF (2004) A memetic algorithm for a multistage capacitated lot-sizing problem. Internat. J. Production Econom. 87:67–81.Crossref, Google Scholar
• Billington P, McClain J, Thomas L (1983) Mathematical programming approaches to capacity-constrained MRP systems: Review, formulation and problem reduction. Management Sci. 29(10):1126–1141.Link, 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
• Constantino M (1996) A cutting plane approach to capacitated lot-sizing with start-up costs. Math. Programming 75:353–376.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
• Dellaert N, Jeunet J, Jonard N (2000) A genetic algorithm to solve the general multi-level lot-sizing problem with time-varying costs. Internat. J. Production Econom. 68:241–257.Crossref, Google Scholar
• Diaby M, Bahl HC, Karwan MH, Zionts S (1992) A Lagrangean relaxation approach for very-large-scale capacitated lot-sizing. Management Sci. 38(9):1329–1340.Link, Google Scholar
• Dye C, Ouyang L (2011) A particle swarm optimization for solving joint pricing and lot-sizing problem with fluctuating demand and trade credit financing. Comput. Indust. Engrg. 60:127–137.Crossref, 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, Tzur M (1993) The dynamic lot-sizing model with backlogging: A simple O(n log n) algorithm and minimal forecast horizon procedure. Naval Res. Logist. 40:459–478.Crossref, 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
• Florian M, Lenstra JK, Rinnooy Kan HG (1980) Deterministic production planning: Algorithms and complexity. Management Sci. 26(7):669–679.Link, Google Scholar
• Fragkos I, Degraeve Z, Reyck BD (2016) A horizon decomposition approach for the capacitated lot-sizing problem with setup times. INFORMS J. Comput. 28(3):465–482.Link, Google Scholar
• Gopalakrishnan M, Ding K, Bourjolly JM, Mohan S (2001) A tabu-search heuristic for the capacitated lot-sizing problem with set-up carryover. Management Sci. 47(6):851–863.Link, Google Scholar
• Guan Y, Ahmed S, Nemhauser GL, Miller AJ (2006) A branch-and-cut algorithm for the stochastic uncapacitated lot-sizing problem. Math. Programming 105:55–84.Crossref, Google Scholar
• Han Y, Tang J, Kaku I, Mu L (2009) Solving uncapacitated multilevel lot-sizing problems using a particle swarm optimization with flexible inertial weight. Comput. Math. Appl. 57:1748–1755.Crossref, Google Scholar
• Heuvel WVD, Wagelmans APM (2006) An efficient dynamic programming algorithm for a special case of the capacitated lot-sizing problem. Comput. Oper. Res. 33:3583–3599.Crossref, Google Scholar
• Hindi KS (1995) Solving the single-item, capacitated dynamic lot sizing problem with startup and reservation costs by Tabu search. Comput. Indust. Engrg. 28:701–707.Crossref, Google Scholar
• Hosmer DW, Lemeshow S (2000) Applied Logistic Regression, 2nd ed. (John Wiley & Sons, New York).Crossref, Google Scholar
• Jans R, Degraeve Z (2004) Improved lower bounds for the capacitated lot sizing problem with setup times. Oper. Res. Lett. 32:185–195.Crossref, Google Scholar
• Joanes DN (1993) Reject inference applied to logistic regression for credit scoring. IMA J. Management Math. 5:35–43.Crossref, Google Scholar
• Krarup JBilde O (1977) Plant location, set covering and economic lot sizes: An O(mn) algorithm for structured problems. Collatz L, Meinardus G, Wetterling W, eds. Numerische Methoden bei Optimierungsaufgaben Band 3, International Series of Numerical Mathematics, vol. 36 (Birkhauser Verlag, Basel, Switzerland), 155–180.Crossref, Google Scholar
• Levi R, Lodi A, Sviridenko M (2008) Approximation algorithms for the capacitated multi-item lot-sizing problem via flow-cover inequalities. Math. Oper. Res. 33:461–474.Link, Google Scholar
• Liang Z, Feng Y, Zhang X, Wu T, Chaovalitwongse WA (2015) Robust weekly aircraft maintenance routing problem and the extension to the tail assignment problem. Transportation Res. Part B: Methodological 78:238–259.Crossref, Google Scholar
• Millar HH, Yang MZ (1994) Lagrangian heuristics for the capacitated multiitem lot-sizing problem with backordering. Internat. J. Production Econom. 34:1–15.Crossref, Google Scholar
• Miller AJ, Nemhauser GL, Savelsbergh MWP (2000) Solving multi-item capacitated lot-sizing problems with setup times by branch-and-cut. Working paper, Center for Operations Research and Econometrics, Universite Catholique de Louvain, Louvain-la-Neuve, Belgium.Google Scholar
• Miller AJ, Nemhauser GL, Savelsbergh MWP (2003) A multi-item production planning model with setup times: Algorithms, reformulations, and polyhedral characterizations for a special case. Math. Programming 95:71–90.Crossref, Google Scholar
• Müller LF, Spoorendonk S, Pisinger D (2012) A hybrid adaptive large neighborhood search heuristic for lot-sizing with setup times. Eur. J. Oper. Res. 218:614–623.Crossref, Google Scholar
• Özdamar L, Barbarosoglu G (2000) An integrated Lagrangean relaxation-simulated annealing approach to the multi-level multi-item capacitated lot sizing problem. Internat. J. Production Econom. 68:319–331.Crossref, 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:299–319.Crossref, Google Scholar
• Pitakaso R, Almeder C, Doerner KF, Hartl RF (2007) A MAX-MIN ant system for unconstrained multi-level lot-sizing problems. Comput. Oper. Res. 34:2533–2552.Crossref, Google Scholar
• Pochet Y, Wolsey LA (1991) Solving multi-item lot-sizing problems using strong cutting planes. Management Sci. 37(1):53–67.Link, Google Scholar
• Shaw DX, Wagelmans APM (1998) An algorithm for single-item capacitated economic lot sizing with piecewise linear production costs and general holding costs. Management Sci. 44(6):831–838.Link, Google Scholar
• Shi L, Ólafsson S (2000) Nested partitions method for global optimization. Oper. Res. 48(3):390–407.Link, Google Scholar
• Sohn SY, Kim HS (2007) Random effects logistic regression model for default prediction of technology credit guarantee fund. Eur. J. Oper. Res. 183:472–478.Crossref, Google Scholar
• Song YY, Chan GH (2005) Single item lot-sizing problems with backlogging on a single machine at a finite production rate. Eur. J. Oper. Res. 161:191–202.Crossref, Google Scholar
• Stadtler H (1997) Reformulations of the shortest route model for dynamic multi-item multi-level capacitated lot sizing. OR Spectrum 19:87–96.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
• Süral H, Denizel M, Wassenhove LNV (2009) Lagrangean relaxation based heuristics for lot sizing with setup times. Eur. J. Oper. Res. 194:51–63.Crossref, Google Scholar
• Tang ZB (1994) Adaptive partitioned random search to global optimization. IEEE Trans. Automatic Control 39(11):2235–2244.Crossref, Google Scholar
• Tang O (2004) Simulated annealing in lot sizing problems. Internat. J. Production Econom. 88:173–181.Crossref, Google Scholar
• Tempelmeier H, Derstroff M (1996) A Lagrangian-based heuristic for dynamic multilevel multiitem constrained lot sizing with setup times. Management Sci. 42(5):738–757.Link, Google Scholar
• Toledo CFM, de Oliveira RRR, França PM (2013) A hybrid multi-population genetic algorithm applied to solve the multi-level capacitated lot sizing problem with backlogging. Comput. Oper. Res. 40(4):910–919.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
• Vyve MV, Wolsey LA, Yaman H (2014) Relaxations for two-level multi-item lot-sizing problems. Math. Programming 146:495–523.Crossref, Google Scholar
• Wu T (2020) Technical note–On nested partitions method for global optimization. Oper. Res., ePub ahead of print October 14, https://doi.org/10.1287/opre.2020.2026.Google Scholar
• Wu T, Liang Z, Zhang C (2018) Analytics branching and selection for the capacitated multi-item lot sizing problem with nonidentical machines. INFORMS J. Comput. 30(2):236–258.Link, 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:500–511.Crossref, Google Scholar
• Wu T, Shi L, Song J (2012) An MIP-based interval heuristic for the capacitated multi-level lot-sizing problem with setup times. Ann. Oper. Res. 196:635–650.Crossref, Google Scholar
• Wu T, Zhang C, Liang Z, Leung SCH (2013) A Lagrangian relaxation-based method and models evaluation for multi-level lot sizing problems with backorders. Comput. Oper. Res. 40:1852–1863.Crossref, Google Scholar
• Xiao Y, Zhang R, Zhao Q, Kaku I, Xu Y (2014) A variable neighborhood search with an effective local search for uncapacitated multilevel lot-sizing problems. Eur. J. Oper. Res. 235:102–114.Crossref, Google Scholar
• Xie F, Wu T, Zhang C (2019) A branch-and-price algorithm for the integrated berth allocation and quay crane assignment problem. Transportation Sci. 53(5):1427–1454.Link, Google Scholar
• Zhang C, Xie F, Huang K, Wu T, Liang Z (2017) MIP models and a hybrid method for the capacitated air-cargo network planning and scheduling problems. Transportation. Res. Part E: Logist. Transportation. Rev. 103:158–173.Crossref, Google Scholar