A self-learning hyper-heuristic for the distributed assembly blocking flow shop scheduling problem with total flowtime criterion.
Fuqing ZhaoShilu DiLing WangTianpeng XuNingning Zhu JonrinaldiPublished in: Eng. Appl. Artif. Intell. (2022)
Keyphrases
- total flowtime
- permutation flowshop
- minimizing makespan
- scheduling problem
- hyper heuristics
- flowshop scheduling problems
- flowshop
- flowshop scheduling
- examination timetabling
- distributed systems
- genetic programming
- timetabling problem
- single machine
- greedy algorithm
- upper bound
- np hard
- parallel machines
- special case
- evolutionary algorithm
- difficult problems
- learning algorithm
- metaheuristic
- optimal solution