Minimizing makespan in permutation flow shop scheduling problems using a hybrid metaheuristic algorithm (Q958458): 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.1016/j.cor.2008.01.007 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2038757212 / rank | |||
Normal rank | |||
Revision as of 21:04, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Minimizing makespan in permutation flow shop scheduling problems using a hybrid metaheuristic algorithm |
scientific article |
Statements
Minimizing makespan in permutation flow shop scheduling problems using a hybrid metaheuristic algorithm (English)
0 references
4 December 2008
0 references
production scheduling
0 references
permutation flow shop
0 references
variable neighbourhood search
0 references
