A computational analysis of lower bounds for big bucket production planning problems
From MaRDI portal
Publication:1935570
DOI10.1007/s10589-012-9465-zzbMath1264.90125OpenAlexW2018062997MaRDI QIDQ1935570
Andrew J. Miller, Kerem Akartunalı
Publication date: 18 February 2013
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://strathprints.strath.ac.uk/39630/
Related Items (14)
Partial objective inequalities for the multi-item capacitated lot-sizing problem ⋮ Extended formulation and valid inequalities for the multi-item inventory lot-sizing problem with supplier selection ⋮ A rolling-horizon approach for multi-period optimization ⋮ Self-adaptive randomized constructive heuristics for the multi-item capacitated lot sizing problem ⋮ 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 ⋮ 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 ⋮ Fixed-Charge Transportation on a Path: Linear Programming Formulations ⋮ Valid inequalities, preprocessing, and an effective heuristic for the uncapacitated three-level lot-sizing and replenishment problem with a distribution structure ⋮ Valid inequalities for two-period relaxations of big-bucket lot-sizing problems: zero setup case ⋮ A relax-and-fix with fix-and-optimize heuristic applied to multi-level lot-sizing problems ⋮ A Horizon Decomposition Approach for the Capacitated Lot-Sizing Problem with Setup Times ⋮ Economic lot-sizing problem with remanufacturing option: complexity and algorithms
Uses Software
Cites Work
- Unnamed Item
- A heuristic approach for big bucket multi-level production planning problems
- Multi-item lot-sizing with joint set-up costs
- Uncapacitated lot sizing with backlogging: the convex hull
- Lot-size models with backlogging: Strong reformulations and cutting planes
- The 0-1 knapsack problem with a single continuous variable
- 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
- Improved lower bounds for the capacitated lot sizing problem with setup times.
- Lifted inequalities for 0-1 mixed integer programming: Basic theory and algorithms
- Lifted inequalities for 0-1 mixed integer programming: superlinear lifting
- Polyhedra for lot-sizing with Wagner-Whitin costs
- A study of the lot-sizing polytope
- Dynamic capacitated lot-sizing problems: a classification and review of solution approaches
- 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
- Approximation Algorithms for the Capacitated Multi-Item Lot-Sizing Problem via Flow-Cover Inequalities
- 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
- A New Dantzig-Wolfe Reformulation and Branch-and-Price Algorithm for the Capacitated Lot-Sizing Problem with Setup Times
- Aggregation and Mixed Integer Rounding to Solve MIPs
- Multilevel Lot Sizing with Setup Times and Multiple Constrained Resources: Internally Rolling Schedules with Lot-Sizing Windows
- Heuristics for Multilevel Lot-Sizing with a Bottleneck
- The Multi-Item Capacitated Lot Size Problem: Error Bounds of Manne's Formulations
- Strong Formulations for Multi-Item Capacitated Lot Sizing
- Solving Multi-Item Capacitated Lot-Sizing Problems Using Variable Redefinition
- Deterministic Production Planning: Algorithms and Complexity
- Computational Complexity of the Capacitated Lot Size Problem
- A Simple Forward Algorithm to Solve General Dynamic Lot Sizing Models with n Periods in 0(n log n) or 0(n) Time
- A Lagrangean-Based Heuristic for Dynamic Multilevel Multiitem Constrained Lotsizing with Setup Times
- Deterministic Production Planning with Concave Costs and Capacity Constraints
- 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
- The uncapacitated lot-sizing problem with sales and safety stocks
- Mixing mixed-integer inequalities
This page was built for publication: A computational analysis of lower bounds for big bucket production planning problems
