Resource-constrained project scheduling: Notation, classification, models, and methods

https://ira.lib.polyu.edu.hk/bitstream/10397/1269/1/SetupSurvey-2006%28June-19%29.pdf

A survey of scheduling problems with setup times or costs

http://web.nchu.edu.tw/pweb/users/arborfish/lesson/8682.pdf

A survey of variants and extensions of the resource-constrained project scheduling problem

Personnel scheduling: A literature review

An ant colony optimization approach (ACO) for the resource-constrained project scheduling problem (RCPSP) is presented. Combinations of two pheromone evaluation methods are used by the ants to find new solutions. We tested our ACO algorithm on a set of large benchmark problems from the PSPLIB. Compared to several other heuristics for the RCPSP including genetic algorithms, simulated annealing, tabu search, and different sampling methods our algorithm performed best on the average. For some test instances the algorithm was able to find new best solutions.

Ant colony optimization for resource-constrained project scheduling

A branch and bound algorithm for the resource-constrained project scheduling problem

http://www.cs.nott.ac.uk/~pszgxk/papers/corsportsbib.pdf

Invited Review: Scheduling in sports: An annotated bibliography

This book describes models and algorithms for complex scheduling problems. It presents key algorithms in detail and includes examples. This second revised edition includes new material, in particular, further generalizations of the RCPSP.

Complex Scheduling

Loading, unloading and premarshalling of stacks in storage areas: Survey and classification

We present two tabu search algorithms for the resource-constrained project scheduling problem. Given are n activities which have to be processed without preemptions. During the processing period of an activity constant amounts of renewable resources are needed where the available capacity of each resource type is limited. Furthermore, finish-start precedence relations between the activities are given. The objective is to determine a schedule with minimal makespan. The first tabu search approach relies on elimination of critical arcs and list-scheduling techniques. The second neighborhood is based on schedule schemes, where neighbors are generated by placing activities in parallel or deleting a parallelity relation. Furthermore, a column-generation approach for a linear programming-based lower bound is presented and computational results are reported.

Sigrid Knust

Papers

A branch and bound algorithm for the resource-constrained project scheduling problem

Invited Review: Scheduling in sports: An annotated bibliography

Complex Scheduling

Loading, unloading and premarshalling of stacks in storage areas: Survey and classification

Tabu Search Algorithms and Lower Bounds for the Resource-Constrained Project Scheduling Problem