A heuristic approach for big bucket multi-level production planning problems
From MaRDI portal
Publication:958084
DOI10.1016/j.ejor.2007.11.033zbMath1160.90358OpenAlexW2026582326MaRDI QIDQ958084
Andrew J. Miller, Kerem Akartunalı
Publication date: 2 December 2008
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://strathprints.strath.ac.uk/18806/
Integer programming (90C10) Approximation methods and heuristics in mathematical programming (90C59) Production models (90B30)
Related Items
Comments on: On a mixture of the fix-and-relax coordination and Lagrangean substitution schemes for multistage stochastic mixed integer programming ⋮ Dynamic capacitated lot-sizing problems: a classification and review of solution approaches ⋮ A Lagrangian relaxation-based method and models evaluation for multi-level lot sizing problems with backorders ⋮ Mixed integer programming based heuristics for the patient admission scheduling problem ⋮ Production planning with order acceptance and demand uncertainty ⋮ 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 ⋮ Using and extending fix-and-relax to solve maritime inventory routing problems ⋮ Predictive Search for Capacitated Multi-Item Lot Sizing Problems ⋮ Extended formulation and valid inequalities for the multi-item inventory lot-sizing problem with supplier selection ⋮ A computational analysis of lower bounds for big bucket production planning problems ⋮ Progressive Selection Method for the Coupled Lot-Sizing and Cutting-Stock Problem ⋮ Local Cuts and Two-Period Convex Hull Closures for Big-Bucket Lot-Sizing Problems ⋮ Collaborative production planning of supply chain under price and demand uncertainty ⋮ Fix-and-optimize heuristics for capacitated lot-sizing with sequence-dependent setups and substitutions ⋮ Effective matheuristics for the multi-item capacitated lot-sizing problem with remanufacturing ⋮ Distance and matching-induced search algorithm for the multi-level lot-sizing problem with substitutable bill of materials ⋮ An efficient matheuristic for offline patient-to-bed assignment problems ⋮ 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 ⋮ An optimization framework for solving capacitated multi-level lot-sizing problems with backlogging ⋮ Robust formulations for economic lot-sizing problem with remanufacturing ⋮ A robust optimization model for multi-product two-stage capacitated production planning under uncertainty ⋮ Worst case analysis of relax and fix heuristics for lot-sizing problems ⋮ A hybrid optimization approach for multi-level capacitated lot-sizing problems ⋮ Generalized relax-and-fix heuristic
Uses Software
Cites Work
- Unnamed Item
- Lot-size models with backlogging: Strong reformulations and cutting planes
- Valid inequalities and projecting the multicommodity extended formulation for uncapacitated fixed charge network flow problems
- A cutting plane approach to capacitated lot-sizing with start-up costs
- On the polyhedral structure of a multi-item production planning model with setup times
- Local branching
- Exploring relaxation induced neighborhoods to improve MIP solutions
- Polyhedra for lot-sizing with Wagner-Whitin costs
- A study of the lot-sizing polytope
- The feasibility pump
- Approximate extended formulations
- Dynamic Version of the Economic Lot Size Model
- Lot Sizing in General Assembly Systems with Setup Costs, Setup Times, and Multiple Constrained Resources
- A General Heuristic for Production Planning Problems
- Modelling Practical Lot-Sizing Problems as Mixed-Integer Programs
- Solving Multi-Item Lot-Sizing Problems with an MIP Solver Using Classification and Reformulation
- bc — prod: A Specialized Branch-and-Cut System for Lot-Sizing Problems
- Uncapacitated lot-sizing: The convex hull of solutions
- 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
- Octane: A New Heuristic for Pure 0–1 Programs
- Multilevel Lot Sizing with Setup Times and Multiple Constrained Resources: Internally Rolling Schedules with Lot-Sizing Windows
- Strong Formulations for Multi-Item Capacitated Lot Sizing
- Optimal Lot-Sizing Algorithms for Complex Product Structures
- Solving Multi-Item Capacitated Lot-Sizing Problems Using Variable Redefinition
- Deterministic Production Planning: Algorithms and Complexity
- A Simple Forward Algorithm to Solve General Dynamic Lot Sizing Models with n Periods in 0(n log n) or 0(n) Time
- Improved Algorithms for Economic Lot Size Problems
- A Lagrangean-Based Heuristic for Dynamic Multilevel Multiitem Constrained Lotsizing with Setup Times
- An O(T3) Algorithm for the Economic Lot-Sizing Problem with Constant Capacities
- Deterministic Production Planning with Concave Costs and Capacity Constraints
- Production Planning by Mixed Integer Programming
- The uncapacitated lot-sizing problem with sales and safety stocks
