An iterated greedy algorithm for distributed blocking flow shop with setup times and maintenance operations to minimize makespan.
Hugo Hissashi MiyataMarcelo Seido NaganoPublished in: Comput. Ind. Eng. (2022)
Keyphrases
- setup times
- greedy algorithm
- flowshop
- scheduling problem
- total flowtime
- permutation flowshop
- processing times
- sequence dependent setup times
- lot sizing
- single machine
- special case
- flowshop scheduling
- total tardiness
- manufacturing cell
- multi item
- worst case
- tabu search
- unrelated parallel machines
- strongly np hard
- minimizing makespan
- precedence constraints
- dynamic programming
- objective function
- single machine scheduling problem
- parallel machines
- knapsack problem
- single server
- scheduling algorithm
- approximation guarantees
- np hard
- lagrangian relaxation