Publisher
Springer Science and Business Media LLC
Subject
Management Science and Operations Research,General Decision Sciences
Reference4 articles.
1. Chen, B., & Zhang, X. (2020). Scheduling coupled tasks with exact delays for minimum total job completion time. Journal of Scheduling. https://doi.org/10.1007/s10951-020-00668-1.
2. Garey, M. R., & Johnson, D. S. (1979). Computers and intractability: A guide to the theory of NP-completeness. New York: W. H. Freeman.
3. Yu, W. (1996). The two-machine flow shop problem with delays and the one-machine total tardiness problem. PhD thesis, Eindhoven University of Technology.
4. Yu, W., Hoogeveen, J. A., & Lenstra, J. K. (2004). Minimizing makespan in a two-machine flow shop with delays and unit-time operations is NP-hard. Journal of Scheduling, 7, 333–348.
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献