On a scheduling problem where a job can be executed only by a limited number of processors
Authors:
- R.S. ChangRCR.S. Chang
- R.C.T. LeeRLR.C.T. Lee
- 31 December 1988
- journal article
- Published by Elsevier in Computers & Operations Research
- Vol. 15 (5) , 471-478
Abstract
No abstract availableKeywords
This publication has 3 references indexed in Scilit:
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey1979
- Deterministic Processor SchedulingACM Computing Surveys, 1977
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite GraphsSIAM Journal on Computing, 1973