Two-agent singe-machine scheduling with release times to minimize the total weighted completion time (Q339589)
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 6651740
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Two-agent singe-machine scheduling with release times to minimize the total weighted completion time |
scientific article; zbMATH DE number 6651740 |
Statements
Two-agent singe-machine scheduling with release times to minimize the total weighted completion time (English)
0 references
11 November 2016
0 references
scheduling
0 references
total weighted completion time
0 references
maximum lateness
0 references
two agents
0 references
0 references
0 references
0 references
0 references
0 references
0.8813828825950623
0 references
0.8764716386795044
0 references
0.8650685548782349
0 references
0.8596059083938599
0 references
0.8544384241104126
0 references
