A hybrid tabu search for batching and sequencing decisions in a single machine environment.
Yasothei SuppiahMohamed K. OmarPublished in: Comput. Ind. Eng. (2014)
Keyphrases
- single machine
- tabu search
- scheduling problem
- weighted tardiness
- processing times
- release dates
- flowshop
- scheduling jobs
- feasible solution
- setup times
- job shop scheduling problem
- path relinking
- sequence dependent setup times
- minimize total
- memetic algorithm
- single machine scheduling problem
- hybrid algorithm
- np hard
- job shop
- metaheuristic
- precedence constraints
- job shop scheduling
- search procedure
- heuristic methods
- simulated annealing
- benchmark instances
- production scheduling
- vehicle routing problem
- scatter search
- parallel machines
- dynamic programming
- computational efficiency
- tabu search algorithm
- genetic algorithm
- variable neighborhood search
- special case
- search algorithm