An Algorithm for Solving the Job-Shop Problem (Q3833853)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4110446
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An Algorithm for Solving the Job-Shop Problem |
scientific article; zbMATH DE number 4110446 |
Statements
An Algorithm for Solving the Job-Shop Problem (English)
0 references
1989
0 references
makespan
0 references
disjunctive graph
0 references
branch and bound
0 references
job-shop
0 references
one-machine scheduling
0 references
0.906049370765686
0 references
0.8680298924446106
0 references
0.8645704388618469
0 references
0.8272871375083923
0 references
