A genetic iterated greedy algorithm for the blocking flowshop to minimize total earliness and tardiness.
Bruno de Athayde PrataHelio Yochihiro FuchigamiPublished in: J. Intell. Manuf. (2024)
Keyphrases
- minimize total
- greedy algorithm
- flowshop
- scheduling problem
- single machine
- parallel machines
- release dates
- processing times
- total flowtime
- sequence dependent setup times
- permutation flowshop
- minimizing makespan
- setup times
- flowshop scheduling
- np hard
- precedence constraints
- genetic algorithm
- dynamic programming
- worst case
- objective function
- special case
- single machine scheduling problem
- total cost
- tabu search
- competitive ratio
- strongly np hard
- job shop scheduling problem