A single-machine bi-criterion scheduling problem with two agents (Q482429)
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 6382673
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A single-machine bi-criterion scheduling problem with two agents |
scientific article; zbMATH DE number 6382673 |
Statements
A single-machine bi-criterion scheduling problem with two agents (English)
0 references
30 December 2014
0 references
scheduling
0 references
total completion time
0 references
maximum tardiness
0 references
two-agent
0 references
single-machine
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8774155378341675
0 references
0.8764716386795044
0 references
0.8687607645988464
0 references
