Pages that link to "Item:Q2286871"
From MaRDI portal
The following pages link to Generalised accelerations for insertion-based heuristics in permutation flowshop scheduling (Q2286871):
Displaying 12 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)
- New idle time-based tie-breaking rules in heuristics for the permutation flowshop scheduling problems (Q2668784) (← links)
- Minimizing the total tardiness and the total carbon emissions in the permutation flow shop scheduling problem (Q2669708) (← links)
- Assembly flowshop scheduling problem: speed-up procedure and computational evaluation (Q2670518) (← links)
- An effective new heuristic algorithm for solving permutation flow shop scheduling problem (Q5103873) (← links)
- Shop scheduling in manufacturing environments: a review (Q6060656) (← links)
- An adaptive dynamic neighborhood crow search algorithm for solving permutation flow shop scheduling problems (Q6065137) (← links)
- A review and classification on distributed permutation flowshop scheduling problems (Q6069211) (← links)
- Intelligent optimization under the makespan constraint: rapid evaluation mechanisms based on the critical machine for the distributed flowshop group scheduling problem (Q6096611) (← links)
- Flowshop with additional resources during setups: mathematical models and a GRASP algorithm (Q6109559) (← links)
- The seeds of the NEH algorithm: an overview using bibliometric analysis (Q6200788) (← links)