Low-complexity algorithms for sequencing jobs with a fixed number of job-classes (Q2564755): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claim: author (P16): Item:Q237883 |
||
| Property / author | |||
| Property / author: Q185359 / rank | |||
Revision as of 11:21, 11 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Low-complexity algorithms for sequencing jobs with a fixed number of job-classes |
scientific article |
Statements
Low-complexity algorithms for sequencing jobs with a fixed number of job-classes (English)
0 references
15 January 1997
0 references
makespan
0 references
parallel machines
0 references
identical processing times
0 references
