Two-agent scheduling to minimize makespan and total completion time on a serial-batching machine (Q5142948)
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 7295047
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Two-agent scheduling to minimize makespan and total completion time on a serial-batching machine |
scientific article; zbMATH DE number 7295047 |
Statements
14 January 2021
0 references
two-agent scheduling
0 references
serial-batching
0 references
computational complexity
0 references
makespan
0 references
total completion time
0 references
0.9137958288192748
0 references
0.9034997820854188
0 references
0.8988013863563538
0 references
0.8838475346565247
0 references
0.8799237012863159
0 references
