A note on Pareto minimizing total completion time and maximum cost (Q1785326)
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 6945335
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A note on Pareto minimizing total completion time and maximum cost |
scientific article; zbMATH DE number 6945335 |
Statements
A note on Pareto minimizing total completion time and maximum cost (English)
0 references
28 September 2018
0 references
scheduling
0 references
Pareto optimization
0 references
maximum cost
0 references
complexity analysis
0 references
0 references
0 references
0.8560356497764587
0 references
0.8173584938049316
0 references
0.8139659762382507
0 references
0.7929618954658508
0 references
