Pages that link to "Item:Q2664430"
From MaRDI portal
The following pages link to Iterated greedy algorithms enhanced by hyper-heuristic based learning for hybrid flexible flowshop scheduling problem with sequence dependent setup times: a case study at a manufacturing plant (Q2664430):
Displaying 10 items.
- A genetic algorithm for a two-machine flowshop with a limited waiting time constraint and sequence-dependent setup times (Q2217032) (← links)
- Accelerating the calculation of makespan used in scheduling improvement heuristics (Q2668662) (← links)
- Selection hyper-heuristics for the multi and many-objective quadratic assignment problem (Q2676362) (← links)
- Unrelated Parallel Machine Scheduling with Job Splitting, Setup Time, Learning Effect, Processing Cost and Machine Eligibility (Q6053524) (← links)
- Stochastic local search and parameters recommendation: a case study on flowshop problems (Q6079864) (← links)
- Intelligent optimization under the makespan constraint: rapid evaluation mechanisms based on the critical machine for the distributed flowshop group scheduling problem (Q6096611) (← links)
- Meta-Lamarckian-based iterated greedy for optimizing distributed two-stage assembly flowshops with mixed setups (Q6099438) (← links)
- A systematic review of multi-objective hybrid flow shop scheduling (Q6112731) (← links)
- An asymmetric traveling salesman problem based matheuristic algorithm for flowshop group scheduling problem (Q6113360) (← links)
- Population-based iterated greedy algorithm for the S-labeling problem (Q6164608) (← links)