A knowledge-guided fruit fly optimization algorithm for dual resource constrained flexible job-shop scheduling problem
Different from the classical job shop scheduling, the dual-resource constrained flexible job-shop scheduling problem (DRCFJSP) should deal with job sequence, machine assignment and worker assignment all together. In this paper, a knowledge-guided fruit fly optimisation algorithm (KGFOA) with a new e...
Saved in:
Published in | International journal of production research Vol. 54; no. 18; pp. 5554 - 5566 |
---|---|
Main Authors | , |
Format | Journal Article |
Language | English |
Published |
London
Taylor & Francis
16.09.2016
Taylor & Francis LLC |
Subjects | |
Online Access | Get full text |
ISSN | 0020-7543 1366-588X |
DOI | 10.1080/00207543.2016.1170226 |
Cover
Loading…
Abstract | Different from the classical job shop scheduling, the dual-resource constrained flexible job-shop scheduling problem (DRCFJSP) should deal with job sequence, machine assignment and worker assignment all together. In this paper, a knowledge-guided fruit fly optimisation algorithm (KGFOA) with a new encoding scheme is proposed to solve the DRCFJSP with makespan minimisation criterion. In the KGFOA, two types of permutation-based search operators are used to perform the smell-based search for job sequence and resource (machine and worker) assignment, respectively. To enhance the search capability, a knowledge-guided search stage is incorporated into the KGFOA with two new search operators particularly designed for adjusting the operation sequence and the resource assignment, respectively. Due to the combination of the knowledge-guided search and the smell-based search, global exploration and local exploitation can be balanced. Besides, the effect of parameter setting of the KGFOA is investigated and numerical tests are carried out using two sets of instances. The comparative results show that the KGFOA is more effective than the existing algorithms in solving the DRCFJSP. |
---|---|
AbstractList | Different from the classical job shop scheduling, the dual-resource constrained flexible job-shop scheduling problem (DRCFJSP) should deal with job sequence, machine assignment and worker assignment all together. In this paper, a knowledge-guided fruit fly optimisation algorithm (KGFOA) with a new encoding scheme is proposed to solve the DRCFJSP with makespan minimisation criterion. In the KGFOA, two types of permutation-based search operators are used to perform the smell-based search for job sequence and resource (machine and worker) assignment, respectively. To enhance the search capability, a knowledge-guided search stage is incorporated into the KGFOA with two new search operators particularly designed for adjusting the operation sequence and the resource assignment, respectively. Due to the combination of the knowledge-guided search and the smell-based search, global exploration and local exploitation can be balanced. Besides, the effect of parameter setting of the KGFOA is investigated and numerical tests are carried out using two sets of instances. The comparative results show that the KGFOA is more effective than the existing algorithms in solving the DRCFJSP. |
Author | Zheng, Xiao-long Wang, Ling |
Author_xml | – sequence: 1 givenname: Xiao-long surname: Zheng fullname: Zheng, Xiao-long organization: Tsinghua National Laboratory for Information Science and Technology (TNList), Department of Automation, Tsinghua University – sequence: 2 givenname: Ling surname: Wang fullname: Wang, Ling email: wangling@mail.tsinghua.edu.cn organization: Tsinghua National Laboratory for Information Science and Technology (TNList), Department of Automation, Tsinghua University |
BookMark | eNqFkU9vFCEYh4mpidvqRzAh8eJl1pdhYNh4sWn8lzTx0ibeCAPMLisDKzDW9dPLdOulB8uFEJ7nhff9naOzEINF6DWBNQEB7wBa6FlH1y0Qviakh7blz9CKUM4bJsT3M7RamGaBXqDznPdQFxPdCv26xD9CvPPWbG2znZ2xBo9pdgWP_ojjobjJ_VHFxYCV38bkym7CY0zYzMrjZHOck7ZYx5BLUi4sure_3eAt3sehybt4wFnvrJm9C1t8SLFeTS_R81H5bF897Bfo9tPHm6svzfW3z1-vLq8b3QlWGgF86HsARW1PQeuRbAzQDdF8EKLXsFnOQvC2VUSNzPChVbbnjIxAe2oEvUBvT3Xruz9nm4ucXNbWexVsnLMkgjLOKCG0om8eofvaW6i_qxR0G9IR2lXq_YnSKeac7Ci1K_fzWdr3koBcMpH_MpFLJvIhk2qzR_YhuUml45Peh5PnQp39pO5i8kYWdfQxjUkF7bKk_y_xF4dlpa0 |
CitedBy_id | crossref_primary_10_1007_s00291_018_0537_z crossref_primary_10_3390_su141912120 crossref_primary_10_1080_21681015_2020_1799084 crossref_primary_10_1109_TCYB_2018_2817240 crossref_primary_10_1016_j_cie_2020_106605 crossref_primary_10_1016_j_procir_2020_05_225 crossref_primary_10_1080_00207543_2018_1497313 crossref_primary_10_1007_s10462_023_10451_1 crossref_primary_10_1016_j_procs_2021_02_048 crossref_primary_10_1007_s11081_020_09494_y crossref_primary_10_1007_s12063_023_00371_2 crossref_primary_10_1007_s10479_019_03196_0 crossref_primary_10_3390_machines9060108 crossref_primary_10_1016_j_cie_2022_108487 crossref_primary_10_1007_s10696_022_09446_x crossref_primary_10_1080_00207543_2021_1937745 crossref_primary_10_1080_00207543_2019_1653504 crossref_primary_10_1016_j_ifacol_2022_10_049 crossref_primary_10_1111_exsy_13669 crossref_primary_10_3390_math10234607 crossref_primary_10_3389_fenvs_2022_873939 crossref_primary_10_1007_s11081_023_09842_8 crossref_primary_10_1016_j_eswa_2023_119644 crossref_primary_10_1016_j_cie_2021_107738 crossref_primary_10_1109_ACCESS_2021_3106797 crossref_primary_10_1016_j_ejor_2022_03_045 crossref_primary_10_1016_j_engappai_2020_103807 crossref_primary_10_1007_s12555_023_0578_1 crossref_primary_10_3389_fmats_2019_00269 crossref_primary_10_1007_s12652_020_02226_1 crossref_primary_10_1109_ACCESS_2020_2999680 crossref_primary_10_1109_ACCESS_2019_2897603 crossref_primary_10_3390_s23010090 crossref_primary_10_1016_j_engappai_2023_106347 crossref_primary_10_1080_24751839_2024_2425478 crossref_primary_10_1016_j_engappai_2020_104004 crossref_primary_10_1016_j_eswa_2024_123556 crossref_primary_10_1016_j_cor_2022_105823 crossref_primary_10_1016_j_compeleceng_2024_109813 crossref_primary_10_1016_j_swevo_2024_101619 crossref_primary_10_3233_JIFS_211399 crossref_primary_10_1360_SST_2021_0355 crossref_primary_10_1016_j_tre_2024_103727 crossref_primary_10_1016_j_ifacol_2019_11_134 crossref_primary_10_1155_2018_4617816 crossref_primary_10_1080_00207543_2019_1677963 crossref_primary_10_1080_0951192X_2022_2078513 crossref_primary_10_1016_j_cie_2024_110419 crossref_primary_10_1007_s00521_021_06504_7 crossref_primary_10_1038_s41598_024_80785_5 crossref_primary_10_1007_s11356_023_26986_3 crossref_primary_10_1016_j_eswa_2020_113754 crossref_primary_10_1016_j_eswa_2022_117182 crossref_primary_10_1016_j_cie_2021_107557 crossref_primary_10_1109_ACCESS_2019_2916468 crossref_primary_10_1080_00207543_2024_2357740 crossref_primary_10_1080_00207543_2018_1437288 crossref_primary_10_1016_j_cie_2022_108508 crossref_primary_10_1016_j_knosys_2021_107430 crossref_primary_10_1049_iet_cim_2018_0009 crossref_primary_10_1080_00207543_2024_2392198 crossref_primary_10_1007_s00500_023_09304_4 crossref_primary_10_1007_s10696_023_09514_w crossref_primary_10_1016_j_promfg_2020_01_359 crossref_primary_10_3233_JIFS_212258 crossref_primary_10_1080_00207543_2019_1597291 crossref_primary_10_1007_s11771_021_4777_8 crossref_primary_10_3390_app13085190 crossref_primary_10_1049_cim2_12005 crossref_primary_10_1016_j_cie_2024_109883 crossref_primary_10_1016_j_ifacol_2019_11_144 crossref_primary_10_1088_1361_665X_ab6ba5 crossref_primary_10_1007_s00500_024_09763_3 crossref_primary_10_1049_cim2_12003 crossref_primary_10_1016_j_swevo_2022_101204 crossref_primary_10_1016_j_jmsy_2023_01_004 |
Cites_doi | 10.1023/A:1018930406487 10.1016/0272-6963(85)90035-X 10.1016/S0007-8506(07)63204-1 10.1109/MCI.2010.936309 10.1111/deci.1974.5.issue-1 10.1016/j.knosys.2011.07.001 10.1016/j.ejor.2011.03.004 10.1016/j.asoc.2012.03.025 10.1007/s00521-011-0769-1 10.1016/j.cor.2012.07.003 10.1126/science.1111280 10.1007/978-1-4614-2361-4 10.1016/j.knosys.2014.08.022 10.1080/0740817X.2014.892231 10.1016/S0305-0548(99)00038-6 10.1016/j.knosys.2013.12.011 10.1007/BF02023073 10.1080/00207543.2013.849822 10.1016/j.cor.2007.02.014 10.1080/00207540110047702 10.4304/jsw.6.4.584-594 10.1080/00207540601138510 |
ContentType | Journal Article |
Copyright | 2016 Informa UK Limited, trading as Taylor & Francis Group 2016 2016 Informa UK Limited, trading as Taylor & Francis Group |
Copyright_xml | – notice: 2016 Informa UK Limited, trading as Taylor & Francis Group 2016 – notice: 2016 Informa UK Limited, trading as Taylor & Francis Group |
DBID | AAYXX CITATION 7SC 8FD F28 FR3 JQ2 L7M L~C L~D |
DOI | 10.1080/00207543.2016.1170226 |
DatabaseName | CrossRef Computer and Information Systems Abstracts Technology Research Database ANTE: Abstracts in New Technology & Engineering Engineering Research Database ProQuest Computer Science Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional |
DatabaseTitle | CrossRef Technology Research Database Computer and Information Systems Abstracts – Academic ProQuest Computer Science Collection Computer and Information Systems Abstracts Engineering Research Database Advanced Technologies Database with Aerospace ANTE: Abstracts in New Technology & Engineering Computer and Information Systems Abstracts Professional |
DatabaseTitleList | Technology Research Database Technology Research Database |
DeliveryMethod | fulltext_linktorsrc |
Discipline | Engineering |
EISSN | 1366-588X |
EndPage | 5566 |
ExternalDocumentID | 4120525211 10_1080_00207543_2016_1170226 1170226 |
Genre | Article Feature |
GrantInformation_xml | – fundername: National Science Fund for Distinguished Young Scholars of China grantid: 61525304 – fundername: National Key Basic Research and Development Program of China grantid: 2013CB329503 – fundername: National Natural Science Foundation of China grantid: 61174189 |
GroupedDBID | -~X .7F .QJ 0BK 0R~ 29J 2DF 30N 4.4 5GY 5VS 8VB A8Z AAENE AAJMT AALDU AAMIU AAPUL AAQRR ABCCY ABFIM ABHAV ABJNI ABLIJ ABPAQ ABPEM ABTAI ABXUL ABXYU ACGEJ ACGFO ACGFS ACGOD ACIWK ACNCT ACTIO ADCVX ADGTB ADXPE AEGXH AEISY AEMOZ AENEX AEOZL AEPSL AEYOC AFKVX AGDLA AGMYJ AHDZW AHQJS AIAGR AIJEM AJWEG AKBVH AKOOK AKVCP ALMA_UNASSIGNED_HOLDINGS ALQZU AQRUH AVBZW AWYRJ BLEHA CCCUG CE4 CS3 DGEBU DKSSO DU5 EBD EBE EBO EBR EBS EBU EJD EMK EPL ESTFP E~A E~B GTTXZ H13 HF~ HZ~ H~9 H~P I-F IPNFZ J.P K1G KYCEM M4Z ML~ NA5 NX~ O9- P2P PQQKQ QWB RIG RNANH ROSJB RTWRZ S-T SNACF TBQAZ TDBHL TEN TFL TFT TFW TH9 TN5 TNC TTHFI TUROJ TWF UT5 UU3 ZGOLN ZL0 ~S~ AAGDL AAHIA AAYXX ADYSH AFRVT AIYEW AMPGV CITATION 7SC 8FD F28 FR3 JQ2 L7M L~C L~D TASJS |
ID | FETCH-LOGICAL-c485t-806b7700a3e730ccf19d0391c6b887c0919d088622a1af5d6b2ae7651f0373d83 |
ISSN | 0020-7543 |
IngestDate | Fri Jul 11 00:28:22 EDT 2025 Wed Aug 13 08:17:10 EDT 2025 Thu Apr 24 22:52:12 EDT 2025 Tue Jul 01 03:30:11 EDT 2025 Wed Dec 25 08:58:11 EST 2024 |
IsPeerReviewed | true |
IsScholarly | true |
Issue | 18 |
Language | English |
LinkModel | OpenURL |
MergedId | FETCHMERGED-LOGICAL-c485t-806b7700a3e730ccf19d0391c6b887c0919d088622a1af5d6b2ae7651f0373d83 |
Notes | SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 14 ObjectType-Article-1 ObjectType-Feature-2 content type line 23 |
PQID | 1804914134 |
PQPubID | 30924 |
PageCount | 13 |
ParticipantIDs | crossref_primary_10_1080_00207543_2016_1170226 crossref_citationtrail_10_1080_00207543_2016_1170226 proquest_journals_1804914134 informaworld_taylorfrancis_310_1080_00207543_2016_1170226 proquest_miscellaneous_1835653113 |
ProviderPackageCode | CITATION AAYXX |
PublicationCentury | 2000 |
PublicationDate | 2016-09-16 |
PublicationDateYYYYMMDD | 2016-09-16 |
PublicationDate_xml | – month: 09 year: 2016 text: 2016-09-16 day: 16 |
PublicationDecade | 2010 |
PublicationPlace | London |
PublicationPlace_xml | – name: London |
PublicationTitle | International journal of production research |
PublicationYear | 2016 |
Publisher | Taylor & Francis Taylor & Francis LLC |
Publisher_xml | – name: Taylor & Francis – name: Taylor & Francis LLC |
References | Xie C. (CIT0022) 2015; 80 CIT0010 CIT0021 CIT0020 CIT0001 CIT0012 CIT0023 CIT0011 CIT0003 CIT0014 CIT0025 CIT0002 CIT0013 CIT0024 CIT0005 CIT0004 CIT0015 CIT0007 CIT0018 Montgomery D. C. (CIT0016) 2005 CIT0017 CIT0009 CIT0008 CIT0019 |
References_xml | – ident: CIT0002 doi: 10.1023/A:1018930406487 – ident: CIT0021 doi: 10.1016/0272-6963(85)90035-X – ident: CIT0003 doi: 10.1016/S0007-8506(07)63204-1 – ident: CIT0017 doi: 10.1109/MCI.2010.936309 – ident: CIT0005 doi: 10.1111/deci.1974.5.issue-1 – ident: CIT0018 doi: 10.1016/j.knosys.2011.07.001 – ident: CIT0023 doi: 10.1016/j.ejor.2011.03.004 – ident: CIT0009 doi: 10.1016/j.asoc.2012.03.025 – ident: CIT0013 doi: 10.1007/s00521-011-0769-1 – ident: CIT0014 doi: 10.1016/j.cor.2012.07.003 – ident: CIT0007 doi: 10.1126/science.1111280 – ident: CIT0020 doi: 10.1007/978-1-4614-2361-4 – ident: CIT0012 doi: 10.1016/j.knosys.2014.08.022 – ident: CIT0015 doi: 10.1080/0740817X.2014.892231 – volume-title: Design and Analysis of Experiments year: 2005 ident: CIT0016 – ident: CIT0008 doi: 10.1016/S0305-0548(99)00038-6 – ident: CIT0025 doi: 10.1016/j.knosys.2013.12.011 – ident: CIT0001 doi: 10.1007/BF02023073 – ident: CIT0010 doi: 10.1080/00207543.2013.849822 – ident: CIT0019 doi: 10.1016/j.cor.2007.02.014 – ident: CIT0004 doi: 10.1080/00207540110047702 – ident: CIT0011 doi: 10.4304/jsw.6.4.584-594 – ident: CIT0024 doi: 10.1080/00207540601138510 – volume: 80 start-page: 1 issue: 1 year: 2015 ident: CIT0022 publication-title: International Journal of Advanced Manufacturing Technology |
SSID | ssj0000584 |
Score | 2.4870965 |
Snippet | Different from the classical job shop scheduling, the dual-resource constrained flexible job-shop scheduling problem (DRCFJSP) should deal with job sequence,... |
SourceID | proquest crossref informaworld |
SourceType | Aggregation Database Enrichment Source Index Database Publisher |
StartPage | 5554 |
SubjectTerms | Algorithms dual-resource constrained flexible job shop fruit fly optimisation algorithm Fruits Job shop scheduling Job shops knowledge-guided search Mathematical models Operators Optimization Production scheduling Resource scheduling Searching smell-based search |
Title | A knowledge-guided fruit fly optimization algorithm for dual resource constrained flexible job-shop scheduling problem |
URI | https://www.tandfonline.com/doi/abs/10.1080/00207543.2016.1170226 https://www.proquest.com/docview/1804914134 https://www.proquest.com/docview/1835653113 |
Volume | 54 |
hasFullText | 1 |
inHoldings | 1 |
isFullTextHit | |
isPrint | |
link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1Lb5tAEF65yaU9VH2qSdNqK_WG1gKzu8DR6kNW1faUqFYuaIHd2JVjLBsqJT-kv7ezD9Y4sZqmF2TAu4Dn88zsMPMNQu-VyGCRkYZEsJgSWrGUiJIqEnJVZaGEQabz3LfvfHJGv0zZdDD43ctaaptiWF7vrSv5H6nCMZCrrpK9h2T9pHAAPoN8YQsShu0_yXgc-JAYuWjnFTiPat3Om0AtroIalMGlq7IMxOKiXs-b2aVJKzT1V2sXuNeJ5xvTKUIP1_yYupjqZ12QzaxeBbD6BWvkitZN85m-P7sbUOzRUKwsk6y-tuMT8nHn85m0CmY6FzVZ1M52mqi-PfG1s6cuHBFxnTthqyV9eUBIEma5l4bSatWYc8JS00PYq13LHd3BK-0pUcbcOel2bV-WW8q-y44chfp6Ok2P63fQ4JXsIde-YfR8KmLkOVLtNLmeJnfTPECHI1h-gMI_HE8-nv_Y2niWOn5v-7BdbZhmbd93Pztezw4n7i0fwDg2p0_QY7ciwWMLr6doIJfP0KMeT-Vz9GuMbwING6BhABruAw17oGG4ONZAwx3QcA9ouAMa7oCGt0DDDmgv0NnnT6cfJsQ17CAlTVkD3g4vkiQMRSzBcJSlirJKdyAoeQG2rATXFPZTWEOPRCQUq3gxEjLhLFJhnMRVGr9EB8t6KV8hLDXTI41oxZmgbKSyimahEJVKBE1KRo8Q7X7QvHRs9voJFvlfBXqEhn7YytK53DUg60srb0wcTdmmN3l8x9iTTrS5-wNu8iiFNXkEriM8wjt_GnS6flEnlrJu9XdiWGfFURQf3_d-X6OH23_lCTpo1q18A25zU7x1GP4DdY287Q |
linkProvider | Library Specific Holdings |
linkToHtml | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1Lb9QwELagHIBDeYs-ACNxzcpeP5Icq4pqgXZPrdSb5fjRbtluqm1Sqfx6ZhJn2YJQDz1GziQZx_OyZ74h5Eu0JQQZBcusEjKTXhWZdTJmTEdfsgBEXee5o6menMjvp-p0rRYG0yoxho49UESnq1G4cTN6SInDEm6wdFJgZpbGY0cwRPoxeaJKnaNwCjb9o41VkZCYWYY0QxXP_x5zxz7dQS_9R1t3JujgBXHDx_eZJz9HbVON3K-_cB0fxt1Lspk8VLrXL6lX5FFYvCbP13AL35CbPbrai8vO2pkPnsZlO2tonN_SGrTQZSrvpHZ-Vi9nzfklBRYpFn7RZToxoA59U2xRgeQIzFnNA72oq-z6vL6iEHaDGcRqeZq63rwlJwdfj_cnWWrgkDlZqAasn67ynDErAigS5yIvPSLSO12BbnPgqsB1ATHV2HIbldfV2IZcKx6ZyIUvxDuysagX4T2hAZH_JJdeKyvVOJZelsxaH3Mrc6fkFpHDbzMuoZsjB3PDVyCo_bQanFaTpnWLjFZkVz28x30E5fqaME23rxL7JihG3EO7OywgkzTFteEFxGgcXAlg4fNqGGQcD27sItQt3iPA7xaci-0HvP4TeTo5Pjo0h9-mP3bIMxzCxBeud8lGs2zDB_CumupjJz6_AeDsFcE |
linkToPdf | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1Lb9QwELagSAgO5S1KCxiJq1fx-pHkWBVW5bXiQCVuluNHu2W7We0mlcqv70ziLC0I9dBj5EyScex5eGa-IeR9tCU4GUXGrBKSSa8KZp2MLNPRl1kAoq7z3LepPjySn3-qIZtwndIq0YeOPVBEJ6txcy99HDLisIIbFJ0UmJilMeoIekjfJfc0BvmwiiOb_hHGqkhAzBlDmqGI53-PuaaeroGX_iOsOw00eUSq4dv7xJNfo7apRu73X7COt2LuMdlO9ind7xfUE3InLJ6Sh1dQC5-R8326OYljx-3MB0_jqp01NM4vaA0y6CwVd1I7P65Xs-bkjAKHFMu-6CrFC6hDyxQbVCA5wnJW80BP64qtT-olBacblCDWytPU8-Y5OZp8_HFwyFL7BuZkoRrQfbrK8yyzIoAYcS7y0iMevdMVSDYHhgpcF-BRjS23UXldjW3IteIxE7nwhXhBthb1IrwkNCDun-TSa2WlGsfSyzKz1sfcytwpuUPk8NeMS9jmyMHc8A0Eaj-tBqfVpGndIaMN2bIH97iJoLy6JEzTnarEvgWKETfQ7g3rxyQ5sTa8AA-NgyEBLLzbDMMOx7CNXYS6xXsEWN2Cc_HqFq9_S-5__zAxXz9Nv-ySBziCWS9c75GtZtWG12BaNdWbbvNcAlg9FGU |
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=A+knowledge-guided+fruit+fly+optimization+algorithm+for+dual+resource+constrained+flexible+job-shop+scheduling+problem&rft.jtitle=International+journal+of+production+research&rft.au=Zheng%2C+Xiao-long&rft.au=Wang%2C+Ling&rft.date=2016-09-16&rft.issn=0020-7543&rft.eissn=1366-588X&rft.volume=54&rft.issue=18&rft.spage=5554&rft.epage=5566&rft_id=info:doi/10.1080%2F00207543.2016.1170226&rft.externalDBID=n%2Fa&rft.externalDocID=10_1080_00207543_2016_1170226 |
thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0020-7543&client=summon |
thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0020-7543&client=summon |
thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0020-7543&client=summon |