A parameter-Less iterated greedy method for the hybrid flowshop scheduling problem with setup times and due date windows.
Ahmed MissaouiRubén RuizPublished in: Eur. J. Oper. Res. (2022)
Keyphrases
- scheduling problem
- setup times
- flowshop
- processing times
- single machine
- cost function
- tabu search
- sequence dependent setup times
- total tardiness
- parallel machines
- unrelated parallel machines
- makespan minimization
- single machine scheduling problem
- maximum lateness
- permutation flowshop
- np hard
- multi item
- strongly np hard
- precedence constraints
- minimizing makespan
- evolutionary algorithm