Two simple and effective heuristics for minimizing the makespan in non-permutation flow shops (Q342177): Difference between revisions
From MaRDI portal
Changed an Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 03:39, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Two simple and effective heuristics for minimizing the makespan in non-permutation flow shops |
scientific article |
Statements
Two simple and effective heuristics for minimizing the makespan in non-permutation flow shops (English)
0 references
17 November 2016
0 references
scheduling
0 references
metaheuristics
0 references
flow shop
0 references
non-permutation schedules
0 references
