Solving the job-shop scheduling problem optimally by dynamic programming (Q339631)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Solving the job-shop scheduling problem optimally by dynamic programming |
scientific article; zbMATH DE number 6651761
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Solving the job-shop scheduling problem optimally by dynamic programming |
scientific article; zbMATH DE number 6651761 |
Statements
Solving the job-shop scheduling problem optimally by dynamic programming (English)
0 references
11 November 2016
0 references
job-shop scheduling
0 references
dynamic programming
0 references
complexity analysis
0 references
0 references
0.8231812715530396
0 references
0.819887101650238
0 references
0.8124645352363586
0 references
0.808599054813385
0 references
0.7978343367576599
0 references
