Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity (Q1399579)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity |
scientific article |
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
