Low-complexity algorithms for sequencing jobs with a fixed number of job-classes (Q2564755): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 06:36, 3 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
