Preemptive open shop scheduling with multiprocessors: Polynomial cases and applications (Q835582)
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: Preemptive open shop scheduling with multiprocessors: Polynomial cases and applications |
scientific article; zbMATH DE number 5599844
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Preemptive open shop scheduling with multiprocessors: Polynomial cases and applications |
scientific article; zbMATH DE number 5599844 |
Statements
Preemptive open shop scheduling with multiprocessors: Polynomial cases and applications (English)
0 references
28 August 2009
0 references
preemptive open shop scheduling
0 references
multiprocessor operations
0 references
polynomial time algorithms
0 references
0 references
0 references
0 references
0.92718136
0 references
0.9269892
0 references
0.9120373
0 references
0 references
0.9054011
0 references
0.8972502
0 references
0.89471155
0 references
