Iterated greedy algorithms enhanced by hyper-heuristic based learning for hybrid flexible flowshop scheduling problem with sequence dependent setup times: A case study at a manufacturing plant.
Fehmi Burcin OzsoydanMüjgan SagirPublished in: Comput. Oper. Res. (2021)
Keyphrases
- scheduling problem
- flowshop
- sequence dependent setup times
- single machine
- setup times
- maximum lateness
- minimizing total tardiness
- total weighted tardiness
- parallel machines
- precedence constraints
- total tardiness
- single machine scheduling problem
- special case
- minimizing makespan
- processing times
- release dates
- np hard
- permutation flowshop
- greedy algorithms
- greedy algorithm
- manufacturing systems
- job shop scheduling problem
- job shop
- branch and bound algorithm
- makespan minimization