| |
Dec 15, 2025
|
|
|
|
|
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
Repeat/Retake Information: May not be retaken.
Lecture/Lab Hours: 3.0 lecture
Grades: Eligible Grades: A-F,WP,WF,WN,FN,AU,I
Learning Outcomes:
- Apply existing scheduling procedures (single machine, parallel machine, flow shop, job shop, cellular manufacturing, and flexible manufacturing systems).
- Apply scheduling procedures in service industry domain.
- Classify scheduling problems considering shops, job arrival patterns, certainty of parameters.
- Modify existing procedures/models to solve different versions of scheduling problems.
- Understand the importance of scheduling function.
- Understand basic scheduling terminology.
- Understand the interrelations between capacity, resources, and scheduling.
- Use different solution methodogies to solve scheduling problems such as heuristics, mathematical models, constructive algorithms, genetic algorithms, etc.
Add to Portfolio (opens a new window)
|
|
