Primary-secondary bicriteria scheduling on identical machines to minimize the total completion time of all jobs and the maximum T-time of all machines (Q391787)
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 6244498
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Primary-secondary bicriteria scheduling on identical machines to minimize the total completion time of all jobs and the maximum T-time of all machines |
scientific article; zbMATH DE number 6244498 |
Statements
Primary-secondary bicriteria scheduling on identical machines to minimize the total completion time of all jobs and the maximum T-time of all machines (English)
0 references
13 January 2014
0 references
bicriteria scheduling
0 references
identical machines
0 references
total completion time
0 references
worst-case ratio
0 references
0 references
0.8518701791763306
0 references
0.8189507126808167
0 references
0.8173722624778748
0 references
0.8142164349555969
0 references
0.8062834739685059
0 references
