Please use this identifier to cite or link to this item: http://hdl.handle.net/10419/161993
Authors: 
Drexl, Andreas
Year of Publication: 
1990
Series/Report no.: 
Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 247
Abstract: 
A recurring problem in project management involves the allocation of scarce resources to the individual jobs comprising the project. In many situations such as audit scheduling, the resources correspond to individuals (skilled labour). This naturally leads to an assignment type project scheduling problem, i.e. a project has to be processed by assigning one of several individuals (resources) to each job. In this paper we consider the nonpreemptive variant of a resource-constrained project job-assignment problem, where job durations as well as costs depend upon the assigned resource. Regarding precedence relations as well as release dates and deadlines, the question arises, to which jobs resources should be assigned in order to minimize overall costs. For solving this time-resource-cost-tradeoff problem we present a hybrid branch and bound / dynamic programming algorithm with a (rather efficient Monte Carlo type) heuristic upper bounding technique as well as various relaxation procedures for determining lower bounds. Computational results are presented as well.
Subjects: 
Project Management
Resource Constraints
Audit Scheduling
Generalized Assignment Problem
Branch and Bound
Dynamic Programming
Monte Carlo Heuristic
Document Type: 
Working Paper

Files in This Item:
File
Size





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