On the open-shop problem with preemption and minimizing the average completion time (Q703917)
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: On the open-shop problem with preemption and minimizing the average completion time |
scientific article; zbMATH DE number 2126923
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the open-shop problem with preemption and minimizing the average completion time |
scientific article; zbMATH DE number 2126923 |
Statements
On the open-shop problem with preemption and minimizing the average completion time (English)
0 references
12 January 2005
0 references
Scheduling
0 references
Heuristics
0 references
Modelling
0 references
0 references
