Openshop scheduling under linear resources constraints (Q4381875)
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 1132981
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Openshop scheduling under linear resources constraints |
scientific article; zbMATH DE number 1132981 |
Statements
25 March 1998
0 references
resources constraints
0 references
openshop
0 references
polynomial algorithms
0 references
NP-hardness
0 references
Openshop scheduling under linear resources constraints (English)
0 references
0.90412253
0 references
0 references
0.89861834
0 references
0.8923045
0 references
0.88683134
0 references
0.8833157
0 references
0.8813298
0 references
0.88006556
0 references
