On Scheduling Tasks with Exponential Service Times and In-Tree Precedence Constraints.
John L. BrunoPublished in: Acta Informatica (1985)
Keyphrases
- precedence constraints
- scheduling problem
- service times
- branch and bound algorithm
- parallel machines
- precedence relations
- release dates
- single server
- approximation algorithms
- parallel processors
- unit length
- maximum lateness
- partial order
- steady state
- setup times
- processor sharing
- single machine scheduling problem
- partially ordered
- queue length
- global constraints
- arrival rate
- holding cost
- processor sharing queue
- queueing networks
- state dependent
- np hard
- arrival process
- branch and bound
- optimal solution
- processing times
- computational complexity