Applying Local Rescheduling in response to schedule disruptions
- First Online:
In realistic scenarios of disruption management the high number of potential options makes the provision of decision support—on how to get back on track—complex. It is thus desirable to reduce the size of the regarded problems by applying methods of partial rescheduling. As existing approaches (such as Affected Operations Rescheduling or Matchup Scheduling) mainly focus on production-specific problems, we propose Local Rescheduling (LRS) as a generic approach to partial rescheduling in this paper. It integrates previous research on partial rescheduling and local search in the context of complex project scheduling problems. LRS is based on the bidirectional incremental extension of a time window regarded for potential schedule modifications. Experiments show that LRS outperforms previous approaches.
KeywordsLocal optimization Partial rescheduling Reactive scheduling Disruption management Extended Resource-Constrained Project Scheduling Problem
Unable to display preview. Download preview PDF.
- Clausen, J., Hansen, J., Larsen, J., & Larsen, A. (2001). Disruption management. ORMS Today, 28, 40–43. Google Scholar
- Cowling, P., Colledge, N., Dahal, K., & Remde, S. (2006). The trade off between diversity and quality for multi-objective workforce scheduling. In J. Gottlieb & G. Raidl (Eds.), Evolutionary computation in combinatorial optimization : Vol. 3906, LNCS (pp. 13–24). Berlin: Springer. CrossRefGoogle Scholar
- Elkhyari, A., Guéret, C., & Jussien, N. (2004). Constraint programming for dynamic scheduling problems. In H. Kise (Ed.), ISS’04 international scheduling symposium, 2004. Awaji: Japan Society of Mechanical Engineers. Google Scholar
- Kolisch, R., & Hartmann, S. (1999). Heuristic algorithms for solving the Resource-Constrained Project Scheduling Problem: classification and computational analysis. In J. Weglarz (Ed.), Project scheduling: recent models, algorithms, and applications. Google Scholar
- Kolisch, R., Schwindt, C., & Sprecher, A. (1999). Benchmark instances for project scheduling problems. In J. Weglarz (Ed.), Handbook on recent advances in project scheduling. Google Scholar
- Kuster, J., Jannach, D., & Friedrich, G. (2007). Handling alternative activities in Resource-Constrained Project Scheduling Problems. In M. Veloso (Ed.), IJCAI-07, proceedings of the twentieth international joint conference on artificial intelligence, 2007. Google Scholar
- Kuster, J., Jannach, D., & Friedrich, G. (2008). Extending the RCPSP for modeling and solving disruption management problems. Applied Intelligence (to appear). Google Scholar
- Laborie, P. (2005). Complete MCS-based search: application to resource constrained project scheduling. In L. Kaelbling & A. Saffiotti (Eds.), IJCAI-05, proceedings of the 19th international joint conference on artificial intelligence, 2005. Google Scholar
- Mausser, H. E., & Lawrence, S. R. (1997). Exploiting block structure to improve resource-constrained project schedules. In I. H. Osman & J. P. Kelly (Eds.), Meta-heuristics: theory and applications (pp. 203–218). Google Scholar
- Policella, N., & Rasconi, R. (2005). Testsets generation for reactive scheduling. In Workshop on experimental analysis and benchmarks for AI algorithms, Ferrara, Italy, 2005. Google Scholar
- Smith, S. F. (1994). Reactive scheduling systems. In D. Brown & W. Scherer (Eds.), Intelligent scheduling systems. Google Scholar