Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity (Q1399579)
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: Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity |
scientific article; zbMATH DE number 1957043
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity |
scientific article; zbMATH DE number 1957043 |
Statements
Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity (English)
0 references
30 July 2003
0 references
parallel machines
0 references
shop
0 references
unit processing time
0 references
scheduling
0 references
complexity
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.90451866
0 references
0.90103614
0 references
0.8974861
0 references
0.8939662
0 references
0.8906186
0 references
0.8872601
0 references
0.8856815
0 references
0.8849051
0 references
