Author:
Shabtay Dvir,Gaspar Nufar,Kaspi Moshe
Publisher
Springer Science and Business Media LLC
Subject
Artificial Intelligence,Management Science and Operations Research,General Engineering,Software
Reference80 articles.
1. Alidaee, B., & Ahmadian, A. (1993). Two parallel machine sequencing problems involving controllable job processing times. European Journal of Operational Research, 70(3), 335–341.
2. Angel, E., Bampis, E., & Kononov, A. (2001). A FPTAS for approximating the unrelated parallel machines scheduling problem with costs. Lecture Notes in Computer Science, 2161, 194–205.
3. Bechman, A., Janiak, A., & Kovalyov, M. Y. (2002). Minimizing the total weighted completion time of deteriorating jobs. Information Processing Letters, 81(2), 81–84.
4. Bartal, Y., Leonardi, S., Marchetti-Spaccamela, A., Sgall, J., & Stougie, L. (2000). Multiprocessor scheduling with rejection. SIAM Journal of Discrete Mathematics, 13(1), 64–78.
5. Bilgintürk, Z., Oğuz, C., & Salman, S. (2007). Order acceptance and scheduling decisions in make-to-order systems. In 5th Multidisciplinary International Scheduling Conference: Theory and Applications, Paris, France.
Cited by
203 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献