Schedule Two-machine Flow-shop with Controllable Processing Times Using Tabu-search.
Kailiang XuGang ZhengPublished in: ICORES (2015)
Keyphrases
- scheduling problem
- tabu search
- single machine
- processing times
- flowshop
- job shop scheduling problem
- memetic algorithm
- path relinking
- feasible solution
- hybrid algorithm
- quadratic assignment problem
- np hard
- heuristic methods
- test problems
- search procedure
- vehicle routing problem
- production scheduling
- benchmark instances
- parallel machines
- precedence constraints
- tabu search algorithm
- multidimensional knapsack problem
- iterated local search
- single machine scheduling problem
- graph colouring
- max sat
- job shop
- scatter search
- multi start
- simulated annealing and tabu search
- initial solution
- variable neighborhood search