Routing and scheduling in a flexible job shop by tabu search
Annals of Operations Research - Special issue on Tabu search
Applying tabu search to the job-shop scheduling problem
Annals of Operations Research - Special issue on Tabu search
A fast taboo search algorithm for the job shop problem
Management Science
Guided Local Search with Shifting Bottleneck for Job Shop Scheduling
Management Science
A tabu search algorithm with a new neighborhood structure for the job shop scheduling problem
Computers and Operations Research
Computers and Operations Research
Computers and Industrial Engineering
A genetic algorithm for the Flexible Job-shop Scheduling Problem
Computers and Operations Research
Multi-objective flexible job shop schedule: Design and evaluation by simulation modeling
Applied Soft Computing
Computers and Industrial Engineering
An effective hybrid optimization approach for multi-objective flexible job-shop scheduling problems
Computers and Industrial Engineering
A PTS-PGATS based approach for data-intensive scheduling in data grids
Frontiers of Computer Science in China
Computers and Industrial Engineering
ICIC'11 Proceedings of the 7th international conference on Advanced Intelligent Computing Theories and Applications: with aspects of artificial intelligence
Flexible job shop scheduling using a multiobjective memetic algorithm
ICIC'11 Proceedings of the 7th international conference on Advanced Intelligent Computing Theories and Applications: with aspects of artificial intelligence
Flexible job shop scheduling problem by chemical-reaction optimization algorithm
ICIC'11 Proceedings of the 7th international conference on Advanced Intelligent Computing
Solving fuzzy job-shop scheduling problem by a hybrid PSO algorithm
SIDE'12 Proceedings of the 2012 international conference on Swarm and Evolutionary Computation
Computers & Mathematics with Applications
Self-Optimization module for Scheduling using Case-based Reasoning
Applied Soft Computing
Path-relinking Tabu search for the multi-objective flexible job shop scheduling problem
Computers and Operations Research
Hi-index | 0.00 |
This paper proposes an effective hybrid tabu search algorithm (HTSA) to solve the flexible job-shop scheduling problem. Three minimization objectives - the maximum completion time (makespan), the total workload of machines and the workload of the critical machine are considered simultaneously. In this study, a tabu search (TS) algorithm with an effective neighborhood structure combining two adaptive rules is developed, which constructs improved local search in the machine assignment module. Then, a well-designed left-shift decoding function is defined to transform a solution to an active schedule. In addition, a variable neighborhood search (VNS) algorithm integrating three insert and swap neighborhood structures based on public critical block theory is presented to perform local search in the operation scheduling component. The proposed HTSA is tested on sets of the well-known benchmark instances. The statistical analysis of performance comparisons shows that the proposed HTSA is superior to four existing algorithms including the AL+CGA algorithm by Kacem, Hammadi, and Borne (2002b), the PSO+SA algorithm by Xia and Wu (2005), the PSO+TS algorithm by Zhang, Shao, Li, and Gao (2009), and the Xing's algorithm by Xing, Chen, and Yang (2009a) in terms of both solution quality and efficiency.