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...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Mathematical programming Ročník 107; číslo 3; s. 471 - 489
Hlavní autor:	Wolsey, Laurence A.
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Heidelberg Springer 01.07.2006 Springer Nature B.V
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!