Tabu Search for a Preemptive Scheduling Problem with Job Incompatibilities.
Simon TheveninNicolas ZuffereyJean-Yves PotvinPublished in: MIM (2013)
Keyphrases
- tabu search
- scheduling problem
- flowshop
- processing times
- job shop
- single machine
- maximum lateness
- release dates
- setup times
- feasible solution
- sequence dependent setup times
- path relinking
- completion times
- tabu search algorithm
- memetic algorithm
- precedence constraints
- test problems
- job shop scheduling problem
- np hard
- job shop scheduling
- multi start
- single machine scheduling problem
- heuristic methods
- quadratic assignment problem
- benchmark instances
- crane scheduling
- initial solution
- search procedure
- hybrid algorithm
- scatter search
- parallel machines
- variable neighborhood search
- vehicle routing problem
- tabu list
- weighted tardiness
- iterated local search
- multidimensional knapsack problem
- tardiness cost
- competitive ratio
- special case
- simulated annealing
- metaheuristic
- candidate list
- genetic algorithm