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 the normal view instead:
scientific article; zbMATH DE number 2126923
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.8462632894515991
0 references
0.8449287414550781
0 references
0.8334029316902161
0 references
0.8322392106056213
0 references
0.827147901058197
0 references
