Heuristics and iterated greedy algorithms for the distributed mixed no-idle flowshop with sequence-dependent setup times.
Fernando Luis RossiMarcelo Seido NaganoPublished in: Comput. Ind. Eng. (2021)
Keyphrases
- sequence dependent setup times
- greedy algorithms
- flowshop
- scheduling problem
- greedy algorithm
- single machine
- flowshop scheduling problems
- minimizing total tardiness
- total weighted tardiness
- total tardiness
- setup times
- single machine scheduling problem
- parallel machines
- special case
- flowshop scheduling
- processing times
- maximum lateness
- knapsack problem
- release dates
- tabu search
- lot sizing
- precedence constraints
- np hard
- search algorithm
- distributed systems
- response time
- dynamic programming
- worst case
- strongly np hard
- genetic algorithm
- branch and bound algorithm
- multi objective