We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
AN O(T²) ALGORITHM FOR THE NI/G/NI/ND CAPACITATED LOT SIZE PROBLEM.
- Authors
Chia-Shin Chung; Chien-Hua Mike Lin
- Abstract
In this paper, we study a class of the capacitated dynamic lot size problem, where, over time, the setup costs are nonincreasing, the unit holding costs have arbitrary pattern, the unit production costs are nonincreasing and the capacities are nondecreasing. We investigate the properties of the optimal solution for the problem and develop the concept of candidate subplan. It is proven that only the candidate subplans need to be examined in searching for an optimal solution. A dynamic programming algorithm, incorporating the concept of candidate subplan, is then devised which has run time complexity of O(T[SUP2]).
- Subjects
ECONOMIC lot size; DYNAMIC programming; ALGORITHMS; PROBLEM solving; COST control; INDUSTRIAL costs; MATHEMATICAL optimization; SYSTEMS engineering; INVENTORY control; INVENTORY management systems
- Publication
Management Science, 1988, Vol 34, Issue 3, p420
- ISSN
0025-1909
- Publication type
Article
- DOI
10.1287/mnsc.34.3.420