Performance of critical path type algorithms for scheduling on parallel processors

Operations Research Letters

Volumn 29, Issue 1, 2001, Pages 17-30

  Singh, Gaurav ^a  

^a UNIVERSITY OF TECHNOLOGY SYDNEY   (Australia)

Author keywords

Concurrency; Maximum lateness; Precedence constraints; Scheduling; Unit communication delays; Unit execution times

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; PROCESS ENGINEERING; PRODUCTION CONTROL; SCHEDULING; STRATEGIC PLANNING;

CRITICAL PATH TYPE ALGORITHMS; PRECEDENCE CONSTRAINTS;

OPERATIONS RESEARCH;

EID: 0035425659     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-6377(01)00077-3     Document Type: Article

References (10)

1. Scheduling equal-length tasks under tree-like precedence constraints to minimise maximum lateness
2. Optimal scheduling for two-processor systems
3. Scheduling tasks with nonuniform deadlines on two processors
4. Parallel sequencing and assembly line problems
5. The complexity of scheduling trees with communication delays
6. Concurrent task systems
7. UET scheduling with unit interprocessor communication delays
8. Worst-case performance of two critical path type algorithms
9. Worst-case performance of critical path type algorithms
10. NP-Complete scheduling problems