A simple proof of the Moore-Hodgson algorithm for minimizing the number of late jobs (Q2670439)
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: A simple proof of the Moore-Hodgson algorithm for minimizing the number of late jobs |
scientific article; zbMATH DE number 7487740
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A simple proof of the Moore-Hodgson algorithm for minimizing the number of late jobs |
scientific article; zbMATH DE number 7487740 |
Statements
A simple proof of the Moore-Hodgson algorithm for minimizing the number of late jobs (English)
0 references
11 March 2022
0 references
scheduling theory
0 references
Moore-Hodgson algorithm
0 references
number of late jobs
0 references
0 references
