Journal ArticleDOI
A hybrid tabu search algorithm with an efficient neighborhood structure for the flexible job shop scheduling problem.
Reads0
Chats0
TLDR
In this article, a hybrid tabu search algorithm with a fast public critical block neighborhood structure (TSPCB) is proposed to solve the flexible job shop scheduling problem with the criterion to minimize the maximum completion time (makespan).Abstract:
A novel hybrid tabu search algorithm with a fast public critical block neighborhood structure (TSPCB) is proposed in this paper to solve the flexible job shop scheduling problem with the criterion to minimize the maximum completion time (makespan). First, a mix of four machine assignment rules and four operation scheduling rules is developed to improve the quality of initial solutions to empower the hybrid algorithm with good exploration capability. Second, an effective neighborhood structure to conduct local search in the machine assignment module is proposed, which integrates three adaptive approaches. Third, a speedup local search method with three kinds of insert and swap neighborhood structures based on public critical block theory is presented. With the fast neighborhood structure, the TSPCB algorithm can enhance its exploitation capability. Simulation results based on the well-known benchmarks and statistical performance comparisons are provided. It is concluded that the proposed TSPCB algorithm is superior to several recently published algorithms in terms of solution quality, convergence ability, and efficiency.read more
Citations
More filters
Journal ArticleDOI
An effective hybrid genetic algorithm and tabu search for flexible job shop scheduling problem
TL;DR: An effective hybrid algorithm which hybridizes the genetic algorithm (GA) and tabu search (TS) has been proposed for the FJSP with the objective to minimize the makespan and the experimental results demonstrate that the proposed HA has achieved significant improvement for solving FJ SP regardless of the solution accuracy and the computational time.
Journal ArticleDOI
A research survey: review of flexible job shop scheduling techniques
Imran Ali Chaudhry,Abid Ali Khan +1 more
TL;DR: The paper aims at presenting the development of flexible JSS and a consolidated survey of various techniques that have been employed since 1990 for problem resolution.
Journal ArticleDOI
A discrete artificial bee colony algorithm for the multi-objective flexible job-shop scheduling problem with maintenance activities
TL;DR: The highly effective and efficient performance of the proposed DABC algorithm is shown against the best performing algorithms from the literature.
Journal ArticleDOI
A review on swarm intelligence and evolutionary algorithms for solving flexible job shop scheduling problems
TL;DR: The mathematical model of FJSP is presented, the constraints in applications are summarized, and the encoding and decoding strategies for connecting the problem and algorithms are reviewed to give insight into future research directions.
Journal ArticleDOI
Pareto-based discrete artificial bee colony algorithm for multi-objective flexible job shop scheduling problems
TL;DR: A hybrid Pareto-based discrete artificial bee colony algorithm for solving the multi-objective flexible job shop scheduling problem and comparisons with other recently published algorithms show the efficiency and effectiveness of the proposed algorithm.
References
More filters
Journal ArticleDOI
The Complexity of Flowshop and Jobshop Scheduling
TL;DR: The results are strong in that they hold whether the problem size is measured by number of tasks, number of bits required to express the task lengths, or by the sum of thetask lengths.
Journal ArticleDOI
Job Shop Scheduling by Simulated Annealing
TL;DR: In this article, an approximation algorithm for the problem of finding the minimum makespan in a job shop is presented, which is based on simulated annealing, a generalization of the well known iterative improvement approach to combinatorial optimization problems.
Journal ArticleDOI
Tabu Search: A Tutorial
TL;DR: This paper presents tabu search, a heuristic procedure designed to guide other methods to escape the trap of local optimality, which has obtained optimal and near optimal solutions to a wide variety of classical and practical problems.
Journal ArticleDOI
A Fast Taboo Search Algorithm for the Job Shop Problem
TL;DR: A fast and easily implementable approximation algorithm for the problem of finding a minimum makespan in a job shop is presented, based on a taboo search technique with a specific neighborhood definition which employs a critical path and blocks of operations notions.
Journal ArticleDOI
Routing and scheduling in a flexible job shop by tabu search
TL;DR: A hierarchical algorithm for the flexible job shop scheduling problem is described, based on the tabu search metaheuristic, which allows to adapt the same basic algorithm to different objective functions.