Ant colony optimization combined with taboo search for the job shop scheduling problem
From MaRDI portal
Publication:941529
DOI10.1016/j.cor.2006.07.003zbMath1180.90123OpenAlexW2011649121MaRDI QIDQ941529
Kuo-Ling Huang, Ching-Jong Liao
Publication date: 1 September 2008
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2006.07.003
Related Items
Ant colony systems for the single-machine total weighted earliness tardiness scheduling problem ⋮ A two-phase scheduling method with the consideration of task clustering for Earth observing satellites ⋮ An integrated search heuristic for large-scale flexible job shop scheduling problems ⋮ Parallel-identical-machine job-shop scheduling with different stage-dependent buffering requirements ⋮ Solving integrated process planning and scheduling problem with constructive meta-heuristics ⋮ A spatial pyramid pooling-based deep reinforcement learning model for dynamic job-shop scheduling problem ⋮ A hybrid differential evolution and tree search algorithm for the job shop scheduling problem ⋮ Ant colony algorithm for just-in-time job shop scheduling with transportation times and multirobots ⋮ An agent-based parallel approach for the job shop scheduling problem with genetic algorithms ⋮ Bottleneck machine identification method based on constraint transformation for job shop scheduling with genetic algorithm ⋮ MAKHA -- a new hybrid swarm intelligence global optimization algorithm ⋮ Makespan minimization on single batch-processing machine via ant colony optimization ⋮ Neighbourhood generation mechanism applied in simulated annealing to job shop scheduling problems ⋮ Hybrid real-code ant colony optimisation for constrained mechanical design ⋮ Double layer ACO algorithm for the multi-objective FJSSP ⋮ A new hybrid parallel genetic algorithm for the job‐shop scheduling problem ⋮ A heuristic hybrid framework for vector job scheduling
Uses Software
Cites Work
- An ant colony optimization algorithm for shop scheduling problems
- The job shop scheduling problem: Conventional and new solution techniques
- A genetic algorithm for the job shop problem
- Evolution based learning in a job shop scheduling environment
- Beam-ACO--hybridizing ant colony optimization with beam search: an application to open shop scheduling
- Deterministic job-shop scheduling: Past, present and future
- An improved ant system algorithm for the vehicle routing problem
- An ant colony optimization algorithm to solve a 2-machine bicriteria flowshop scheduling problem
- Constraint propagation and problem decomposition: A preprocessing procedure for the job shop problem
- A tabu search method guided by shifting bottleneck for the job shop scheduling problem
- Benchmarks for basic scheduling problems
- Applying tabu search to the job-shop scheduling problem
- Guided Local Search with Shifting Bottleneck for Job Shop Scheduling
- The Shifting Bottleneck Procedure for Job Shop Scheduling
- An Algorithm for Solving the Job-Shop Problem
- Job Shop Scheduling by Simulated Annealing
- Tabu Search—Part I
- Tabu Search—Part II
- A Computational Study of the Job-Shop Scheduling Problem
- Parallel Taboo Search Techniques for the Job Shop Scheduling Problem
- A Fast Taboo Search Algorithm for the Job Shop Problem
- Improved Constructive Multistart Strategies for the Quadratic Assignment Problem Using Adaptive Memory
- Comparing an ACO algorithm with other heuristics for the single machine scheduling problem with sequence-dependent setup times
- A modified shifting bottleneck procedure for job-shop scheduling
- The One-Machine Problem with Delayed Precedence Constraints and its Use in Job Shop Scheduling
- Job Shop Scheduling by Local Search
- An effective hybrid optimization strategy for job-shop scheduling problems
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
