A Hyper-Heuristic Algorithm for the No-Wait Flowshop Scheduling Problem with Makespan Criterion.
Yu GaoZiyue WangLiang GaoXinyu LiPublished in: CSCWD (2022)
Keyphrases
- flowshop
- scheduling problem
- total flowtime
- permutation flowshop
- minimizing makespan
- flowshop scheduling problems
- processing times
- flowshop scheduling
- single machine
- setup times
- maximum lateness
- sequence dependent setup times
- special case
- np hard
- bicriteria
- makespan minimization
- maximum tardiness
- tabu search
- total tardiness
- minimizing total tardiness
- strongly np hard
- total weighted tardiness
- precedence constraints
- parallel machines
- open shop
- job shop scheduling problem
- upper bound
- lot streaming
- release dates
- completion times
- neural network