Minimizing makespan in permutation flow shop scheduling problems using a hybrid metaheuristic algorithm (Q958458): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 18:47, 30 January 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
