Abstract
We investigate the question if online-algorithms can he used in a framework for knowledge-based reactive vehicle scheduling. Appropriate models are presented and corresponding research issues are discussed.
Chapter PDF
Similar content being viewed by others
References
Albers, S.: The Influence of Lookahead in Competitive On-Line Algorithms, Dissertation, Universität des Saarlandes, 1993
Ben-David, S., Borodin, A., Karp, R. M., Tardos, G., Wigderson, A.: On the power of randomization in on-line algorithms. In Proc. 22nd Annual ACM Symposium on Theory of Computing, 379–386, 1990.
Ben-David, S., Dichterman E.: Derandomizing Online Algorithms (Extended Abstract), Technion - Israel Institute of Technology, Computer Science Department, Technical Report #691, October 1991
Blacewicz, J., Ecker, K., Schmidt, G., Weglarz, J.: Scheduling in Computer and Manufacturing Systems, Springer-Verlag, Second revised Edition, 1994
Borodin, A., Linial, N., Saks, M. E.: An optimal Online Algorithm for Metrical Task Systems, Journal of the Association for Computing Machinery, Vol. 39, No. 4, 745–763, October 1992
Coppersmith, D., Doyle, P., Raghavan, P., Snir, M.: Random Walks on Weighted Graphs, and Applications to On-line Algorithms, in 22nd STOC, 369–378, May 1990
Fischer, K., Müller, J. P., Pischel, M., Jacob, E.: Modeling Traffic Jams in a Logistics Simulation Environment, Proceedings of the 1994 European Simu-lation Multiconference, ESM94, Barcelona, 883–887, Spain 1994
Irani, S., Reingold, N., Westbrook, J., Sleator, D.D.: Randomized competitive Algorithms for the List Update Problem. In Proc. 2nd Annual ACM-SIAM Symposium on Discrete Algorithms, 251–260, 1991
Karlin, A. R., Manasse, M. S., Rudolph, L., Sleator, D. D.: Competitive snoopy Caching, Algorithmica, 3 (1): 79–119, 1988
Manasse, M. S., McGeoch, L. A:, Sleator, D. D.: Competitive Algorithms for On-line Problems, in Proc. 20th Annual ACM Symposium on theory of Computing, 322–333, 1988
Psaraftis, H., N.: Dynamic Vehicle Routing Problems, in: Golden, B. L., Assad, A. (eds.), Vehicle Routing: Models and Studies, Elsevier Science Publisher B. V. (North-Holland), 223–248, 1988
Papadimitriou, Chr. H., Yannakakis, M.: Shortest path without a map. Theore-tical Computer Science 84, Elsevier Science Publisher B. V. (North-Holland), 127–150, 1991
Schmidt, G.: A Decision Support System for Production Scheduling, Journal for Decision Systems 1 (2–3), 243–260, 1992
Spirn, J. R.: Program Behavior: Models and Measurements. Elsevier, New York 1977.
Sleator, D. D., Tarjan, R. E.: Amortized efficiency of List Update and Paging rules. Communication Q the ACM, 28, 202–208, 1985
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1995 IFIP International Federation for Information Processing
About this chapter
Cite this chapter
Schmidt, G., Jacob, E. (1995). Online-algorithms for reactive vehicle scheduling. In: Kerr, R., Szelke, E. (eds) Artificial Intelligence in Reactive Scheduling. IFIP Advances in Information and Communication Technology. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-34928-2_5
Download citation
DOI: https://doi.org/10.1007/978-0-387-34928-2_5
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-5041-2889-6
Online ISBN: 978-0-387-34928-2
eBook Packages: Springer Book Archive