Experimental Comparison of Approximation Algorithms for Scheduling Unrelated Parallel Machines.
Tjark VredeveldCor A. J. HurkensPublished in: INFORMS J. Comput. (2002)
Keyphrases
- unrelated parallel machines
- approximation algorithms
- experimental comparison
- open shop
- scheduling problem
- np hard
- parallel machines
- special case
- setup times
- precedence constraints
- minimum cost
- feature selection
- worst case
- approximation ratio
- scheduling jobs
- single machine
- job shop
- shared memory
- processing times
- flowshop
- sequence dependent setup times
- upper bound
- combinatorial auctions
- constant factor
- lower bound