A dynamic programming algorithm for preemptive scheduling of a single machine to minimize the number of late jobs
- 1 December 1990
- journal article
- Published by Springer Nature in Annals of Operations Research
- Vol. 26 (1-4) , 125-133
- https://doi.org/10.1007/bf02248588
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- Preemptive Scheduling of a Single Machine to Minimize Maximum Cost Subject to Release Dates and Precedence ConstraintsOperations Research, 1983
- A Solvable Case of the One-Machine Scheduling Problem with Ready and Due TimesOperations Research, 1978
- Application de la théorie des graphes au choix des investissements à court terme dans un réseau électrique sujet à avariesRevue française d'automatique, informatique, recherche opérationnelle. Recherche opérationnelle, 1976
- A Functional Equation and its Application to Resource Allocation and Sequencing ProblemsManagement Science, 1969
- An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late JobsManagement Science, 1968