Polynomial time algorithms for minimizing the weighted number of late jobs on a single machine with equal processing times (Q1964481)
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: Polynomial time algorithms for minimizing the weighted number of late jobs on a single machine with equal processing times |
scientific article; zbMATH DE number 1402220
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Polynomial time algorithms for minimizing the weighted number of late jobs on a single machine with equal processing times |
scientific article; zbMATH DE number 1402220 |
Statements
Polynomial time algorithms for minimizing the weighted number of late jobs on a single machine with equal processing times (English)
0 references
6 November 2001
0 references
single-machine scheduling
0 references
preemptive scheduling
0 references
late jobs
0 references
dynamic programming
0 references
0 references
0 references
0.8972094058990479
0 references
0.883431613445282
0 references
0.8603537082672119
0 references
0.8483161330223083
0 references
0.8453048467636108
0 references
