Optimal solutions for unrelated parallel machines scheduling problems using convex quadratic reformulations.
Marie-Christine PlateauYasmín Á. Ríos-SolísPublished in: Eur. J. Oper. Res. (2010)
Keyphrases
- scheduling problem
- unrelated parallel machines
- convex quadratic
- optimal solution
- np hard
- inequality constraints
- single machine
- parallel machines
- setup times
- flowshop
- tabu search
- lower bound
- feasible solution
- linear program
- branch and bound algorithm
- job shop scheduling
- objective function
- linear programming
- job shop
- processing times
- equality constraints
- approximation algorithms
- solution quality
- metaheuristic
- branch and bound
- np complete
- knapsack problem
- job shop scheduling problem
- precedence constraints
- special case
- sequence dependent setup times
- total cost
- search space
- release dates
- constraint satisfaction problems
- worst case
- constrained optimization
- integer programming