Minimizing makespan in permutation flow shop scheduling problems using a hybrid metaheuristic algorithm (Q958458): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.cor.2008.01.007 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.COR.2008.01.007 / rank | |||
Normal rank | |||
Latest revision as of 10:03, 10 December 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
