TY - JOUR

T1 - Infinite horizon production planning with periodic demand

T2 - Solvable cases and a general numerical approach

AU - Kogan, Konstantin

AU - Perkins, James R.

PY - 2003/1

Y1 - 2003/1

N2 - In this paper, we consider a single part-type pull manufacturing system, which controls its production rates in response to periodic demand. When tracking the demand results in a product surplus, an inventory storage cost is incurred. Likewise, if an overall shortage occurs then a backlog cost is paid. In addition, production costs accrue when the system is not idle. Given an infinite planning horizon, the objective is to determine the cyclic production rates in order to minimize the total cost. With the aid of the maximum principle, extremal behavior of the system is studied and the continuous-time production planning problem is reduced to a discrete problem with a limited number of switching points at which time the production rates change. Using this result, an efficient numerical algorithm is proposed, which will yield an approximation to the optimal solution within any desired level of accuracy. In addition, we determine the analytical solution to the problem for three special cases: (i) the system capacity is not limited and the inventory storage cost factor is equal to the backlog cost factor; (ii) the production cost is negligible; and (iii) the surplus and shortages costs are negligible.

AB - In this paper, we consider a single part-type pull manufacturing system, which controls its production rates in response to periodic demand. When tracking the demand results in a product surplus, an inventory storage cost is incurred. Likewise, if an overall shortage occurs then a backlog cost is paid. In addition, production costs accrue when the system is not idle. Given an infinite planning horizon, the objective is to determine the cyclic production rates in order to minimize the total cost. With the aid of the maximum principle, extremal behavior of the system is studied and the continuous-time production planning problem is reduced to a discrete problem with a limited number of switching points at which time the production rates change. Using this result, an efficient numerical algorithm is proposed, which will yield an approximation to the optimal solution within any desired level of accuracy. In addition, we determine the analytical solution to the problem for three special cases: (i) the system capacity is not limited and the inventory storage cost factor is equal to the backlog cost factor; (ii) the production cost is negligible; and (iii) the surplus and shortages costs are negligible.

UR - http://www.scopus.com/inward/record.url?scp=0037231135&partnerID=8YFLogxK

U2 - 10.1080/07408170304432

DO - 10.1080/07408170304432

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:0037231135

SN - 0740-817X

VL - 35

SP - 61

EP - 71

JO - IIE Transactions (Institute of Industrial Engineers)

JF - IIE Transactions (Institute of Industrial Engineers)

IS - 1

ER -