Pages that link to "Item:Q1761140"

The following pages link to A hybrid discrete differential evolution algorithm for the no-idle permutation flow shop scheduling problem with makespan criterion (Q1761140):

Displaying 11 items.

• A differential evolution algorithm with self-adaptive strategy and control parameters based on symmetric Latin hypercube design for unconstrained optimization problems (Q322395) (← links)
• Flexible open shop scheduling problem to minimize makespan (Q342284) (← links)
• A hybrid discrete teaching-learning based meta-heuristic for solving no-idle flow shop scheduling problem with total tardiness criterion (Q1652608) (← links)
• Beam search-based heuristics for the mixed no-idle flowshop with total flowtime criterion (Q2099337) (← links)
• Benders decomposition for the mixed no-idle permutation flowshop scheduling problem (Q2197331) (← links)
• A new iterated greedy algorithm for no-idle permutation flowshop scheduling with the total tardiness criterion (Q2297561) (← links)
• Improved particle swarm optimization algorithm based novel encoding and decoding schemes for flexible job shop scheduling problem (Q2664300) (← 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 simulation‐based differential evolution algorithm for stochastic parallel machine scheduling with operational considerations (Q5416762) (← links)
• A systematic literature review on no-idle flow shop scheduling problem (Q6130678) (← links)