A Branch-and-Bound Approach for a Two-machine Flowshop Scheduling Problem (Q4849290)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 800657
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A Branch-and-Bound Approach for a Two-machine Flowshop Scheduling Problem |
scientific article; zbMATH DE number 800657 |
Statements
A Branch-and-Bound Approach for a Two-machine Flowshop Scheduling Problem (English)
0 references
25 September 1995
0 references
computational analysis
0 references
branch-and-bound
0 references
two-machine flow shop scheduling
0 references
simulated annealing
0 references
tabu search
0 references
genetic algorithms
0 references
0.8954125642776489
0 references
0.8784248232841492
0 references
0.8736283183097839
0 references
0.8707984685897827
0 references
