Total Tardiness Minimization in a Flow Shop with Blocking Using an Iterated Greedy Algorithm.
Nouri NouhaTalel LadhariPublished in: CSOC (1) (2016)
Keyphrases
- total tardiness
- greedy algorithm
- flowshop
- scheduling problem
- objective function
- sequence dependent setup times
- special case
- setup times
- single machine
- total flowtime
- flowshop scheduling
- processing times
- greedy algorithms
- minimizing makespan
- tabu search
- parallel machines
- worst case
- greedy strategy
- np hard
- dynamic programming
- permutation flowshop
- linear programming
- evolutionary algorithm
- strongly np hard
- precedence constraints
- optimization problems
- knapsack problem
- lower bound