ISE 6710 - Scheduling and Sequencing

Defining scheduling function, performance measures and terminology. Topics include scheduling algorithms for single machine, parallel machine, flow shop, job shop, cellular manufacturing systems, flexible manufacturing systems and also solution methodologies such as heuristic procedures, constructive algorithms, branch and bound approaches, dynamic programming, linear programming, integer programming, mixed integer programming, genetic algorithms, tabu search simulated annealing and fuzzy math modeling. Focusing on manufacturing scheduling in practice with relations to capacity, multiple resource requirements and material availability. Also discussing hierarchical scheduling approaches needed to solve nested scheduling problems using case studies.

Requisites

Credit Hours: 3.0
Repeat/Retake Information: May not be retaken.

Lecture/Lab Hours: 3.0 lecture

Eligible grades: A-F,WP,WF,FN,FS,AU,I