Skip to main content
grasp.study
About
Explore
Pricing
Log in
Try it for free
Back to course
👋
Welcome to a Grasp lesson
Create a free account
to keep studying and create your own study path.
Flow shop scheduling.
·
Module 4
Flow Shop: Complexity and Heuristics
1
The NP-Hardness of F3||Cmax
Explain why the three-machine flow shop problem (F3||Cmax) is NP-hard.
2
NEH Heuristic for Flow Shop Scheduling
Apply the NEH heuristic to construct high-quality flow shop schedules.
3
Flow Shop Scheduling: Implementing Swap-Based Local Search
Implement a swap-based local search procedure for flow shop schedule improvement.
4
Permutation Flow Shop MILP Model
Formulate the permutation flow shop problem as a MILP model.
5
Constructive vs. Improvement Heuristics for Flow Shop Scheduling
Compare constructive vs. improvement heuristics for flow shop scheduling.
Previous module
Flow Shop Scheduling Fundamentals
Next module
Hybrid and Job Shop Environments