Sequencing and Scheduling

CSC

86170

Sequencing and Scheduling

Sequencing and scheduling problems are motivated by allocation of limited resources over time. The goal is to find an optimal allocation where optimality is defined by some problem specific objective. Many researchers from the computer science field, study sequencing and scheduling problems with the focus on analyzing the computational complexity of scheduling problems, designing polynomial time algorithms if the problems are in Polynomial (P) or approximation algorithms if the problems are Non-Polynomial (NP)-Hard, and designing efficient exact algorithms or heuristics or meta-heuristics for the problems. Students from computer science department will learn how to apply the knowledge of computational complexity and combinatorial optimization to solve scheduling problems.

Offer as needed

Graduate School Graduate

No