Pages that link to "Item:Q336966"

The following pages link to On insertion tie-breaking rules in heuristics for the permutation flowshop scheduling problem (Q336966):

Displaying 30 items.

• NEH-based heuristics for the permutation flowshop scheduling problem to minimise total tardiness (Q337554) (← links)
• Efficient non-population-based algorithms for the permutation flowshop scheduling problem with makespan minimisation subject to a maximum tardiness (Q342073) (← links)
• A generalized constructive algorithm using insertion-based heuristics (Q342160) (← links)
• Two simple and effective heuristics for minimizing the makespan in non-permutation flow shops (Q342177) (← links)
• New simple constructive heuristic algorithms for minimizing total flow-time in the permutation flowshop scheduling problem (Q342481) (← links)
• Efficient constructive and composite heuristics for the permutation flowshop to minimise total earliness and tardiness (Q342504) (← links)
• Automatic design of hybrid stochastic local search algorithms for permutation flowshop problems (Q666941) (← links)
• Reduction of permutation flowshop problems to single machine problems using machine dominance relations (Q1652025) (← links)
• An iterated greedy algorithm with optimization of partial solutions for the makespan permutation flowshop problem (Q1652233) (← links)
• A beam-search-based constructive heuristic for the PFSP to minimise total flowtime (Q1652234) (← links)
• A new vision of approximate methods for the permutation flowshop to minimise makespan: state-of-the-art and computational evaluation (Q1752855) (← links)
• Fast heuristics for minimizing the makespan in non-permutation flow shops (Q1782179) (← links)
• Synergy of genetic algorithm with extensive neighborhood search for the permutation flowshop scheduling problem (Q1992647) (← 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)
• Beam search-based heuristics for the mixed no-idle flowshop with total flowtime criterion (Q2099337) (← links)
• The reversibility property in a job-insertion tiebreaker for the permutational flow shop scheduling problem (Q2242240) (← links)
• Makespan minimization for the \(m\)-machine ordered flow shop scheduling problem (Q2273694) (← links)
• Generalised accelerations for insertion-based heuristics in permutation flowshop scheduling (Q2286871) (← links)
• A best-of-breed iterated greedy for the permutation flowshop scheduling problem with makespan objective (Q2329724) (← links)
• Relationship between common objective functions, idle time and waiting time in permutation flow shop scheduling (Q2664303) (← links)
• Dominance conditions determination based on machine idle times for the permutation flowshop scheduling problem (Q2664317) (← links)
• \(N\)-NEH+ algorithm for solving permutation flow shop problems (Q2668738) (← links)
• New idle time-based tie-breaking rules in heuristics for the permutation flowshop scheduling problems (Q2668784) (← links)
• An adaptive dynamic neighborhood crow search algorithm for solving permutation flow shop scheduling problems (Q6065137) (← links)
• Evaluating the impact of grammar complexity in automatic algorithm design (Q6082176) (← links)
• Improved NEH-based heuristic for the blocking flow-shop problem with bicriteria of the makespan and machine utilization (Q6094862) (← links)
• An asymmetric traveling salesman problem based matheuristic algorithm for flowshop group scheduling problem (Q6113360) (← links)
• The seeds of the NEH algorithm: an overview using bibliometric analysis (Q6200788) (← links)
• Deterministic constructive \(\nu N\)-NEH+ algorithm to solve permutation flow shop scheduling problem with makespan criterion (Q6551067) (← links)