Improved algorithms for two-agent scheduling on an unbounded serial-batching machine (Q2234745)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Improved algorithms for two-agent scheduling on an unbounded serial-batching machine |
scientific article; zbMATH DE number 7411463
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Improved algorithms for two-agent scheduling on an unbounded serial-batching machine |
scientific article; zbMATH DE number 7411463 |
Statements
Improved algorithms for two-agent scheduling on an unbounded serial-batching machine (English)
0 references
19 October 2021
0 references
serial-batching machine
0 references
agent scheduling
0 references
maximum lateness
0 references
total completion time
0 references
makespan
0 references
0 references
0 references
0 references
0 references
0 references
0.8968889713287354
0 references
0.8943852186203003
0 references
0.8838475346565247
0 references
