Pages that link to "Item:Q1782179"
From MaRDI portal
The following pages link to Fast heuristics for minimizing the makespan in non-permutation flow shops (Q1782179):
Displayed 6 items.
- A combinatorial analysis of the permutation and non-permutation flow shop scheduling problems (Q2029256) (← links)
- Learning to select operators in meta-heuristics: an integration of Q-learning into the iterated greedy algorithm for the permutation flowshop scheduling problem (Q2079447) (← links)
- The reversibility property in a job-insertion tiebreaker for the permutational flow shop scheduling problem (Q2242240) (← links)
- Makespan minimization for the \(m\)-machine ordered flow shop scheduling problem (Q2273694) (← links)
- Generalised accelerations for insertion-based heuristics in permutation flowshop scheduling (Q2286871) (← links)
- A best-of-breed iterated greedy for the permutation flowshop scheduling problem with makespan objective (Q2329724) (← links)