G-SCAN: A Novel Real-Time Disk Scheduling Using Grouping and Branch-and-Bound Strategy.
Taeseok KimEungkyu SongYunji KohYoujip WonKern KohPublished in: ICCSA (1) (2006)
Keyphrases
- branch and bound
- real time
- lower bound
- search algorithm
- branch and bound algorithm
- search space
- search strategies
- optimal solution
- column generation
- upper bound
- combinatorial optimization
- randomly generated problems
- beam search
- branch and bound procedure
- lagrangian heuristic
- tree search algorithm
- scheduling problem
- scheduling algorithm
- depth first search
- branch and bound method
- tree search
- network design problem
- objective function
- linear programming relaxation
- round robin
- tertiary storage
- integer programming problems
- linear programming
- branch and bound search
- search strategy
- partial solutions
- constraint satisfaction problems
- lower and upper bounds