Submodular Returns and Greedy Heuristics for Queueing Scheduling Problems.
Renate GarbeKevin D. GlazebrookPublished in: Oper. Res. (1998)
Keyphrases
- greedy heuristics
- scheduling problem
- set cover
- greedy algorithm
- single machine
- steady state
- queue length
- flowshop
- processing times
- np hard
- priority scheduling
- job shop scheduling
- arrival rate
- tabu search
- objective function
- long run
- neural network
- queueing systems
- optimal solution
- parallel machines
- queueing networks
- search algorithm
- computational complexity
- lower bound
- worst case
- setup times
- social networks
- optimization problems