Improved cuckoo search algorithm for hybrid flow shop scheduling problems to minimize makespan

2014 ◽  
Vol 19 ◽  
pp. 93-101 ◽  
Author(s):  
M.K. Marichelvam ◽  
T. Prabaharan ◽  
X.S. Yang
Keyword(s):  
Flow Shop ◽  
Search Algorithm ◽  
Cuckoo Search ◽  
Cuckoo Search Algorithm ◽  
Flow Shop Scheduling ◽  
Hybrid Flow Shop ◽  
Scheduling Problems ◽  
Shop Scheduling ◽  
Hybrid Flow Shop Scheduling ◽  
Improved Cuckoo Search Algorithm

Cuckoo Search Algorithm for Solving Real Industrial Multi-Objective Scheduling Problems

2018 ◽  
pp. 4369-4381 ◽  
Author(s):  
Mariappan Kadarkarainadar Marichelvam ◽  
Mariappan Geetha
Keyword(s):  
Flow Shop ◽  
Search Algorithm ◽  
Cuckoo Search ◽  
Cuckoo Search Algorithm ◽  
Flow Shop Scheduling ◽  
Hybrid Flow Shop ◽  
Data Sets ◽  
Scheduling Problems ◽  
Shop Scheduling ◽  
Hybrid Flow Shop Scheduling

A multistage hybrid flow shop scheduling problem is considered in this chapper with the objective of minimizing the makespan and mean flow time. Since the problem is NP-hard in nature, many heuristics and meta-heuristics were developed by the researchers. cuckoo search algorithm is one of the recently developed meta–heuristic algorithms inspired by the social behavior of cuckoos. The cuckoo search algorithm is presented in this paper to solve the hybrid flow shop scheduling problems. To illustrate the proposed algorithm, data sets from a steel furniture manufacturing company are used. The computational results show that the proposed algorithm is better than many other algorithms.

Cuckoo Search Algorithm for Solving Real Industrial Multi-Objective Scheduling Problems

2019 ◽  
pp. 400-414
Author(s):  
Mariappan Kadarkarainadar Marichelvam ◽  
Mariappan Geetha
Keyword(s):  
Flow Shop ◽  
Search Algorithm ◽  
Cuckoo Search ◽  
Cuckoo Search Algorithm ◽  
Flow Shop Scheduling ◽  
Hybrid Flow Shop ◽  
Data Sets ◽  
Scheduling Problems ◽  
Shop Scheduling ◽  
Hybrid Flow Shop Scheduling

A multistage hybrid flow shop scheduling problem is considered in this chapter with the objective of minimizing the makespan and mean flow time. Since the problem is NP-hard in nature, many heuristics and meta-heuristics were developed by the researchers. Cuckoo search algorithm is one of the recently developed meta-heuristic algorithms inspired by the social behavior of cuckoos. The cuckoo search algorithm is presented in this chapter to solve the hybrid flow shop scheduling problems. To illustrate the proposed algorithm, data sets from a steel furniture manufacturing company are used. The computational results show that the proposed algorithm is better than many other algorithms.

Using Cuckoo Search Algorithm for Hybrid Flow Shop Scheduling Problems Under Makespan Criterion

2018 ◽  
pp. 379-400
Author(s):  
M. K. Marichelvam ◽  
Ömür Tosun
Keyword(s):  
Parallel Machines ◽  
Flow Shop ◽  
Search Algorithm ◽  
Cuckoo Search ◽  
Cuckoo Search Algorithm ◽  
Flow Shop Scheduling ◽  
Hybrid Flow Shop ◽  
Benchmark Problems ◽  
Scheduling Problems ◽  
Hybrid Flow Shop Scheduling

In this chapter, cuckoo search algorithm (CSA) is used to solve the multistage hybrid flow shop (HFS) scheduling problems with parallel machines. The objective is the minimization of makespan. The HFS scheduling problems are proved to be strongly non-deterministic polynomial time-hard (NP-hard). Proposed CSA algorithm has been tested on benchmark problems addressed in the literature against other well-known algorithms. The results are presented in terms of percentage deviation (PD) of the solution from the lower bound. The results indicate that the proposed CSA algorithm is quite effective in reducing makespan because average PD is observed as 1.531, whereas the next best algorithm has result of average PD of 2.295, which is, in general, nearly 50% worse, and other algorithms start from 2.645.

Performance Comparison of Cuckoo Search Algorithm to Solve the Hybrid Flow Shop Scheduling Benchmark Problems with Makespan Criterion

2016 ◽  
Vol 7 (2) ◽  
pp. 1-14 ◽  
Author(s):  
M.K. Marichelvam ◽  
Ömür Tosun
Keyword(s):  
Parallel Machines ◽  
Flow Shop ◽  
Search Algorithm ◽  
Cuckoo Search ◽  
Cuckoo Search Algorithm ◽  
Flow Shop Scheduling ◽  
Hybrid Flow Shop ◽  
Benchmark Problems ◽  
Scheduling Problems ◽  
Hybrid Flow Shop Scheduling

In this work, the performance of cuckoo search algorithm (CSA) is measured solving the multistage hybrid flow shop (HFS) scheduling problems with parallel machines. The objective is the minimization of makespan. The HFS scheduling problems are proved to be strongly non-deterministic polynomial time-hard (NP-hard). Proposed CSA algorithm has been tested on benchmark problems addressed in the literature against other well-known algorithms. The results are presented in terms of percentage deviation (PD) of the solution from the lower bound. The results indicate that the proposed CSA algorithm is quite effective in reducing makespan because average PD is observed as 1.531, whereas the next best algorithm has result of average PD of 2.295 which is in general nearly 50% worse and other algorithms start from 3.833.

A new cuckoo search algorithm with hybrid strategies for flow shop scheduling problems

2016 ◽  
Vol 21 (15) ◽  
pp. 4297-4307 ◽  
Author(s):  
Hui Wang ◽  
Wenjun Wang ◽  
Hui Sun ◽  
Zhihua Cui ◽  
Shahryar Rahnamayan ◽  
...  
Keyword(s):  
Flow Shop ◽  
Search Algorithm ◽  
Cuckoo Search ◽  
Cuckoo Search Algorithm ◽  
Flow Shop Scheduling ◽  
Scheduling Problems ◽  
Shop Scheduling

scholarly journals Hybrid Flow Shop Scheduling Problems Using Improved Fireworks Algorithm for Permutation

2020 ◽  
Vol 10 (3) ◽  
pp. 1174 ◽  
Author(s):  
Xuelian Pang ◽  
Haoran Xue ◽  
Ming-Lang Tseng ◽  
Ming K. Lim ◽  
Kaihua Liu
Keyword(s):  
Flow Shop ◽  
Flow Shop Scheduling ◽  
Hybrid Flow Shop ◽  
Scheduling Problems ◽  
Gaussian Mutation ◽  
Fireworks Algorithm ◽  
Shop Scheduling ◽  
Permutation Flow Shop Scheduling ◽  
Hybrid Flow Shop Scheduling ◽  
Permutation Flow Shop

Prior studies are lacking which address permutation flow shop scheduling problems and hybrid flow shop scheduling problems together to help firms find the optimized scheduling strategy. The permutation flow shop scheduling problem and hybrid flow shop scheduling problems are important production scheduling types, which widely exist in industrial production fields. This study aimed to acquire the best scheduling strategy for making production plans. An improved fireworks algorithm is proposed to minimize the makespan in the proposed strategies. The proposed improved fireworks algorithm is compared with the fireworks algorithm, and the improvement strategies include the following: (1) A nonlinear radius is introduced and the minimum explosion amplitude is checked to avoid the waste of optimal fireworks; (2) The original Gaussian mutation operator is replaced by a hybrid operator that combines Cauchy and Gaussian mutation to improve the search ability; and (3) An elite group selection strategy is adopted to reduce the computing costs. Two instances from the permutation flow shop scheduling problem and hybrid flow shop scheduling problems were used to evaluate the improved fireworks algorithm’s performance, and the computational results demonstrate the improved fireworks algorithm’s superiority.

Sign in / Sign up

Export Citation Format

Share Document