Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches
From MaRDI portal
Publication:857326
DOI10.1016/j.ejor.2005.12.008zbMath1102.90002OpenAlexW1978009882MaRDI QIDQ857326
Publication date: 14 December 2006
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://repub.eur.nl/pub/1336/ERS%202004%20042%20LIS.pdf
Approximation methods and heuristics in mathematical programming (90C59) Inventory, storage, reservoirs (90B05)
Related Items (63)
Simultaneous production and maintenance planning for a single capacitated resource facing both a dynamic demand and intensive wear and tear ⋮ Multiple-stage multiple-machine capacitated lot-sizing and scheduling with sequence-dependent setup: a case study in the wheel industry ⋮ MIP-based heuristics for lotsizing in capacitated pure flow shop with sequence-dependent setups ⋮ Neighbourhood search meta-heuristics for capacitated lot-sizing with sequence-dependent setups ⋮ New lot sizing heuristics for demand and price uncertainties with service-level constraint ⋮ Dynamic capacitated lot-sizing problems: a classification and review of solution approaches ⋮ A GLNPSO for multi-level capacitated lot-sizing and scheduling problem in the poultry industry ⋮ Fenced in? Stochastic and deterministic planning models in a time-fenced, rolling-horizon scheduling system ⋮ Heuristic approach on dynamic lot-sizing model for durable products with end-of-use constraints ⋮ Capacitated lot sizing with parallel machines, sequence-dependent setups, and a common setup operator ⋮ Polynomial-Time Solvability of Dynamic Lot Size Problems ⋮ A hybrid VNS approach for the short-term production planning and scheduling: a case study in the pulp and paper industry ⋮ A genetic algorithm/mathematical programming approach to solve a two-level soft drink production problem ⋮ Multi-product valid inequalities for the discrete lot-sizing and scheduling problem ⋮ Designing new heuristics for the capacitated lot sizing problem by genetic programming ⋮ Heuristics for the multi-item capacitated lot-sizing problem with lost sales ⋮ Combining the principles of variable neighborhood decomposition search and the Fix\&Optimize heuristic to solve multi-level lot-sizing and scheduling problems ⋮ A new approach to solve the multi-product multi-period inventory lot sizing with supplier selection problem ⋮ Integrated cost optimization in a two-stage, automotive supply chain ⋮ Mathematical programming-based approaches for multi-facility Glass container production planning ⋮ Large-scale joint price-inventory decision problems, under resource limitation and a discrete price set ⋮ Capacitated replenishment and disposal planning for multiple products with resalable returns ⋮ Infeasibility handling in genetic algorithm using nested domains for production planning ⋮ The synchronized and integrated two-level lot sizing and scheduling problem: evaluating the generalized mathematical model ⋮ A metaheuristic approach to solving a multiproduct EOQ-based inventory problem with storage space constraints ⋮ Data-driven branching and selection for lot-sizing and scheduling problems with sequence-dependent setups and setup carryover ⋮ Design of mathematical models for the integration of purchase and production lot-sizing and scheduling problems under demand uncertainty ⋮ Multiple machine continuous setup lotsizing with sequence-dependent setups ⋮ Self-adaptive randomized constructive heuristics for the multi-item capacitated lot sizing problem ⋮ A hybrid genetic algorithm and variable neighborhood search for multi-family capacitated lot-sizing problem ⋮ Multi-stage simultaneous lot-sizing and scheduling for flow line production ⋮ New construction heuristic for capacitated lot sizing problems ⋮ Tactical Production and Lot Size Planning with Lifetime Constraints: A Comparison of Model Formulations ⋮ Foundations of operations research: from linear programming to data envelopment analysis ⋮ A dynamic programming approach for the two-product capacitated lot-sizing problem with concave costs ⋮ An \(O(T^{3})\) algorithm for the capacitated lot sizing problem with minimum order quantities ⋮ Model and metaheuristics for a scheduling problem integrating procurement, sale and distribution decisions ⋮ A hybrid adaptive large neighborhood search heuristic for lot-sizing with setup times ⋮ Exact solution approaches for the discrete lot-sizing and scheduling problem with parallel resources ⋮ An integrated approach for production lot sizing and raw material purchasing ⋮ A capacitated lot sizing problem with stochastic setup times and overtime ⋮ A math-heuristic Dantzig-Wolfe algorithm for capacitated lot sizing ⋮ Dynamic lot-sizing models with pricing for new products ⋮ Valid inequalities for two-period relaxations of big-bucket lot-sizing problems: zero setup case ⋮ Minimizing weighted tardiness of job-shop scheduling using a hybrid genetic algorithm ⋮ Inventory control as a discrete system control for the fixed-order quantity system ⋮ A stochastic production planning problem with nonlinear cost ⋮ Capacitated lot sizing and sequence dependent setup scheduling: An iterative approach for integration ⋮ Applying particle swarm optimisation to dynamic lot sizing with batch ordering ⋮ Rounding heuristics for multiple product dynamic lot-sizing in the presence of queueing behavior ⋮ Classification and literature review of integrated lot-sizing and cutting stock problems ⋮ On the discrete lot-sizing and scheduling problem with sequence-dependent changeover times ⋮ An evaluation of semidefinite programming based approaches for discrete lot-sizing problems ⋮ Discrete lot sizing and scheduling using product decomposition into attributes ⋮ A heuristic for the dynamic multi-level capacitated lotsizing problem with linked lotsizes for general product structures ⋮ Capacitated lot-sizing and scheduling with parallel machines, back-orders, and setup carry-over ⋮ Variable neighborhood formulation search approach for the multi-item capacitated lot-sizing problem with time windows and setup times ⋮ Equivalence classes of problem instances for a continuous-time lot sizing and scheduling problem ⋮ A hybrid optimization approach for multi-level capacitated lot-sizing problems ⋮ Efficient and effective heuristics for the coordinated capacitated lot-size problem ⋮ Solving lot-sizing problem with quantity discount and transportation cost ⋮ A decomposition approach for the general lotsizing and scheduling problem for parallel production lines ⋮ Multi-level lot sizing and job shop scheduling with compressible process times: a cutting plane approach
Uses Software
Cites Work
- A Dual Ascent and Column Generation Heuristic for the Discrete Lotsizing and Scheduling Problem with Setup Times
- Competitive methods for multi-level lot sizing and scheduling: tabu search and randomized regrets
- Lot-Sizing with Constant Batches: Formulation and Valid Inequalities
- Dynamic Production Scheduling for a Process Industry
- A Lagrangean-Based Heuristic for Dynamic Multilevel Multiitem Constrained Lotsizing with Setup Times
- Feature Article—Genetic Algorithms for the Operations Researcher
- Remarks on: “Some Extensions of the Discrete Lotsizing and Scheduling Problem”
- DLSP for two-stage multi-item batch production
- Solving large unconstrained multilevel lot-sizing problems using a hybrid genetic algorithm
- LP-based heuristics for the capacitated lot-sizing problem: The interaction of model formulation and solution algorithm
- A Heuristic for a Resource-capacitated Multi-stage Lot-sizing Problem with Lead Times
- Solving the CLSP by a Tabu Search Heuristic
- Lot Sizing in Serial Assembly Systems with Multiple Constrained Resources
- An O(T3) Algorithm for the Economic Lot-Sizing Problem with Constant Capacities
- Sequential-analysis Based Randomized-regret-methods for Lot-sizing and Scheduling
- Deterministic Production Planning with Concave Costs and Capacity Constraints
- A Deterministic Multiproduct, Multi-Facility Production and Inventory Model
- A Deterministic Multi-Period Production Scheduling Model with Backlogging
- A Backlogging Model and a Multi-Echelon Model of a Dynamic Economic Lot Size Production System—A Network Approach
- Optimal Inventory Policy with Multiple Set-Up Costs
- An Efficient Algorithm for Multi-Item Scheduling
- Fully Polynomial Approximation Schemes for Single-Item Capacitated Economic Lot-Sizing Problems
- Handbook of metaheuristics
- Experimental evaluation of heuristic optimization algorithms: A tutorial
- Questioning the relative virtues of dynamic lot sizing rules
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The discrete lot-sizing and scheduling problem
- Multilevel capacitated lotsizing complexity and LP-based heuristics
- Set partitioning and column generation heuristics for capacitated dynamic lotsizing
- A simple heuristic for the multi-item single level capacitated lotsizing problem
- Valid inequalities and separation for capacitated economic lot sizing
- Lot-size models with backlogging: Strong reformulations and cutting planes
- Capacitated lot-sizing and scheduling by Lagrangean relaxation
- A facilities in series capacity constrained dynamic lot-size model
- Multi-item lot size determination and scheduling under capacity constraints
- A capacity constrained singlefacility dynamic lot-size model
- Efficient post-optimization analysis procedure for the dynamic lot-sizing problem
- An efficient algorithm for the capacitated single item dynamic lot size problem
- Multi-level lot-sizing problem: Evaluation of a simulated-annealing heuristic
- Mixed integer programming model formulations for dynamic multi-item multi-level capacitated lotsizing
- Lot sizing and scheduling -- survey and extensions
- MIP modelling of changeovers in production planning and scheduling problems
- Hybrid heuristics for the capacitated lot sizing and loading problem with setup times and overtime decisions
- A genetic algorithm for multi-level, multi-machine lot sizing and scheduling
- The single-item discrete lotsizing and scheduling problem: Optimization by linear and dynamic programming
- Studying the effects of production loss due to setup in dynamic production scheduling
- A heuristic for dynamic multi-item multi-level capacitated lotsizing for general product structures
- Using geometric techniques to improve dynamic programming algorithms for the economic lot-sizing problem and extensions
- A new heuristic approach for the multi-item dynamic lot sizing problem
- The discrete lot-sizing and scheduling problem with sequence-dependent setup costs
- A cutting plane approach to capacitated lot-sizing with start-up costs
- On the discrete lot-sizing and scheduling problem with Wagner-Whitin costs
- Reformulations of the shortest route model for dynamic multi-item multi-level capacitated lotsizing
- The general lotsizing and scheduling problem
- Progress with single-item lot-sizing
- Solving mixed integer programming production planning problems with setups by shadow price information.
- Guidelines for the use of meta-heuristics in combinatorial optimization.
- On the polyhedral structure of a multi-item production planning model with setup times
- Dynamic knapsack sets and capacitated lot-sizing
- A multi-item production planning model with setup times: algorithms, reformulations, and polyhedral characterizations for a special case
- Metaheuristic. Computer decision-making. Papers from the 4th Metaheuristics International Conference (MIC2001) held in Porto (Portugal), July 16--20, 2001. With assistance from Ana Viana
- Improved lower bounds for the capacitated lot sizing problem with setup times.
- Analysis of solution space-dependent performance of simulated annealing: The case of the multi-level capacitated lot sizing problem
- The discrete lot-sizing and scheduling problem: Complexity and modification for batch availability
- On the capacitated lot-sizing and continuous 0-1 knapsack polyhedra
- A novel decomposition approach for on-line lot-sizing.
- Heuristic genetic algorithms for general capacitated lot-sizing problems
- Polyhedra for lot-sizing with Wagner-Whitin costs
- Lotsizing with backlogging and start-ups: The case of Wagner-Whitin costs
- Experience with fine-grained parallel genetic algorithms
- Randomized multi-level lot-sizing heuristics for general product structures.
- Planning lot sizes and capacity requirements in a single stage production system
- Facets and algorithms for capacitated lot sizing
- Simultaneous lotsizing and scheduling by combining local search with dual reoptimization
- Statistical search methods for lotsizing problems
- Lot-sizing with fixed charges on stocks: the convex hull
- Lower Bounds in Lot-Sizing Models: A Polyhedral Study
- Dynamic Version of the Economic Lot Size Model
- Branch-and-Price: Column Generation for Solving Huge Integer Programs
- An Algorithm for Single-Item Capacitated Economic Lot Sizing with Piecewise Linear Production Costs and General Holding Costs
- Lot Sizing in General Assembly Systems with Setup Costs, Setup Times, and Multiple Constrained Resources
- Lot-Sizing with Start-Up Times
- A Tabu-Search Heuristic for the Capacitated Lot-Sizing Problem with Set-up Carryover
- Modelling Practical Lot-Sizing Problems as Mixed-Integer Programs
- Solving Multi-Item Lot-Sizing Problems with an MIP Solver Using Classification and Reformulation
- Remarks on: “Some Extensions of the Discrete Lotsizing and Scheduling Problem”
- bc — prod: A Specialized Branch-and-Cut System for Lot-Sizing Problems
- Evolutionary algorithms for production planning problems with setup decisions
- A multi-class multi-level capacitated lot sizing model
- Hybrid heuristics for the multi-stage capacitated lot sizing and loading problem
- Decomposition Principle for Linear Programs
- Approximation Methods for the Uncapacitated Dynamic Lot Size Problem
- Uncapacitated lot-sizing: The convex hull of solutions
- Computationally Efficient Optimal Solutions to the Lot-Sizing Problem in Multistage Assembly Systems
- Solving Multi-Item Lot-Sizing Problems Using Strong Cutting Planes
- A New Dantzig-Wolfe Reformulation and Branch-and-Price Algorithm for the Capacitated Lot-Sizing Problem with Setup Times
- Uncapacitated Lot-Sizing Problems with Start-Up Costs
- A Strong Cutting Plane Algorithm for Production Scheduling with Changeover Costs
- Facets and Reformulations for Solving Production Planning With Changeover Costs
- Multilevel Lot Sizing with Setup Times and Multiple Constrained Resources: Internally Rolling Schedules with Lot-Sizing Windows
- The Deterministic Dynamic Product Cycling Problem
- The Multi-Item Capacitated Lot Size Problem: Error Bounds of Manne's Formulations
- Strong Formulations for Multi-Item Capacitated Lot Sizing
- Optimal Lot-Sizing Algorithms for Complex Product Structures
- Note—Performance Bounds for Lot Sizing Heuristics
- The Dynamic Lot-Sizing Problem with Startup and Reservation Costs
- Solving Multi-Item Capacitated Lot-Sizing Problems Using Variable Redefinition
- Multi-Item Single-Level Capacitated Dynamic Lot-Sizing Heuristics: A General Review
- An O(T2) Algorithm for the NI/G/NI/ND Capacitated Lot Size Problem
- Deterministic Production Planning: Algorithms and Complexity
- The Lagrangian Relaxation Method for Solving Integer Programming Problems
- Improved Heuristics for Multi-Stage Requirements Planning Systems
- Computational Complexity of the Capacitated Lot Size Problem
- Some Extensions of the Discrete Lotsizing and Scheduling Problem
- A Simple Forward Algorithm to Solve General Dynamic Lot Sizing Models with n Periods in 0(n log n) or 0(n) Time
- Economic Lot Sizing: An O(n log n) Algorithm That Runs in Linear Time in the Wagner-Whitin Case
- A Lagrangean Relaxation Approach for Very-Large-Scale Capacitated Lot-Sizing
- Tabu Search—Part I
- Valid Inequalities for the Lasdon-Terjung Production Model
- Tabu Search—Part II
- A Lower Bounding Structure for Lot-Size Scheduling Problems
- Multi-Item Lot Size Scheduling by Heuristic Part I: With Fixed Resources
- Improved Algorithms for Economic Lot Size Problems
This page was built for publication: Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches
