A hybrid genetic algorithm for non-permutation flow shop scheduling problems with unavailability constraints.
Wei-Wei CuiZhiqiang LuBinghai ZhouChen LiXiaole HanPublished in: Int. J. Comput. Integr. Manuf. (2016)
Keyphrases
- scheduling problem
- flowshop
- precedence constraints
- single machine
- processing times
- setup times
- squeaky wheel
- flowshop scheduling
- job shop
- special case
- tabu search
- minimizing makespan
- sequence dependent setup times
- bicriteria
- total tardiness
- parallel machines
- makespan minimization
- total flowtime
- unrelated parallel machines
- maximum lateness
- total weighted tardiness
- permutation flowshop
- np hard
- asymptotic optimality
- open shop
- job shop scheduling
- constraint programming
- flowshop scheduling problems
- release dates
- strongly np hard
- neural network
- single machine scheduling problem
- resource constraints
- search algorithm