Preemptive LCFS Scheduling in Hard Real-Time Applications.
Johann BliebergerUlrich SchmidPublished in: Perform. Evaluation (1992)
Keyphrases
- scheduling algorithm
- scheduling problem
- response time
- random walk
- single machine
- scheduling strategy
- processing times
- real time database systems
- steady state
- job shop
- flowshop
- flexible manufacturing systems
- databases
- np hard
- computational grids
- scheduling policies
- job shop scheduling problem
- parallel machines
- decision making
- minimize total
- lower bound
- precedence constraints
- flow control
- dynamic scheduling
- database
- decision trees
- identical machines