生产计划与控制教学课件（清华大学）PPC L08A Optimal Lot Sizing.pdfVIP

Lecture 8ALecture 8A Optimal Lot SizingOptimal Lot Sizing For TimeFor Time--Varying DemandVarying Demand Ye ChengYe Cheng Dept. of Industrial EngineeringDept. of Industrial Engineering Tsinghua UniversityTsinghua University Ye Cheng, Dept. IE, Tsinghua University PPC Lecture 8A Optimal Lot Sizing 1 Optimal Lot Sizing for Time-Varying Demand  Compute true optimal lot sizes  Minimize the total cost of holding and setup cost over the planning horizon  Casting the problem as shortest-path problem  Dynamic programming  Assumption  Forecasted demands over the next n periods are known r = (r , r , ……, r ) 1 2 n  Holding cost $h per unit per period • Charged against ending inventory of each period $K per setup Ye Cheng, Dept. IE, Tsinghua University PPC Lecture 8A Optimal Lot Sizing 2 Example of Hi-Tech Co. (1/4)  A local semiconductor fabrication shop of Hi-Tech Co.  Forecasted demands of 4 weeks: 52, 87, 23, 56  Only on setup each week, no backordering, enough capacity  Consider the total number of feasible production policies  y , …, y , the order quantities in each week 1 4  y 1 ≥ 52  y 1 + y 2 ≥ 52 + 87 = 139  No stock out in week 1  No stock out in week 2  y 1 ≤ 218  If y 1 ≤ 139, then  Zero ending inventory in week 4 39 - y 1 ≤y 2 ≤ 218 - y 1  So, y 1 can take any one of 167  If y 1 139, then 0 ≤y 2 ≤ 218 - y 1 values  10200 different values of just the pair ( y , y