Open Access. Powered by Scholars. Published by Universities.®
Management Information Systems Commons™
Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 2 of 2
Full-Text Articles in Management Information Systems
Resource-Constrained Project Scheduling: A Survey Of Recent Developments, Willy Herroelen, Erik Demeulemeester, Bert De Reyck
Resource-Constrained Project Scheduling: A Survey Of Recent Developments, Willy Herroelen, Erik Demeulemeester, Bert De Reyck
Research Collection Lee Kong Chian School Of Business
Resource-constrained project scheduling involves the scheduling of project activities subject to precedence and resource constraints in order to meet the objective(s) in the best possible way. The area covers a wide variety of problem types. The objective of this paper is to provide a survey of what we believe are the important recent developments in the area. Our main focus will be on the recent progress made in and the encouraging computational experience gained with the use of optimal solution procedures for the basic resource-constrained project scheduling problem (RCPSP) and important extensions. We illustrate how the branching rules, dominance and …
On The Use Of The Complexity Index As A Measure Of Complexity In Activity Networks, Bert De Reyck, Willy Herroelen
On The Use Of The Complexity Index As A Measure Of Complexity In Activity Networks, Bert De Reyck, Willy Herroelen
Research Collection Lee Kong Chian School Of Business
A large number of optimal and suboptimal procedures have been developed for solving combinatorial problems modeled as activity networks. The need to differentiate between easy and hard problem instances and the interest in isolating the fundamental factors that determine the computing effort required by these procedures, inspired a number of researchers to develop various complexity measures. In this paper we investigate the relation between the hardness of a problem instance and the topological structure of its underlying network, as measured by the complexity index. We demonstrate through a series of experiments that the complexity index, defined as the minimum number …