The inverse parallel machine scheduling problem with minimum total completion time (Q380601)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The inverse parallel machine scheduling problem with minimum total completion time |
scientific article; zbMATH DE number 6226930
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The inverse parallel machine scheduling problem with minimum total completion time |
scientific article; zbMATH DE number 6226930 |
Statements
The inverse parallel machine scheduling problem with minimum total completion time (English)
0 references
14 November 2013
0 references
scheduling
0 references
inverse
0 references
processing times
0 references
parallel machine
0 references
0 references
