A dynamic programming algorithm for preemptive scheduling of a single machine to minimize the number of late jobs (Q922286)
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: Publication:922286 |
scientific article; zbMATH DE number 4167840
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A dynamic programming algorithm for preemptive scheduling of a single machine to minimize the number of late jobs |
scientific article; zbMATH DE number 4167840 |
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
0 references
0.9162135124206544
0 references
0.9131346344947816
0 references
0.8927631974220276
0 references
0.8813296556472778
0 references
