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

scientific article; zbMATH DE number 5080323

Language	Label	Description	Also known as
English	Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches	scientific article; zbMATH DE number 5080323

Statements

instance of

scholarly article

0 references

title

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

0 references

0 references

0 references

European Journal of Operational Research

0 references

publication date

14 December 2006

0 references

full work available at URL

https://repub.eur.nl/pub/1336/ERS%202004%20042%20LIS.pdf

0 references

zbMATH Keywords

meta-heuristics

0 references

lot sizing

0 references

Dantzig-Wolfe decomposition

0 references

Lagrange relaxation

0 references

cutting planes

0 references

describes a project that uses

0 references

0 references

0 references

A novel decomposition approach for on-line lot-sizing.

0 references

Optimal Lot-Sizing Algorithms for Complex Product Structures

0 references

Computationally Efficient Optimal Solutions to the Lot-Sizing Problem in Multistage Assembly Systems

0 references

Improved Algorithms for Economic Lot Size Problems

0 references

Lotsizing with backlogging and start-ups: The case of Wagner-Whitin costs

0 references

LP-based heuristics for the capacitated lot-sizing problem: The interaction of model formulation and solution algorithm

0 references

Note—Performance Bounds for Lot Sizing Heuristics

0 references

Q3995531

0 references

Strong Formulations for Multi-Item Capacitated Lot Sizing

0 references

Uncapacitated lot-sizing: The convex hull of solutions

0 references

Analysis of solution space-dependent performance of simulated annealing: The case of the multi-level capacitated lot sizing problem

0 references

Branch-and-price: Column generation for solving huge integer programs

0 references

bc — prod: A Specialized Branch-and-Cut System for Lot-Sizing Problems

0 references

Modelling Practical Lot-Sizing Problems as Mixed-Integer Programs

0 references

The Multi-Item Capacitated Lot Size Problem: Error Bounds of Manne's Formulations

0 references

Computational Complexity of the Capacitated Lot Size Problem

0 references

Approximation Methods for the Uncapacitated Dynamic Lot Size Problem

0 references

Improved Heuristics for Multi-Stage Requirements Planning Systems

0 references

DLSP for two-stage multi-item batch production

0 references

Remarks on: “Some Extensions of the Discrete Lotsizing and Scheduling Problem”

0 references

The discrete lot-sizing and scheduling problem: Complexity and modification for batch availability

0 references

Set partitioning and column generation heuristics for capacitated dynamic lotsizing

0 references

A Dual Ascent and Column Generation Heuristic for the Discrete Lotsizing and Scheduling Problem with Setup Times

0 references

An O(T2) Algorithm for the NI/G/NI/ND Capacitated Lot Size Problem

0 references

A Heuristic for a Resource-capacitated Multi-stage Lot-sizing Problem with Lead Times

0 references

A cutting plane approach to capacitated lot-sizing with start-up costs

0 references

Lower bounds in lot-sizing models: A polyhedral study

0 references

Decomposition Principle for Linear Programs

0 references

A New Dantzig-Wolfe Reformulation and Branch-and-Price Algorithm for the Capacitated Lot-Sizing Problem with Setup Times

0 references

Solving large unconstrained multilevel lot-sizing problems using a hybrid genetic algorithm

0 references

Randomized multi-level lot-sizing heuristics for general product structures.

0 references

Dynamic Production Scheduling for a Process Industry

0 references

Studying the effects of production loss due to setup in dynamic production scheduling

0 references

Efficient post-optimization analysis procedure for the dynamic lot-sizing problem

0 references

Capacitated lot-sizing and scheduling by Lagrangean relaxation

0 references

A Lagrangean Relaxation Approach for Very-Large-Scale Capacitated Lot-Sizing

0 references

Sequential-analysis Based Randomized-regret-methods for Lot-sizing and Scheduling

0 references

Lot sizing and scheduling -- survey and extensions

0 references

Solving Multi-Item Capacitated Lot-Sizing Problems Using Variable Redefinition

0 references

A Simple Forward Algorithm to Solve General Dynamic Lot Sizing Models with n Periods in 0(n log n) or 0(n) Time

0 references

Q5287175

0 references

The Lagrangian Relaxation Method for Solving Integer Programming Problems

0 references

The discrete lot-sizing and scheduling problem

0 references

The discrete lot-sizing and scheduling problem with sequence-dependent setup costs

0 references

The general lotsizing and scheduling problem

0 references

Deterministic Production Planning with Concave Costs and Capacity Constraints

0 references

Deterministic Production Planning: Algorithms and Complexity

0 references

Q4178782

0 references

Tabu Search—Part I

0 references

Tabu Search—Part II

0 references

Handbook of metaheuristics

0 references

Q4354785

0 references

A Tabu-Search Heuristic for the Capacitated Lot-Sizing Problem with Set-up Carryover

0 references

Planning lot sizes and capacity requirements in a single stage production system

0 references

Lot Sizing in Serial Assembly Systems with Multiple Constrained Resources

0 references

Guidelines for the use of meta-heuristics in combinatorial optimization.

0 references

Solving the CLSP by a Tabu Search Heuristic

0 references

A multi-class multi-level capacitated lot sizing model

0 references

Solving mixed integer programming production planning problems with setups by shadow price information.

0 references

Evolutionary algorithms for production planning problems with setup decisions

0 references

Improved lower bounds for the capacitated lot sizing problem with setup times.

0 references

The Deterministic Dynamic Product Cycling Problem

0 references

The Dynamic Lot-Sizing Problem with Startup and Reservation Costs

0 references

Lot sizing in general assembly systems with setup costs, setup times, and multiple constrained resources

0 references

Competitive methods for multi-level lot sizing and scheduling: tabu search and randomized regrets

0 references

A genetic algorithm for multi-level, multi-machine lot sizing and scheduling

0 references

An efficient algorithm for the capacitated single item dynamic lot size problem

0 references

A new heuristic approach for the multi-item dynamic lot sizing problem

0 references

A Lower Bounding Structure for Lot-Size Scheduling Problems

0 references

Experience with fine-grained parallel genetic algorithms

0 references

Multi-level lot-sizing problem: Evaluation of a simulated-annealing heuristic

0 references

A facilities in series capacity constrained dynamic lot-size model

0 references

A capacity constrained singlefacility dynamic lot-size model

0 references

An Efficient Algorithm for Multi-Item Scheduling

0 references

Facets and algorithms for capacitated lot sizing

0 references

Optimal Inventory Policy with Multiple Set-Up Costs

0 references

Dynamic knapsack sets and capacitated lot-sizing

0 references

A simple heuristic for the multi-item single level capacitated lotsizing problem

0 references

Multi-Item Single-Level Capacitated Dynamic Lot-Sizing Heuristics: A General Review

0 references

Multilevel capacitated lotsizing complexity and LP-based heuristics

0 references

Facets and Reformulations for Solving Production Planning With Changeover Costs

0 references

A Strong Cutting Plane Algorithm for Production Scheduling with Changeover Costs

0 references

Simultaneous lotsizing and scheduling by combining local search with dual reoptimization

0 references

Q4935970

0 references

On the capacitated lot-sizing and continuous 0-1 knapsack polyhedra

0 references

On the polyhedral structure of a multi-item production planning model with setup times

0 references

A multi-item production planning model with setup times: algorithms, reformulations, and polyhedral characterizations for a special case

0 references

Multi-Item Lot Size Scheduling by Heuristic Part I: With Fixed Resources

0 references

Hybrid heuristics for the multi-stage capacitated lot sizing and loading problem

0 references

Hybrid heuristics for the capacitated lot sizing and loading problem with setup times and overtime decisions

0 references

Valid inequalities and separation for capacitated economic lot sizing

0 references

Q4735937

0 references

Lot-size models with backlogging: Strong reformulations and cutting planes

0 references

Solving Multi-Item Lot-Sizing Problems Using Strong Cutting Planes

0 references

Lot-Sizing with Constant Batches: Formulation and Valid Inequalities

0 references

Polyhedra for lot-sizing with Wagner-Whitin costs

0 references

Q4840775

0 references

Experimental evaluation of heuristic optimization algorithms: A tutorial

0 references

Feature Article—Genetic Algorithms for the Operations Researcher

0 references

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

0 references

Some Extensions of the Discrete Lotsizing and Scheduling Problem

0 references

Statistical search methods for lotsizing problems

0 references

An algorithm for single-item capacitated economic lot sizing with piecewise linear production costs and general holding costs

0 references

Questioning the relative virtues of dynamic lot sizing rules

0 references

Mixed integer programming model formulations for dynamic multi-item multi-level capacitated lotsizing

0 references

Reformulations of the shortest route model for dynamic multi-item multi-level capacitated lotsizing

0 references

Multilevel Lot Sizing with Setup Times and Multiple Constrained Resources: Internally Rolling Schedules with Lot-Sizing Windows

0 references

A Lagrangean-Based Heuristic for Dynamic Multilevel Multiitem Constrained Lotsizing with Setup Times

0 references

A heuristic for dynamic multi-item multi-level capacitated lotsizing for general product structures

0 references

Q4017556

0 references

Lot-sizing with start-up times

0 references

Valid Inequalities for the Lasdon-Terjung Production Model

0 references

On the discrete lot-sizing and scheduling problem with Wagner-Whitin costs

0 references

An O(T3) Algorithm for the Economic Lot-Sizing Problem with Constant Capacities

0 references

Fully Polynomial Approximation Schemes for Single-Item Capacitated Economic Lot-Sizing Problems

0 references

The single-item discrete lotsizing and scheduling problem: Optimization by linear and dynamic programming

0 references

Using geometric techniques to improve dynamic programming algorithms for the economic lot-sizing problem and extensions

0 references

Multi-item lot size determination and scheduling under capacity constraints

0 references

Lot-sizing with fixed charges on stocks: the convex hull

0 references

Economic Lot Sizing: An O(n log n) Algorithm That Runs in Linear Time in the Wagner-Whitin Case

0 references

Dynamic version of the economic lot size model

0 references

Remarks on: “Some Extensions of the Discrete Lotsizing and Scheduling Problem”

0 references

Uncapacitated Lot-Sizing Problems with Start-Up Costs

0 references

Progress with single-item lot-sizing

0 references

MIP modelling of changeovers in production planning and scheduling problems

0 references

Solving Multi-Item Lot-Sizing Problems with an MIP Solver Using Classification and Reformulation

0 references

Heuristic genetic algorithms for general capacitated lot-sizing problems

0 references

A Deterministic Multi-Period Production Scheduling Model with Backlogging

0 references

A Deterministic Multiproduct, Multi-Facility Production and Inventory Model

0 references

A Backlogging Model and a Multi-Echelon Model of a Dynamic Economic Lot Size Production System—A Network Approach

0 references

Identifiers

zbMATH Open document ID

1102.90002

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

10.1016/J.EJOR.2005.12.008

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:857326