A tabu search algorithm for the flowshop scheduling problem with changing neighborhoods.
Burak EksiogluSandra Duni EksiogluPramod JainPublished in: Comput. Ind. Eng. (2008)
Keyphrases
- flowshop
- scheduling problem
- tabu search
- minimizing makespan
- processing times
- single machine
- maximum lateness
- setup times
- minimizing total tardiness
- flowshop scheduling
- sequence dependent setup times
- total tardiness
- makespan minimization
- np hard
- total weighted tardiness
- bicriteria
- special case
- parallel machines
- precedence constraints
- total flowtime
- vehicle routing problem
- simulated annealing
- preventive maintenance
- maximum tardiness
- job shop scheduling problem
- memetic algorithm
- permutation flowshop
- strongly np hard
- feasible solution
- particle swarm optimization
- unrelated parallel machines
- flowshop scheduling problems