A branch-and-bound algorithm for a two-stage hybrid flowshop scheduling problem minimizing total tardiness (Q4666773)
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 for a two-stage hybrid flowshop scheduling problem minimizing total tardiness |
scientific article; zbMATH DE number 2153040
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A branch-and-bound algorithm for a two-stage hybrid flowshop scheduling problem minimizing total tardiness |
scientific article; zbMATH DE number 2153040 |
Statements
A branch-and-bound algorithm for a two-stage hybrid flowshop scheduling problem minimizing total tardiness (English)
0 references
5 April 2005
0 references
flowshop-scheduling problem
0 references
branch-and-bound algorithm
0 references
0 references
0 references
0.9032897353172302
0 references
0.8919176459312439
0 references
0.891726553440094
0 references
0.8916587829589844
0 references
0.8890864849090576
0 references
