Exact and Approximation Algorithms for Makespan Minimization on Unrelated Parallel Machines.
Silvano MartelloFrançois SoumisPaolo TothPublished in: Discret. Appl. Math. (1997)
Keyphrases
- approximation algorithms
- parallel machines
- open shop
- polynomial time approximation
- np hard
- scheduling problem
- special case
- setup times
- flowshop
- polynomially solvable
- precedence constraints
- processing times
- worst case
- minimum cost
- approximation ratio
- sequence dependent setup times
- shared memory
- single machine
- parallel computing
- single server
- optimal solution
- combinatorial auctions
- integer programming
- np complete
- multi item
- multistage