A branch-and-bound algorithm for the three-machine flowshop scheduling problem with bicriteria of makespan andtotal flowtime (Q3158872)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A branch-and-bound algorithm for the three-machine flowshop scheduling problem with bicriteria of makespan andtotal flowtime |
scientific article |
Statements
A branch-and-bound algorithm for the three-machine flowshop scheduling problem with bicriteria of makespan andtotal flowtime (English)
0 references
31 January 2005
0 references
flowshop
0 references
bicriteria
0 references
makespan
0 references
flowtime
0 references
heuristics
0 references
dominance relation
0 references
0 references
0 references
0 references
