Funder
National Science Foundation
Ford Motor Company
Publisher
Springer Science and Business Media LLC
Reference61 articles.
1. Ahmed, S., & Garcia, R. (2003). Dynamic capacity acquisition and assignment under uncertainty. Annals of Operations Research, 124(1–4), 267–283.
2. Al-Hinai, N., & ElMekkawy, T. Y. (2011). Robust and stable flexible job shop scheduling with random machine breakdowns using a hybrid genetic algorithm. International Journal of Production Economics, 132(2), 279–291.
3. Albers, S. (1999). Better bounds for online scheduling. SIAM Journal on Computing, 29(2), 459–473.
4. Alonso-Mora, J., Samaranayake, S., Wallar, A., Frazzoli, E., & Rus, D. (2017). On-demand high-capacity ride-sharing via dynamic trip-vehicle assignment. Proceedings of the National Academy of Sciences, 114(3), 462–467.
5. Barer, M., Sharon, G., Stern, R., & Felner, A. (2014). Suboptimal variants of the conflict-based search algorithm for the multi-agent pathfinding problem. In European conference on artificial intelligence (ECAI), pp. 961–962.
Cited by
51 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献