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 17 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)
• 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)
• Simulated annealing and genetic algorithms for minimizing mean flow time in an open shop (Q2389828) (← links)