Minimizing the makespan in the non-preemptive job-shop scheduling with limited machine availability.

Published in: Comput. Ind. Eng. (2010)

Keyphrases

job shop scheduling
scheduling problem
flowshop
job shop scheduling problem
single machine
graph coloring
processing times
np hard
genetic algorithm
tabu search
scheduling algorithm
combinatorial optimization problems
computational intelligence