We describe a time-oriented branch-and-bound algorithm for the resource-constrained project scheduling problem which explores the set of active schedules by enumerating possible activity start times. The algorithm uses constraint-propagation techniques that exploit the temporal and resource...

We describe a time-oriented branch-and-bound algorithm for the resource-constrained project scheduling problem which explores the set of active schedules by enumerating possible activity start times. The algorithm uses constraint-propagation techniques that exploit the temporal and resource...

This paper surveys a large variety of mathematical models and up-to-date solution techniques developed for solving a general flight gate scheduling problem that deals with assigning different aircraft activities (arrival, departure and intermediate parking) to distinct aircraft stands or gates....

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

Project Scheduling is concerned with the allocation of scarce resources over time. The rich optimisation models with time windows that are treated in this book cover a multitude of practical decision problems arising in diverse application areas such as construction engineering or make-to-order...

This paper describes a specific local search approach to solve a problem arising in logistics which we prove to be NP-hard. The problem is a complex scheduling or vehicle routing problem where we have to schedule the tours of concrete mixer vehicles over a working day from concrete-producing...