Mixed integer programming formulations for two-machine flow shop scheduling with an availability constraint (Q1640598)
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: Mixed integer programming formulations for two-machine flow shop scheduling with an availability constraint |
scientific article; zbMATH DE number 6889126
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Mixed integer programming formulations for two-machine flow shop scheduling with an availability constraint |
scientific article; zbMATH DE number 6889126 |
Statements
Mixed integer programming formulations for two-machine flow shop scheduling with an availability constraint (English)
0 references
14 June 2018
0 references
flow shop
0 references
availability constraint
0 references
makespan
0 references
mixed integer programming
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.93918073
0 references
0.93099415
0 references
0.9225451
0 references
0.9205798
0 references
0 references
0.91713655
0 references
0.91672516
0 references
0.91532826
0 references
