Information

• Syllabus
• Course Information
• Project

Homework

• Homework 1
• Homework 2
• Homework 3
• Homework 4
• Homework 5
• Homework 6
• Homework 7
• Homework 8
• Homework 9
• Homework 10

Homework Solutions

• Homework 1
• Homework 2
• Homework 3
• Homework 4
• Homework 5
• Homework 6
• Homework 7
• Homework 8
• Homework 9
• Homework 10

Examples

• Lecture 1
• Running times of various functions
• A list of some NP-complete problems
• Lecture 3 notes (partial)
• Lecture 4 notes
• Reductions notes
• C code to solve 1||w_jU_j .
• Some notes on NP-completeness.
• Lecture 2/10 (partial) notes
• Some notes on 1||&Sigma T_j .
• Some notes on R|pmtn|C _max .
• Project Scheduling
• Permuation Flow Shop
• Job Shop
• Shifting Bottleneck
• Airline Scheduling
• Scheduling in Transportation
• Heuristics , simulated annealing, tabu search , genetic algorithms ,
• Nuclear Weapons Scheduling

• Midterm will be in Davis Auditorium, on 3/10 at 9:10 AM.
• Practice Exam Questions
• Midterm Topics.
• Presentation Schedule.
• Final will be in Davis Auditorium, on 5/12 at 9:00 AM. You may bring in one piece of 8.5 x 11 paper with writing on both sides. No calculators or other electronic devices allowed.