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!

Schreiben Sie den ersten Kommentar!