Single machine scheduling with controllable processing times and compression costs. II: Proof and theorems (Q1288217): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 10:39, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Single machine scheduling with controllable processing times and compression costs. II: Proof and theorems |
scientific article |
Statements
Single machine scheduling with controllable processing times and compression costs. II: Proof and theorems (English)
0 references
18 May 2000
0 references
single machine scheduling
0 references
