Pages that link to "Item:Q1788967"

The following pages link to A discrete artificial bee colony algorithm for the no-idle permutation flowshop scheduling problem with the total tardiness criterion (Q1788967):

Displaying 14 items.

• On clarifying misconceptions when comparing variants of the artificial bee colony algorithm by offering a new implementation (Q508802) (← links)
• Iterated greedy algorithms for the blocking flowshop scheduling problem with makespan criterion (Q1652026) (← links)
• On the exact solution of the no-wait flow shop problem with due date constraints (Q1652232) (← links)
• A hybrid discrete teaching-learning based meta-heuristic for solving no-idle flow shop scheduling problem with total tardiness criterion (Q1652608) (← links)
• Artificial bee colony algorithm combined with grenade explosion method and Cauchy operator for global optimization (Q1666477) (← links)
• A variable block insertion heuristic for the blocking flowshop scheduling problem with total flowtime criterion (Q1736840) (← 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 multi-objective multi-population ant colony optimization for economic emission dispatch considering power system security (Q2290163) (← 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)
• Scheduling the Flowshop with Zero Intermediate Storage Using Chaotic Discrete Artificial Bee Algorithm (Q5259763) (← links)
• A systematic literature review on no-idle flow shop scheduling problem (Q6130678) (← links)