Ant colony optimization combined with taboo search for the job shop scheduling problem

Authors:
Kuo-Ling Huang;Ching-Jong Liao
Affiliations:
Department of Industrial Management, National Taiwan University of Science and Technology, 43 Keelung Road, , Taipei 106, Taiwan;Department of Industrial Management, National Taiwan University of Science and Technology, 43 Keelung Road, , Taipei 106, Taiwan
Venue:
Computers and Operations Research
Year:
2008

Citing 18
Cited 22

The shifting bottleneck procedure for job shop scheduling

Management Science
An algorithm for solving the job-shop problem

Management Science
Job shop scheduling by simulated annealing

Operations Research
Applying tabu search to the job-shop scheduling problem

Annals of Operations Research - Special issue on Tabu search
A genetic algorithm for the job shop problem

Computers and Operations Research - Special issue on genetic algorithms
Evolution based learning in a job shop scheduling environment

Computers and Operations Research - Special issue on genetic algorithms
The one-machine problem with delayed precedence constraints and its use in job shop scheduling

Management Science
A fast taboo search algorithm for the job shop problem

Management Science
Guided Local Search with Shifting Bottleneck for Job Shop Scheduling

Management Science
An effective hybrid optimization strategy for job-shop scheduling problems

Computers and Operations Research
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
ACO Applied to Group Shop Scheduling: A Case Study on Intensification and Diversification

ANTS '02 Proceedings of the Third International Workshop on Ant Algorithms
Improved Constructive Multistart Strategies for the Quadratic Assignment Problem Using Adaptive Memory

INFORMS Journal on Computing
Parallel GRASP with path-relinking for job shop scheduling

Parallel Computing - Special issue: Parallel computing in numerical optimization
Ant Colony Optimization

Ant Colony Optimization
Beam-ACO: hybridizing ant colony optimization with beam search: an application to open shop scheduling

Computers and Operations Research
Ant colony optimization for FOP shop scheduling: a case study on different pheromone representations

CEC '02 Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02
Ant colony system: a cooperative learning approach to the traveling salesman problem

IEEE Transactions on Evolutionary Computation

Multi-objective flexible job shop schedule: Design and evaluation by simulation modeling

Applied Soft Computing
A hybrid artificial immune algorithm for a realistic variant of job shops to minimize the total completion time

Computers and Industrial Engineering
A hybrid immune simulated annealing algorithm for the job shop scheduling problem

Applied Soft Computing
A Knowledge-Based Ant Colony Optimization for Flexible Job Shop Scheduling Problems

Applied Soft Computing
An immune genetic algorithm based on bottleneck jobs for the job shop scheduling problem

EvoCOP'08 Proceedings of the 8th European conference on Evolutionary computation in combinatorial optimization
Integrated heuristics for scheduling multiple order jobs in a complex job shop

International Journal of Metaheuristics
Testing the permutation space based geometric differential evolution on the job-shop scheduling problem

PPSN'10 Proceedings of the 11th international conference on Parallel problem solving from nature: Part II
Research on double-objective optimal scheduling algorithm for dual resource constrained job shop

AICI'10 Proceedings of the 2010 international conference on Artificial intelligence and computational intelligence: Part I
A heuristics method based on ant colony optimisation for redundancy allocation problems

International Journal of Computer Applications in Technology
A new hybrid multi-objective Pareto archive PSO algorithm for a bi-objective job shop scheduling problem

Expert Systems with Applications: An International Journal
A GA/TS algorithm for the stage shop scheduling problem

Computers and Industrial Engineering
Makespan minimization on single batch-processing machine via ant colony optimization

Computers and Operations Research
Decomposition-based classified ant colony optimization algorithm for scheduling semiconductor wafer fabrication system

Computers and Industrial Engineering
Bottleneck machine identification method based on constraint transformation for job shop scheduling with genetic algorithm

Information Sciences: an International Journal
An agent-based parallel approach for the job shop scheduling problem with genetic algorithms

Mathematical and Computer Modelling: An International Journal
Pheromone-based coordination for manufacturing system control

Journal of Intelligent Manufacturing
Literature review regarding Ant Colony Optimization applied to scheduling problems: Guidelines for implementation and directions for future research

Engineering Applications of Artificial Intelligence
A hybrid Differential Evolution-Tabu Search algorithm for the solution of Job-Shop Scheduling Problems

Applied Soft Computing
Application of ant colony optimization algorithm in process planning optimization

Journal of Intelligent Manufacturing
An optimal method for the preemptive job shop scheduling problem

Computers and Operations Research
A two-phase scheduling method with the consideration of task clustering for earth observing satellites

Computers and Operations Research
An integrated search heuristic for large-scale flexible job shop scheduling problems

Computers and Operations Research

Quantified Score

Hi-index	0.01

Visualization

Abstract

In this paper, we present a hybrid algorithm combining ant colony optimization algorithm with the taboo search algorithm for the classical job shop scheduling problem. Instead of using the conventional construction approach to construct feasible schedules, the proposed ant colony optimization algorithm employs a novel decomposition method inspired by the shifting bottleneck procedure, and a mechanism of occasional reoptimizations of partial schedules. Besides, a taboo search algorithm is embedded to improve the solution quality. We run the proposed algorithm on 101 benchmark instances and obtain competitive results and a new best upper bound for one open benchmark instance is found.