Scheduling of Project Networks by Job Assignment

Andreas Drexl
Additional contact information
Andreas Drexl: Institut für Betriebswirtschaftslehre, Christian-Albrechts-Universität zu Kiel, Olshausenstrasse 40, D-2300 Kiel 1, Germany

Management Science, 1991, vol. 37, issue 12, 1590-1602

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 brand 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.

Keywords: project management: resource constraints; audit scheduling; generalized assignment problem; branch and bound; dynamic programming; Monte Carlo heuristic (search for similar items in EconPapers)
Date: 1991
References: Add references at CitEc
Citations: View citations in EconPapers (63)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.37.12.1590 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ormnsc:v:37:y:1991:i:12:p:1590-1602

Access Statistics for this article

More articles in Management Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().