An O\((n^4)\) algorithm for preemptive scheduling of a single machine to minimize the number of late jobs (Q1306357): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: CLAIRE / rank | |||
Normal rank | |||
Revision as of 23:07, 29 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An O\((n^4)\) algorithm for preemptive scheduling of a single machine to minimize the number of late jobs |
scientific article |
Statements
An O\((n^4)\) algorithm for preemptive scheduling of a single machine to minimize the number of late jobs (English)
0 references
4 March 2001
0 references
single machine scheduling
0 references
preemptive scheduling
0 references
dynamic programming
0 references
