An improved iterated greedy algorithm with a Tabu-based reconstruction strategy for the no-wait flowshop scheduling problem.
Jianya DingShiji SongJatinder N. D. GuptaRui ZhangRaymond ChiongCheng WuPublished in: Appl. Soft Comput. (2015)
Keyphrases
- greedy algorithm
- scheduling problem
- flowshop
- tabu search
- total flowtime
- iterated greedy
- permutation flowshop
- greedy strategy
- minimizing makespan
- processing times
- job shop scheduling problem
- np hard
- greedy algorithms
- total tardiness
- single machine
- minimizing total tardiness
- flowshop scheduling problems
- setup times
- special case
- squeaky wheel
- sequence dependent setup times
- set cover
- precedence constraints
- bicriteria
- dynamic programming
- maximum lateness
- objective function
- flowshop scheduling
- makespan minimization
- search procedure
- worst case
- strongly np hard
- parallel machines
- total weighted tardiness
- preventive maintenance
- job processing times
- upper bound
- release dates
- influence spread
- optimal strategy
- knapsack problem
- evolutionary algorithm