Author:
Carlier Jacques,Hermès Fatma,Moukrim Aziz,Ghédira Khaled
Subject
General Engineering,General Computer Science
Reference23 articles.
1. Sequencing with due-dates and early starts times to minimize maximum tardiness;Baker;Naval Research Logistics Quarterly,1974
2. Baptiste, P. (2006). Scheduling unit tasks to minimize the number of idle periods: A polynomial time algorithm for offline dynamic power management. In Proceedings on the seventeenth annual ACM–SIAM symposium on discrete algorithms, January 22–26, Miami, FL, pp. 364–367.
3. On sequencing with earliest starts and due dates with application to computing bounds for the n/m/g/fmax problem;Bratley;Naval Research Logistics Quarterly,1973
4. Brucker, P. (1995). Scheduling algorithms. Springer, ISBN 3-540-60087-6.
5. The one-machine sequencing problem;Carlier;European Journal of Operational Research,1982
Cited by
19 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献