This repository contains an implementation of the Branch and Bound algorithm to solve the Flow Shop Scheduling Problem (FSP). The Flow Shop Scheduling Problem is a classic optimization problem in operations research, where the goal is to determine the optimal sequence of jobs on multiple machines to minimize the total completion time (makespan).
-
Notifications
You must be signed in to change notification settings - Fork 0
This repository contains an implementation of the Branch and Bound algorithm to solve the Flow Shop Scheduling Problem (FSP). The Flow Shop Scheduling Problem is a classic optimization problem in operations research, where the goal is to determine the optimal sequence of jobs on multiple machines to minimize the total completion time (makespan).
Fadouaslm/Branch-and-Bound-FSP
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
This repository contains an implementation of the Branch and Bound algorithm to solve the Flow Shop Scheduling Problem (FSP). The Flow Shop Scheduling Problem is a classic optimization problem in operations research, where the goal is to determine the optimal sequence of jobs on multiple machines to minimize the total completion time (makespan).
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published