SYS 770 - Sequencing and Scheduling

A comprehensive treatment of scheduling theory and practice. The formal machine-scheduling problem: assumptions, performance measures, job and flow shops, constructive algorithms for special cases, disjunctive and integer programming formulations, branch-and-bound and dynamic programming approaches, computational complexity and heuristics. Includes alternative scheduling paradigms and scheduling philosophies and software tools in modern applications. (IR)

Prerequisites & Notes
Prerequisite: SYS 603, 605, or equivalent.

Credits: 3