The dominance digraph as a solution to the two-machine flow-shop problem with interval processing times (Q3111147)
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: The dominance digraph as a solution to the two-machine flow-shop problem with interval processing times |
scientific article; zbMATH DE number 5998499
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The dominance digraph as a solution to the two-machine flow-shop problem with interval processing times |
scientific article; zbMATH DE number 5998499 |
Statements
The dominance digraph as a solution to the two-machine flow-shop problem with interval processing times (English)
0 references
18 January 2012
0 references
scheduling
0 references
makespan
0 references
uncertainty
0 references
dominance relation
0 references
0 references
0 references
0 references
0 references
0.8140518665313721
0 references
0.758306086063385
0 references
0.7581877112388611
0 references
0.7581667304039001
0 references
