An improved algorithm on unbounded parallel-batching scheduling to minimize maximum cost and makespan (Q6041237)
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: An improved algorithm on unbounded parallel-batching scheduling to minimize maximum cost and makespan |
scientific article; zbMATH DE number 7689344
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An improved algorithm on unbounded parallel-batching scheduling to minimize maximum cost and makespan |
scientific article; zbMATH DE number 7689344 |
Statements
An improved algorithm on unbounded parallel-batching scheduling to minimize maximum cost and makespan (English)
0 references
26 May 2023
0 references
bicriteria scheduling
0 references
parallel-batching
0 references
maximum cost
0 references
makespan
0 references
Pareto optimal solutions
0 references
0.9112173318862916
0 references
0.8983255624771118
0 references
0.8725129961967468
0 references
0.8709453344345093
0 references
0.8554893732070923
0 references
