Characterization and generation of a general class of resource-constrained project scheduling problems
Article Abstract:
The issue of coming up with problem cases of control difficulty is explored. The analysis addresses precedence- and resource-constrained scheduling problems and presents a network construction approach that consider the limitations on the network topology, a resource factor representing the coefficient matrix density, and the availability of resources. Branch and bound methodologies are applied to benchmark cases for the single- and multi-mode resource-constrained project scheduling problem. Findings suggest that the benchmark instances employed in previous studies belong to the group of the very easy benchmark cases. The project generator ProGen, which is intended for a varied array of precedence and resource-constrained scheduling, is described.
Publication Name: Management Science
Subject: Business, general
ISSN: 0025-1909
Year: 1995
User Contributions:
Comment about this article or add new information about this topic:
Project scheduling under partially renewable resource constraints
Article Abstract:
The allocation of scarce resources including renewable and non-renewable resources is a persistent concern in project management. A study was conducted to introduce the concept of 'partially renewable' resources in considering a generalization of the classical resource-constrained project scheduling problem. These partially renewable resources are derived by assuming for each resource a capacity on subsets of periods and cover traditional renewable and non-renewable resource constraints as special cases. A fundamental enumeration scheme was utilized for the exact solution of the problem, with makespan minimization as objective. The procedures developed were assessed for a set of instances generated with the project generator.
Publication Name: Management Science
Subject: Business, general
ISSN: 0025-1909
Year: 1999
User Contributions:
Comment about this article or add new information about this topic:
Note: on semi-active timetabling in resource-constrained project scheduling
Article Abstract:
The branch-and-bound algorithm presented by E.L. Demeulemeester and W.S. Herroelen in 1992 does not minimize the enumeration to semi-active schedules. Although the algorithm produces an optimal solution, the optimal schedule generated need not be semi-active. Two renewable resources supporting an availability of 3 and 2 units per period were taken into consideration. The decision point was determined as the minimum completion time of the activities in process. In addition, the makespan coincided with the critical route to terminate the algorithm. Finally, it is not enough to evaluate the feasibility of local left-shifts on the activities at the decision point to generate semi-active schedules.
Publication Name: Management Science
Subject: Business, general
ISSN: 0025-1909
Year: 1999
User Contributions:
Comment about this article or add new information about this topic:
- Abstracts: International group reaches agreement on encryption. Microsoft to alter its software, responding to privacy concerns
- Abstracts: Simply a question of cultural barriers? The search for new perspectives in the transfer of Japanese management practices
- Abstracts: AT&T plan links Internet and satellites: 12-space craft system proposed to regulators
- Abstracts: Microsoft memo offers a glimpse of Gates 2.0. Microsoft shifts Web unit to Windows group
- Abstracts: Getting with the program. Adding some byte to retirement plans. Taking account of software