Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches
type: Item
instance of: scholarly article
title: Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches
zbMATH Open document ID: 1102.90002
author: Raf Jans
author: Zeger Degraeve
published in: European Journal of Operational Research
publication date: 2006-12-14T00:00:00Z
full work available at URL: ERS 2004 042 LIS.pdf
Mathematics Subject Classification ID: 90B05
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 5080323
zbMATH Keywords: meta-heuristics
zbMATH Keywords: lot sizing
zbMATH Keywords: Dantzig-Wolfe decomposition
zbMATH Keywords: Lagrange relaxation
zbMATH Keywords: cutting planes
describes a project that uses: Tabu search
describes a project that uses: bc-prod
MaRDI profile type: Publication
OpenAlex ID: W1978009882
cites work: A novel decomposition approach for on-line lot-sizing.
cites work: Optimal Lot-Sizing Algorithms for Complex Product Structures
cites work: Computationally Efficient Optimal Solutions to the Lot-Sizing Problem in Multistage Assembly Systems
cites work: Improved Algorithms for Economic Lot Size Problems
cites work: Lotsizing with backlogging and start-ups: The case of Wagner-Whitin costs
cites work: LP-based heuristics for the capacitated lot-sizing problem: The interaction of model formulation and solution algorithm
cites work: Note—Performance Bounds for Lot Sizing Heuristics
cites work: Q3995531
cites work: Strong Formulations for Multi-Item Capacitated Lot Sizing
cites work: Uncapacitated lot-sizing: The convex hull of solutions
cites work: Analysis of solution space-dependent performance of simulated annealing: The case of the multi-level capacitated lot sizing problem
cites work: Branch-and-price: Column generation for solving huge integer programs
cites work: bc — prod: A Specialized Branch-and-Cut System for Lot-Sizing Problems
cites work: Modelling Practical Lot-Sizing Problems as Mixed-Integer Programs
cites work: The Multi-Item Capacitated Lot Size Problem: Error Bounds of Manne's Formulations
cites work: Computational Complexity of the Capacitated Lot Size Problem
cites work: Approximation Methods for the Uncapacitated Dynamic Lot Size Problem
cites work: Improved Heuristics for Multi-Stage Requirements Planning Systems
cites work: DLSP for two-stage multi-item batch production
cites work: Remarks on: “Some Extensions of the Discrete Lotsizing and Scheduling Problem”
cites work: The discrete lot-sizing and scheduling problem: Complexity and modification for batch availability
cites work: Set partitioning and column generation heuristics for capacitated dynamic lotsizing
cites work: A Dual Ascent and Column Generation Heuristic for the Discrete Lotsizing and Scheduling Problem with Setup Times
cites work: An O(T2) Algorithm for the NI/G/NI/ND Capacitated Lot Size Problem
cites work: A Heuristic for a Resource-capacitated Multi-stage Lot-sizing Problem with Lead Times
cites work: A cutting plane approach to capacitated lot-sizing with start-up costs
cites work: Lower bounds in lot-sizing models: A polyhedral study
cites work: Decomposition Principle for Linear Programs
cites work: A New Dantzig-Wolfe Reformulation and Branch-and-Price Algorithm for the Capacitated Lot-Sizing Problem with Setup Times
cites work: Solving large unconstrained multilevel lot-sizing problems using a hybrid genetic algorithm
cites work: Randomized multi-level lot-sizing heuristics for general product structures.
cites work: Dynamic Production Scheduling for a Process Industry
cites work: Studying the effects of production loss due to setup in dynamic production scheduling
cites work: Efficient post-optimization analysis procedure for the dynamic lot-sizing problem
cites work: Capacitated lot-sizing and scheduling by Lagrangean relaxation
cites work: A Lagrangean Relaxation Approach for Very-Large-Scale Capacitated Lot-Sizing
cites work: Sequential-analysis Based Randomized-regret-methods for Lot-sizing and Scheduling
cites work: Lot sizing and scheduling -- survey and extensions
cites work: Solving Multi-Item Capacitated Lot-Sizing Problems Using Variable Redefinition
cites work: A Simple Forward Algorithm to Solve General Dynamic Lot Sizing Models with n Periods in 0(n log n) or 0(n) Time
cites work: Q5287175
cites work: The Lagrangian Relaxation Method for Solving Integer Programming Problems
cites work: The discrete lot-sizing and scheduling problem
cites work: The discrete lot-sizing and scheduling problem with sequence-dependent setup costs
cites work: The general lotsizing and scheduling problem
cites work: Deterministic Production Planning with Concave Costs and Capacity Constraints
cites work: Deterministic Production Planning: Algorithms and Complexity
cites work: Q4178782
cites work: Tabu Search—Part I
cites work: Tabu Search—Part II
cites work: Handbook of metaheuristics
cites work: Q4354785
cites work: A Tabu-Search Heuristic for the Capacitated Lot-Sizing Problem with Set-up Carryover
cites work: Planning lot sizes and capacity requirements in a single stage production system
cites work: Lot Sizing in Serial Assembly Systems with Multiple Constrained Resources
cites work: Guidelines for the use of meta-heuristics in combinatorial optimization.
cites work: Solving the CLSP by a Tabu Search Heuristic
cites work: A multi-class multi-level capacitated lot sizing model
cites work: Solving mixed integer programming production planning problems with setups by shadow price information.

Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches (cites work)
cites work: Evolutionary algorithms for production planning problems with setup decisions

Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches (cites work)
cites work: Improved lower bounds for the capacitated lot sizing problem with setup times.

Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches (cites work)
cites work: The Deterministic Dynamic Product Cycling Problem

Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches (cites work)
cites work: The Dynamic Lot-Sizing Problem with Startup and Reservation Costs

Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches (cites work)
cites work: Lot sizing in general assembly systems with setup costs, setup times, and multiple constrained resources

Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches (cites work)
cites work: Competitive methods for multi-level lot sizing and scheduling: tabu search and randomized regrets

Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches (cites work)
cites work: A genetic algorithm for multi-level, multi-machine lot sizing and scheduling

Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches (cites work)
cites work: An efficient algorithm for the capacitated single item dynamic lot size problem

Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches (cites work)
cites work: A new heuristic approach for the multi-item dynamic lot sizing problem

Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches (cites work)
cites work: A Lower Bounding Structure for Lot-Size Scheduling Problems

Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches (cites work)
cites work: Experience with fine-grained parallel genetic algorithms

Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches (cites work)
cites work: Multi-level lot-sizing problem: Evaluation of a simulated-annealing heuristic

Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches (cites work)
cites work: A facilities in series capacity constrained dynamic lot-size model

Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches (cites work)
cites work: A capacity constrained singlefacility dynamic lot-size model

Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches (cites work)
cites work: An Efficient Algorithm for Multi-Item Scheduling

Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches (cites work)
cites work: Facets and algorithms for capacitated lot sizing

Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches (cites work)
cites work: Optimal Inventory Policy with Multiple Set-Up Costs

Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches (cites work)
cites work: Dynamic knapsack sets and capacitated lot-sizing

Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches (cites work)
cites work: A simple heuristic for the multi-item single level capacitated lotsizing problem

Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches (cites work)
cites work: Multi-Item Single-Level Capacitated Dynamic Lot-Sizing Heuristics: A General Review

Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches (cites work)
cites work: Multilevel capacitated lotsizing complexity and LP-based heuristics

Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches (cites work)
cites work: Facets and Reformulations for Solving Production Planning With Changeover Costs

Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches (cites work)
cites work: A Strong Cutting Plane Algorithm for Production Scheduling with Changeover Costs

Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches (cites work)
cites work: Simultaneous lotsizing and scheduling by combining local search with dual reoptimization

Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches (cites work)
cites work: Q4935970

Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches (cites work)
cites work: On the capacitated lot-sizing and continuous 0-1 knapsack polyhedra

Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches (cites work)
cites work: On the polyhedral structure of a multi-item production planning model with setup times

Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches (cites work)
cites work: A multi-item production planning model with setup times: algorithms, reformulations, and polyhedral characterizations for a special case

Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches (cites work)
cites work: Multi-Item Lot Size Scheduling by Heuristic Part I: With Fixed Resources

Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches (cites work)
cites work: Hybrid heuristics for the multi-stage capacitated lot sizing and loading problem

Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches (cites work)
cites work: Hybrid heuristics for the capacitated lot sizing and loading problem with setup times and overtime decisions

Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches (cites work)
cites work: Valid inequalities and separation for capacitated economic lot sizing

Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches (cites work)
cites work: Q4735937

Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches (cites work)
cites work: Lot-size models with backlogging: Strong reformulations and cutting planes

Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches (cites work)
cites work: Solving Multi-Item Lot-Sizing Problems Using Strong Cutting Planes

Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches (cites work)
cites work: Lot-Sizing with Constant Batches: Formulation and Valid Inequalities

Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches (cites work)
cites work: Polyhedra for lot-sizing with Wagner-Whitin costs

Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches (cites work)
cites work: Q4840775

Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches (cites work)
cites work: Experimental evaluation of heuristic optimization algorithms: A tutorial

Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches (cites work)
cites work: Feature Article—Genetic Algorithms for the Operations Researcher

Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches (cites work)
cites work: 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

Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches (cites work)
cites work: Some Extensions of the Discrete Lotsizing and Scheduling Problem

Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches (cites work)
cites work: Statistical search methods for lotsizing problems

Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches (cites work)
cites work: An algorithm for single-item capacitated economic lot sizing with piecewise linear production costs and general holding costs

Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches (cites work)
cites work: Questioning the relative virtues of dynamic lot sizing rules

Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches (cites work)
cites work: Mixed integer programming model formulations for dynamic multi-item multi-level capacitated lotsizing

Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches (cites work)
cites work: Reformulations of the shortest route model for dynamic multi-item multi-level capacitated lotsizing

Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches (cites work)
cites work: Multilevel Lot Sizing with Setup Times and Multiple Constrained Resources: Internally Rolling Schedules with Lot-Sizing Windows

Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches (cites work)
cites work: A Lagrangean-Based Heuristic for Dynamic Multilevel Multiitem Constrained Lotsizing with Setup Times

Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches (cites work)
cites work: A heuristic for dynamic multi-item multi-level capacitated lotsizing for general product structures

Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches (cites work)
cites work: Q4017556

Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches (cites work)
cites work: Lot-sizing with start-up times

Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches (cites work)
cites work: Valid Inequalities for the Lasdon-Terjung Production Model

Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches (cites work)
cites work: On the discrete lot-sizing and scheduling problem with Wagner-Whitin costs

Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches (cites work)
cites work: An O(T3) Algorithm for the Economic Lot-Sizing Problem with Constant Capacities

Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches (cites work)
cites work: Fully Polynomial Approximation Schemes for Single-Item Capacitated Economic Lot-Sizing Problems

Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches (cites work)
cites work: The single-item discrete lotsizing and scheduling problem: Optimization by linear and dynamic programming

Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches (cites work)
cites work: Using geometric techniques to improve dynamic programming algorithms for the economic lot-sizing problem and extensions

Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches (cites work)
cites work: Multi-item lot size determination and scheduling under capacity constraints

Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches (cites work)
cites work: Lot-sizing with fixed charges on stocks: the convex hull

Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches (cites work)
cites work: Economic Lot Sizing: An O(n log n) Algorithm That Runs in Linear Time in the Wagner-Whitin Case

Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches (cites work)
cites work: Dynamic version of the economic lot size model

Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches (cites work)
cites work: Remarks on: “Some Extensions of the Discrete Lotsizing and Scheduling Problem”

Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches (cites work)
cites work: Uncapacitated Lot-Sizing Problems with Start-Up Costs

Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches (cites work)
cites work: Progress with single-item lot-sizing

Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches (cites work)
cites work: MIP modelling of changeovers in production planning and scheduling problems

Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches (cites work)
cites work: Solving Multi-Item Lot-Sizing Problems with an MIP Solver Using Classification and Reformulation

Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches (cites work)
cites work: Heuristic genetic algorithms for general capacitated lot-sizing problems

Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches (cites work)
cites work: A Deterministic Multi-Period Production Scheduling Model with Backlogging

Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches (cites work)
cites work: A Deterministic Multiproduct, Multi-Facility Production and Inventory Model

Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches (cites work)
cites work: A Backlogging Model and a Multi-Echelon Model of a Dynamic Economic Lot Size Production System—A Network Approach

Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches (DOI)
DOI: 10.1016/J.EJOR.2005.12.008