A branch and bound algorithm to minimize the total tardiness for \(m\)-machine permutation flowshop problems (Q858325)
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 branch and bound algorithm to minimize the total tardiness for \(m\)-machine permutation flowshop problems |
scientific article; zbMATH DE number 5082774
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A branch and bound algorithm to minimize the total tardiness for \(m\)-machine permutation flowshop problems |
scientific article; zbMATH DE number 5082774 |
Statements
A branch and bound algorithm to minimize the total tardiness for \(m\)-machine permutation flowshop problems (English)
0 references
9 January 2007
0 references
scheduling
0 references
permutation flowshop
0 references
tardiness
0 references
Branch and Bound
0 references
0 references
