Pages that link to "Item:Q1652233"

The following pages link to An iterated greedy algorithm with optimization of partial solutions for the makespan permutation flowshop problem (Q1652233):

Displaying 29 items.

• A variable iterated greedy algorithm with differential evolution for the no-idle permutation flowshop scheduling problem (Q336357) (← links)
• Automatic design of hybrid stochastic local search algorithms for permutation flowshop problems (Q666941) (← links)
• A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem (Q857345) (← links)
• An iterated local search algorithm for the permutation flowshop problem with total flowtime criterion (Q959513) (← links)
• A multi-objective iterated greedy search for flowshop scheduling with makespan and flowtime criteria (Q991843) (← links)
• Constraint guided accelerated search for mixed blocking permutation flowshop scheduling (Q1628124) (← links)
• Iterated greedy algorithms for the blocking flowshop scheduling problem with makespan criterion (Q1652026) (← links)
• Minimizing the makespan for a two-stage three-machine assembly flow shop problem with the sum-of-processing-time based learning effect (Q1727266) (← links)
• A variable block insertion heuristic for solving permutation flow shop scheduling problem with makespan criterion (Q2004870) (← 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)
• Iterative beam search algorithms for the permutation flowshop (Q2140159) (← links)
• A computationally efficient branch-and-bound algorithm for the permutation flow-shop scheduling problem (Q2178110) (← links)
• The reversibility property in a job-insertion tiebreaker for the permutational flow shop scheduling problem (Q2242240) (← links)
• Metaheuristic algorithms for the hybrid flowshop scheduling problem (Q2273670) (← links)
• Makespan minimization for the \(m\)-machine ordered flow shop scheduling problem (Q2273694) (← links)
• Automatic algorithm design for hybrid flowshop scheduling problems (Q2286868) (← links)
• Generalised accelerations for insertion-based heuristics in permutation flowshop scheduling (Q2286871) (← links)
• A new iterated greedy algorithm for no-idle permutation flowshop scheduling with the total tardiness criterion (Q2297561) (← links)
• A best-of-breed iterated greedy for the permutation flowshop scheduling problem with makespan objective (Q2329724) (← links)
• Accelerating the calculation of makespan used in scheduling improvement heuristics (Q2668662) (← links)
• Metaheuristics with restart and learning mechanisms for the no-idle flowshop scheduling problem with makespan criterion (Q2669719) (← links)
• Using iterated local search for solving the flow‐shop problem: Parallelization, parametrization, and randomization issues (Q4979992) (← links)
• Exactly Solving Hard Permutation Flowshop Scheduling Problems on Peta-Scale GPU-Accelerated Supercomputers (Q5057997) (← links)
• An adaptive dynamic neighborhood crow search algorithm for solving permutation flow shop scheduling problems (Q6065137) (← links)
• A constraint programming-based iterated greedy algorithm for the open shop with sequence-dependent processing times and makespan minimization (Q6068709) (← links)
• Stochastic local search and parameters recommendation: a case study on flowshop problems (Q6079864) (← links)
• Evaluating the impact of grammar complexity in automatic algorithm design (Q6082176) (← links)
• Flowshop with additional resources during setups: mathematical models and a GRASP algorithm (Q6109559) (← links)
• Population-based iterated greedy algorithm for the S-labeling problem (Q6164608) (← links)