Parallel approximation to high multiplicity scheduling problems VIA smooth multi-valued quadratic programming.
Maria J. SernaFatos XhafaPublished in: RAIRO Theor. Informatics Appl. (2008)
Keyphrases
- multi valued
- quadratic programming
- high multiplicity
- scheduling problem
- asymptotically optimal
- single machine
- linear programming
- np hard
- processing times
- job shop scheduling problem
- flowshop
- boolean functions
- approximation algorithms
- support vector machine
- tabu search
- normal form
- ls svm
- closed form
- worst case
- feature selection
- graphical models
- undirected graph
- computational complexity