Optimal scheduling of unit-time tasks on two uniform processors under tree-like precedence constraints.
Wieslaw KubiakPublished in: ZOR Methods Model. Oper. Res. (1989)
Keyphrases
- precedence constraints
- optimal scheduling
- scheduling problem
- parallel processors
- parallel machines
- branch and bound algorithm
- precedence relations
- single machine
- vertex cover
- release dates
- sequence dependent setup times
- partial order
- series parallel
- parallel algorithm
- unit length
- maximum lateness
- np hard
- single machine scheduling problem
- parallel computing
- partially ordered sets
- processing units
- global constraints
- multistage
- computer systems
- upper bound
- partially ordered
- image segmentation
- parallel processing
- tabu search
- search algorithm
- data structure