Abstract

In this paper some recent results on the Discrete Lotsizing and Scheduling Problem (DLSP) are presented. DLSP tries to determine a feasible production schedule with minimal total costs for a single-stage multi-item manufacturing process by sequencing and sizing production lots for the items. Results presented are on computational complexity and algorithms for DLSP.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call