Iterated greedy algorithms for the blocking flowshop scheduling problem with makespan criterion.
Mehmet Fatih TasgetirenDamla KizilayQuan-Ke PanPonnuthurai N. SuganthanPublished in: Comput. Oper. Res. (2017)
Keyphrases
- greedy algorithms
- total flowtime
- flowshop
- scheduling problem
- greedy algorithm
- permutation flowshop
- flowshop scheduling problems
- minimizing makespan
- single machine
- processing times
- setup times
- bicriteria
- knapsack problem
- flowshop scheduling
- tabu search
- parallel machines
- special case
- sequence dependent setup times
- unrelated parallel machines
- search algorithm
- maximum lateness
- total tardiness
- lot streaming
- strongly np hard
- release dates
- precedence constraints
- total weighted tardiness
- preventive maintenance
- makespan minimization
- open shop
- multistage
- dynamic programming
- maximum tardiness
- identical parallel machines
- neural network