Pages that link to "Item:Q342177"
From MaRDI portal
The following pages link to Two simple and effective heuristics for minimizing the makespan in non-permutation flow shops (Q342177):
Displaying 5 items.
- Non-permutation flowshop scheduling problem with minimal and maximal time lags: theoretical study and heuristic (Q1615940) (← links)
- Fast heuristics for minimizing the makespan in non-permutation flow shops (Q1782179) (← links)
- A combinatorial analysis of the permutation and non-permutation flow shop scheduling problems (Q2029256) (← links)
- Generalised accelerations for insertion-based heuristics in permutation flowshop scheduling (Q2286871) (← links)
- Solving non-permutation flow-shop scheduling problem via a novel deep reinforcement learning approach (Q6109307) (← links)
