An O\((n^4)\) algorithm for preemptive scheduling of a single machine to minimize the number of late jobs (Q1306357)
From MaRDI portal
!
WARNING
This is the item page for this Wikibase entity, intended for internal use and editing purposes.
Please use the normal view instead:
scientific article; zbMATH DE number 1347057
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An O\((n^4)\) algorithm for preemptive scheduling of a single machine to minimize the number of late jobs |
scientific article; zbMATH DE number 1347057 |
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
0.9162135124206544
0 references
0.8918821811676025
0 references
0.8476110696792603
0 references
0.8353460431098938
0 references
0.8341107964515686
0 references
