Author:
Angel Eric,Bampis Evripidis,Chau Vincent,Letsios Dimitrios
Publisher
Springer Berlin Heidelberg
Reference14 articles.
1. Baptiste, P.: An O(n
4) algorithm for preemptive scheduling of a single machine to minimize the number of late jobs. Operations Research Letters 24(4), 175–180 (1999)
2. Graham, R.L., Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G.: Optimization and Approximation in Deterministic Sequencing and Scheduling: A Survey. Annals of Operations Research 5, 287–326 (1979)
3. Yao, F.F., Demers, A.J., Shenker, S.: A Scheduling Model for Reduced CPU Energy. In: Symposium on Foundations of Computer Science (FOCS), pp. 374–382 (1995)
4. Kise, H., Ibaraki, T., Mine, H.: A Solvable Case of the One-Machine Scheduling Problem with Ready and Due Times. Operations Research Letters 26(4), 121–126 (1978)
5. Moore, J.M.: An n job, one machine sequencing algorithm for minimizing the number of late jobs. Management Science 15, 102–109 (1968)
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献