Makespan minimization for the \(m\)-machine ordered flow shop scheduling problem (Q2273694): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: CPLEX / rank | |||
Normal rank | |||
Revision as of 04:52, 29 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Makespan minimization for the \(m\)-machine ordered flow shop scheduling problem |
scientific article |
Statements
Makespan minimization for the \(m\)-machine ordered flow shop scheduling problem (English)
0 references
25 September 2019
0 references
ordered flow shop scheduling
0 references
pyramidal-shaped property
0 references
V-shaped property
0 references
makespan minimization
0 references
iterated local search
0 references
heuristics
0 references
