Single machine scheduling with controllable processing times and compression costs. II: Proof and theorems (Q1288217): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Single machine scheduling with controllable processing times and compression costs. I: Equal times and costs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Choosing the Job Sequence and Processing Times to Minimize Total Processing Plus Flow Cost on a Single Machine / rank | |||
Normal rank | |||
Revision as of 19:02, 28 May 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
