Minimizing makespan for a no-wait flowshop using tabu mechanism improved iterated greedy algorithm.
Jianya DingShiji SongRui ZhangCheng WuPublished in: IEEE Congress on Evolutionary Computation (2014)
Keyphrases
- minimizing makespan
- total flowtime
- greedy algorithm
- flowshop
- scheduling problem
- tabu search
- permutation flowshop
- maximum tardiness
- flowshop scheduling problems
- greedy algorithms
- worst case
- dynamic programming
- single machine
- greedy strategy
- search procedure
- parallel machines
- processing times
- job shop scheduling problem
- objective function
- reinforcement learning
- simulated annealing
- sequence dependent setup times
- flowshop scheduling
- np hard
- special case