Polynomial time algorithms for minimizing the weighted number of late jobs on a single machine with equal processing times
- 1 November 1999
- journal article
- Published by Wiley in Journal of Scheduling
Abstract
No abstract availableThis publication has 6 references indexed in Scilit:
- Minimizing late jobs in the general one machine scheduling problemEuropean Journal of Operational Research, 1995
- Scheduling AlgorithmsPublished by Springer Science and Business Media LLC ,1995
- Knapsack-like scheduling problems, the Moore-Hodgson algorithm and the ‘tower of sets’ propertyMathematical and Computer Modelling, 1994
- A dynamic programming algorithm for preemptive scheduling of a single machine to minimize the number of late jobsAnnals of Operations Research, 1990
- A Solvable Case of the One-Machine Scheduling Problem with Ready and Due TimesOperations Research, 1978
- An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late JobsManagement Science, 1968