Note—Sequencing <i>n</i> Jobs on <i>m</i> Machines to Minimise Maximum Tardiness: A Branch-and-Bound Solution (Q4145413): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| 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.23.9.1016 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2170525601 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Revision as of 23:56, 19 March 2024
scientific article; zbMATH DE number 3573583
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Note—Sequencing <i>n</i> Jobs on <i>m</i> Machines to Minimise Maximum Tardiness: A Branch-and-Bound Solution |
scientific article; zbMATH DE number 3573583 |
Statements
Note—Sequencing <i>n</i> Jobs on <i>m</i> Machines to Minimise Maximum Tardiness: A Branch-and-Bound Solution (English)
0 references
1977
0 references
