Pages that link to "Item:Q933507"

The following pages link to A discrete particle swarm optimization for lot-streaming flowshop scheduling problem (Q933507):

Displaying 17 items.

• Security based bi-objective flow shop scheduling model and its hybrid genetic algorithm (Q279989) (← links)
• Eidetic wolf search algorithm with a global memory structure (Q323278) (← links)
• Genetic based discrete particle swarm optimization for elderly day care center timetabling (Q342133) (← links)
• Binary accelerated particle swarm algorithm (BAPSA) for discrete optimization problems (Q377748) (← links)
• Inventory based bi-objective flow shop scheduling model and its hybrid genetic algorithm (Q474788) (← links)
• Lagrangian relaxation with cut generation for hybrid flowshop scheduling problems to minimize the total weighted tardiness (Q733544) (← links)
• A competitive and cooperative co-evolutionary approach to multi-objective particle swarm optimization algorithm design (Q1038375) (← links)
• An integrated tabu search algorithm for the lot streaming problem in job shops (Q1042155) (← links)
• A study on integration of lot sizing and flow shop lot streaming problems (Q1637796) (← links)
• Iterated search methods for earliness and tardiness minimization in hybrid flowshops with due windows (Q1652188) (← links)
• Minimizing maximum tardiness and delivery costs with batch delivery and job release times (Q2282368) (← links)
• A simulated annealing with multiple-search paths and parallel computation for a comprehensive flowshop scheduling problem (Q2794678) (← links)
• Lot streaming multiple jobs in a flow shop (Q2997892) (← links)
• Multicriteria models for just-in-time scheduling (Q2997893) (← links)
• An Iterated Local Search Algorithm for the Lot-Streaming Flow Shop Scheduling Problem (Q5174415) (← links)
• Heuristic solution approaches for the cumulative capacitated vehicle routing problem (Q5746676) (← links)
• The distributed no-idle permutation flowshop scheduling problem with due windows (Q6546486) (← links)