Polynomial algorithms for multiprocessor scheduling with a small number of job lengths

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 1997, Pages 509-517

  McCormick, S Thomas ^a   Smallwood, Scott R ^a   Spieksma, Frits C R ^a  

^a UNIVERSITY OF BRITISH COLUMBIA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; JOB ANALYSIS; MAINTENANCE; PROBLEM SOLVING; SCHEDULING;

MULTIPROCESSOR SCHEDULING PROBLEMS; POLYNOMIAL TIME ALGORITHMS;

MULTIPROCESSING SYSTEMS;

EID: 0030823073     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (16)