Scheduling job families on non-identical parallel machines with time constraints.

Ali Obeid Stéphane Dauzère-Pérès Claude Yugma

Published in: Ann. Oper. Res. (2014)

Keyphrases

identical parallel machines
scheduling problem
fixed number
processing times
scheduling jobs
release dates
parallel machines
competitive ratio
precedence constraints
single machine
single server
strongly np hard
flowshop
average case
np hard
branch and bound algorithm
single machine scheduling problem
tabu search