Bilevel programming applied to the flow shop scheduling problem (Q1915962)
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: Bilevel programming applied to the flow shop scheduling problem |
scientific article; zbMATH DE number 895068
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Bilevel programming applied to the flow shop scheduling problem |
scientific article; zbMATH DE number 895068 |
Statements
Bilevel programming applied to the flow shop scheduling problem (English)
0 references
1 July 1996
0 references
two level branch and bound
0 references
flow-shop scheduling
0 references
bilevel programming
0 references
total flowtime
0 references
makespan
0 references
0 references
0.9475896
0 references
0.9076399
0 references
0.89930856
0 references
0.89788055
0 references
0.8844191
0 references
0.88359857
0 references
0.8771095
0 references
0.8754967
0 references
