On the <i>N</i>-Job One-Machine, Sequence-Independent Scheduling Problem with Tardiness Penalties: A Branch-Bound Solution (Q5639517): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 04:12, 7 March 2024
scientific article; zbMATH DE number 3366697
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the <i>N</i>-Job One-Machine, Sequence-Independent Scheduling Problem with Tardiness Penalties: A Branch-Bound Solution |
scientific article; zbMATH DE number 3366697 |
Statements
On the <i>N</i>-Job One-Machine, Sequence-Independent Scheduling Problem with Tardiness Penalties: A Branch-Bound Solution (English)
0 references
1972
0 references
