On applicability of symbolic techniques to larger scheduling problems.
Ivan P. RadivojevicForrest BrewerPublished in: ED&TC (1995)
Keyphrases
- scheduling problem
- single machine
- np hard
- real world
- precedence constraints
- setup times
- job shop scheduling
- tabu search
- processing times
- sequencing problems
- job shop
- job shop scheduling problem
- symbolic representation
- hidden markov models
- small size
- special case
- decision trees
- clustering algorithm
- neural network
- data sets