Addendum to Stankard and Gupta's Note on Lot Size Scheduling

This paper presents a grouping procedure which yields improved solutions to Bomberger's Lot Size Scheduling Problem [1]. The group definition is a generalization of the group definition proposed by Stankard and Gupta [3]. Moreover, the generalization leads to a pseudo dynamic programming procedure which is readily programmable. Computational experience has shown the procedure to be extremely efficient.

• 저널Management Science · 16(7) · 514–517
• 토픽Scheduling and Optimization Algorithms · Industrial and Manufacturing Engineering
• DOI10.1287/mnsc.16.7.514
• 저자Thom J. Hodgson