Multidirectional Scheduling Scheme in Resource-Constrained Project Scheduling Problem

In 2000, Klein showed that bidirectional scheduling schemes (bidss) outperform single-directional scheduling schemes (e.g., forward or backward schemes). In 2010, Yoosefzadeh, et al. [J Math Model Algor 9 (2010), 357-373] showed that depending on the nature of the problems and also the type of priority rules used, schedules produced by a so-called tridirectional scheduling scheme (trdss) yields shorter makespans when compared to forward, backward, and even bidss. Since the justification technique is applied in many of the state-of-the-art algorithms nowadays, we show that the tuned version of the trdss outperforms the double justification technique. Moreover, we investigate the circumstances under which the trdss is more probable to generate schedules with shorter makespans. To this end, we introduce a new measure of resource requirements and their distributions, namely total amount of overflows. Our analytical as well as empirical investigations show that when the new measure is increased, it is more probable to obtain schedules with shorter makespans using the trdss. (c) 2013 Wiley Periodicals, Inc. Naval Research Logistics 61: 44-55, 2014