Polynomial time algorithms for minimizing the weighted number of late jobs on a single machine with equal processing times (Q1964481): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 16:37, 1 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Polynomial time algorithms for minimizing the weighted number of late jobs on a single machine with equal processing times |
scientific article |
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
