Shortest path to nonpreemptive schedules of unit-time jobs on two identical parallel machines with minimum total completion time.
Philippe BaptisteVadim G. TimkovskyPublished in: Math. Methods Oper. Res. (2004)
Keyphrases
- shortest path
- identical parallel machines
- scheduling problem
- single machine
- precedence constraints
- processing times
- parallel machines
- scheduling jobs
- completion times
- release dates
- shortest path problem
- competitive ratio
- flowshop
- np hard
- strongly np hard
- setup times
- shortest path algorithm
- fixed number
- road network
- tabu search
- sequence dependent setup times
- single machine scheduling problem
- routing algorithm
- single server
- path length
- shortest distance
- finding the shortest path