Resource-constrained project scheduling. Exact methods for the multi-mode case
type: Item
instance of: scholarly article
title: Resource-constrained project scheduling. Exact methods for the multi-mode case
zbMATH Open document ID: 0809.90084
author: Arno Sprecher
published in: Lecture Notes in Economics and Mathematical Systems
publication date: 1994-06-29T00:00:00Z
review text: The book is devoted to multi-mode resource-constrained project scheduling problem stated in terms of a discrete mathematical programming problem. In the multi-mode case, the activities comprising the project can be executed in one of several ways called modes. Each mode represents a way of combining different resources and/or amounts of resources required. In consequence, a resource-resource and a time-resource tradeoffs can be realized. The author examines exact methods for solving the multi-mode resource- constrained project scheduling problem. The presented algorithm belongs to the class of branch-and-bound methods, however, it is different from previously proposed. The algorithm is modified by the use of priority rules and accelerated by new bounding rules. Its primary objective is to minimize the makespan. A computational experiment has been performed in order to compare the efficiency of different priority rules used in the algorithm. Some applications of the models and methods presented, as well as \(n\) artificial intelligence approach to problem solving, are also discussed.
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 68M20
zbMATH DE Number: 597023
zbMATH Keywords: multi-mode resource-constrained project scheduling
zbMATH Keywords: makespan
reviewed by: Roman Słowiński
MaRDI profile type: Publication
description: scientific article; zbMATH DE number 597023