Two-agent scheduling problem about total late work on a single machine (Q5371809)
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 6796428
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Two-agent scheduling problem about total late work on a single machine |
scientific article; zbMATH DE number 6796428 |
Statements
20 October 2017
0 references
scheduling
0 references
two-agent
0 references
total late work
0 references
polynomial programming algorithm
0 references
0.940687358379364
0 references
0.927144467830658
0 references
0.8967700004577637
0 references
0.8966664671897888
0 references
0.8791537880897522
0 references
