A rapid scheduling method by using gradual assignment for a rectangular cutting stock problem for flawed and connectable resources.
Yuji ShonoYoshitomo IkkaiNorihisa KomodaSatoshi ImaiHidenobu HamamotoPublished in: ETFA (2) (2003)
Keyphrases
- synthetic data
- neural network
- lower bound
- high accuracy
- resource allocation
- similarity measure
- preprocessing
- prior knowledge
- significant improvement
- cost function
- support vector machine
- experimental evaluation
- scheduling algorithm
- high precision
- classification method
- clustering method
- feature set
- pairwise
- computational complexity
- clustering algorithm