Pages that link to "Item:Q1764767"

The following pages link to Beam-ACO--hybridizing ant colony optimization with beam search: an application to open shop scheduling (Q1764767):

Displaying 44 items.

• Ant colony systems for the single-machine total weighted earliness tardiness scheduling problem (Q282252) (← links)
• A decomposition approach for the car resequencing problem with selectivity banks (Q339550) (← links)
• An ant colony optimization approach to a permutational flowshop scheduling problem with outsourcing allowed (Q632673) (← links)
• On the part inventory model sequencing problem: complexity and beam search heuristic (Q633549) (← links)
• A parallel ant colony algorithm on massively parallel processors and its convergence analysis for the travelling salesman problem (Q712674) (← links)
• Fidelity-based ant colony algorithm with Q-learning of quantum system (Q726011) (← links)
• Compiling finite linear CSP into SAT (Q842794) (← links)
• A beam search approach for the optimization version of the car sequencing problem (Q940889) (← links)
• Ant colony optimization combined with taboo search for the job shop scheduling problem (Q941529) (← links)
• ACS-TS: Train scheduling using ant colony system (Q955488) (← links)
• A beam search implementation for the irregular shape packing problem (Q964846) (← links)
• The museum visitor routing problem (Q969135) (← links)
• Hybridizing exact methods and metaheuristics: a taxonomy (Q1042187) (← links)
• An effective heuristic algorithm for the partial shop scheduling problem (Q1652579) (← links)
• Solving integrated process planning and scheduling problem with constructive meta-heuristics (Q1671703) (← links)
• Open shop cyclic scheduling (Q1750495) (← links)
• Coupling genetic local search and recovering beam search algorithms for minimizing the total completion time in the single machine scheduling problem subject to release dates (Q1762109) (← links)
• Dynamic programming approach for solving the open shop problem (Q2033324) (← links)
• New efficient heuristics for scheduling open shops with makespan minimization (Q2147004) (← links)
• A self-tuning variable neighborhood search algorithm and an effective decoding scheme for open shop scheduling problems with travel/setup times (Q2183852) (← links)
• Optimal directed hypergraph traversal with ant-colony optimisation (Q2200670) (← links)
• Four decades of research on the open-shop scheduling problem to minimize the makespan (Q2239884) (← links)
• Beam-ACO for the travelling salesman problem with time windows (Q2270441) (← links)
• Supply chain scheduling in a collaborative manufacturing mode: model construction and algorithm design (Q2327696) (← links)
• Simulated annealing and genetic algorithms for minimizing mean flow time in an open shop (Q2389828) (← links)
• Backtracking and exchange of information: Methods to enhance a beam search algorithm for assembly line scheduling (Q2426522) (← links)
• A tabu search approach for proportionate multiprocessor open shop scheduling (Q2450907) (← links)
• A modified ant colony system for solving the travelling salesman problem with time windows (Q2472698) (← links)
• A new particle swarm optimization for the open shop scheduling problem (Q2482375) (← links)
• A Lagrangian-ACO matheuristic for car sequencing (Q2513756) (← links)
• Ant colony optimization theory: a survey (Q2575081) (← links)
• An Optimal Constraint Programming Approach to the Open-Shop Problem (Q2815442) (← links)
• A new particle swarm optimization for multi-objective open shop scheduling (Q2903242) (← links)
• Hybrid Metaheuristics: An Introduction (Q2950517) (← links)
• Hybridizations of Metaheuristics With Branch & Bound Derivates (Q2950520) (← links)
• Evolutionary Computational Technique in Automatic Generation Control of Multi-area Power Systems with Nonlinearity and Energy Storage Unit (Q2975879) (← links)
• Performance analysis of rotation schedule and improved strategy for open shop problem to minimise makespan (Q3102811) (← links)
• <i>q</i>-Analogs of Packing Designs (Q3191439) (← links)
• Multi-rendezvous Spacecraft Trajectory Optimization with Beam P-ACO (Q3304193) (← links)
• SOLVING THE OPEN SHOP SCHEDULING PROBLEM VIA A HYBRID GENETIC-VARIABLE NEIGHBORHOOD SEARCH ALGORITHM (Q3393531) (← links)
• ANALYTICAL AND NUMERICAL INVESTIGATION OF ANT BEHAVIOR UNDER CROWDED CONDITIONS (Q3439939) (← links)
• Multiple colony ant algorithm for job-shop scheduling problem (Q3518511) (← links)
• Multiprocessor task scheduling in multistage hybrid flow-shops: an ant colony system approach (Q3527930) (← links)
• A genetic algorithm for scheduling open shops with conflict graphs to minimize the makespan (Q6164629) (← links)