A branch-and-bound algorithm for the three-machine flowshop scheduling problem with bicriteria of makespan andtotal flowtime (Q3158872): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1111/j.1475-3995.2004.00461.x / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2008570019 / rank | |||
Normal rank | |||
Revision as of 19:53, 19 March 2024
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
