Mixed integer programming in production planning with backlogging and setup carryover: modeling and algorithms
暂无分享,去创建一个
[1] Ross J. W. James,et al. Single and parallel machine capacitated lotsizing and scheduling: New iterative MIP-based neighborhood search heuristics , 2011, Comput. Oper. Res..
[2] Hartmut Stadtler,et al. The Capacitated Lot-Sizing Problem with Linked Lot Sizes , 2003, Manag. Sci..
[3] Laurence A. Wolsey,et al. Multi-item lot-sizing problems using strong cutting planes , 1991 .
[4] Sotirios Papachristos,et al. The Single-Product Lot-Sizing Problem with Constant Parameters and Backlogging: Exact Results, a New Solution, and All Parameter Stability Regions , 2005, Oper. Res..
[5] Horst Tempelmeier,et al. A heuristic for the dynamic multi-level capacitated lotsizing problem with linked lotsizes for general product structures , 2009, OR Spectr..
[6] Patrizia Beraldi,et al. Rolling-horizon and fix-and-relax heuristics for the parallel machine lot-sizing and scheduling problem with sequence-dependent set-up costs , 2008, Comput. Oper. Res..
[7] Laurence A. Wolsey,et al. Tight Mip Formulation for Multi-Item Discrete Lot-Sizing Problems , 2003, Oper. Res..
[8] Leyuan Shi,et al. An MIP-based interval heuristic for the capacitated multi-level lot-sizing problem with setup times , 2012, Ann. Oper. Res..
[9] Leyuan Shi,et al. On the equivalence of strong formulations for capacitated multi-level lot sizing problems with setup times , 2012, J. Glob. Optim..
[10] Leyuan Shi,et al. An optimization framework for solving capacitated multi-level lot-sizing problems with backlogging , 2011, Eur. J. Oper. Res..
[11] Laurence A. Wolsey,et al. bc -- prod: A Specialized Branch-and-Cut System for Lot-Sizing Problems , 2000 .
[12] Hartmut Stadtler,et al. Multilevel Lot Sizing with Setup Times and Multiple Constrained Resources: Internally Rolling Schedules with Lot-Sizing Windows , 2003, Oper. Res..
[13] Laurence A. Wolsey,et al. Lot-size models with backlogging: Strong reformulations and cutting planes , 1988, Math. Program..
[14] Marc Salomon,et al. LINEAR PROGRAMMING, SIMULATED ANNEALING AND TABU SEARCH HEURISTICS FOR LOTSIZING IN BOTTLENECK ASSEMBLY SYSTEMS , 1993 .
[15] Harvey H. Millar,et al. Lagrangian heuristics for the capacitated multi-item lot-sizing problem with backordering , 1994 .
[16] Horst Tempelmeier,et al. Solving a multi-level capacitated lot sizing problem with multi-period setup carry-over via a fix-and-optimize heuristic , 2009, Comput. Oper. Res..
[17] Bernardo Almada-Lobo,et al. Neighbourhood search meta-heuristics for capacitated lot-sizing with sequence-dependent setups , 2010 .
[18] Tao Wu,et al. A novel mixed integer programming formulation and progressively stochastic search for capacitated lot sizing , 2011 .
[19] Youngho Lee,et al. Decomposition based heuristic algorithm for lot-sizing and scheduling problem treating time horizon as a continuum , 2010, Comput. Oper. Res..
[20] J. Krarup,et al. Plant location, Set Covering and Economic Lot Size: An 0 (mn)-Algorithm for Structured Problems , 1977 .
[21] Dirk Briskorn,et al. A note on capacitated lot sizing with setup carry over , 2006 .
[22] A. Federgruen,et al. The dynamic lot-sizing model with backlogging: A simple o(n log n) algorithm and minimal forecast horizon procedure , 1993 .
[23] Kerem Akartunali,et al. A heuristic approach for big bucket multi-level production planning problems , 2009, Eur. J. Oper. Res..
[24] Ke Ding,et al. A Tabu-Search Heuristic for the Capacitated Lot-Sizing Problem with Set-up Carryover , 2001, Manag. Sci..
[25] Reinaldo Morabito,et al. Solution approaches for the soft drink integrated production lot sizing and scheduling problem , 2009, Eur. J. Oper. Res..
[26] John O. McClain,et al. Mathematical Programming Approaches to Capacity-Constrained MRP Systems: Review, Formulation and Problem Reduction , 1983 .
[27] H. Tempelmeier,et al. A Lagrangean-based heuristic for dynamic multilevel multiitem constrained lotsizing with setup times , 1996 .
[28] Yuyue Song,et al. Production , Manufacturing and Logistics Single item lot-sizing problems with backlogging on a single machine at a finite production rate , 2004 .
[29] G. D. Eppen,et al. Solving Multi-Item Capacitated Lot-Sizing Problems Using Variable Redefinition , 1987, Oper. Res..
[30] Yi-Feng Hung,et al. Using tabu search with ranking candidate list to solve production planning problems with setups , 2003, Comput. Ind. Eng..
[31] Stefan Helber,et al. A Fix-and-Optimize Approach for the Multi-Level Capacitated Lot Sizing Problems , 2010 .
[32] Mathieu Van Vyve,et al. Linear-programming extended formulations for the single-item lot-sizing problem with backlogging and constant capacity , 2006, Math. Program..
[33] C. R. Sox,et al. The capacitated lot sizing problem with setup carry-over , 1999 .
[34] John M. Wilson,et al. A tabu search heuristic for solving the CLSP with backlogging and set-up carry-over , 2006, J. Oper. Res. Soc..
[35] Yves Pochet,et al. Uncapacitated lot sizing with backlogging: the convex hull , 2007, Math. Program..
[36] Awi Federgruen,et al. Progressive Interval Heuristics for Multi-Item Capacitated Lot-Sizing Problems , 2007, Oper. Res..
[37] Laurence A. Wolsey,et al. Strong Formulations for Multi-Item Capacitated Lot Sizing , 1984 .
[38] S. Selcuk Erenguc,et al. Modeling multiple stage manufacturing systems with generalized costs and capacity issues , 2005 .