A best possible online algorithm for scheduling equal-length jobs on two machines with chain precedence constraints.
Junling YuanWenhua LiJinjiang YuanPublished in: Theor. Comput. Sci. (2012)
Keyphrases
- equal length
- parallel machines
- precedence constraints
- scheduling problem
- single machine scheduling problem
- release dates
- optimal solution
- probabilistic model
- objective function
- vertex cover
- search space
- parallel processors
- computational complexity
- flowshop
- optimal scheduling
- dynamic programming
- np hard
- scheduling policies
- series parallel
- sequence dependent setup times
- branch and bound algorithm
- scheduling strategy
- precedence relations
- unit length
- identical parallel machines
- maximum lateness
- identical machines
- processing times
- simulated annealing