Lot-sizing with production and delivery time windows

We study two different lot-sizing problems with time windows that have been proposed recently. For the case of production time windows, in which each client specific order must be produced within a given time interval, we derive tight extended formulations for both the constant capacity and uncapaci...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Mathematical programming Jg. 107; H. 3; S. 471 - 489
1. Verfasser: Wolsey, Laurence A.
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Heidelberg Springer 01.07.2006
Springer Nature B.V
Schlagworte:
Algorithms
Applied sciences
Costs
Digital Object Identifier
Dynamic programming
Equivalence
Exact sciences and technology
Integer programming
Linear programming
Lot sizing
Mathematical models
Mathematical programming
Operational research and scientific management
Operational research. Management science
Optimization algorithms
Polynomials
Scheduling, sequencing
Studies
Upper bounds
Windows (intervals)
Convex hull
Lot-sizing
Time window
Production time windows
Mixed integer programming
Time interval
Lot sizing
Dynamic programming
Delivery lead time
Mathematical programming
ISSN:0025-5610, 1436-4646
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:We study two different lot-sizing problems with time windows that have been proposed recently. For the case of production time windows, in which each client specific order must be produced within a given time interval, we derive tight extended formulations for both the constant capacity and uncapacitated problems with Wagner-Whitin (non-speculative) costs. For the variant with nonspecific orders, known to be equivalent to the problem in which the time windows can be ordered by time, we also show equivalence to the basic lot-sizing problem with upper bounds on the stocks. Here we derive polynomial time dynamic programming algorithms and tight extended formulations for the uncapacitated and constant capacity problems with general costs. For the problem with delivery time windows, we use a similar approach to derive tight extended formulations for both the constant capacity and uncapacitated problems with Wagner-Whitin (non-speculative) costs. [PUBLICATION ABSTRACT]
Bibliographie:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-1
ObjectType-Feature-2
ISSN:0025-5610
1436-4646
DOI:10.1007/s10107-005-0675-3