Pages that link to "Item:Q339553"

The following pages link to A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime (Q339553):

Displaying 26 items.

• New hard benchmark for flowshop scheduling problems minimising makespan (Q300036) (← links)
• A new set of high-performing heuristics to minimise flowtime in permutation flowshops (Q337260) (← links)
• Variability of completion time differences in permutation flow shop scheduling (Q337356) (← links)
• Permutation flowshop problems with bi-criterion makespan and total completion time objective and position-weighted learning effects (Q337503) (← links)
• NEH-based heuristics for the permutation flowshop scheduling problem to minimise total tardiness (Q337554) (← links)
• A discrete inter-species cuckoo search for flowshop scheduling problems (Q337568) (← 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)
• 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)
• Enhanced migrating birds optimization algorithm for the permutation flow shop problem with sequence dependent setup times (Q1694317) (← links)
• Bicriterion optimization for flow shop with a learning effect subject to release dates (Q1722948) (← links)
• Revisiting simulated annealing: a component-based analysis (Q1725612) (← links)
• Heuristics for a flowshop scheduling problem with stepwise job objective function (Q1754167) (← 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)
• A landscape-based analysis of fixed temperature and simulated annealing (Q2171587) (← links)
• An iterated greedy heuristic for no-wait flow shops with sequence dependent setup times, learning and forgetting effects (Q2195404) (← links)
• Flow shop scheduling problem with position-dependent processing times (Q2273687) (← links)
• Generalised accelerations for insertion-based heuristics in permutation flowshop scheduling (Q2286871) (← links)
• Relationship between common objective functions, idle time and waiting time in permutation flow shop scheduling (Q2664303) (← links)
• Minimizing the total tardiness and the total carbon emissions in the permutation flow shop scheduling problem (Q2669708) (← links)
• A review and classification on distributed permutation flowshop scheduling problems (Q6069211) (← links)
• A simheuristic algorithm for the stochastic permutation flow‐shop problem with delivery dates and cumulative payoffs (Q6070118) (← links)
• Research on <i>m</i>‐machine flow shop scheduling with truncated learning effects (Q6088136) (← links)