Subject
Applied Mathematics,Discrete Mathematics and Combinatorics
Reference13 articles.
1. A linear time algorithm to minimize maximum lateness for the two-machine unit-time, job-shop, scheduling problem;Brucker;Lecture Notes in Control and Inform. Sci.,1982
2. Minimizing maximum lateness in a two-machine unit-time job-shop;Brucker;Computing,1981
3. Flow shop and job shop schedules: complexity and approximation;Gonzalez;Oper. Res.,1978
4. An efficient optimal algorithm for the two-machine, unit-time, job-shop, schedule-length problem;Hefetz;Math. Oper. Res.,1982
5. R.M. Karp, Reducibility among combinatorial problems, in: R.E. Miller, J.W. Thatcher (Eds.), Complexity of Computer Computations, Plenum Press, New York, 1972, pp. 85–103.
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献