Scheduling problems with rejection to minimize the maximum flow time (Q1691942): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s11424-016-4187-4 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2298323795 / rank | |||
Normal rank | |||
Revision as of 14:29, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Scheduling problems with rejection to minimize the maximum flow time |
scientific article |
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
