Login / Signup
Using mixed graph coloring to minimize total completion time in job shop scheduling.
Fawaz S. Al-Anzi
Yuri N. Sotskov
Ali Allahverdi
George V. Andreev
Published in:
Appl. Math. Comput. (2006)
Keyphrases
</>
job shop scheduling
graph coloring
minimize total
scheduling problem
single machine
parallel machines
release dates
job shop scheduling problem
total cost
processing times
combinatorial optimization problems
tabu search
resource constraints
machine learning
genetic algorithm
cost function