A tight approximation ratio of a list scheduling algorithm for a single-machine scheduling problem with a non-renewable resource.
Susumu HashimotoShinji MizunoPublished in: J. Sched. (2021)
Keyphrases
- scheduling algorithm
- single machine scheduling problem
- resource consumption
- approximation ratio
- np hard
- approximation algorithms
- response time
- lower bound
- branch and bound algorithm
- worst case
- special case
- search algorithm
- grid environment
- greedy algorithm
- setup times
- scheduling strategy
- upper bound
- precedence constraints
- lagrangian relaxation
- greedy algorithms
- optimal solution
- minimum cost
- single machine
- resource allocation
- web services