Minimizing the number of late jobs on unrelated machines
Authors:
- 1 April 1991
- journal article
- Published by Elsevier in Operations Research Letters
- Vol. 10 (3) , 153-158
Abstract
No abstract availableKeywords
This publication has 2 references indexed in Scilit:
- On Preemptive Scheduling of Unrelated Parallel Processors by Linear ProgrammingJournal of the ACM, 1978
- An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late JobsManagement Science, 1968