Subject
Applied Mathematics,Discrete Mathematics and Combinatorics
Reference15 articles.
1. Shop problems with two machines and time lags;Dell'Amico;Oper. Res.,1996
2. M. Dell'Amico, R.J.M. Vaessens, Flow- and open-shop scheduling on two machines with transportation times and machine-independent processing times is NP-hard. Materiali di discussione 141, Dipartimento di Economia Politica, Università di Modena, Italy, 1995.
3. Open shop scheduling to minimize finish time;Gonzalez;J. Assoc. Comput. Mach.,1976
4. Two-stage no-wait scheduling models with setup and removal times separated;Gupta;Comput. Oper. Res.,1997
5. E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan, D.B. Shmoys, Sequencing and scheduling: algorithms and complexity, in: S.C. Graves, A.H.G. Rinnooy Kan, P.H. Zipkin (Eds.), Handbooks in Operations Research and Management Science, vol. 4, Logistics of Production and Inventory, North-Holland, Amsterdam, 1993, pp. 455–522.
Cited by
50 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献