Two-Machine Super-Shop Scheduling Problem (Q3978740)
From MaRDI portal
!
WARNING
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 12795
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Two-Machine Super-Shop Scheduling Problem |
scientific article; zbMATH DE number 12795 |
Statements
Two-Machine Super-Shop Scheduling Problem (English)
0 references
25 June 1992
0 references
two-machine super-shop
0 references
flow-shop
0 references
job-shop
0 references
open-shop
0 references
mixed-shop
0 references
polynomial algorithm
0 references
makespan
0 references
0.819086492061615
0 references
0.8058735728263855
0 references
0.8035961389541626
0 references
0.8009648323059082
0 references
