A Self-Adaptive Differential Evolution Algorithm for Scheduling a Single Batch-Processing Machine With Arbitrary Job Sizes and Release Times

Batch-processing machines (BPMs) can process a number of jobs at a time, which can be found in many industrial systems. This article considers a single BPM scheduling problem with unequal release times and job sizes. The goal is to assign jobs into batches without breaking the machine capacity const...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	IEEE transactions on cybernetics Ročník 51; číslo 3; s. 1430 - 1442
Hlavní autori:	Zhou, Shengchao, Xing, Lining, Zheng, Xu, Du, Ni, Wang, Ling, Zhang, Qingfu
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	United States IEEE 01.03.2021 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Predmet:	Adaptive algorithms Algorithms Batch-processing machine (BPM) differential evolution (DE) Dynamic programming Evolutionary algorithms Evolutionary computation Genetic algorithms Heuristic algorithms Job shop scheduling Mutation operator adaptation Optimal scheduling parameter adaptation Scheduling
ISSN:	2168-2267, 2168-2275, 2168-2275
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Abstract	Batch-processing machines (BPMs) can process a number of jobs at a time, which can be found in many industrial systems. This article considers a single BPM scheduling problem with unequal release times and job sizes. The goal is to assign jobs into batches without breaking the machine capacity constraint and then sort the batches to minimize the makespan. A self-adaptive differential evolution algorithm is developed for addressing the problem. In our proposed algorithm, mutation operators are adaptively chosen based on their historical performances. Also, control parameter values are adaptively determined based on their historical performances. Our proposed algorithm is compared to CPLEX, existing metaheuristics for this problem and conventional differential evolution algorithms through comprehensive experiments. The experimental results demonstrate that our proposed self-adaptive algorithm is more effective than other algorithms for this scheduling problem.
AbstractList	Batch-processing machines (BPMs) can process a number of jobs at a time, which can be found in many industrial systems. This article considers a single BPM scheduling problem with unequal release times and job sizes. The goal is to assign jobs into batches without breaking the machine capacity constraint and then sort the batches to minimize the makespan. A self-adaptive differential evolution algorithm is developed for addressing the problem. In our proposed algorithm, mutation operators are adaptively chosen based on their historical performances. Also, control parameter values are adaptively determined based on their historical performances. Our proposed algorithm is compared to CPLEX, existing metaheuristics for this problem and conventional differential evolution algorithms through comprehensive experiments. The experimental results demonstrate that our proposed self-adaptive algorithm is more effective than other algorithms for this scheduling problem. Batch-processing machines (BPMs) can process a number of jobs at a time, which can be found in many industrial systems. This article considers a single BPM scheduling problem with unequal release times and job sizes. The goal is to assign jobs into batches without breaking the machine capacity constraint and then sort the batches to minimize the makespan. A self-adaptive differential evolution algorithm is developed for addressing the problem. In our proposed algorithm, mutation operators are adaptively chosen based on their historical performances. Also, control parameter values are adaptively determined based on their historical performances. Our proposed algorithm is compared to CPLEX, existing metaheuristics for this problem and conventional differential evolution algorithms through comprehensive experiments. The experimental results demonstrate that our proposed self-adaptive algorithm is more effective than other algorithms for this scheduling problem.Batch-processing machines (BPMs) can process a number of jobs at a time, which can be found in many industrial systems. This article considers a single BPM scheduling problem with unequal release times and job sizes. The goal is to assign jobs into batches without breaking the machine capacity constraint and then sort the batches to minimize the makespan. A self-adaptive differential evolution algorithm is developed for addressing the problem. In our proposed algorithm, mutation operators are adaptively chosen based on their historical performances. Also, control parameter values are adaptively determined based on their historical performances. Our proposed algorithm is compared to CPLEX, existing metaheuristics for this problem and conventional differential evolution algorithms through comprehensive experiments. The experimental results demonstrate that our proposed self-adaptive algorithm is more effective than other algorithms for this scheduling problem.
Author	Zhang, Qingfu Zheng, Xu Xing, Lining Zhou, Shengchao Du, Ni Wang, Ling
Author_xml	– sequence: 1 givenname: Shengchao orcidid: 0000-0001-7761-6346 surname: Zhou fullname: Zhou, Shengchao email: zhousc@mail.ustc.edu.cn organization: School of Automation, Central South University, Changsha, China – sequence: 2 givenname: Lining orcidid: 0000-0002-6983-4244 surname: Xing fullname: Xing, Lining email: xinglining@gmail.com organization: School of Logistics and Transportation, Central South University of Forestry and Technology, Changsha, China – sequence: 3 givenname: Xu orcidid: 0000-0002-3773-7845 surname: Zheng fullname: Zheng, Xu email: scott@mail.ustc.edu.cn organization: School of Management, University of Science and Technology of China, Hefei, China – sequence: 4 givenname: Ni surname: Du fullname: Du, Ni email: ni.du@hunau.edu.cn organization: School of Economics, Hunan Agricultural University, Changsha, China – sequence: 5 givenname: Ling orcidid: 0000-0001-8964-6454 surname: Wang fullname: Wang, Ling email: wangling@tsinghua.edu.cn organization: Department of Automation, Tsinghua University, Beijing, China – sequence: 6 givenname: Qingfu surname: Zhang fullname: Zhang, Qingfu email: qingfu.zhang@cityu.edu.hk organization: Department of Computer Science, City University of Hong Kong, Hong Kong
BackLink	https://www.ncbi.nlm.nih.gov/pubmed/31567106$$D View this record in MEDLINE/PubMed
BookMark	eNp9kc1u1DAUhS1URH_oAyAkZIkNmwy2Eyf2cjqUPxWBmEGIleU41x1XTjzYSaXyDDw0jmbaRRfYi3tlf-fKPucUHQ1hAIReULKglMi3m9WviwUjVC6YLCWj8gk6YbQWBWMNP3ro6-YYnad0Q_IS-UiKZ-i4pLxuKKlP0N8lXoO3xbLTu9HdAn7nrIUIw-i0x5e3wU-jCwNe-usQ3bjtsQ0Rr80Wusm74RprvM7FA77Qo9kW32IwkNJ880WbrRsA_8wyvIytG6OOd_hzaLPkDySshw5_Bw86Ad64HtJz9NRqn-D8UM_Qj_eXm9XH4urrh0-r5VVhykqORUksbTnXQhjW6ooSqCpSNqZlpmPSkJZ1NTTG1kCNYFSTxgJ0XNSWGN7IujxDb_ZzdzH8niCNqnfJgPd6gDAlxZiUTS2qmmX09SP0JkxxyK9TrJJE5M15pl4dqKntoVO76Pr8V3XvcwaaPWBiSCmCVcaNenY2m-K8okTNoao5VDWHqg6hZiV9pLwf_j_Ny73GAcADLwQnJePlP-zqrHw
CODEN	ITCEB8
CitedBy_id	crossref_primary_10_1049_cim2_12065 crossref_primary_10_32604_ee_2024_053130 crossref_primary_10_1007_s40747_024_01478_0 crossref_primary_10_1016_j_eswa_2022_119192 crossref_primary_10_1007_s00291_022_00678_9 crossref_primary_10_1109_ACCESS_2021_3138049 crossref_primary_10_1109_TIM_2023_3265744 crossref_primary_10_1109_TCC_2022_3216541 crossref_primary_10_32604_cmc_2024_049480 crossref_primary_10_1109_TCYB_2022_3210228 crossref_primary_10_1016_j_asoc_2023_110551 crossref_primary_10_1109_TEVC_2022_3220424 crossref_primary_10_1016_j_cor_2024_106933 crossref_primary_10_1109_LRA_2022_3211776 crossref_primary_10_3390_math11132979 crossref_primary_10_1109_TASE_2025_3575531 crossref_primary_10_1080_0305215X_2022_2124406 crossref_primary_10_1155_2022_8374300 crossref_primary_10_1016_j_jprocont_2023_103125 crossref_primary_10_1093_jcde_qwac111 crossref_primary_10_1155_2022_5622466 crossref_primary_10_1016_j_eswa_2023_120191 crossref_primary_10_1108_EC_08_2022_0536 crossref_primary_10_1007_s00500_023_08754_0 crossref_primary_10_1016_j_engappai_2024_108016 crossref_primary_10_1016_j_eswa_2021_116097 crossref_primary_10_1016_j_knosys_2023_110808 crossref_primary_10_1016_j_engappai_2022_104735 crossref_primary_10_1016_j_eswa_2022_118134 crossref_primary_10_1016_j_asoc_2025_112744 crossref_primary_10_1016_j_swevo_2025_101929 crossref_primary_10_1016_j_eswa_2022_118811 crossref_primary_10_1007_s00500_023_08230_9 crossref_primary_10_1016_j_cie_2025_111197 crossref_primary_10_1016_j_eswa_2022_117566 crossref_primary_10_1016_j_cie_2025_111198 crossref_primary_10_3390_math11173681 crossref_primary_10_1016_j_eswa_2022_118416 crossref_primary_10_1016_j_cor_2024_106785 crossref_primary_10_1016_j_swevo_2023_101400 crossref_primary_10_1007_s10696_022_09459_6 crossref_primary_10_1016_j_eswa_2022_117154 crossref_primary_10_1109_ACCESS_2022_3157286 crossref_primary_10_3390_math11133012 crossref_primary_10_1016_j_eswa_2022_116584 crossref_primary_10_1016_j_cie_2021_107928 crossref_primary_10_1007_s00607_022_01132_y crossref_primary_10_1016_j_engappai_2024_108572 crossref_primary_10_1016_j_eswa_2022_116589 crossref_primary_10_1016_j_jmsy_2024_01_011 crossref_primary_10_1016_j_cor_2024_106871 crossref_primary_10_3390_pr11010026 crossref_primary_10_1016_j_eswa_2022_116907 crossref_primary_10_1016_j_sasc_2025_200325 crossref_primary_10_1016_j_swevo_2023_101412 crossref_primary_10_1016_j_eswa_2022_116908 crossref_primary_10_3233_JIFS_221994 crossref_primary_10_1016_j_dsp_2023_104310 crossref_primary_10_1109_TR_2022_3201333 crossref_primary_10_1016_j_engappai_2023_106236 crossref_primary_10_3390_rs15123108 crossref_primary_10_1016_j_jmsy_2024_11_003 crossref_primary_10_1007_s12008_024_02078_5 crossref_primary_10_1109_TCYB_2021_3101880 crossref_primary_10_1155_2021_8647386 crossref_primary_10_1080_0305215X_2022_2086238 crossref_primary_10_1155_2022_5699472 crossref_primary_10_1109_ACCESS_2022_3172953 crossref_primary_10_1080_0305215X_2024_2381818 crossref_primary_10_1016_j_jmsy_2023_01_005 crossref_primary_10_1177_16878132221106296 crossref_primary_10_1109_TCYB_2020_3026571 crossref_primary_10_3390_biomimetics10080544 crossref_primary_10_1109_TCYB_2024_3454346 crossref_primary_10_1155_2021_6756588 crossref_primary_10_3390_math12050731 crossref_primary_10_1016_j_cie_2024_109929 crossref_primary_10_1007_s11227_024_06799_y crossref_primary_10_1109_TMC_2024_3486712 crossref_primary_10_1016_j_eswa_2022_119035 crossref_primary_10_1016_j_eswa_2022_118068 crossref_primary_10_1016_j_swevo_2023_101318 crossref_primary_10_1515_cppm_2022_0044 crossref_primary_10_1155_2022_3558385 crossref_primary_10_3390_app132111896 crossref_primary_10_1109_TVT_2024_3408756 crossref_primary_10_1093_jcde_qwac038 crossref_primary_10_1080_00207543_2023_2254858 crossref_primary_10_1016_j_ins_2022_10_111 crossref_primary_10_1080_17455030_2023_2226249 crossref_primary_10_1016_j_knosys_2023_110606 crossref_primary_10_1016_j_knosys_2023_110968 crossref_primary_10_1016_j_physa_2022_127764 crossref_primary_10_1109_ACCESS_2023_3327732 crossref_primary_10_1109_TETCI_2021_3098354 crossref_primary_10_20965_jaciii_2022_p0974 crossref_primary_10_1016_j_asoc_2024_112650 crossref_primary_10_1109_TAES_2023_3292072 crossref_primary_10_1109_TCYB_2022_3158334 crossref_primary_10_1016_j_molliq_2025_127991 crossref_primary_10_1007_s10462_024_11053_1 crossref_primary_10_1080_02533839_2022_2141340 crossref_primary_10_1093_jcde_qwac021 crossref_primary_10_1109_TCYB_2020_3041494 crossref_primary_10_1016_j_swevo_2022_101149 crossref_primary_10_1080_00207543_2022_2060772 crossref_primary_10_1016_j_neucom_2025_130405 crossref_primary_10_1016_j_cie_2022_108135 crossref_primary_10_1145_3690768 crossref_primary_10_1049_cim2_12042 crossref_primary_10_1016_j_eswa_2022_119130 crossref_primary_10_1177_1063293X221114666 crossref_primary_10_1007_s10462_023_10403_9 crossref_primary_10_1016_j_eswa_2023_120916 crossref_primary_10_1109_TCYB_2022_3153964 crossref_primary_10_1155_2022_1166968 crossref_primary_10_1016_j_eswa_2023_119810 crossref_primary_10_1155_2022_4203082 crossref_primary_10_32604_cmc_2023_041973 crossref_primary_10_1016_j_eswa_2023_122425 crossref_primary_10_1049_ell2_12603 crossref_primary_10_1155_2022_6722848 crossref_primary_10_1371_journal_pone_0273155 crossref_primary_10_1016_j_asoc_2024_112517 crossref_primary_10_1109_TCYB_2025_3565010 crossref_primary_10_1155_2022_6400318 crossref_primary_10_1007_s11356_023_26219_7 crossref_primary_10_1155_2022_1088906 crossref_primary_10_1080_00207543_2023_2252932 crossref_primary_10_3390_math12203221 crossref_primary_10_1093_jcde_qwac099 crossref_primary_10_1155_2021_6860503 crossref_primary_10_1109_ACCESS_2022_3203813 crossref_primary_10_3390_pr11030755 crossref_primary_10_1002_rob_22543 crossref_primary_10_1016_j_knosys_2023_110309 crossref_primary_10_1016_j_swevo_2022_101172 crossref_primary_10_1016_j_swevo_2025_102081 crossref_primary_10_3390_su15097388 crossref_primary_10_26599_TST_2024_9010164 crossref_primary_10_1016_j_compeleceng_2024_109523 crossref_primary_10_1109_TEVC_2023_3237336 crossref_primary_10_1080_00207543_2025_2481184 crossref_primary_10_1109_TSMC_2023_3335998 crossref_primary_10_1109_TEVC_2022_3222791
Cites_doi	10.1007/s00170-005-2585-1 10.1016/j.ijpe.2016.05.014 10.1016/j.asoc.2014.06.005 10.1002/nav.4 10.1016/S0305-0548(00)00078-2 10.1109/TEVC.2013.2250977 10.1080/002075499192020 10.1007/s00170-005-0194-7 10.1109/TCYB.2018.2802912 10.1016/j.swevo.2016.01.004 10.1016/j.ins.2015.09.009 10.1016/j.cor.2013.01.005 10.1016/j.ins.2010.10.009 10.1007/s00500-017-2777-2 10.1109/CEC.2005.1554725 10.1007/s00170-006-0787-9 10.1016/S0927-0507(05)80189-6 10.1016/S0925-5273(03)00092-6 10.1080/00207549308956847 10.1016/S0305-0548(00)00098-8 10.1016/j.ijpe.2006.02.010 10.1109/TEVC.2010.2087271 10.1007/s10878-005-5480-7 10.1080/00207543.2010.512620 10.1016/j.patrec.2015.07.007 10.1016/j.cor.2008.10.008 10.1016/j.asoc.2007.12.008 10.1080/00207543.2014.910625 10.1016/j.cor.2008.12.004 10.1287/opre.40.4.764 10.1016/0377-2217(95)00332-0 10.1007/s00170-006-0738-5 10.1016/j.cor.2008.06.007 10.1057/palgrave.jors.2602448 10.1016/j.engappai.2011.05.003 10.1016/j.ejor.2004.08.043 10.1016/j.patrec.2014.11.009 10.1080/00207540500525254 10.1016/j.asoc.2012.07.034 10.1109/TEVC.2008.927706 10.1109/TEVC.2010.2059031 10.1016/j.cor.2018.04.009 10.5019/j.ijcir.2005.32 10.1109/TEVC.2011.2161873 10.1007/s11390-012-1282-4 10.1080/00207549408957026 10.1109/CEC.2004.1331139 10.1002/(SICI)1099-1425(199806)1:1<31::AID-JOS4>3.0.CO;2-R 10.1109/TSMCC.2012.2196996 10.1016/j.cor.2014.01.001 10.1016/S0167-5060(08)70356-X 10.1109/TCYB.2016.2617301 10.1023/A:1008202821328 10.1016/j.ins.2016.07.041 10.1016/j.cor.2011.05.011 10.1016/S0305-0548(01)00031-4 10.1080/00207543.2013.854937 10.1016/0167-6377(86)90104-5
ContentType	Journal Article
Copyright	Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2021
Copyright_xml	– notice: Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2021
DBID	97E RIA RIE AAYXX CITATION NPM 7SC 7SP 7TB 8FD F28 FR3 H8D JQ2 L7M L~C L~D 7X8
DOI	10.1109/TCYB.2019.2939219
DatabaseName	IEEE All-Society Periodicals Package (ASPP) 2005–Present IEEE All-Society Periodicals Package (ASPP) 1998–Present IEEE Electronic Library (IEL) CrossRef PubMed Computer and Information Systems Abstracts Electronics & Communications Abstracts Mechanical & Transportation Engineering Abstracts Technology Research Database ANTE: Abstracts in New Technology & Engineering Engineering Research Database Aerospace Database ProQuest Computer Science Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional MEDLINE - Academic
DatabaseTitle	CrossRef PubMed Aerospace Database Technology Research Database Computer and Information Systems Abstracts – Academic Mechanical & Transportation Engineering Abstracts Electronics & Communications Abstracts 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 MEDLINE - Academic
DatabaseTitleList	MEDLINE - Academic PubMed Aerospace Database
Database_xml	– sequence: 1 dbid: NPM name: PubMed url: http://www.ncbi.nlm.nih.gov/entrez/query.fcgi?db=PubMed sourceTypes: Index Database – sequence: 2 dbid: RIE name: IEEE Electronic Library (IEL) url: https://ieeexplore.ieee.org/ sourceTypes: Publisher – sequence: 3 dbid: 7X8 name: MEDLINE - Academic url: https://search.proquest.com/medline sourceTypes: Aggregation Database
DeliveryMethod	fulltext_linktorsrc
Discipline	Sciences (General)
EISSN	2168-2275
EndPage	1442
ExternalDocumentID	31567106 10_1109_TCYB_2019_2939219 8850325
Genre	orig-research Journal Article
GrantInformation_xml	– fundername: National Natural Science Fund for Distinguished Young Scholars of China grantid: 61525304 funderid: 10.13039/501100001809 – fundername: Natural Science Foundation of Hunan Province grantid: 2018JJ3891 funderid: 10.13039/501100004735 – fundername: National Natural Science Foundation of China grantid: 61773120; 61873328; 61876163 funderid: 10.13039/501100001809 – fundername: Foundation for the Author of National Excellent Doctoral Dissertation of China grantid: 2014-92 funderid: 10.13039/501100003181 – fundername: Dongguan Innovative Research Team Program grantid: 2018607202007
GroupedDBID	0R~ 4.4 6IK 97E AAJGR AARMG AASAJ AAWTH ABAZT ABQJQ ABVLG ACIWK AENEX AGQYO AGSQL AHBIQ AKJIK AKQYR ALMA_UNASSIGNED_HOLDINGS ATWAV BEFXN BFFAM BGNUA BKEBE BPEOZ EBS EJD HZ~ IFIPE IPLJI JAVBF M43 O9- OCL PQQKQ RIA RIE RNS AAYXX CITATION NPM RIG 7SC 7SP 7TB 8FD F28 FR3 H8D JQ2 L7M L~C L~D 7X8
ID	FETCH-LOGICAL-c349t-30f1b55a88c2ba410e44037cb2cd29c0b2d6e7cf6e1c821a07feed586f0c57963
IEDL.DBID	RIE
ISICitedReferencesCount	192
ISICitedReferencesURI	http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000619376300028&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN	2168-2267 2168-2275
IngestDate	Sun Nov 09 11:03:56 EST 2025 Sun Nov 30 03:42:56 EST 2025 Thu Jan 02 22:58:04 EST 2025 Tue Nov 18 22:38:30 EST 2025 Sat Nov 29 02:02:28 EST 2025 Wed Aug 27 05:44:41 EDT 2025
IsPeerReviewed	true
IsScholarly	true
Issue	3
Language	English
License	https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html https://doi.org/10.15223/policy-029 https://doi.org/10.15223/policy-037
LinkModel	DirectLink
MergedId	FETCHMERGED-LOGICAL-c349t-30f1b55a88c2ba410e44037cb2cd29c0b2d6e7cf6e1c821a07feed586f0c57963
Notes	ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 content type line 23
ORCID	0000-0002-6983-4244 0000-0001-7761-6346 0000-0002-3773-7845 0000-0001-8964-6454
PMID	31567106
PQID	2490808055
PQPubID	85422
PageCount	13
ParticipantIDs	proquest_miscellaneous_2299768462 crossref_primary_10_1109_TCYB_2019_2939219 proquest_journals_2490808055 ieee_primary_8850325 crossref_citationtrail_10_1109_TCYB_2019_2939219 pubmed_primary_31567106
PublicationCentury	2000
PublicationDate	2021-03-01
PublicationDateYYYYMMDD	2021-03-01
PublicationDate_xml	– month: 03 year: 2021 text: 2021-03-01 day: 01
PublicationDecade	2020
PublicationPlace	United States
PublicationPlace_xml	– name: United States – name: Piscataway
PublicationTitle	IEEE transactions on cybernetics
PublicationTitleAbbrev	TCYB
PublicationTitleAlternate	IEEE Trans Cybern
PublicationYear	2021
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	ref13 ref56 ref12 ref59 ref15 ref14 ref53 ref52 ref55 ref11 ref54 ref10 ref17 ref16 ref19 ref18 ref51 ref50 mathirajan (ref2) 2006; 29 ref46 ref45 ref48 ref47 ref42 ref41 ref44 ref43 ref49 ref7 ref9 ref4 ref3 ref6 ref5 ref40 lawler (ref57) 1993; 4 ref35 das (ref28) 2009; 9 ref34 ref36 ref31 ref30 ref33 ref32 ref1 ref39 ref38 storn (ref58) 1995 li (ref8) 1997; 96 ref24 ref23 ref26 ref25 ref20 ref22 ref21 ref27 ref29 gou (ref37) 2014 ref60
References_xml	– volume: 29 start-page: 990 year: 2006 ident: ref2 article-title: A literature review, classification and simple meta-analysis on scheduling of batch processors in semiconductor publication-title: Int J Adv Manuf Technol doi: 10.1007/s00170-005-2585-1 – ident: ref43 doi: 10.1016/j.ijpe.2016.05.014 – ident: ref31 doi: 10.1016/j.asoc.2014.06.005 – ident: ref14 doi: 10.1002/nav.4 – ident: ref15 doi: 10.1016/S0305-0548(00)00078-2 – ident: ref3 doi: 10.1109/TEVC.2013.2250977 – ident: ref10 doi: 10.1080/002075499192020 – ident: ref22 doi: 10.1007/s00170-005-0194-7 – ident: ref33 doi: 10.1109/TCYB.2018.2802912 – year: 1995 ident: ref58 article-title: Differential evolution-A simple and efficient adaptive scheme for global optimization over continuous spaces – ident: ref56 doi: 10.1016/j.swevo.2016.01.004 – ident: ref52 doi: 10.1016/j.ins.2015.09.009 – ident: ref45 doi: 10.1016/j.cor.2013.01.005 – ident: ref41 doi: 10.1016/j.ins.2010.10.009 – ident: ref54 doi: 10.1007/s00500-017-2777-2 – start-page: 2956 year: 2014 ident: ref37 article-title: Vehicle license plate recognition based on class-specific ERs and SaE-ELM publication-title: Proc IEEE Int Conf Intell Transport Syst – ident: ref59 doi: 10.1109/CEC.2005.1554725 – ident: ref44 doi: 10.1007/s00170-006-0787-9 – volume: 4 start-page: 445 year: 1993 ident: ref57 article-title: Sequencing and scheduling: Algorithms and complexity publication-title: Handbooks Oper Res Manage Sci doi: 10.1016/S0927-0507(05)80189-6 – ident: ref16 doi: 10.1016/S0925-5273(03)00092-6 – ident: ref7 doi: 10.1080/00207549308956847 – ident: ref11 doi: 10.1016/S0305-0548(00)00098-8 – ident: ref17 doi: 10.1016/j.ijpe.2006.02.010 – ident: ref32 doi: 10.1109/TEVC.2010.2087271 – ident: ref13 doi: 10.1007/s10878-005-5480-7 – ident: ref19 doi: 10.1080/00207543.2010.512620 – ident: ref29 doi: 10.1016/j.patrec.2015.07.007 – ident: ref48 doi: 10.1016/j.cor.2008.10.008 – volume: 9 start-page: 226 year: 2009 ident: ref28 article-title: Automatic image pixel clustering with an improved differential evolution publication-title: Appl Soft Comput doi: 10.1016/j.asoc.2007.12.008 – ident: ref42 doi: 10.1080/00207543.2014.910625 – ident: ref39 doi: 10.1016/j.cor.2008.12.004 – ident: ref1 doi: 10.1287/opre.40.4.764 – volume: 96 start-page: 564 year: 1997 ident: ref8 article-title: Scheduling with agreeable release times and due dates on a batch processing machine publication-title: Eur J Oper Res doi: 10.1016/0377-2217(95)00332-0 – ident: ref23 doi: 10.1007/s00170-006-0738-5 – ident: ref40 doi: 10.1016/j.cor.2008.06.007 – ident: ref21 doi: 10.1057/palgrave.jors.2602448 – ident: ref51 doi: 10.1016/j.engappai.2011.05.003 – ident: ref38 doi: 10.1016/j.ejor.2004.08.043 – ident: ref27 doi: 10.1016/j.patrec.2014.11.009 – ident: ref18 doi: 10.1080/00207540500525254 – ident: ref46 doi: 10.1016/j.asoc.2012.07.034 – ident: ref50 doi: 10.1109/TEVC.2008.927706 – ident: ref55 doi: 10.1109/TEVC.2010.2059031 – ident: ref49 doi: 10.1016/j.cor.2018.04.009 – ident: ref47 doi: 10.5019/j.ijcir.2005.32 – ident: ref36 doi: 10.1109/TEVC.2011.2161873 – ident: ref35 doi: 10.1007/s11390-012-1282-4 – ident: ref4 doi: 10.1080/00207549408957026 – ident: ref60 doi: 10.1109/CEC.2004.1331139 – ident: ref9 doi: 10.1002/(SICI)1099-1425(199806)1:1<31::AID-JOS4>3.0.CO;2-R – ident: ref30 doi: 10.1109/TSMCC.2012.2196996 – ident: ref20 doi: 10.1016/j.cor.2014.01.001 – ident: ref5 doi: 10.1016/S0167-5060(08)70356-X – ident: ref53 doi: 10.1109/TCYB.2016.2617301 – ident: ref26 doi: 10.1023/A:1008202821328 – ident: ref34 doi: 10.1016/j.ins.2016.07.041 – ident: ref24 doi: 10.1016/j.cor.2011.05.011 – ident: ref12 doi: 10.1016/S0305-0548(01)00031-4 – ident: ref25 doi: 10.1080/00207543.2013.854937 – ident: ref6 doi: 10.1016/0167-6377(86)90104-5
SSID	ssj0000816898
Score	2.6189542
Snippet	Batch-processing machines (BPMs) can process a number of jobs at a time, which can be found in many industrial systems. This article considers a single BPM...
SourceID	proquest pubmed crossref ieee
SourceType	Aggregation Database Index Database Enrichment Source Publisher
StartPage	1430
SubjectTerms	Adaptive algorithms Algorithms Batch-processing machine (BPM) differential evolution (DE) Dynamic programming Evolutionary algorithms Evolutionary computation Genetic algorithms Heuristic algorithms Job shop scheduling Mutation operator adaptation Optimal scheduling parameter adaptation Scheduling
Title	A Self-Adaptive Differential Evolution Algorithm for Scheduling a Single Batch-Processing Machine With Arbitrary Job Sizes and Release Times
URI	https://ieeexplore.ieee.org/document/8850325 https://www.ncbi.nlm.nih.gov/pubmed/31567106 https://www.proquest.com/docview/2490808055 https://www.proquest.com/docview/2299768462
Volume	51
WOSCitedRecordID	wos000619376300028&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText	1
inHoldings	1
isFullTextHit
isPrint
journalDatabaseRights	– providerCode: PRVIEE databaseName: IEEE Electronic Library (IEL) customDbUrl: eissn: 2168-2275 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0000816898 issn: 2168-2267 databaseCode: RIE dateStart: 20130101 isFulltext: true titleUrlDefault: https://ieeexplore.ieee.org/ providerName: IEEE
link	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1baxQxFA5tEemLWqt1a1si-KDitJnMJcnjtraIYBG34vo05HKmXZjOlL30wd_gj_Ykmx0Q2oLMwwSSzAS-c0lyboS8rSXKfCPKpBaKJ7mrIdG5YInNDMpJC7lLdSg2Ic7P5Xisvq2Rj30sDAAE5zM49M1gy3edXfirsiMpC5bxYp2sC1EuY7X6-5RQQCKUvuXYSHBXIaIRM2Xq6OLk17H341KHqN4UcukmeZzh0QX1a_mPRgolVu7fbQatc_b0_9b7jDyJu0s6XJLDFlmD9jnZivw7o-9ikun32-TPkI6gqZOh0zde4tFPsVIKcnxDT28jRdJhc9lNJ_Ora4q7WzpCiJ33Xb-kmo7w1QA9RmF-lcSAA9_zNfhnAv2J03ApZhIi--mXzuCU37gM3Tr6HdUdKlAaQlBekB9npxcnn5NYmQExzNU8yVidmqLQUlpudJ4yyHOWCWu4dVxZZrgrQdi6hNRKnmomatTFhSxrZn3wa_aSbLRdC68ITSErysxn1XeQp8YoZyQKHmalhlpxOSBshU5lY9pyXz2jqcLxhanKY1t5bKuI7YB86KfcLHN2PDR42wPXD4yYDcjeigSqyNWzinsrKT4Fdr_pu5EfvZFFt9AtcAzqd2_cLPmA7CxJp__2iuJ27_7na7LJvcdM8HDbIxvz6QL2ySN7O5_MpgdI9GN5EIj-Lz9Y-zU
linkProvider	IEEE
linkToHtml	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1Jb9QwFH4qBdFegFIKAwWMxAEQaR3HSezjtLQq0I4QM4hyirylHSlkqll64Dfwo3n2eCIhARLKIZZsJ5a-t9h-G8DLWqDM12WR1KVkCbe1SxQvaWIyjXLSOG5TFYpNlIOBOD-Xn9bgbRcL45wLzmduzzeDLd9OzMJfle0LkdOM5TfgZs45o8tore5GJZSQCMVvGTYS3FeU0YyZUrk_Ovx24D255B4qOIl8ugm3Mzy8oIYtftNJocjK3_ebQe8c3_2_Fd-DO3F_SfpLgtiCNdfeh63IwTPyKqaZfr0NP_tk6Jo66Vt15WUeeRdrpSDPN-ToOtIk6TcXk-l4fvmd4P6WDBFk673XL4giQ3w1jhygOL9MYsiB7zkLHpqOfMVpuBQ9DrH95MNE45QfuAzVWvIZFR6qUBKCUB7Al-Oj0eFJEmszIIpczpOM1qnOcyWEYVrxlDrOaVYazYxl0lDNbOFKUxcuNYKlipY1auNcFDU1Pvw124H1dtK6R0BSl-VF5vPqW8dTraXVAkUPNUK5WjLRA7pCpzIxcbmvn9FU4QBDZeWxrTy2VcS2B2-6KVfLrB3_GrztgesGRsx6sLsigSry9axi3k6KT47dL7pu5EhvZlGtmyxwDGp4b94sWA8eLkmn-_aK4h7_-Z_PYeNkdHZanb4ffHwCm8z7zwR_t11Yn08X7incMtfz8Wz6LJD-L4d1_ZQ
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+Self-Adaptive+Differential+Evolution+Algorithm+for+Scheduling+a+Single+Batch-Processing+Machine+With+Arbitrary+Job+Sizes+and+Release+Times&rft.jtitle=IEEE+transactions+on+cybernetics&rft.au=Zhou%2C+Shengchao&rft.au=Xing%2C+Lining&rft.au=Zheng%2C+Xu&rft.au=Du%2C+Ni&rft.date=2021-03-01&rft.issn=2168-2275&rft.eissn=2168-2275&rft.volume=51&rft.issue=3&rft.spage=1430&rft_id=info:doi/10.1109%2FTCYB.2019.2939219&rft.externalDBID=NO_FULL_TEXT
thumbnail_l	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=2168-2267&client=summon
thumbnail_m	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=2168-2267&client=summon
thumbnail_s	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=2168-2267&client=summon