Please use this identifier to cite or link to this item:
Title: A hybrid cuckoo search algorithm in parallel batch processing machines with unequal job ready times
Authors: Majumder, Arindam
Laha, Dipak
Suganthan, Ponnuthurai Nagaratnam
Keywords: Engineering::Electrical and electronic engineering
Issue Date: 2018
Source: Majumder, A., Laha, D., & Suganthan, P. N. (2018). A hybrid cuckoo search algorithm in parallel batch processing machines with unequal job ready times. Computer & Industrial Engineering, 124, 65-76. doi:10.1016/j.cie.2018.07.001
Journal: Computers & Industrial Engineering
Abstract: This paper deals with the problem of scheduling identical parallel batch processing machines. In this scheduling system, each machine processes a set of jobs in a batch simultaneously and each job in the batch is characterized by its processing time, ready time and job size. We propose a hybrid discrete cuckoo search (HDCS) algorithm to minimize makespan for this scheduling problem. The HDCS is constructed, based on a modified variable neighborhood search and cuckoo search algorithm. In the proposed algorithm, we present a modified Lévy flight in the cuckoo search to transform a continuous position in the HDCS into a discrete schedule for generating a new solution. The process parameters of the proposed HDCS are tuned by implementing the desirability-based Taguchi method to optimize both solution quality and run time. The results of exhaustive computational experimentation on a large number of randomly generated sparse as well as non-sparse problem instances show that the proposed algorithm is more effective and efficient than the state-of-the-art algorithms.
ISSN: 0360-8352
DOI: 10.1016/j.cie.2018.07.001
Rights: © 2018 Elsevier Ltd. All rights reserved.
Fulltext Permission: none
Fulltext Availability: No Fulltext
Appears in Collections:EEE Journal Articles

Citations 20

Updated on Mar 2, 2021

Citations 20

Updated on Mar 7, 2021

Page view(s)

Updated on Jan 17, 2022

Google ScholarTM




Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.