Pages that link to "Item:Q2475841"

The following pages link to An effective hybrid PSO-based algorithm for flow shop scheduling with limited buffers (Q2475841):

Displaying 13 items.

• A hybrid variable neighborhood search algorithm for solving the limited-buffer permutation flow shop scheduling problem with the makespan criterion (Q337223) (← links)
• Multiple strategies based orthogonal design particle swarm optimizer for numerical optimization (Q337566) (← links)
• Metaheuristics for the multi-objective FJSP with sequence-dependent set-up times, auxiliary resources and machine down time (Q613775) (← links)
• A unified framework for population-based metaheuristics (Q646652) (← links)
• Minimizing the number of tardy jobs in the flowshop problem with operation and resource flexibility (Q732893) (← links)
• Total tardiness minimization in permutation flowshop with deterioration consideration (Q1630777) (← links)
• Decomposition methods for cost and tardiness reduction in aircraft manufacturing flow lines (Q1634065) (← links)
• Iterated greedy algorithms for the blocking flowshop scheduling problem with makespan criterion (Q1652026) (← links)
• Managing facility disruption in hub-and-spoke networks: formulations and efficient solution methods (Q1730620) (← links)
• A variable block insertion heuristic for the blocking flowshop scheduling problem with total flowtime criterion (Q1736840) (← links)
• Differential evolution metaheuristics for distributed limited-buffer flowshop scheduling with makespan criterion (Q2003413) (← links)
• Hybrid particle swarm optimization with genetic algorithm for solving capacitated vehicle routing problem with fuzzy demand - a case study on garbage collection system (Q2017925) (← links)
• An exact block algorithm for no-idle RPQ problem (Q4971711) (← links)