Please use this identifier to cite or link to this item: http://hdl.handle.net/10419/155423
Authors: 
Kimms, Alf
Year of Publication: 
1994
Series/Report no.: 
Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 351
Abstract: 
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.
Subjects: 
Production planning
lot sizing
scheduling
multi-level
dedicated machines
optimal greedy algorithm
Document Type: 
Working Paper

Files in This Item:
File
Size





Items in EconStor are protected by copyright, with all rights reserved, unless otherwise indicated.