A note on the maximum number of on-time jobs on parallel identical machines.

Avital Lann Gur Mosheiov

Published in: Comput. Oper. Res. (2003)

Keyphrases

identical machines
maximum number
processing times
single machine
job scheduling
scheduling problem
precedence constraints
scheduling jobs
polynomial time approximation
setup times
release dates
flowshop
theoretical analysis
np hard
single machine scheduling problem
special case
genetic algorithm