Implements a Dantzig-Wolfe Decomposition to solve a generic #m machines #n jobs Flow Shop scheduling problem. Pricing problems are defined per machine. Patterns either store the start and completion times for the jobs (branch offsetVariables) or the precendence information (integerPatterns). The master problem is initialized with arbitrary, sub-optimal patterns. The price-and-branch method only generates new patterns at the root node.
-
Notifications
You must be signed in to change notification settings - Fork 0
RoderickWR/PriceAndBranch
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
No description, website, or topics provided.
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published