Two-agent scheduling on a bounded series-batch machine to minimize makespan and maximum cost (Q2081468)
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: Two-agent scheduling on a bounded series-batch machine to minimize makespan and maximum cost |
scientific article; zbMATH DE number 7600622
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Two-agent scheduling on a bounded series-batch machine to minimize makespan and maximum cost |
scientific article; zbMATH DE number 7600622 |
Statements
Two-agent scheduling on a bounded series-batch machine to minimize makespan and maximum cost (English)
0 references
13 October 2022
0 references
series-batch
0 references
bounded
0 references
two-agent scheduling
0 references
makespan
0 references
maximum cost
0 references
0 references
0 references
0 references
0 references
0 references
0.95263046
0 references
0.9484354
0 references
0.9308279
0 references
0.92365557
0 references
0.9234542
0 references
0.9205437
0 references
