Dynamic lot-sizing model for major and minor demands

This paper deals with a lot-sizing model for major and minor demands in which major demands are specified by time windows while minor demands are given by periods. For major demands, the agreeable time window structure is assumed where each time window is not strictly nested in any other time window...

Full description

Saved in:
Bibliographic Details
Published in:European journal of operational research 2008-01, Vol.184 (2), p.711-724
Main Authors: Hwang, Hark-Chin, Jaruphongsa, Wikrom
Format: Article
Language:English
Subjects:
Agreeable time windows
Algorithms
Demand
Dynamic programming
Lot-sizing
Major/minor demands
Production
Production planning
Studies
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This paper deals with a lot-sizing model for major and minor demands in which major demands are specified by time windows while minor demands are given by periods. For major demands, the agreeable time window structure is assumed where each time window is not strictly nested in any other time windows. To incorporate the economy of scale of large production quantity, especially from major demands, concave cost structure in production must be considered. Investigating the optimality properties, we propose optimal solution procedures based on dynamic program. For a simple case when only major demands exist, we propose an optimal procedure with running time of O ( n 2 T ) where n is the number of demands and T is the length of the planning horizon. Extending the algorithm to the model with major and minor demands, we propose an algorithm with complexity O ( n 2 T 2 ) .
ISSN:0377-2217
1872-6860
DOI:10.1016/j.ejor.2006.11.017