Complexity of single machine, multi-criteria scheduling problems (Q1309989)
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: Complexity of single machine, multi-criteria scheduling problems |
scientific article; zbMATH DE number 474829
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity of single machine, multi-criteria scheduling problems |
scientific article; zbMATH DE number 474829 |
Statements
Complexity of single machine, multi-criteria scheduling problems (English)
0 references
20 December 1993
0 references
complexity of scheduling problems
0 references
maximal tardiness
0 references
flowtime
0 references
number of tardy jobs
0 references
tardiness
0 references
0.8636685013771057
0 references
0.8610956072807312
0 references
