INEG 68403 — Scheduling Theory and Algorithms
The course will cover the theory and solution methods for scheduling several tasks over time. Topics include terminology, measures of performance, single machine sequencing, flow shop scheduling, the job shop problem, and priority dispatching. Side constraints within scheduling, such as precedence, release dates, and due dates are addressed. Integer programming, dynamic programming, and heuristic approaches to various problems are also presented. Prerequisite: INEG 56103 or equivalent, computer programming proficiency, and exposure to proofs. (Typically offered: Irregular)
Prerequisites: INEG 56103