Hybrid ant colony optimization and visibility studies applied to a job-shop scheduling problem

DOI10.1016/j.amc.2006.09.023zbMath1127.90027OpenAlexW2063842491MaRDI QIDQ883910

N. E. Zubov

Publication date: 12 June 2007

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2006.09.023

zbMATH Keywords

job-shop schedulingant colony optimizationACO

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (10)

A multi-objective memetic algorithm for the job-shop scheduling problem ⋮ Ant colony optimization for competency based learning objects sequencing in e-learning ⋮ Solving integrated process planning and scheduling problem with constructive meta-heuristics ⋮ Hybrid ant colony optimization algorithm applied to the multi-depot vehicle routing problem ⋮ An ant colony optimization approach to a permutational flowshop scheduling problem with outsourcing allowed ⋮ Multi-stage ordinal optimization based approach for job shop scheduling problems ⋮ The museum visitor routing problem ⋮ Scheduling job shop problems with sequence-dependent setup times ⋮ A heuristic hybrid framework for vector job scheduling ⋮ Supply chain scheduling in a collaborative manufacturing mode: model construction and algorithm design

Cites Work

• Unnamed Item
• An ant colony system for permutation flow-shop sequencing
• A new rank based version of the ant system. -- A computational study
• An ACO algorithm for a dynamic regional nurse-scheduling problem in Austria
• The Shifting Bottleneck Procedure for Job Shop Scheduling
• Job Shop Scheduling by Simulated Annealing
• A Survey of Scheduling Rules
• A Fast Taboo Search Algorithm for the Job Shop Problem

This page was built for publication: Hybrid ant colony optimization and visibility studies applied to a job-shop scheduling problem