Scheduling problems with rejection to minimize the maximum flow time (Q1691942)
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: Scheduling problems with rejection to minimize the maximum flow time |
scientific article; zbMATH DE number 6829738
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Scheduling problems with rejection to minimize the maximum flow time |
scientific article; zbMATH DE number 6829738 |
Statements
Scheduling problems with rejection to minimize the maximum flow time (English)
0 references
25 January 2018
0 references
approximation algorithm
0 references
NP-hard
0 references
rejection penalty
0 references
scheduling
0 references
0 references
0.9255614
0 references
0.9133108
0 references
0.8999597
0 references
0.8954376
0 references
0.8945385
0 references
