PSU CS410/510SS: Search and Scheduling
Lecture 4
Scheduling Spaces and Heuristics

Administrative

• Bathroom key
• Homework 2
• Homework 3

Lecture 4

• Systematic CSP Search (cont.)
  • Backjumping techniques
  • Forward checking techniques
  • Nogoods
    • Static nogoods: arc consistency
    • Dynamic nogoods: ``learning'' nogoods

• A Scheduling Model
  • Bin-Packing
  • Precedences
  • Bin-Packing Under Precedences
  • Multiple Bins
  • Search spaces for scheduling
    • tasks-times
    • precedence-based (priority-based)
    • more about symmetry breaking

• Scheduling Heuristics
  • Objective functions
  • The ``obvious'' heuristic
  • Korf: Heuristics For Bin-Packing
    • Reducing uneven bins to Number Partitioning
    • Greedy Heuristic
    • KK Heuristic
      • Priority Queue by size
      • Remove two largest, replace difference
      • Two-color resulting graph
    • CKK = LDS + KK heuristic
    • Critically-constrained domains
    • Generalization to k-way partitioning
    • CKK: custom search space + intelligent search
  • Johnston and Minton: Min-Conflicts
    • CSPs and scheduling
    • Local search vs. systematic search
    • Job-shop problems (Sadeh)
    • Analysis of local search algorithms (one-soln)
    • Deterministic min-conflicts