Beam-ACO--hybridizing ant colony optimization with beam search: an application to open shop scheduling
From MaRDI portal
Publication:1764767
DOI10.1016/j.cor.2003.11.018zbMath1122.90427OpenAlexW2029319864MaRDI QIDQ1764767
Publication date: 22 February 2005
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2003.11.018
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
Ant colony systems for the single-machine total weighted earliness tardiness scheduling problem ⋮ A new particle swarm optimization for multi-objective open shop scheduling ⋮ Compiling finite linear CSP into SAT ⋮ New efficient heuristics for scheduling open shops with makespan minimization ⋮ Simulated annealing and genetic algorithms for minimizing mean flow time in an open shop ⋮ An effective heuristic algorithm for the partial shop scheduling problem ⋮ A decomposition approach for the car resequencing problem with selectivity banks ⋮ q-Analogs of Packing Designs ⋮ Solving integrated process planning and scheduling problem with constructive meta-heuristics ⋮ A self-tuning variable neighborhood search algorithm and an effective decoding scheme for open shop scheduling problems with travel/setup times ⋮ Hybrid Metaheuristics: An Introduction ⋮ Hybridizations of Metaheuristics With Branch & Bound Derivates ⋮ Backtracking and exchange of information: Methods to enhance a beam search algorithm for assembly line scheduling ⋮ A genetic algorithm for scheduling open shops with conflict graphs to minimize the makespan ⋮ Optimal directed hypergraph traversal with ant-colony optimisation ⋮ An ant colony optimization approach to a permutational flowshop scheduling problem with outsourcing allowed ⋮ On the part inventory model sequencing problem: complexity and beam search heuristic ⋮ Multiple colony ant algorithm for job-shop scheduling problem ⋮ Evolutionary Computational Technique in Automatic Generation Control of Multi-area Power Systems with Nonlinearity and Energy Storage Unit ⋮ Multiprocessor task scheduling in multistage hybrid flow-shops: an ant colony system approach ⋮ A tabu search approach for proportionate multiprocessor open shop scheduling ⋮ A beam search approach for the optimization version of the car sequencing problem ⋮ Ant colony optimization combined with taboo search for the job shop scheduling problem ⋮ Multi-rendezvous Spacecraft Trajectory Optimization with Beam P-ACO ⋮ Four decades of research on the open-shop scheduling problem to minimize the makespan ⋮ A modified ant colony system for solving the travelling salesman problem with time windows ⋮ Open shop cyclic scheduling ⋮ ACS-TS: Train scheduling using ant colony system ⋮ A beam search implementation for the irregular shape packing problem ⋮ A new particle swarm optimization for the open shop scheduling problem ⋮ 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 ⋮ The museum visitor routing problem ⋮ Beam-ACO for the travelling salesman problem with time windows ⋮ A parallel ant colony algorithm on massively parallel processors and its convergence analysis for the travelling salesman problem ⋮ Fidelity-based ant colony algorithm with Q-learning of quantum system ⋮ Dynamic programming approach for solving the open shop problem ⋮ A Lagrangian-ACO matheuristic for car sequencing ⋮ An Optimal Constraint Programming Approach to the Open-Shop Problem ⋮ SOLVING THE OPEN SHOP SCHEDULING PROBLEM VIA A HYBRID GENETIC-VARIABLE NEIGHBORHOOD SEARCH ALGORITHM ⋮ Performance analysis of rotation schedule and improved strategy for open shop problem to minimise makespan ⋮ Hybridizing exact methods and metaheuristics: a taxonomy ⋮ Supply chain scheduling in a collaborative manufacturing mode: model construction and algorithm design ⋮ Ant colony optimization theory: a survey ⋮ ANALYTICAL AND NUMERICAL INVESTIGATION OF ANT BEHAVIOR UNDER CROWDED CONDITIONS
Uses Software
Cites Work
- Optimization by Simulated Annealing
- A branch \(\&\) bound algorithm for the open-shop problem
- Competitive genetic algorithms for the open-shop scheduling problem
- A hybrid genetic algorithm for the open shop scheduling problem
- A new lower bound for the open-shop problem
- Benchmarks for basic scheduling problems
- Exact and Approximate Nondeterministic Tree-Search Procedures for the Quadratic Assignment Problem
- Local Search and Constraint Programming
- Algorithms for Solving Production-Scheduling Problems
- Handbook of metaheuristics
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
