The IRMA Community
Newsletters
Research IRM
Click a keyword to search titles using our InfoSci-OnDemand powered search:
|
Using Cuckoo Search Algorithm for Hybrid Flow Shop Scheduling Problems Under Makespan Criterion
|
|
Author(s): M. K. Marichelvam (Mepco Schlenk Engineering College, India)and Ömür Tosun (Akdeniz University, Turkey)
Copyright: 2018
Pages: 22
Source title:
Critical Developments and Applications of Swarm Intelligence
Source Author(s)/Editor(s): Yuhui Shi (Southern University of Science and Technology, China)
DOI: 10.4018/978-1-5225-5134-8.ch015
Purchase
|
Abstract
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.
Related Content
|
P. Chitra, A. Saleem Raja, V. Sivakumar.
© 2024.
24 pages.
|
|
K. Ezhilarasan, K. Somasundaram, T. Kalaiselvi, Praveenkumar Somasundaram, S. Karthigai Selvi, A. Jeevarekha.
© 2024.
36 pages.
|
|
Kande Archana, V. Kamakshi Prasad, M. Ashok.
© 2024.
17 pages.
|
|
Ritesh Kumar Jain, Kamal Kant Hiran.
© 2024.
23 pages.
|
|
U. Vignesh, R. Elakya.
© 2024.
13 pages.
|
|
S. Karthigai Selvi, R. Siva Shankar, K. Ezhilarasan.
© 2024.
16 pages.
|
|
Vemasani Varshini, Maheswari Raja, Sharath Kumar Jagannathan.
© 2024.
20 pages.
|
|
|