An <i>n</i> Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs (Q5548719): Difference between revisions
From MaRDI portal
Created a new Item |
Normalize DOI. |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1287/mnsc.15.1.102 / rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1287/mnsc.15.1.102 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2010484711 / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1287/MNSC.15.1.102 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 17:09, 30 December 2024
scientific article; zbMATH DE number 3262861
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
