Parallel-machine scheduling with maintenance: praising the assignment problem (Q322837)
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: Parallel-machine scheduling with maintenance: praising the assignment problem |
scientific article; zbMATH DE number 6636200
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Parallel-machine scheduling with maintenance: praising the assignment problem |
scientific article; zbMATH DE number 6636200 |
Statements
Parallel-machine scheduling with maintenance: praising the assignment problem (English)
0 references
7 October 2016
0 references
parallel machines
0 references
position-dependent processing
0 references
time-dependent maintenance
0 references
assignment problem
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8273847103118896
0 references
0.808871865272522
0 references
0.804826557636261
0 references
0.7982624173164368
0 references
0.794504702091217
0 references
