Mixed integer programming in production planning with backlogging and setup carryover: modeling and algorithms
From MaRDI portal
Publication:2393142
DOI10.1007/s10626-012-0141-3zbMath1273.90130MaRDI QIDQ2393142
Shi, Leyuan, Tao Wu, Jie Song, Kerem Akartunalı
Publication date: 7 August 2013
Published in: Discrete Event Dynamic Systems (Search for Journal in Brave)
Full work available at URL: https://strathprints.strath.ac.uk/40463/
Related Items
A Lagrangian relaxation-based method and models evaluation for multi-level lot sizing problems with backorders, An integrated approach for production lot sizing and raw material purchasing
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Single and parallel machine capacitated lotsizing and scheduling: new iterative MIP-based neighborhood search heuristics
- On the equivalence of strong formulations for capacitated multi-level lot sizing problems with setup times
- Decomposition based heuristic algorithm for lot-sizing and scheduling problem treating time horizon as a continuum
- A heuristic approach for big bucket multi-level production planning problems
- Solving a multi-level capacitated lot sizing problem with multi-period setup carry-over via a fix-and-optimize heuristic
- Uncapacitated lot sizing with backlogging: the convex hull
- A heuristic for the dynamic multi-level capacitated lotsizing problem with linked lotsizes for general product structures
- Solution approaches for the soft drink integrated production lot sizing and scheduling problem
- Lot-size models with backlogging: Strong reformulations and cutting planes
- An MIP-based interval heuristic for the capacitated multi-level lot-sizing problem with setup times
- Single item lot-sizing problems with backlogging on a single machine at a finite production rate
- An optimization framework for solving capacitated multi-level lot-sizing problems with backlogging
- Rolling-horizon and fix-and-relax heuristics for the parallel machine lot-sizing and scheduling problem with sequence-dependent set-up costs
- Linear-programming extended formulations for the single-item lot-sizing problem with backlogging and constant capacity
- A Tabu-Search Heuristic for the Capacitated Lot-Sizing Problem with Set-up Carryover
- The Capacitated Lot-Sizing Problem with Linked Lot Sizes
- bc — prod: A Specialized Branch-and-Cut System for Lot-Sizing Problems
- Neighbourhood search meta-heuristics for capacitated lot-sizing with sequence-dependent setups
- Solving Multi-Item Lot-Sizing Problems Using Strong Cutting Planes
- Modeling multiple stage manufacturing systems with generalized costs and capacity issues
- Progressive Interval Heuristics for Multi-Item Capacitated Lot-Sizing Problems
- Multilevel Lot Sizing with Setup Times and Multiple Constrained Resources: Internally Rolling Schedules with Lot-Sizing Windows
- Tight Mip Formulation for Multi-Item Discrete Lot-Sizing Problems
- Mathematical Programming Approaches to Capacity-Constrained MRP Systems: Review, Formulation and Problem Reduction
- Strong Formulations for Multi-Item Capacitated Lot Sizing
- Solving Multi-Item Capacitated Lot-Sizing Problems Using Variable Redefinition
- A Lagrangean-Based Heuristic for Dynamic Multilevel Multiitem Constrained Lotsizing with Setup Times
- A tabu search heuristic for solving the CLSP with backlogging and set-up carry-over
- The Single-Product Lot-Sizing Problem with Constant Parameters and Backlogging: Exact Results, a New Solution, and All Parameter Stability Regions
