An optimization framework for solving capacitated multi-level lot-sizing problems with backlogging
From MaRDI portal
Publication:2275834
DOI10.1016/j.ejor.2011.04.029zbMath1218.90046OpenAlexW2092387420MaRDI QIDQ2275834
Joseph Geunes, Kerem Akartunalı, Tao Wu, Shi, Leyuan
Publication date: 10 August 2011
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://strathprints.strath.ac.uk/37401/
Related Items (18)
Lead time considerations for the multi-level capacitated lot-sizing problem ⋮ A Lagrangian relaxation-based method and models evaluation for multi-level lot sizing problems with backorders ⋮ The green capacitated multi-item lot sizing problem with parallel machines ⋮ A hybrid Lagrangian-simulated annealing-based heuristic for the parallel-machine capacitated lot-sizing and scheduling problem with sequence-dependent setup times ⋮ Mixed integer programming in production planning with backlogging and setup carryover: modeling and algorithms ⋮ The synchronized and integrated two-level lot sizing and scheduling problem: evaluating the generalized mathematical model ⋮ Depth-first heuristic search for the job shop scheduling problem ⋮ Integrated lot sizing and blending problems ⋮ Dynamic emergency logistics planning: models and heuristic algorithm ⋮ Progressive Selection Method for the Coupled Lot-Sizing and Cutting-Stock Problem ⋮ Analytics Branching and Selection for the Capacitated Multi-Item Lot Sizing Problem with Nonidentical Machines ⋮ Distance and matching-induced search algorithm for the multi-level lot-sizing problem with substitutable bill of materials ⋮ A relax-and-fix with fix-and-optimize heuristic applied to multi-level lot-sizing problems ⋮ On the equivalence of strong formulations for capacitated multi-level lot sizing problems with setup times ⋮ An MIP-based interval heuristic for the capacitated multi-level lot-sizing problem with setup times ⋮ A robust optimization model for multi-product two-stage capacitated production planning under uncertainty ⋮ Bi-level programming problem in the supply chain and its solution algorithm ⋮ Multi-level lot sizing and job shop scheduling with compressible process times: a cutting plane approach
Cites Work
- Unnamed Item
- Unnamed Item
- A heuristic approach for big bucket multi-level production planning problems
- Uncapacitated lot sizing with backlogging: the convex hull
- Lot-size models with backlogging: Strong reformulations and cutting planes
- Deterministic lotsizing models for production planning
- Multi-level lot-sizing problem: Evaluation of a simulated-annealing heuristic
- New parallel randomized algorithms for the traveling salesman problem
- On the polyhedral structure of a multi-item production planning model with setup times
- A multi-item production planning model with setup times: algorithms, reformulations, and polyhedral characterizations for a special case
- Analysis of solution space-dependent performance of simulated annealing: The case of the multi-level capacitated lot sizing problem
- Lotsizing with backlogging and start-ups: The case of Wagner-Whitin costs
- Single item lot-sizing problems with backlogging on a single machine at a finite production rate
- Linear-programming extended formulations for the single-item lot-sizing problem with backlogging and constant capacity
- An Optimization Framework for Product Design
- Solving Multi-Item Lot-Sizing Problems Using Strong Cutting Planes
- Modeling multiple stage manufacturing systems with generalized costs and capacity issues
- Multilevel Lot Sizing with Setup Times and Multiple Constrained Resources: Internally Rolling Schedules with Lot-Sizing Windows
- Mathematical Programming Approaches to Capacity-Constrained MRP Systems: Review, Formulation and Problem Reduction
- Solving Multi-Item Capacitated Lot-Sizing Problems Using Variable Redefinition
- A Lagrangean-Based Heuristic for Dynamic Multilevel Multiitem Constrained Lotsizing with Setup Times
- Nested Partitions Method for Global Optimization
- Solving the capacitated lot-sizing problem with backorder consideration
- Solving the CLSP by a Tabu Search Heuristic
- 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
- Production Planning by Mixed Integer Programming
- A Backlogging Model and a Multi-Echelon Model of a Dynamic Economic Lot Size Production System—A Network Approach
- Scheduling
This page was built for publication: An optimization framework for solving capacitated multi-level lot-sizing problems with backlogging
