Subject
Management Science and Operations Research,Computer Science Applications,Theoretical Computer Science
Reference45 articles.
1. 1. BALAS E., Machine Sequencing via Disjunctive Graph : an Implicit Enumeration algorithm, Operation Research, vol. 17, n° 6, 1969.2507700183.49404
2. 2. BAKER K. A., Introduction to Sequencing and Scheduling, John Wiley and sons, 1974.
3. 3. BAKER K. A. et SU Z. S., Sequencing with Due-Dates and Early Start-Times to Minimize Maximum Tardiness, Naval Research Logistic Quarterly, vol. 21, mars 1974, p. 171-176.3438920277.90044
4. 4. BRATLEY P., FLORIAN M. et ROBILLARD P., On Sequencing with Earliest Start and Due-dates with Applications to Calculations of Bounds for the (n, m, G/Fmax) Problem, Naval Research Logistic Quarterly, 1979, p. 20-57.4115990256.90027
5. 5. BRUNO J., COFFMAN E. G. et SETHI R., Algorithms for Minimizing Mean Flow Time, Proceedings, IFIPS Congress, North Holland Publishing Company août 1974, p. 504-510.4188930297.68048
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献