Minimizing makespan in permutation flow shop scheduling problems using a hybrid metaheuristic algorithm (Q958458): Difference between revisions
From MaRDI portal
Revision as of 21:02, 28 June 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
0 references
0 references
0 references
0 references
0 references