Using Edge Histogram Models to solve Flow shop Scheduling Problems with Probabilistic Model-Building Genetic Algorithms.
Shigeyoshi TsutsuiMitsunori MikiPublished in: SEAL (2002)
Keyphrases
- scheduling problem
- flowshop
- genetic algorithm
- tabu search
- single machine
- probabilistic model
- processing times
- setup times
- job shop scheduling
- np hard
- job shop
- flowshop scheduling
- strongly np hard
- total tardiness
- unrelated parallel machines
- neural network
- sequence dependent setup times
- release dates
- bicriteria
- multi objective
- precedence constraints
- job shop scheduling problem
- parallel machines
- maximum lateness
- multistage
- special case