On sequencing with earliest starts and due dates with application to computing bounds for the (<i>n/m/G/F</i><sub>max</sub>) problem (Q5671775): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1002/nav.3800200106 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2162658140 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 23:54, 19 March 2024
scientific article; zbMATH DE number 3405668
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On sequencing with earliest starts and due dates with application to computing bounds for the (<i>n/m/G/F</i><sub>max</sub>) problem |
scientific article; zbMATH DE number 3405668 |
Statements
On sequencing with earliest starts and due dates with application to computing bounds for the (<i>n/m/G/F</i><sub>max</sub>) problem (English)
0 references
1973
0 references
