An exact algorithm for the batch sequencing problem in a two-machine flow shop with limited buffer (Q4390594)
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: An exact algorithm for the batch sequencing problem in a two-machine flow shop with limited buffer |
scientific article; zbMATH DE number 1156570
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An exact algorithm for the batch sequencing problem in a two-machine flow shop with limited buffer |
scientific article; zbMATH DE number 1156570 |
Statements
26 May 1998
0 references
makespan minimization
0 references
flow shop
0 references
two machines
0 references
exact branch-and-bound
0 references
An exact algorithm for the batch sequencing problem in a two-machine flow shop with limited buffer (English)
0 references
0.9354372
0 references
0.9029362
0 references
0.9001258
0 references
0.8889211
0 references
0.8874707
0 references
0.88651884
0 references
0.8811844
0 references
