Two-machine open shop problem with controllable processing times (Q2467128)
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 5228530
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Two-machine open shop problem with controllable processing times |
scientific article; zbMATH DE number 5228530 |
Statements
Two-machine open shop problem with controllable processing times (English)
0 references
18 January 2008
0 references
open shop scheduling
0 references
controllable processing times
0 references
Knapsack problem
0 references
resource allocation problem
0 references
0 references
0 references
0 references
0 references
0 references
0.8694748282432556
0 references
0.8482102155685425
0 references
0.8466961979866028
0 references
0.8444837331771851
0 references
