A hybrid cuckoo search algorithm in parallel batch processing machines with unequal job ready times
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 disc...
| Main Authors: | , , |
|---|---|
| Other Authors: | |
| Format: | Journal Article |
| Language: | English |
| Published: |
2020
|
| Subjects: | |
| Online Access: | https://hdl.handle.net/10356/141031 |
| _version_ | 1826117090038251520 |
|---|---|
| author | Majumder, Arindam Laha, Dipak Suganthan, Ponnuthurai Nagaratnam |
| author2 | School of Electrical and Electronic Engineering |
| author_facet | School of Electrical and Electronic Engineering Majumder, Arindam Laha, Dipak Suganthan, Ponnuthurai Nagaratnam |
| author_sort | Majumder, Arindam |
| collection | NTU |
| description | 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. |
| first_indexed | 2024-10-01T04:22:03Z |
| format | Journal Article |
| id | ntu-10356/141031 |
| institution | Nanyang Technological University |
| language | English |
| last_indexed | 2024-10-01T04:22:03Z |
| publishDate | 2020 |
| record_format | dspace |
| spelling | ntu-10356/1410312020-06-03T08:01:40Z A hybrid cuckoo search algorithm in parallel batch processing machines with unequal job ready times Majumder, Arindam Laha, Dipak Suganthan, Ponnuthurai Nagaratnam School of Electrical and Electronic Engineering Engineering::Electrical and electronic engineering Scheduling Parallel Batch Processing Machines 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. 2020-06-03T08:01:39Z 2020-06-03T08:01:39Z 2018 Journal Article 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 0360-8352 https://hdl.handle.net/10356/141031 10.1016/j.cie.2018.07.001 2-s2.0-85049895660 124 65 76 en Computers & Industrial Engineering © 2018 Elsevier Ltd. All rights reserved. |
| spellingShingle | Engineering::Electrical and electronic engineering Scheduling Parallel Batch Processing Machines Majumder, Arindam Laha, Dipak Suganthan, Ponnuthurai Nagaratnam A hybrid cuckoo search algorithm in parallel batch processing machines with unequal job ready times |
| title | A hybrid cuckoo search algorithm in parallel batch processing machines with unequal job ready times |
| title_full | A hybrid cuckoo search algorithm in parallel batch processing machines with unequal job ready times |
| title_fullStr | A hybrid cuckoo search algorithm in parallel batch processing machines with unequal job ready times |
| title_full_unstemmed | A hybrid cuckoo search algorithm in parallel batch processing machines with unequal job ready times |
| title_short | A hybrid cuckoo search algorithm in parallel batch processing machines with unequal job ready times |
| title_sort | hybrid cuckoo search algorithm in parallel batch processing machines with unequal job ready times |
| topic | Engineering::Electrical and electronic engineering Scheduling Parallel Batch Processing Machines |
| url | https://hdl.handle.net/10356/141031 |
| work_keys_str_mv | AT majumderarindam ahybridcuckoosearchalgorithminparallelbatchprocessingmachineswithunequaljobreadytimes AT lahadipak ahybridcuckoosearchalgorithminparallelbatchprocessingmachineswithunequaljobreadytimes AT suganthanponnuthurainagaratnam ahybridcuckoosearchalgorithminparallelbatchprocessingmachineswithunequaljobreadytimes AT majumderarindam hybridcuckoosearchalgorithminparallelbatchprocessingmachineswithunequaljobreadytimes AT lahadipak hybridcuckoosearchalgorithminparallelbatchprocessingmachineswithunequaljobreadytimes AT suganthanponnuthurainagaratnam hybridcuckoosearchalgorithminparallelbatchprocessingmachineswithunequaljobreadytimes |