Approximation algorithms for single vehicle scheduling problems with release and service times on a tree or cycle.
Xiaoguang BaoZhaohui LiuPublished in: Theor. Comput. Sci. (2012)
Keyphrases
- constraint satisfaction problems
- approximation algorithms
- np hard
- scheduling problem
- service times
- special case
- minimum cost
- worst case
- precedence constraints
- steady state
- optimal solution
- waiting times
- approximation ratio
- lower bound
- single machine
- branch and bound algorithm
- vertex cover
- randomized algorithms
- set cover
- flowshop
- processing times
- queue length
- processor sharing queue
- arrival rate
- job shop scheduling problem
- stationary distribution
- independent and identically distributed
- tabu search
- strongly np hard
- parallel machines
- combinatorial auctions
- job shop
- markov chain
- computational complexity
- single server queue
- processor sharing
- constant factor approximation
- search algorithm