Multi-mode resource constrained project scheduling: scheduling schemes, priority rules and mode selection rules.

Abstract

This work deals with the multi-mode resource-constrained project scheduling problem. In this problem, activities of the project may be executed in more than one operating mode and renewable resource constraints exist. Each activity operation mode has a different duration and requires different amount of renewable resources. The objective function considered is the minimisation of the project completion time. Heuristics based on priority rule are considered as solution procedures for this problem. Both, parallel and serial scheduling generation schemes are described in the multi-mode context. On the basis of a well-known set of project instances, the new heuristics based on priority rules are evaluated against the best ones published. Finally, multi-pass heuristics based on priority rules that outperforms the deterministic multi-pass heuristic previously published are designed.

A heuristic procedure to solve the project staffing problem with discrete time/resource trade-offs and personnel scheduling constraints

“…De Reyck et al (1998) present several heuristic procedures that are based on the decomposition of the problem into a mode assignment phase and a resource-constrained project scheduling phase with fixed mode assignments. Lova et al (2006) compare different heuristics based on single-pass and multi-pass priority rules to sort the activities and mode selection rules to assign an execution mode to each activity. Van Peteghem and Vanhoucke (2014) provide an excellent literature overview of developed meta-heuristic solution procedures for the MRCPSP.…”

Project Scheduling: Survey and Research Potentials

“…Also he proposed a genetic algorithm for scheduling the same test instances and compared the resulted schedules by those rendered from heuristic rules and proofs the robustness of heuristic rules performance. Lova et al [34] presents some heuristics based on priority rule for the MRCPSP with renewable resources are analyzed. These methods are very important in the construction of more sophisticated heuristics as random sampling techniques or meta-heuristics.…”

A parallel simulated annealing (PSA) for solving project scheduling problem with discounted cash flow policy in pricing strategy of the project suppliers

“…In addition, Bokter has suggested more precise heuristic algorithm using critical path method and its calculations. In recent years, Notes et al [11] studied agent based algorithms for the mentioned problem and Lova et al [12] presented methods based on the priority rules to solve that. Most heuristic algorithms which have been presented use two serial and parallel productions methods of scheduling.…”