Scheduling on parallel processors with varying processing times.
Radoslaw RudekPublished in: Comput. Oper. Res. (2017)
Keyphrases
- parallel processors
- processing times
- scheduling problem
- precedence constraints
- single machine
- release dates
- precedence relations
- setup times
- scheduling jobs
- single machine scheduling problem
- flowshop
- identical machines
- release times
- sequence dependent setup times
- search problems
- polynomially solvable
- contract algorithms
- worst case performance ratio
- np hard
- parallel machines
- tabu search
- completion times
- identical parallel machines
- communication delays
- job shop scheduling problem
- branch and bound algorithm
- job shop
- competitive ratio
- resource consumption
- multistage
- orders of magnitude
- job processing times
- search algorithm