Some Extensions of the Discrete Lotsizing and Scheduling Problem (original) (raw)
In this paper the Discrete Lotsizing and Scheduling Problem (DLSP) is considered. DLSP relates to capacitated lotsizing as well as to job scheduling problems and is concerned with determining a feasible production schedule with minimal total costs in a single-stage manufactunng process. This involves the sequencing and sizing of production lots for a number of different items over a discrete and finite planning horizon. Feasibility of production schedules is subject to production quantities being within bounds set by capacity.
Loading Preview
Sorry, preview is currently unavailable. You can download the paper by clicking the button above.