Improved Jaya Algorithm for Flexible Job Shop Rescheduling Problem
Machine recovery is met from time to time in real-life production. Rescheduling is often a necessary procedure to cope with it. Its instability gauges the number of changes to the existing scheduling solutions. It is a key criterion to measure a rescheduling solution's quality. This work aims a...
Saved in:
| Published in | IEEE access Vol. 8; pp. 86915 - 86922 |
|---|---|
| Main Authors | , , , , |
| Format | Journal Article |
| Language | English |
| Published |
Piscataway
IEEE
2020
The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| Subjects | |
| Online Access | Get full text |
| ISSN | 2169-3536 2169-3536 |
| DOI | 10.1109/ACCESS.2020.2992478 |
Cover
| Abstract | Machine recovery is met from time to time in real-life production. Rescheduling is often a necessary procedure to cope with it. Its instability gauges the number of changes to the existing scheduling solutions. It is a key criterion to measure a rescheduling solution's quality. This work aims at solving a flexible job shop problem with machine recovery, which arises from the scheduling and rescheduling of pump remanufacturing systems. In their scheduling phase, the objective is to minimize makespan. In their rescheduling phase, two objectives are to minimize both instability and makespan. By introducing two novel local search operators into the original Jaya algorithm, this work proposes an improved Jaya algorithm to solve it. It performs experiments on ten different-scale cases of real-life remanufacturing environment. The results show that the improved Jaya is effective and efficient for solving a flexible job shop scheduling and rescheduling problems. It can effectively balance instability and makespan in a rescheduling phase. |
|---|---|
| AbstractList | Machine recovery is met from time to time in real-life production. Rescheduling is often a necessary procedure to cope with it. Its instability gauges the number of changes to the existing scheduling solutions. It is a key criterion to measure a rescheduling solution's quality. This work aims at solving a flexible job shop problem with machine recovery, which arises from the scheduling and rescheduling of pump remanufacturing systems. In their scheduling phase, the objective is to minimize makespan. In their rescheduling phase, two objectives are to minimize both instability and makespan. By introducing two novel local search operators into the original Jaya algorithm, this work proposes an improved Jaya algorithm to solve it. It performs experiments on ten different-scale cases of real-life remanufacturing environment. The results show that the improved Jaya is effective and efficient for solving a flexible job shop scheduling and rescheduling problems. It can effectively balance instability and makespan in a rescheduling phase. |
| Author | Gao, Kaizhou Luo, Jianping Sang, Hongyan Li, Junqing Yang, Fajun |
| Author_xml | – sequence: 1 givenname: Kaizhou orcidid: 0000-0002-9252-6928 surname: Gao fullname: Gao, Kaizhou organization: Macau Institute of Systems Engineering, Macau University of Science and Technology, Taipa, China – sequence: 2 givenname: Fajun orcidid: 0000-0002-5522-2714 surname: Yang fullname: Yang, Fajun email: fjyang1116@foxmail.com organization: School of Mathematics and Computer Science, University of Hagen, Hagen, Germany – sequence: 3 givenname: Junqing orcidid: 0000-0002-3617-6708 surname: Li fullname: Li, Junqing organization: School of Computer, Liaocheng University, Liaocheng, China – sequence: 4 givenname: Hongyan orcidid: 0000-0001-7476-5039 surname: Sang fullname: Sang, Hongyan organization: School of Computer, Liaocheng University, Liaocheng, China – sequence: 5 givenname: Jianping surname: Luo fullname: Luo, Jianping organization: College of Information Engineering, Shenzhen University, Shenzhen, China |
| BookMark | eNp9kU1v2zAMhoWhA9p1_QW9GOg5KSXZ-jimQbulKLBhWc-CPqhEgWNlslOs_35u3Q3DDuOFBMnnBYn3AznpcoeEXFKYUwr6erFc3q7XcwYM5kxrVkv1jpwxKvSMN1yc_FWfkou-38EYamw18ozcrPaHkp8wVPf22VaLdpNLGrb7KuZS3bX4M7kWq_vsqvU2H6pv2PsthmObuk31teRxuP9I3kfb9njxls_J493t9-Xn2cOXT6vl4mHma1DDTEqUPoBljjNoEILkjaBM-dpGa71GFyXEwJs60hA9t-hFY5XgNWU-SsfPyWrSDdnuzKGkvS3PJttkXhu5bIwtQ_ItGnSaOmBeB61rrqRjUSnhHLigtLN21LqatMbnfxyxH8wuH0s3nm9Y3dQUKAg9bulpy5fc9wWj8WmwQ8rdUGxqDQXz4oCZHDAvDpg3B0aW_8P-vvj_1OVEJUT8Q2hQQkDDfwFKupOG |
| CODEN | IAECCG |
| CitedBy_id | crossref_primary_10_3390_pr11030755 crossref_primary_10_1016_j_compeleceng_2024_109813 crossref_primary_10_1109_ACCESS_2020_3028617 crossref_primary_10_3390_math13060932 crossref_primary_10_1007_s12555_023_0578_1 crossref_primary_10_1016_j_ejor_2024_07_030 crossref_primary_10_1016_j_engappai_2024_108572 crossref_primary_10_1109_ACCESS_2024_3384252 crossref_primary_10_1007_s00170_021_08163_3 crossref_primary_10_1007_s11831_021_09585_8 crossref_primary_10_1016_j_simpat_2024_102948 crossref_primary_10_3233_JIFS_223827 crossref_primary_10_1007_s11356_023_26219_7 crossref_primary_10_1016_j_jmsy_2024_03_002 crossref_primary_10_3390_a17100470 crossref_primary_10_1007_s00500_023_09393_1 crossref_primary_10_1109_ACCESS_2021_3076732 crossref_primary_10_1016_j_jmsy_2021_05_018 crossref_primary_10_1016_j_jmsy_2024_03_005 |
| Cites_doi | 10.1109/TASE.2017.2741965 10.1109/TASE.2013.2274517 10.1109/TEVC.2003.810067 10.1007/s00170-013-4923-z 10.1007/BF02238804 10.1080/00207540210147043 10.1007/s00170-018-2805-0 10.1109/TCYB.2019.2901834 10.1109/TSMC.2017.2782009 10.1016/j.engappai.2017.01.008 10.1080/00207543.2018.1468095 10.1016/j.ins.2014.07.039 10.1016/j.ins.2018.03.012 10.1016/j.cie.2015.04.029 10.1016/j.ijpe.2012.03.034 10.1016/j.engappai.2017.03.001 10.1109/TASE.2016.2642997 10.1016/j.cor.2016.03.009 10.1109/TASE.2019.2953669 10.1016/S0377-2217(98)00113-1 10.1016/j.asoc.2016.08.046 10.1016/j.engappai.2018.10.008 10.1016/j.knosys.2016.06.014 10.1287/moor.1.2.117 10.1016/j.cor.2015.02.014 10.1007/s00170-010-2621-7 10.1109/4235.996017 10.1109/TASE.2016.2631491 10.1080/00207543.2013.784408 10.1016/j.apenergy.2019.01.008 10.1109/TASE.2019.2958979 10.1109/TSTE.2017.2714705 10.1016/j.eswa.2015.06.004 10.1016/j.ins.2016.08.046 10.1109/TCYB.2015.2478486 10.1016/j.engappai.2018.10.003 10.1287/mnsc.1030.0186 10.1016/j.cie.2017.03.006 10.1007/s00170-012-4344-4 10.1016/j.ijpe.2011.04.020 10.1007/s10845-014-0869-8 10.1109/TFUZZ.2019.2895562 10.1080/00207543.2018.1467575 10.1109/TCYB.2016.2574766 10.1109/TCYB.2018.2817240 10.1109/TSM.2017.2758380 10.1016/j.asoc.2017.10.001 |
| ContentType | Journal Article |
| Copyright | Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2020 |
| Copyright_xml | – notice: Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2020 |
| DBID | 97E ESBDL RIA RIE AAYXX CITATION 7SC 7SP 7SR 8BQ 8FD JG9 JQ2 L7M L~C L~D DOA |
| DOI | 10.1109/ACCESS.2020.2992478 |
| DatabaseName | IEEE Xplore (IEEE) IEEE Xplore Open Access Journals IEEE All-Society Periodicals Package (ASPP) 1998–Present IEEE Electronic Library (IEL) CrossRef Computer and Information Systems Abstracts Electronics & Communications Abstracts Engineered Materials Abstracts METADEX Technology Research Database Materials Research Database ProQuest Computer Science Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional DOAJ Directory of Open Access Journals |
| DatabaseTitle | CrossRef Materials Research Database Engineered Materials Abstracts Technology Research Database Computer and Information Systems Abstracts – Academic Electronics & Communications Abstracts ProQuest Computer Science Collection Computer and Information Systems Abstracts Advanced Technologies Database with Aerospace METADEX Computer and Information Systems Abstracts Professional |
| DatabaseTitleList | Materials Research Database |
| Database_xml | – sequence: 1 dbid: DOA name: DOAJ Directory of Open Access Journals url: https://www.doaj.org/ sourceTypes: Open Website – sequence: 2 dbid: RIE name: IEEE Electronic Library (IEL) url: https://proxy.k.utb.cz/login?url=https://ieeexplore.ieee.org/ sourceTypes: Publisher |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering |
| EISSN | 2169-3536 |
| EndPage | 86922 |
| ExternalDocumentID | oai_doaj_org_article_eb91b02c9d994387b2f886bb0bd89baa 10_1109_ACCESS_2020_2992478 9086605 |
| Genre | orig-research |
| GrantInformation_xml | – fundername: Alexander von Humboldt Foundation funderid: 10.13039/100005156 – fundername: Shandong Province Colleges and Universities Youth Innovation Talent Introduction and Education Program – fundername: National Natural Science Foundation of China grantid: 61603169; 61773192; 61503170; 61803192 funderid: 10.13039/501100001809 – fundername: Shandong Provincial Key Laboratory for Novel Distributed Computer Software Technology |
| GroupedDBID | 0R~ 4.4 5VS 6IK 97E AAJGR ABAZT ABVLG ACGFS ADBBV AGSQL ALMA_UNASSIGNED_HOLDINGS BCNDV BEFXN BFFAM BGNUA BKEBE BPEOZ EBS EJD ESBDL GROUPED_DOAJ IPLJI JAVBF KQ8 M43 M~E O9- OCL OK1 RIA RIE RNS AAYXX CITATION RIG 7SC 7SP 7SR 8BQ 8FD JG9 JQ2 L7M L~C L~D |
| ID | FETCH-LOGICAL-c408t-77e7cd0a2b3205e0d7356128c4afaac9ebf70fd354f1dfc3aec65a863412cf7b3 |
| IEDL.DBID | DOA |
| ISSN | 2169-3536 |
| IngestDate | Wed Aug 27 01:23:58 EDT 2025 Sun Jun 29 16:48:20 EDT 2025 Tue Jul 01 01:22:32 EDT 2025 Thu Apr 24 23:08:33 EDT 2025 Wed Aug 27 02:41:40 EDT 2025 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Language | English |
| License | https://creativecommons.org/licenses/by/4.0/legalcode |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c408t-77e7cd0a2b3205e0d7356128c4afaac9ebf70fd354f1dfc3aec65a863412cf7b3 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
| ORCID | 0000-0001-7476-5039 0000-0002-9252-6928 0000-0002-5522-2714 0000-0002-3617-6708 |
| OpenAccessLink | https://doaj.org/article/eb91b02c9d994387b2f886bb0bd89baa |
| PQID | 2454101069 |
| PQPubID | 4845423 |
| PageCount | 8 |
| ParticipantIDs | crossref_citationtrail_10_1109_ACCESS_2020_2992478 doaj_primary_oai_doaj_org_article_eb91b02c9d994387b2f886bb0bd89baa ieee_primary_9086605 crossref_primary_10_1109_ACCESS_2020_2992478 proquest_journals_2454101069 |
| ProviderPackageCode | CITATION AAYXX |
| PublicationCentury | 2000 |
| PublicationDate | 20200000 2020-00-00 20200101 2020-01-01 |
| PublicationDateYYYYMMDD | 2020-01-01 |
| PublicationDate_xml | – year: 2020 text: 20200000 |
| PublicationDecade | 2020 |
| PublicationPlace | Piscataway |
| PublicationPlace_xml | – name: Piscataway |
| PublicationTitle | IEEE access |
| PublicationTitleAbbrev | Access |
| PublicationYear | 2020 |
| Publisher | IEEE The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| Publisher_xml | – name: IEEE – name: The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| References | ref35 ref13 ref34 ref12 ref37 ref15 ref36 ref14 ref31 ref30 tao (ref28) 2018; 56 ref33 ref11 ref10 ref2 ref1 ref39 ref17 ref38 ref16 ref19 ref18 ref46 ref24 ref45 ref23 ref48 ref26 ref47 ref25 ref20 ref42 ref41 ref22 ref44 ref21 ref43 ref27 ref29 rao (ref32) 2016; 7 ref8 ref7 ref9 ref4 ref3 ref6 ref5 ref40 |
| References_xml | – ident: ref47 doi: 10.1109/TASE.2017.2741965 – ident: ref29 doi: 10.1109/TASE.2013.2274517 – ident: ref26 doi: 10.1109/TEVC.2003.810067 – ident: ref17 doi: 10.1007/s00170-013-4923-z – ident: ref1 doi: 10.1007/BF02238804 – ident: ref24 doi: 10.1080/00207540210147043 – ident: ref6 doi: 10.1007/s00170-018-2805-0 – ident: ref43 doi: 10.1109/TCYB.2019.2901834 – ident: ref45 doi: 10.1109/TSMC.2017.2782009 – ident: ref36 doi: 10.1016/j.engappai.2017.01.008 – ident: ref42 doi: 10.1080/00207543.2018.1468095 – ident: ref41 doi: 10.1016/j.ins.2014.07.039 – ident: ref40 doi: 10.1016/j.ins.2018.03.012 – ident: ref9 doi: 10.1016/j.cie.2015.04.029 – ident: ref38 doi: 10.1016/j.ijpe.2012.03.034 – ident: ref31 doi: 10.1016/j.engappai.2017.03.001 – ident: ref44 doi: 10.1109/TASE.2016.2642997 – ident: ref5 doi: 10.1016/j.cor.2016.03.009 – ident: ref46 doi: 10.1109/TASE.2019.2953669 – ident: ref23 doi: 10.1016/S0377-2217(98)00113-1 – ident: ref12 doi: 10.1016/j.asoc.2016.08.046 – ident: ref7 doi: 10.1016/j.engappai.2018.10.008 – ident: ref15 doi: 10.1016/j.knosys.2016.06.014 – ident: ref2 doi: 10.1287/moor.1.2.117 – ident: ref21 doi: 10.1016/j.cor.2015.02.014 – ident: ref22 doi: 10.1007/s00170-010-2621-7 – ident: ref39 doi: 10.1109/4235.996017 – ident: ref11 doi: 10.1109/TASE.2016.2631491 – ident: ref19 doi: 10.1080/00207543.2013.784408 – volume: 7 start-page: 19 year: 2016 ident: ref32 article-title: Jaya: A simple and new optimization algorithm for solving constrained and unconstrained optimization problems publication-title: Int J Ind Eng Comput – ident: ref30 doi: 10.1016/j.apenergy.2019.01.008 – ident: ref48 doi: 10.1109/TASE.2019.2958979 – ident: ref35 doi: 10.1109/TSTE.2017.2714705 – ident: ref14 doi: 10.1016/j.eswa.2015.06.004 – ident: ref10 doi: 10.1016/j.ins.2016.08.046 – ident: ref3 doi: 10.1109/TCYB.2015.2478486 – ident: ref33 doi: 10.1016/j.engappai.2018.10.003 – ident: ref37 doi: 10.1287/mnsc.1030.0186 – ident: ref20 doi: 10.1016/j.cie.2017.03.006 – ident: ref18 doi: 10.1007/s00170-012-4344-4 – ident: ref16 doi: 10.1016/j.ijpe.2011.04.020 – ident: ref27 doi: 10.1007/s10845-014-0869-8 – ident: ref8 doi: 10.1109/TFUZZ.2019.2895562 – volume: 56 start-page: 5278 year: 2018 ident: ref28 article-title: A hybrid artificial bee colony algorithm for a flexible job shop scheduling problem with overlapping in operations publication-title: Int J Prod Res doi: 10.1080/00207543.2018.1467575 – ident: ref4 doi: 10.1109/TCYB.2016.2574766 – ident: ref13 doi: 10.1109/TCYB.2018.2817240 – ident: ref25 doi: 10.1109/TSM.2017.2758380 – ident: ref34 doi: 10.1016/j.asoc.2017.10.001 |
| SSID | ssj0000816957 |
| Score | 2.2760837 |
| Snippet | Machine recovery is met from time to time in real-life production. Rescheduling is often a necessary procedure to cope with it. Its instability gauges the... |
| SourceID | doaj proquest crossref ieee |
| SourceType | Open Website Aggregation Database Enrichment Source Index Database Publisher |
| StartPage | 86915 |
| SubjectTerms | Algorithms Dynamic scheduling Electric breakdown flexible job shop scheduling Gauges Genetic algorithms Jaya algorithm Job shop scheduling Job shops machine recovery Pumps Recovery Remanufacturing Rescheduling Schedules Scheduling scheduling and rescheduling Stability |
| SummonAdditionalLinks | – databaseName: IEEE Electronic Library (IEL) dbid: RIE link: http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV1Nb9QwELVKT3CglIJYKJUPPTZbxx-xfdyuWFUrFVVApd4se2xTxHZTleyh_HrsxBtVgBC3KLKtid_YM5543iB0TG2swXFfcdY0FY9KVyopTtWImgmgTHCWc4cvPjbnV3x5La530MmYCxNC6C-fhWl-7P_l-xY2OVR2qpP_3WTC0idJzYZcrTGekgtIaCELsVBN9OlsPk_fkI6AlEzTpkt5LqX2yPj0HP2lqMofO3FvXhZ76GIr2HCr5Pt007kp_PyNs_F_JX-Bnhc_E88GxdhHO2H9Ej17xD54gM6GgELweGkfLJ6tvrb337qbW5z8WLzIRJluFfCydfjzTXuHP4V0EE6GKeev48uhDs0rdLX48GV-XpWSChVworrkSwcJnljqGCUiEC9ZLo-pgNtoLejgoiTRJ4hi7SMwG6ARVjXJ1lGI0rHXaHfdrsMbhBVoQWVwWknPQaYxieLcJ38IOHirJ4hu59pA4RvPZS9Wpj93EG0GgEwGyBSAJuhk7HQ30G38u_lZBnFsmrmy-xdp8k1ZeiaJWDtCQXutOVPS0ahU4xxxXmln7QQdZMDGQQpWE3S4VQlT1vUPQ7ngdT5G67d_7_UOPc0CDkGaQ7Tb3W_C--S2dO6o19dfSe3ofQ priority: 102 providerName: IEEE |
| Title | Improved Jaya Algorithm for Flexible Job Shop Rescheduling Problem |
| URI | https://ieeexplore.ieee.org/document/9086605 https://www.proquest.com/docview/2454101069 https://doaj.org/article/eb91b02c9d994387b2f886bb0bd89baa |
| Volume | 8 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV3LSgMxFA3iShfiE-ujZOHSsZk8JsmyFosUFFEL3YU8dVFb0brw772ZGUtB0I3bIZOZnJvJvSdMzkHojNpUesdDwVlVFTwpXSiYOEUlSiY8ZYKzfHb45ra6HvPRRExWrL7yP2GNPHADXC86XTpCvQ5ac6ako0mpyjnigtLO1qUR0WSFTNVrsCorLWQrM1QS3esPBjAiIISUXMASTHk2VltJRbVif2ux8mNdrpPNcBtttVUi7jdvt4PW4mwXba5oB-6hy2Y7IAY8sp8W96dPc-D5zy8YqlA8zDKXbhrxaO7ww_P8Fd9HoLGQVvLpc3zXuMjso_Hw6nFwXbSGCIXnRC2gEo7SB2KpY5SISIJk2dxSeW6TtV5HlyRJAQBOZUie2egrYVUFmYr6JB07QOuz-SweIqy8FlQCuEoG7iX0SRTnAaoZz32wuoPoNzbGt2rh2bRiamrWQLRpADUZUNMC2kHny5teG7GM35tfZtCXTbPSdX0B4m_a-Ju_4t9Bezlky040cDSgaB108h1C036V74ZywctMgvXRfzz6GG3k4TQbMidoffH2EU-hRFm4bj0bu_Vpwi8sX-Dl |
| linkProvider | Directory of Open Access Journals |
| linkToHtml | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV1Lb9QwEB5V5QAcyqMgFgr4wLHZOn7E9nG7YrUs3QpBK_Vm-ZUWsWyqNnuAX4-deKMKEOIWRbY18Tf2jCeebwDeEVOXzjJfMFpVBaulKmRUnKLiJeWOUM5oyh1enlbzc7a44Bc7cDjkwoQQustnYZweu3_5vnGbFCo7UtH_rhJh6b1o9xnvs7WGiEoqIaG4yNRCJVZHk-k0fkU8BBI8jtsuYamY2h3z07H057Iqf-zFnYGZPYLlVrT-Xsm38aa1Y_fzN9bG_5X9MexlTxNNetV4Ajth_RQe3uEf3IfjPqQQPFqYHwZNVpfNzdf26juKniyaJapMuwpo0Vj05aq5Rp9DPApH05Qy2NGnvhLNMzifvT-bzotcVKFwDMs2etNBOI8NsZRgHrAXNBXIlI6Z2hingq0Frn0EqS597agJruJGVtHaEVcLS5_D7rpZhxeApFOciGCVFJ45EcfEkjEfPSLHnDdqBGQ719plxvFU-GKlu5MHVroHSCeAdAZoBIdDp-uecOPfzY8TiEPTxJbdvYiTr_Pi01HE0mLilFeKUSksqaWsrMXWS2WNGcF-AmwYJGM1goOtSui8sm81iZpXpoO0evn3Xm_h_vxseaJPPpx-fAUPkrB9yOYAdtubTXgdnZjWvul09xebGuvK |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Improved+Jaya+Algorithm+for+Flexible+Job+Shop+Rescheduling+Problem&rft.jtitle=IEEE+access&rft.au=Gao%2C+Kaizhou&rft.au=Yang%2C+Fajun&rft.au=Li%2C+Junqing&rft.au=Sang%2C+Hongyan&rft.date=2020&rft.issn=2169-3536&rft.eissn=2169-3536&rft.volume=8&rft.spage=86915&rft.epage=86922&rft_id=info:doi/10.1109%2FACCESS.2020.2992478&rft.externalDBID=n%2Fa&rft.externalDocID=10_1109_ACCESS_2020_2992478 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=2169-3536&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=2169-3536&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=2169-3536&client=summon |