Scheduling job families on non-identical parallel machines with time constraints.
Ali ObeidStéphane Dauzère-PérèsClaude YugmaPublished in: WSC (2011)
Keyphrases
- identical parallel machines
- scheduling problem
- fixed number
- processing times
- scheduling jobs
- release dates
- precedence constraints
- single server
- competitive ratio
- single machine
- parallel machines
- strongly np hard
- single machine scheduling problem
- flowshop
- steady state
- identical machines
- queueing networks
- completion times
- genetic algorithm
- optimal strategy
- lower bound