Pages that link to "Item:Q925842"

The following pages link to An improved NEH-based heuristic for the permutation flowshop problem (Q925842):

Displaying 27 items.

• New hard benchmark for flowshop scheduling problems minimising makespan (Q300036) (← 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)
• New simple constructive heuristic algorithms for minimizing total flow-time in the permutation flowshop scheduling problem (Q342481) (← links)
• An iterated local search algorithm for the permutation flowshop problem with total flowtime criterion (Q959513) (← links)
• An empirical analysis of the optimality rate of flow shop heuristics (Q1027589) (← links)
• The distributed permutation flowshop scheduling problem (Q1040975) (← links)
• A beam-search-based constructive heuristic for the PFSP to minimise total flowtime (Q1652234) (← links)
• Enhanced migrating birds optimization algorithm for the permutation flow shop problem with sequence dependent setup times (Q1694317) (← 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)
• 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)
• New efficient heuristics for scheduling open shops with makespan minimization (Q2147004) (← 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)
• 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) (← 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)
• An adaptive dynamic neighborhood crow search algorithm for solving permutation flow shop scheduling problems (Q6065137) (← links)
• Automatic design of constructive heuristics for a reconfigurable distributed flowshop group scheduling problem (Q6065623) (← links)
• Improved NEH-based heuristic for the blocking flow-shop problem with bicriteria of the makespan and machine utilization (Q6094862) (← links)