Complexity of scheduling problems with multi-purpose machines.

Peter Brucker Bernd Jurisch Andreas Krämer

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

Keyphrases

scheduling problem
flowshop
parallel machines
single machine
computational complexity
real time
job shop scheduling problem
space complexity
worst case
machine learning
data sets
computational cost
lower bound
genetic algorithm
processing times
database
job shop scheduling
identical machines