Skip to main content

2014 | OriginalPaper | Buchkapitel

Application of Scheduling Theory to the Bus Evacuation Problem

verfasst von : Corinna Kaufmann

Erschienen in: Operations Research Proceedings 2013

Verlag: Springer International Publishing

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

We consider the problem of scheduling a fleet of buses to evacuate people from a fixed set of gathering points to a fixed set of shelters. In case of uncapacitated shelters this can be modeled as a well-known scheduling problem. Since there are no efficient exact solution methods for this problem, we propose a customized branch-and-bound procedure and compare the performance to a commercial IP solver.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Literatur
1.
Zurück zum Zitat Allahverdi, A., Gupta, J. N. D., & Aldowaisan, T. (1999). A review of scheduling research involving setup considerations. Journal of Management Science, 27, 219–239. Allahverdi, A., Gupta, J. N. D., & Aldowaisan, T. (1999). A review of scheduling research involving setup considerations. Journal of Management Science, 27, 219–239.
2.
Zurück zum Zitat Allahverdi, A., Ng, C. T., Cheng, T. C. E., & Kovalyov, M. Y. (2008). A survey of scheduling problems with setup times or costs. European Journal of Operational Research, 187, 985–1032.CrossRef Allahverdi, A., Ng, C. T., Cheng, T. C. E., & Kovalyov, M. Y. (2008). A survey of scheduling problems with setup times or costs. European Journal of Operational Research, 187, 985–1032.CrossRef
3.
Zurück zum Zitat Bish, D. (2011). Planning for a bus-based evacuation. OR Spectrum, 33, 629–654. Bish, D. (2011). Planning for a bus-based evacuation. OR Spectrum, 33, 629–654.
4.
Zurück zum Zitat Dunstall, S., & Wirth, A. (2005). A comparison of branch-and-bound algorithms for a family scheduling problem with identical parallel machines. European Journal of Operational Research, 167, 283–296. Dunstall, S., & Wirth, A. (2005). A comparison of branch-and-bound algorithms for a family scheduling problem with identical parallel machines. European Journal of Operational Research, 167, 283–296.
5.
Zurück zum Zitat Elmaghraby, S. E., & Park, S. H. (1974). Scheduling jobs on a number of identical machines. AIIE Transactions, 6, 1–13. Elmaghraby, S. E., & Park, S. H. (1974). Scheduling jobs on a number of identical machines. AIIE Transactions, 6, 1–13.
6.
Zurück zum Zitat França, P. M., Gendreau, M., Laporte, G., & Mller, F. M. (1996). A tabu search heuristic for the multiprocessor scehduling problem with sequence dependent setup times. International Journal of Production Economics, 43, 79–89. França, P. M., Gendreau, M., Laporte, G., & Mller, F. M. (1996). A tabu search heuristic for the multiprocessor scehduling problem with sequence dependent setup times. International Journal of Production Economics, 43, 79–89.
7.
Zurück zum Zitat Gendreau, M., Laporte, G., & Guimarães, E. M. (2001). A divide and merge heuristic for the multiprocessor scheduling problem with sequence dependent setup times. European Journal of Operational Research, 133, 183–189. Gendreau, M., Laporte, G., & Guimarães, E. M. (2001). A divide and merge heuristic for the multiprocessor scheduling problem with sequence dependent setup times. European Journal of Operational Research, 133, 183–189.
8.
Zurück zum Zitat Goerigk, M., & Grün, B. (2013). The robust bus evacuation problem. Technical Report, University of Kaiserslautern, Germany. Goerigk, M., & Grün, B. (2013). The robust bus evacuation problem. Technical Report, University of Kaiserslautern, Germany.
10.
Zurück zum Zitat Guinet, A. (1993). Scheduling sequence-dependent jobs on identical parallel machines to minimize completion time criteria. International Journal of Production Research, 31, 1579–1594. Guinet, A. (1993). Scheduling sequence-dependent jobs on identical parallel machines to minimize completion time criteria. International Journal of Production Research, 31, 1579–1594.
11.
Zurück zum Zitat Kurz, M. E., & Askin, R. G. (2001). Heuristic scheduling of parallel machines with sequence-dependent set-up times. International Journal of Production Research, 39, 3747–3769. Kurz, M. E., & Askin, R. G. (2001). Heuristic scheduling of parallel machines with sequence-dependent set-up times. International Journal of Production Research, 39, 3747–3769.
12.
Zurück zum Zitat Sarin, S. C., Ahn, S., & Bishop, A. B. (1988). An improved branching scheme for the branch and bound procedure of scheduling n jobs on m parallel machines to minimize total weighte flowtime. International Journal of Production Research, 26, 1183–1191. Sarin, S. C., Ahn, S., & Bishop, A. B. (1988). An improved branching scheme for the branch and bound procedure of scheduling n jobs on m parallel machines to minimize total weighte flowtime. International Journal of Production Research, 26, 1183–1191.
13.
Zurück zum Zitat Schutten, J. M. J. (1996). List scheduling revisited. Operations Research Letters, 18, 167–170. Schutten, J. M. J. (1996). List scheduling revisited. Operations Research Letters, 18, 167–170.
14.
Zurück zum Zitat Wesley Barnes, J., & Brennan, J. J. (1977). An improved algorithm for scheduling jobs on identical machines. AIIE Transactions, 9, 25–31. Wesley Barnes, J., & Brennan, J. J. (1977). An improved algorithm for scheduling jobs on identical machines. AIIE Transactions, 9, 25–31.
15.
Zurück zum Zitat Yang, W. H. (1999). Survey of scheduling research involving setup times. International Journal of Systems Science, 30, 143–155. Yang, W. H. (1999). Survey of scheduling research involving setup times. International Journal of Systems Science, 30, 143–155.
Metadaten
Titel
Application of Scheduling Theory to the Bus Evacuation Problem
verfasst von
Corinna Kaufmann
Copyright-Jahr
2014
DOI
https://doi.org/10.1007/978-3-319-07001-8_31