Homogeneously non-idling schedules of unit-time jobs on identical parallel machines.
Alain QuilliotPhilippe ChrétiennePublished in: Discret. Appl. Math. (2013)
Keyphrases
- identical parallel machines
- scheduling problem
- scheduling jobs
- processing times
- fixed number
- single machine
- flowshop
- tabu search
- precedence constraints
- setup times
- np hard
- parallel machines
- release dates
- strongly np hard
- competitive ratio
- hybrid algorithm
- approximation algorithms
- genetic algorithm
- average case
- search algorithm