Manchester Metropolitan University's Research Repository

Efficient Heuristics for Solving Precedence Constrained Scheduling Problems

Kalfay, A and Crispin, A and Crockett, Keeley (2019) Efficient Heuristics for Solving Precedence Constrained Scheduling Problems. In: Intelligent Systems Conference (IntelliSys) 2019, 05 September 2019 - 06 September 2019, London, United Kingdom. (In Press)

Restricted to Repository staff only

Download (238kB)


This paper discusses the occurrence of dependency relationships within NP hard personnel scheduling problems. These dependencies, commonly referred to as precedence constraints, arise in a number of industries including but not limited to: maintenance scheduling, home health care, and unmanned aerial vehicle scheduling. Precedence relationships, as demonstrated in this research, can significantly impact the quality of solution that can be obtained. In such a competitive market it is imperative that new and innovative ways of finding high quality solutions in short computational times are discovered. This paper presents novel datasets, containing 100-1000 jobs to allocate, that are used to benchmark two heuristic algorithms; an intelligent decision heuristic and a greedy heuristic. Each heuristic is coupled with a multi start metaheuristic to provide a set of benchmark results.

Impact and Reach


Activity Overview

Additional statistics for this dataset are available via IRStats2.

Actions (login required)

View Item View Item