SLIDES / PRESENTATIONS

• Atlason, J., (2004) Visiting Assistant Professor, Department of Industrial and Operations Engineering, University of Michigan-Ann Arbor
  • Powerpoint
    • Introduction
    • Chapter 3
    • Chapter 3b
    • Chapter 5
    • Chapter 5b
    • Chapter 6
    • Chapter 7
    • Chapter 8
    • Chapter 9
    • Chapter 10
    • Chapter 11
    • Chapter 14
    • Chapter 14 ga
    • Chapter14 local search
  • Homework
    • #1, #2, #3, #4, #5, #6, #7, #8, #9, #10, #11

     

• Hurink, J., (2005) Department of Applied Mathematics, University of Twente
  • Lecture #1, #2, #3, #4, #5, #6, #7, #8, #9, #10, #11
  • Exercises #1, #2

• Nagi, R., (Fall 2003) "Scheduling Theory", Department of Industrial Engineering, University at Buffalo.
  • Introduction
  • Chapter 1
  • Chapter 2
  • Chapter 3
    • Single Machine Deterministic Models
    • Lateness Models
    • Tardiness Models
  • Chapter 4
  • Chapter 5
  • Chapter 6
  • Complexity Theory

• Schwiegelshohn, U., (Summer 2006) "Scheduling Problems and Solutions," CEI University Dortmund.

• Schwiegelshohn, U., (Summer 2004) "Scheduling Problems and Solutions," CEI University Dortmund.
  • A complete PowerPoint file of this presentation may be obtained by contacting Michael Pinedo or Uwe Schwiegelshohn.


• Schwiegelshohn, U., (Summer 2003) "Scheduling Problems and Solutions," CEI University Dortmund.

 

• Shakhlevich, N. (2004/2005) "Scheduling: Models and Algorithms", School of Computing, University of Leeds
  • 1. Introduction
  • 2. Single Machine Problems: Total Completion Time
  • 3. Single Machine Problems: Due Date Scheduling
  • 4. Computational Complexity
  • 5. Single Machine Problems: Branch and Bound Algorithm
  • 6. Parallel Machine Problems
  • 7. Flow Shop
  • 8. Types of Algorithms. Dispatching rules
  • 9. Local Search
  • 10. Genetic Algorithm
  • 11. Job Shop Problem: Branch and Bound Algorithm
  • Handout 1: Introduction
  • Handout 2: Single Machine Problems: Total Completion Time
  • Handout 3: Single Machine Problems: Preemption
  • Handout 4: Single Machine Problems: Due Date Scheduling
  • Handout 5: Computational Complexity; Approximation Algorithm
  • Handout 6: Single Machine Problems: Branch and Bound Algorithm
  • Handout 7: Parallel Machines
  • Handout 8: Flow Shop
  • Handout 9: Heuristic Algorithms: Dispatching Rules
  • Handout 10: Heuristic Algorithms: Local Search
  • Handout 11: Job Shop
  • Handout 12: Genetic Algorithm