Premium
Dynamic lot‐sizing model with production time windows
Author(s) -
Hwang HarkChin
Publication year - 2007
Publication title -
naval research logistics (nrl)
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.665
H-Index - 68
eISSN - 1520-6750
pISSN - 0894-069X
DOI - 10.1002/nav.20246
Subject(s) - sizing , production (economics) , time horizon , order (exchange) , computer science , cost structure , mathematical optimization , operations research , mathematics , economics , microeconomics , finance , art , visual arts
We consider a dynamic lot‐sizing model with production time windows where each of n demands has earliest and latest production due dates and it must be satisfied during the given time window. For the case of nonspeculative cost structure, an O ( n log n ) time procedure is developed and it is shown to run in O ( n ) when demands come in the order of latest production due dates. When the cost structure is somewhat general fixed plus linear that allows speculative motive, an optimal procedure with O ( T 4 ) is proposed where T is the length of a planning horizon. Finally, for the most general concave production cost structure, an optimal procedure with O ( T 5 ) is designed. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007