Please use this identifier to cite or link to this item: http://hdl.handle.net/10419/147575
Authors: 
Kolisch, Rainer
Year of Publication: 
1998
Series/Report no.: 
Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel No. 468
Abstract: 
The problem of scheduling multiple, large scale, make-to-order assemblies is considered. Beside "classical" precedence- and resource constraints as known from resource constrained project scheduling we take spatial resource and part availability constraints into account. The objective is to minimize the sum of the weighted tardiness. We propose a MIP-model of the problem which is a generalization of three allocation problems. Since the problem is NP-hard, a list-scheduling heuristic is proposed and evaluated on a set of benchmark instances.
Document Type: 
Working Paper
Document Version: 
Digitized Version

Files in This Item:
File
Size





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