Capacitated Multi-Item Lot-Sizing Problems with Time Windows

Authors:
Nadjib Brahimi;Stéphane Dauzère-Pérès;Najib M. Najid
Affiliations:
IRCCyN---Ecole des Mines de Nantes, UMR CNRS 6597, La Chantrerie, BP 20722, F-44307 Nantes Cedex 3, France;Ecole des Mines de Saint-Etienne, CMP Georges Charpak, Avenue des Anémones---Quartier Saint-Pierre, F-13541 Gardanne, France;IRCCyN---IUT de Nantes, UMR CNRS 6597, 2, Avenue du Professeur Jean Rouxel, BP 539, F-44475 Carquefou, France
Venue:
Operations Research
Year:
2006

Citing 9
Cited 4

Discrete optimization

Discrete optimization
Capacitated lot sizing with setup times

Management Science
Analysis of relaxations for the multi-item capacitated lot-sizing problem

Annals of Operations Research
A simple forward algorithm to solve general dynamic lot sizing models with n periods in 0(n log n) or 0(n) time

Management Science
Economic lot sizing: an O(n log n) algorithm that runs in linear time in the Wagner-Whitin case

Operations Research - Supplement
Improved algorithms for economic lot size problems

Operations Research
Statistical search methods for lotsizing problems

Annals of Operations Research - Special issue on Tabu search
The single-item discrete lotsizing and scheduling problem: optimization by linear and dynamic programming

CO89 Selected papers of the conference on Combinatorial Optimization
A Dynamic Lot-Sizing Model with Demand Time Windows

Management Science

The multi-item capacitated lot-sizing problem with safety stocks and demand shortage costs

Computers and Operations Research
Polyhedral and Lagrangian approaches for lot sizing with production time windows and setup times

Computers and Operations Research
Capacitated dynamic lot-sizing problem with delivery/production time windows

Operations Research Letters
Collaborative production planning with production time windows and order splitting in make-to-order manufacturing

Computers and Industrial Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

This research concerns a new family of capacitated multi-item lot-sizing problems, namely, lot-sizing problems with time windows. Two classes of the problem are analyzed and solved using different Lagrangian heuristics. Capacity constraints and a subset of time window constraints are relaxed resulting in particular single-item time window problems that are solved in polynomial time. Other relaxations leading to the classical Wagner-Whitin problem are also tested. Several smoothing heuristics are implemented and tested, and their results are compared. The gaps between lower and upper bounds for most problems are very small (less than 1%). Moreover, the proposed algorithms are robust and do not seem to be too affected when different parameters of the problem are varied.