Pages that link to "Item:Q2384652"

The following pages link to A note on a greedy heuristic for flow-shop makespan minimization with no machine idle-time (Q2384652):

Displayed 12 items.

• A variable iterated greedy algorithm with differential evolution for the no-idle permutation flowshop scheduling problem (Q336357) ‎ (← links)
• Minimization of maximum lateness on parallel machines with sequence-dependent setup times and job release dates (Q614053) ‎ (← links)
• A hybrid discrete teaching-learning based meta-heuristic for solving no-idle flow shop scheduling problem with total tardiness criterion (Q1652608) ‎ (← links)
• A hybrid discrete differential evolution algorithm for the no-idle permutation flow shop scheduling problem with makespan criterion (Q1761140) ‎ (← links)
• A discrete artificial bee colony algorithm for the no-idle permutation flowshop scheduling problem with the total tardiness criterion (Q1788967) ‎ (← links)
• Beam search-based heuristics for the mixed no-idle flowshop with total flowtime criterion (Q2099337) ‎ (← 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)
• An iterated greedy algorithm for the single-machine total weighted tardiness problem with sequence-dependent setup times (Q5172564) ‎ (← 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)