A Branch-and-Bound Approach for a Two-machine Flowshop Scheduling Problem (Q4849290): 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.1057/jors.1995.102 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2011813554 / rank | |||
Normal rank | |||
Latest revision as of 21:52, 19 March 2024
scientific article; zbMATH DE number 800657
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
