Author:
Hoogeveen Han,Kawaguchi Tsuyoshi
Publisher
Springer Berlin Heidelberg
Reference8 articles.
1. R.W. Conway, W.L. Maxwell, and L.W. Miller (1967). Theory of Scheduling, Addison-Wesley, Reading, Massachusetts.
2. M.R. Garey, D.S. Johnson, and R. Sethi (1976). The complexity of flowshop and jobshop scheduling. Mathematics of Operations Research 13, 330–348.
3. M.R. Garey and D.S. Johnson (1979). Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, San Francisco.
4. R.L. Graham, E.L. Lawler, J.K. Lenstra, and A.H.G. Rinnooy Kan (1979). Optimization and approximation in deterministic sequencing and scheduling: a survey. Annals of Discrete Mathematics 5, 287–326.
5. T. Gonzalez and S. Sahni (1978). Flowshop and jobshop schedules: Complexity and approximation. Operations Research 26, 36–52.
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献