An <i>n</i> Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs (Q5548719)
From MaRDI portal
!
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 3262861
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An <i>n</i> Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs |
scientific article; zbMATH DE number 3262861 |
Statements
An <i>n</i> Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs (English)
0 references
1968
0 references
operations research
0 references
