Pages that link to "Item:Q336357"

The following pages link to A variable iterated greedy algorithm with differential evolution for the no-idle permutation flowshop scheduling problem (Q336357):

Displaying 18 items.

• Total completion time with makespan constraint in no-wait flowshops with setup times (Q296867) (← links)
• A novel differential evolution algorithm using local abstract convex underestimate strategy for global optimization (Q342520) (← 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)
• A hybrid discrete teaching-learning based meta-heuristic for solving no-idle flow shop scheduling problem with total tardiness criterion (Q1652608) (← links)
• Improved bounded dynamic programming algorithm for solving the blocking flow shop problem (Q1725819) (← links)
• Effective metaheuristics for scheduling a hybrid flowshop with sequence-dependent setup times (Q1735381) (← links)
• A variable block insertion heuristic for the blocking flowshop scheduling problem with total flowtime criterion (Q1736840) (← links)
• An improved binary differential evolution algorithm for optimizing PWM control laws of power inverters (Q1787319) (← 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)
• Beam search-based heuristics for the mixed no-idle flowshop with total flowtime criterion (Q2099337) (← 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)
• Metaheuristics with restart and learning mechanisms for the no-idle flowshop scheduling problem with makespan criterion (Q2669719) (← links)
• MILP-based local search procedures for minimizing total tardiness in the no-idle permutation flowshop problem (Q2676278) (← links)
• A systematic literature review on no-idle flow shop scheduling problem (Q6130678) (← links)
• A branch-and-bound approach to the no-idle flowshop scheduling problem (Q6202953) (← links)