A Dynamic Programming Approach to a Lot Size Scheduling Problem

The problem considered is that of scheduling the production of several different items over the same facility on a repetitive basis. The facility is such that only one item can be produced at a time; there is a setup cost and a setup time associated with producing each item; the demand rate for each item is known and constant over an infinite planning horizon, and all demand must be met. A dynamic programming solution is developed. This solution is applied to a sample problem, and the results are compared with pertinent bounds.

• 저널Management Science · 12(11) · 778–784
• 토픽Advanced Manufacturing and Logistics Optimization · Industrial and Manufacturing Engineering
• DOI10.1287/mnsc.12.11.778
• 저자Earl E. Bomberger