Subject
Computational Mathematics
Reference34 articles.
1. R. L. Graham, E. L. Lawler, J. K. Lenstra, et al., “Optimization and Approximation in Deterministic Sequencing and Scheduling: A Survey,” Ann. Discrete Math., No. 5, 287–326 (1979).
2. J. K. Lenstra, A. H. G. Rinnooy Kan, and P. Brucker, “Complexity of Machine Scheduling Problems,” Eur. J. Operat. Res. 4, 270–275 (1980).
3. J. R. Jackson, “Scheduling a Production Line to Minimize Maximum Tardiness,” Manag. Sci. Res. Project, UCLA, 43 (1955).
4. C. N. Potts, “Analysis of a Heuristic for One Machine Sequencing with Release Dates and Delivery Times,” Operat. Res. 28, 1436–1441 (1980).
5. L. A. Hall and D. B. Shmoys, “Jackson’s Rule for One-Machine Scheduling: Making a Good Heuristic Better,” Math. Operat. Res. 17, 22–35 (1992).
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献