A Time-Oriented Branch-and-Bound Algorithm for Resource-Constrained Project Scheduling with Generalised Precedence Constraints

Authors:
Ulrich Dorndorf;Erwin Pesch;Toàn Phan-Huy
Affiliations:
-;-;-
Venue:
Management Science
Year:
2000

Citing 0
Cited 15

Scheduling and constraint propagation

Discrete Applied Mathematics
Machine learning by schedule decomposition: prospects for an integration of AI and OR techniques for job shop scheduling

Advances in evolutionary computing
Solving Project Scheduling Problems by Minimum Cut Computations

Management Science
A Branch-and-Cut Procedure for the Multimode Resource-Constrained Project-Scheduling Problem

INFORMS Journal on Computing
An effective algorithm for project scheduling with arbitrary temporal constraints

AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
A double genetic algorithm for the MRCPSP/max

Computers and Operations Research
A cross-entropy based population learning algorithm for multi-mode resource-constrained project scheduling problem with minimum and maximum time lags

ICCCI'10 Proceedings of the Second international conference on Computational collective intelligence: technologies and applications - Volume PartI
An evolutionary algorithm for the resource-constrained project scheduling problem with minimum and maximum time lags

Journal of Scheduling
New model and heuristics for safety stock placement in general acyclic supply chain networks

Computers and Operations Research
Schedule robustness through broader solve and robustify search for partial order schedules

AI*IA'05 Proceedings of the 9th conference on Advances in Artificial Intelligence
Strong valid inequalities for the resource-constrained scheduling problem with uniform resource requirements

Discrete Optimization
Project scheduling: a review of recent books

Operations Research Letters
Scheduling jobs with time constraints between consecutive process steps in semiconductor manufacturing

Proceedings of the Winter Simulation Conference
Solving RCPSP/max by lazy clause generation

Journal of Scheduling
Solving resource-constrained project scheduling problems: Conceptual validation of FLP formulation and efficient permutation-based ABC computation

Computers and Operations Research

Quantified Score

Hi-index	0.01

Visualization

Abstract

Resource-constrained project scheduling with generalised precedence constraints is a very general scheduling model with applications in areas such as make-to-order production planning. We describe a time-oriented branch-and-bound algorithm that uses constraint-propagation techniques which actively exploit the temporal and resource constraints of the problem in order to reduce the search space. Extensive computational experiments with systematically generated test problems show that the algorithm solves more problems to optimality than other exact solution procedures which have recently been proposed, and that the truncated version of the algorithm is also a very good heuristic.