Pages that link to "Item:Q2329724"
From MaRDI portal
The following pages link to A best-of-breed iterated greedy for the permutation flowshop scheduling problem with makespan objective (Q2329724):
Displaying 8 items.
- 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)
- Iterative beam search algorithms for the permutation flowshop (Q2140159) (← links)
- The reversibility property in a job-insertion tiebreaker for the permutational flow shop scheduling problem (Q2242240) (← links)
- Dominance conditions determination based on machine idle times for the permutation flowshop scheduling problem (Q2664317) (← links)
- New idle time-based tie-breaking rules in heuristics for the permutation flowshop scheduling problems (Q2668784) (← links)
- Solving non-permutation flow-shop scheduling problem via a novel deep reinforcement learning approach (Q6109307) (← links)
- Flowshop with additional resources during setups: mathematical models and a GRASP algorithm (Q6109559) (← links)
- An asymmetric traveling salesman problem based matheuristic algorithm for flowshop group scheduling problem (Q6113360) (← links)
