Author:
Brucker Peter,Kravchenko Svetlana A.
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Modelling and Simulation
Reference5 articles.
1. Brucker, P.: Scheduling algorithms. Springer, Berlin Heidelberg New York Tokyo, 1998.
2. Brucker, P., Jurisch, B. and Jurisch, M.: Open shop problems with unit time operations, Math. Methods Oper. Res. 37 (1993), 59–73.
3. Brucker, P., Kravchenko, S. A. and Sotskov, Y. N.: Preemptive job-shop scheduling problem with a fixed number of jobs, Math. Methods Oper. Res. 49 (1999), 41–76.
4. Garey, M. R. and Johnson, D. S.: Computers and intractability. A guide to the theory of NP-completeness. W.H. Freeman and Company, San Francisco, 1979.
5. Lawler, E. L.: Resent results in the theory of machine scheduling, in A. Bachem, M. Grötschel and B. Korte (eds.), Mathematical Programming: the State of the Art, Springer, Berlin Heidelberg New York Tokyo, 1983, pp. 202–234.
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献