A new branch and bound algorithm for minimizing mean tardiness in two- machine flowshops (Q1260741)
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: A new branch and bound algorithm for minimizing mean tardiness in two- machine flowshops |
scientific article; zbMATH DE number 370623
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A new branch and bound algorithm for minimizing mean tardiness in two- machine flowshops |
scientific article; zbMATH DE number 370623 |
Statements
A new branch and bound algorithm for minimizing mean tardiness in two- machine flowshops (English)
0 references
25 August 1993
0 references
two-machine flowshop scheduling
0 references
lower bounds
0 references
branch and bound
0 references
0 references
0.9176110625267028
0 references
0.9014784097671508
0 references
0.8916587829589844
0 references
0.8878846764564514
0 references
0.8864087462425232
0 references
