Preemptive Scheduling of Two Uniform Machines to Minimize the Number of Late Jobs (Q3826352): 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.1287/opre.37.2.314 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2022498940 / rank | |||
Normal rank | |||
Revision as of 18:55, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Preemptive Scheduling of Two Uniform Machines to Minimize the Number of Late Jobs |
scientific article |
Statements
Preemptive Scheduling of Two Uniform Machines to Minimize the Number of Late Jobs (English)
0 references
1989
0 references
preemptive scheduling
0 references
parallel machines
0 references
NP-hard
0 references
fixed set of uniform machines
0 references
polynomial time
0 references
