A branch-and-bound algorithm for a two-stage hybrid flowshop scheduling problem minimizing total tardiness (Q4666773): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 18:41, 7 February 2024
scientific article; zbMATH DE number 2153040
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
