A dynamic programming algorithm for preemptive scheduling of a single machine to minimize the number of late jobs (Q922286): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 01:37, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A dynamic programming algorithm for preemptive scheduling of a single machine to minimize the number of late jobs |
scientific article |
Statements
A dynamic programming algorithm for preemptive scheduling of a single machine to minimize the number of late jobs (English)
0 references
1990
0 references
polynomial algorithm
0 references
due dates
0 references
single machine
0 references
sum of the weights of the late jobs
0 references
Time and space bounds
0 references
pseudopolynomial time bound
0 references
