Pages that link to "Item:Q2475856"

The following pages link to An improved NEH heuristic to minimize makespan in permutation flow shops (Q2475856):

Displaying 23 items.

• New hard benchmark for flowshop scheduling problems minimising makespan (Q300036) (← links)
• Makespan minimization flowshop with position dependent job processing times -- computational complexity and solution algorithms (Q336439) (← links)
• On insertion tie-breaking rules in heuristics for the permutation flowshop scheduling problem (Q336966) (← links)
• NEH-based heuristics for the permutation flowshop scheduling problem to minimise total tardiness (Q337554) (← 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)
• Scheduling permutation flowshops with initial availability constraint: Analysis of solutions and constructive heuristics (Q1017464) (← links)
• An empirical analysis of the optimality rate of flow shop heuristics (Q1027589) (← links)
• A new vision of approximate methods for the permutation flowshop to minimise makespan: state-of-the-art and computational evaluation (Q1752855) (← links)
• A hybrid discrete differential evolution algorithm for the no-idle permutation flow shop scheduling problem with makespan criterion (Q1761140) (← links)
• Synergy of genetic algorithm with extensive neighborhood search for the permutation flowshop scheduling problem (Q1992647) (← links)
• Beam search-based heuristics for the mixed no-idle flowshop with total flowtime criterion (Q2099337) (← 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)
• Makespan minimization for the \(m\)-machine ordered flow shop scheduling problem (Q2273694) (← links)
• A best-of-breed iterated greedy for the permutation flowshop scheduling problem with makespan objective (Q2329724) (← 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)
• Assembly flowshop scheduling problem: speed-up procedure and computational evaluation (Q2670518) (← links)
• Minimizing Total Idle Energy Consumption in the Permutation Flow Shop Scheduling Problem (Q4561176) (← links)
• An adaptive dynamic neighborhood crow search algorithm for solving permutation flow shop scheduling problems (Q6065137) (← links)
• Improved NEH-based heuristic for the blocking flow-shop problem with bicriteria of the makespan and machine utilization (Q6094862) (← links)
• Deterministic constructive \(\nu N\)-NEH+ algorithm to solve permutation flow shop scheduling problem with makespan criterion (Q6551067) (← links)