Syllabus
Schedule
Current Reading:
Chapter 13
Excel Solver Walkthrough
Extra Excel Exercises [Solution]
Extra Exercise #1
Slides from 9/19
CPLEX Installation and Run Guide
CPLEX Getting Started Guide (from IBM)
Big M Cheat Sheet
Big M Step-by-Step Example
Slides from 11/5 (Transportation
Simplex)
Hungarian Method Cheat Sheet
Slides from 11/12 (Hungarian Method)
Slides from 11/26 (Network
Optimization)
Project
Documents
Assignment 1 - Due 9/24 at 11:59pm
[Rubric]
Assignment 2 - Due 10/19 at 11:59pm
[Spread]
Assignment 3 - Due 11/30 at 11:59pm
[Project Data] [Map] [Simulator]
Articles
Mason, McKenney, Carlson, Copeland.
“Absolutely, Positively Operations Research: The Federal
Express Story.” (for 9/5)
Schuster and Allen, “Raw Material Management
at Welch’s, Inc.” (for 9/17)
Leachman, Kang, Lin. “SLIM: Short Cycle Time
and Low Inventory in Manufacturing at Samsung
Electronics.” (for 9/24)
Bjorndal, Herrero, Newman, Romero, Weintraub.
“Operations Research in the Natural Resource
Industry.” (for
10/15)
Ahmadi. “Managing Capacity and Flow at Theme
Parks.” (for
11/5)
Tibben-Lembke. “Maximum Happiness: Amusement
Park Rides as Closed Queueing Networks.”
(for 11/5)
Caro et al. “Zara Uses Operations Research to
Reengineer Its Global Distribution Process.”
(for 11/12)
Kleindorfer, Singhal, Van Wassenhove.
“Sustainable Operations Management.” (for
11/19)
Larson. “Perspectives on Queues: Social
Justice and the Psychology of Queuing.”
(for 11/26)
Gendron. “Scheduling Employees in Quebec’s
Liquor Stores with Integer Programming.”
(for
12/3)
HW Documents
HW#1 (Due 9/5)
HW#2 (Due 9/12)
HW#3 (Due 9/19)
HW#4 (Due 9/26)
HW#5 (Due 10/17)
HW#6 (Due 11/12)
HW#7 (Due 11/19)
HW#8 (Due 12/3)
Exams
Exam 1 (Due 10/29) [Formulations]
Project 3 Support
Articles
Wikipedia Entry - Generalized Assignment
Problem
Wikipedia Entry - Assignment
Problem
Wikipedia Entry - Simulated
Annealing (for
CS and CS inclined)
Wikipedia Entry - Approximation
Algorithms (for
CS and CS inclined)
Lecture Room Assignment Problem
- via Complexity
International
General Description and Approach for the
Generalized Assignment Problem - Chapter from Martello and Toth
“Knapsack Problems”
Yagiura and Ibaraki, “The Generalized
Assignment Problem and Its
Generalizations”
Shmoys and Tardos, “An approximation
algorithm for the generalized assignment
problem”
Juell, Perera, Nygard, “Application of a
Genetic Algorithm to improve an existing solution for
the General Assignment Problem”
