Solving large permutation flow-shop scheduling problems on GPU-accelerated supercomputers.
Jan GmysPublished in: CoRR (2020)
Keyphrases
- scheduling problem
- flowshop
- gpu accelerated
- single machine
- squeaky wheel
- processing times
- flowshop scheduling
- setup times
- strongly np hard
- special case
- np hard
- sequence dependent setup times
- tabu search
- total tardiness
- real time
- job shop scheduling
- minimizing makespan
- precedence constraints
- parallel machines
- finite element
- release dates
- job shop
- total weighted tardiness
- flowshop scheduling problems
- permutation flowshop
- makespan minimization
- genetic algorithm
- maximum lateness
- job shop scheduling problem
- search algorithm
- asymptotic optimality
- completion times
- np complete
- open shop
- simulated annealing
- optimal solution