Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 351
This contribution deals with dynamic, capacitated, multi-level lot sizing and scheduling. The basic assumption is that for each item there is exactly one machine that this item can be manufactured on but no two items share a common machine. Finding an optimal solution with a greedy algorithm turns out to be an easy task.
Production planning lot sizing scheduling multi-level dedicated machines optimal greedy algorithm