Mixed integer linear programs and tabu search approach to solve mixed graph coloring for unit-time job shop scheduling.
Ahmed KouiderHacène Aït HaddadèneSamia OurariAmmar OulamaraPublished in: CASE (2015)
Keyphrases
- job shop scheduling
- graph coloring
- tabu search
- job shop scheduling problem
- scheduling problem
- simulated annealing
- metaheuristic
- max sat
- memetic algorithm
- feasible solution
- combinatorial optimization problems
- genetic algorithm
- heuristic methods
- search procedure
- test problems
- vehicle routing problem
- search algorithm
- benchmark problems
- combinatorial problems
- multidimensional knapsack problem
- neural network
- resource constraints
- combinatorial optimization
- evolutionary algorithm
- optimal solution