Single machine batch scheduling with two competing agents to minimize total flowtime (Q420859)
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 6037815
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Single machine batch scheduling with two competing agents to minimize total flowtime |
scientific article; zbMATH DE number 6037815 |
Statements
Single machine batch scheduling with two competing agents to minimize total flowtime (English)
0 references
23 May 2012
0 references
two-agent scheduling
0 references
batch scheduling
0 references
single machine
0 references
flowtime
0 references
0 references
0 references
0 references
0.93569547
0 references
0.9350109
0 references
0.9297473
0 references
0.9251298
0 references
0.92270803
0 references
0.9163723
0 references
0.9101876
0 references
0.9095551
0 references
