Hybrid Discrete EDA for the No-Wait Flow Shop Scheduling Problem.
Zewen SunXingsheng GuPublished in: LSMS/ICSEE (2) (2017)
Keyphrases
- scheduling problem
- single machine
- flowshop
- tabu search
- setup times
- discrete geometry
- processing times
- np hard
- hybrid approaches
- unrelated parallel machines
- parallel machines
- precedence constraints
- earliness tardiness
- minimizing makespan
- discrete version
- genetic algorithm
- hybrid learning
- job shop scheduling problem
- knapsack problem
- genetic programming
- permutation flowshop
- lower bound
- feature selection
- data sets