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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
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., 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.
Bish, D. (2011). Planning for a bus-based evacuation. OR Spectrum, 33, 629–654.
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.
Elmaghraby, S. E., & Park, S. H. (1974). Scheduling jobs on a number of identical machines. AIIE Transactions, 6, 1–13.
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.
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.
Goerigk, M., & Grün, B. (2013). The robust bus evacuation problem. Technical Report, University of Kaiserslautern, Germany.
Goerigk, M., Grün, B., & Heßler, P. (2013). Branch and bound algorithms for the bus evacuation problem. doi:10.1016/j.cor.2013.07.006.
Guinet, A. (1993). Scheduling sequence-dependent jobs on identical parallel machines to minimize completion time criteria. International Journal of Production Research, 31, 1579–1594.
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.
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.
Schutten, J. M. J. (1996). List scheduling revisited. Operations Research Letters, 18, 167–170.
Wesley Barnes, J., & Brennan, J. J. (1977). An improved algorithm for scheduling jobs on identical machines. AIIE Transactions, 9, 25–31.
Yang, W. H. (1999). Survey of scheduling research involving setup times. International Journal of Systems Science, 30, 143–155.
Acknowledgments
Partially supported by the Federal Ministry of Education and Research Germany, grant DSS_Evac_Logistic, FKZ 13N12229.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Kaufmann, C. (2014). Application of Scheduling Theory to the Bus Evacuation Problem. In: Huisman, D., Louwerse, I., Wagelmans, A. (eds) Operations Research Proceedings 2013. Operations Research Proceedings. Springer, Cham. https://doi.org/10.1007/978-3-319-07001-8_31
Download citation
DOI: https://doi.org/10.1007/978-3-319-07001-8_31
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-07000-1
Online ISBN: 978-3-319-07001-8
eBook Packages: Business and EconomicsBusiness and Management (R0)