The dominance digraph as a solution to the two-machine flow-shop problem with interval processing times (Q3111147): Difference between revisions
From MaRDI portal
Created a new Item |
Created claim: Wikidata QID (P12): Q57633868, #quickstatements; #temporary_batch_1705872010755 |
||
Property / Wikidata QID | |||
Property / Wikidata QID: Q57633868 / rank | |||
Normal rank |
Revision as of 23:30, 21 January 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The dominance digraph as a solution to the two-machine flow-shop problem with interval processing times |
scientific article |
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