Minimizing the range of order completion times with multiple job classes (Q4900956)
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 6129426
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimizing the range of order completion times with multiple job classes |
scientific article; zbMATH DE number 6129426 |
Statements
24 January 2013
0 references
scheduling problem
0 references
order problem
0 references
branch and bound algorithm
0 references
0.8663759827613831
0 references
0.8272644281387329
0 references
0.8194171786308289
0 references
0.8176336288452148
0 references
0.8148998618125916
0 references
