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
ReferenceBot (talk | contribs) Changed an Item |
Created claim: Wikidata QID (P12): Q127960074, #quickstatements; #temporary_batch_1722203565125 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q127960074 / rank | |||
Normal rank | |||
Latest revision as of 23:53, 28 July 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
0 references
0 references
