Pages that link to "Item:Q2387266"

The following pages link to Some local search algorithms for no-wait flow-shop problem with makespan criterion (Q2387266):

Displayed 27 items.

• A high performing metaheuristic for multi-objective flowshop scheduling problem (Q337199) ‎ (← links)
• A class of multi-objective expected value decision-making model with birandom coefficients and its application to flow shop scheduling problem (Q730912) ‎ (← links)
• Minimizing makespan for a no-wait flowshop using genetic algorithm (Q746438) ‎ (← links)
• A multiperiod single processor scheduling problem with periodic requirements (Q818097) ‎ (← links)
• On no-wait and no-idle flow shops with makespan criterion (Q859679) ‎ (← links)
• A multi-objective particle swarm for a flow shop scheduling problem (Q867030) ‎ (← links)
• Accelerated tabu search for no-wait flowshop scheduling problem with maximum lateness criterion (Q976399) ‎ (← links)
• A novel differential evolution algorithm for bi-criteria no-wait flow shop scheduling problems (Q1010312) ‎ (← links)
• An empirical analysis of the optimality rate of flow shop heuristics (Q1027589) ‎ (← links)
• A novel hybrid discrete differential evolution algorithm for blocking flow shop scheduling problems (Q1038288) ‎ (← links)
• No-wait flowshop scheduling problem with two criteria; total tardiness and makespan (Q1750472) ‎ (← links)
• A survey of scheduling problems with no-wait in process (Q1751258) ‎ (← 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)
• Cyclic flow-shop scheduling with no-wait constraints and missing operations (Q2140312) ‎ (← links)
• Heuristics for no-wait flowshops with makespan subject to mean completion time (Q2249033) ‎ (← links)
• Heuristic for no-wait flow shops with makespan minimization based on total idle-time increments (Q2250726) ‎ (← links)
• No-wait flow shop scheduling using fuzzy multi-objective linear programming (Q2271524) ‎ (← links)
• Minimisation of total tardiness for identical parallel machine scheduling using genetic algorithm (Q2403558) ‎ (← links)
• A hybrid multi-objective immune algorithm for a flow shop scheduling problem with bi-objectives: weighted mean completion time and weighted mean tardiness (Q2456478) ‎ (← links)
• Some effective heuristics for no-wait flowshops with setup times to minimize total completion time (Q2468768) ‎ (← links)
• A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem (Q2475842) ‎ (← links)
• An improved NEH heuristic to minimize makespan in permutation flow shops (Q2475856) ‎ (← links)
• An efficient simple metaheuristic for minimizing the makespan in two-machine no-wait job shops (Q2482377) ‎ (← links)
• A HYBRID HARMONY SEARCH ALGORITHM FOR THE NO-WAIT FLOW-SHOP SCHEDULING PROBLEMS (Q2911576) ‎ (← links)
• An iterated greedy algorithm for the single-machine total weighted tardiness problem with sequence-dependent setup times (Q5172564) ‎ (← links)
• An iterated greedy algorithm for the no-wait flowshop scheduling problem to minimize makespan subject to total completion time (Q6094378) ‎ (← links)