Thoery of Scheduling

Overview of the course

Scheduling problems occur whenever we have a choice as to the order of jobs or operations under resource constraints, and as a result of our decision there are differences in the performance measures under consideration. In other words, the scheduling problem is a kind of decision making problem under resource constraints. This course is offered for doctoral students who may find the subject interesting for their thesis work. The topics include Single Machine Sequencing, Parallel Machine Scheduling, Flow Shop Scheduling, Job Shop Scheduling, Project Scheduling. In addition, a new optimization techniques such as Simulated Annealing, Genetic Algorithm, Theory of Constraints will also be covered.

Main Text Book
Principles of Sequencing and Scheduling, K.E.Baker and D. Trietsch, 2009, John Wiley & Sons.
1. Scheduling: Theory, Algorithms, and Systems by M. Pinedo, 3rd Ed.(Springer, 2008)
- Optimization programming using APL and iLOG packages will be required.
- Previous knowledge on optimization techniques like Branch and Bound, Integer Programming, Large Scale Programming, Dynamic Programming.
- The course include individual project(and presentation).
List of Articles
번호 제목
12 Week 14 file
11 Week 13 file
10 Week 12 file
9 Week 11 file
8 Week 10 file
7 Week 6 file
6 Week 5 file
5 Week 4 file
4 Week 3 file
3 Week 2 file
2 Week 1 file
1 전체 파일 압축본 file