Author:
Pinto Gaby,Ben-Dov Yariv T.,Rabinowitz Gad
Publisher
Springer Science and Business Media LLC
Subject
Management Science and Operations Research,General Decision Sciences
Reference50 articles.
1. Agnetis, A., Pacciarelli, D., & Rossi, F. (1997). Batch scheduling in a two-machine flow shop with limited buffer. Discrete Applied Mathematics, 72, 243–260.
2. Ainbinder, I., Pinto, G., Rabinowitz, G., & Ben-Dov, Y. T. (2006). A customized branch and bound algorithm to solve a resource-sharing and scheduling problem. In Proceedings of the 4th IEEE international conference on computational cybernetic (ICCC), Estonia.
3. Artigues, C., & Feillet, D. (2008). A branch and bound method for the job-shop problem with sequence-dependent setup times. Annals of Operations Research, 159, 135–159.
4. Azizoglu, M., & Webster, S. (2000). Scheduling a batch processing machine with non-identical job sizes. International Journal of Production Research, 38(10), 2173–2184.
5. Bostrom, N. (2003). When machines outsmart humans. Futures, 35, 759–764.
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献