Using Quadratic Programming to Solve High Multiplicity Scheduling Problems on Parallel Machines.
Frieda GranotJadranka Skorin-KapovAmir TamirPublished in: Algorithmica (1997)
Keyphrases
- scheduling problem
- parallel machines
- high multiplicity
- quadratic programming
- single machine
- unrelated parallel machines
- total tardiness
- sequence dependent setup times
- linear programming
- precedence constraints
- flowshop
- strongly np hard
- np hard
- processing times
- setup times
- tabu search
- job shop scheduling problem
- single server
- job shop
- shared memory
- genetic algorithm
- model selection
- upper bound
- support vector machine
- dynamic programming
- evolutionary algorithm
- objective function