Heuristic Scheduling of Batch Production Processes Based on Petri Nets and Iterated Greedy Algorithms

Wire rod and bar rolling is an important batch production process in steel production systems. A scheduling problem originated from this process is studied in this work by considering the constraints on sequence-dependent family setup time and release time. For each serial batch to be scheduled, it...

Full description

Saved in:

Bibliographic Details
Published in:	IEEE transactions on automation science and engineering Vol. 19; no. 1; pp. 251 - 261
Main Authors:	Zhao, Ziyan, Liu, Shixin, Zhou, Mengchu, You, Dan, Guo, Xiwang
Format:	Journal Article
Language:	English
Published:	New York IEEE 01.01.2022 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:	Algorithms Batch production Batch production process Employment Greedy algorithms Hardness Heuristic Heuristic scheduling Industrial applications iterated greedy algorithm (IGA) Job shop scheduling Mixed integer Petri net (PN) Petri nets Production scheduling Scheduling Single machine scheduling Steel production Task analysis variable neighborhood descent (VND) Wire rod
ISSN:	1545-5955, 1558-3783
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Abstract	Wire rod and bar rolling is an important batch production process in steel production systems. A scheduling problem originated from this process is studied in this work by considering the constraints on sequence-dependent family setup time and release time. For each serial batch to be scheduled, it contains several jobs and the number of late jobs within it varies with its start time. First, we model a rolling process using a Petri net (PN), where a so-called rolling transition describes a rolling operation of a batch. The objective of the concerned problem is to determine a firing sequence of all rolling transitions such that the total number of late jobs is minimal. Next, a mixed-integer linear program is formulated based on the PN model. Due to the NP-hardness of the concerned problem, iterated greedy algorithm (IGA)-based methods by using different neighborhood structures and integrating a variable neighborhood descent method are developed to obtain its near-optimal solutions. To test the accuracy, speed, and stability of the proposed algorithms, we compare their solutions of different-size instances with those of CPLEX (a commercial software) and four heuristic peers. The results indicate that the proposed algorithms outperform their peers and have great potential to be applied to industrial production process scheduling. Note to Practitioners -This work deals with a scheduling problem of a batch production process, i.e., wire rod and bar rolling, which is modeled by a Petri net (PN). Due to the NP-hardness of the concerned problem, four iterated greedy algorithm-based methods are developed to solve it. The proposed methods are validated and tested by comparing their solutions with those of four heuristic peers and the exact ones (when available via CPLEX). Extensive experimental results show that they can fast solve one-week-scale instances with better performance than their peers', thereby proving the readiness to put them in industrial use. When solving a one-month-scale instance, the proposed methods show much better performance than others.
AbstractList	Wire rod and bar rolling is an important batch production process in steel production systems. A scheduling problem originated from this process is studied in this work by considering the constraints on sequence-dependent family setup time and release time. For each serial batch to be scheduled, it contains several jobs and the number of late jobs within it varies with its start time. First, we model a rolling process using a Petri net (PN), where a so-called rolling transition describes a rolling operation of a batch. The objective of the concerned problem is to determine a firing sequence of all rolling transitions such that the total number of late jobs is minimal. Next, a mixed-integer linear program is formulated based on the PN model. Due to the NP-hardness of the concerned problem, iterated greedy algorithm (IGA)-based methods by using different neighborhood structures and integrating a variable neighborhood descent method are developed to obtain its near-optimal solutions. To test the accuracy, speed, and stability of the proposed algorithms, we compare their solutions of different-size instances with those of CPLEX (a commercial software) and four heuristic peers. The results indicate that the proposed algorithms outperform their peers and have great potential to be applied to industrial production process scheduling. Note to Practitioners -This work deals with a scheduling problem of a batch production process, i.e., wire rod and bar rolling, which is modeled by a Petri net (PN). Due to the NP-hardness of the concerned problem, four iterated greedy algorithm-based methods are developed to solve it. The proposed methods are validated and tested by comparing their solutions with those of four heuristic peers and the exact ones (when available via CPLEX). Extensive experimental results show that they can fast solve one-week-scale instances with better performance than their peers', thereby proving the readiness to put them in industrial use. When solving a one-month-scale instance, the proposed methods show much better performance than others.
Author	You, Dan Zhou, Mengchu Liu, Shixin Guo, Xiwang Zhao, Ziyan
Author_xml	– sequence: 1 givenname: Ziyan orcidid: 0000-0002-5858-4489 surname: Zhao fullname: Zhao, Ziyan email: neuzhaoziyan@163.com organization: State Key Laboratory of Synthetical Automation for Process Industries, Northeastern University, Shenyang, China – sequence: 2 givenname: Shixin orcidid: 0000-0002-3404-9297 surname: Liu fullname: Liu, Shixin email: sxliu@mail.neu.edu.cn organization: State Key Laboratory of Synthetical Automation for Process Industries, Northeastern University, Shenyang, China – sequence: 3 givenname: Mengchu orcidid: 0000-0002-5408-8752 surname: Zhou fullname: Zhou, Mengchu email: zhou@njit.edu organization: Department of Electrical and Computer Engineering, New Jersey Institute of Technology, Newark, NJ, USA – sequence: 4 givenname: Dan orcidid: 0000-0001-9088-9672 surname: You fullname: You, Dan email: youdan000@hotmail.com organization: Department of Electrical and Electronic Engineering, University of Cagliari, Cagliari, Italy – sequence: 5 givenname: Xiwang orcidid: 0000-0002-9142-1251 surname: Guo fullname: Guo, Xiwang email: x.w.guo@163.com organization: Computer and Communication Engineering College, Liaoning Shihua University, Fushun, China
BookMark	eNp9kEFPwzAMhSMEEjD4AYhLJM4dTty0zXEgGEgIkBjnKk1cFrS1I0kP-_esGuLAgZOf7PfZ8jtlh13fEWMXAqZCgL5ezN7uphIkTBFkqVAesBOhVJVhWeHhqHOVKa3UMTuN8RNA5pWGE0YPNAQfk7f8zS7JDSvfffC-5Tcm2SV_Db0bbPJ9N0pLMVLcjSI5PrYoBc-fKUVuOscfEwWTdqN5IHJbPlt99MGn5TqesaPWrCKd_9QJe7-_W9w-ZE8v88fb2VNmpcaUlUIILKBsNVlRQCMKo1E3AtGoNnc5OgBX6Eo0SJVxWBYNaIOqtQ0IMDlO2NV-7yb0XwPFVH_2Q-h2J2tZiKKUoMrRVe5dNvQxBmpr65MZn0zB-FUtoB4zrcdM6zHT-ifTHSn-kJvg1yZs_2Uu94wnol-_lljlqPEbtauDeA
CODEN	ITASC7
CitedBy_id	crossref_primary_10_1016_j_ifacol_2021_04_140 crossref_primary_10_1016_j_ijmecsci_2025_110860 crossref_primary_10_1109_TASE_2023_3307588 crossref_primary_10_1080_00207543_2024_2431178 crossref_primary_10_3390_math10234519 crossref_primary_10_1109_JSEN_2024_3457497 crossref_primary_10_1109_TASE_2024_3396474 crossref_primary_10_1016_j_cie_2024_109929 crossref_primary_10_1088_1742_6596_1944_1_012034 crossref_primary_10_1109_TASE_2024_3356255 crossref_primary_10_1109_TCSS_2021_3132355 crossref_primary_10_3390_s23031447 crossref_primary_10_1109_ACCESS_2022_3174484 crossref_primary_10_1002_sys_21793 crossref_primary_10_1109_TASE_2025_3575531 crossref_primary_10_1016_j_engappai_2024_108477 crossref_primary_10_3390_math11204243 crossref_primary_10_1109_JAS_2020_1003539 crossref_primary_10_1109_TASE_2024_3421889 crossref_primary_10_1109_TSMC_2024_3352522 crossref_primary_10_3390_math12060816 crossref_primary_10_1109_ACCESS_2021_3058328 crossref_primary_10_1109_ACCESS_2022_3201147 crossref_primary_10_1080_00207543_2022_2098872 crossref_primary_10_1016_j_cie_2024_110042 crossref_primary_10_1109_LRA_2023_3246384 crossref_primary_10_1109_JSAC_2023_3280970 crossref_primary_10_1109_JAS_2021_1004174 crossref_primary_10_3390_math12010009 crossref_primary_10_1109_TCSS_2023_3238042 crossref_primary_10_1080_23307706_2022_2071775 crossref_primary_10_1109_TASE_2023_3267714 crossref_primary_10_1109_TASE_2024_3450656 crossref_primary_10_1109_TCYB_2024_3413054 crossref_primary_10_1109_TII_2024_3413335 crossref_primary_10_1109_TITS_2023_3237570 crossref_primary_10_1109_TCSS_2022_3217101 crossref_primary_10_1109_TASE_2024_3420107 crossref_primary_10_1016_j_swevo_2025_101884 crossref_primary_10_1109_ACCESS_2024_3388418 crossref_primary_10_1109_TASE_2021_3091610 crossref_primary_10_3390_sym17060907 crossref_primary_10_1109_TASE_2021_3062994 crossref_primary_10_1109_TASE_2024_3490039 crossref_primary_10_1016_j_compind_2024_104131 crossref_primary_10_1088_1742_6596_2024_1_012047 crossref_primary_10_1109_JIOT_2024_3352658 crossref_primary_10_1109_TASE_2023_3336807 crossref_primary_10_1109_TSMC_2024_3473851 crossref_primary_10_1007_s41965_024_00169_6 crossref_primary_10_1109_TCSS_2023_3238965 crossref_primary_10_1016_j_ejor_2023_03_038 crossref_primary_10_1016_j_ins_2021_12_063 crossref_primary_10_1109_TCSS_2024_3456589 crossref_primary_10_1016_j_jii_2024_100631 crossref_primary_10_1109_TASE_2023_3305308 crossref_primary_10_1109_TASE_2024_3477982 crossref_primary_10_3390_su16104180 crossref_primary_10_1109_ACCESS_2025_3535825 crossref_primary_10_1109_TASE_2024_3418898 crossref_primary_10_1109_TASE_2023_3328895 crossref_primary_10_1109_TASE_2024_3440169 crossref_primary_10_1109_TCSI_2024_3514674 crossref_primary_10_1088_1742_6596_2024_1_012057 crossref_primary_10_1109_THMS_2025_3528629 crossref_primary_10_1016_j_jmsy_2023_02_002 crossref_primary_10_1109_TSMC_2021_3131849 crossref_primary_10_1371_journal_pone_0278310 crossref_primary_10_1109_JIOT_2024_3468331 crossref_primary_10_1145_3570326 crossref_primary_10_1109_TASE_2024_3418370 crossref_primary_10_1080_0305215X_2025_2507285 crossref_primary_10_1080_00207543_2021_1975839 crossref_primary_10_1016_j_jmsy_2024_05_006 crossref_primary_10_1108_K_05_2021_0416
Cites_doi	10.1109/TASE.2019.2955988 10.1109/TSMC.2016.2616347 10.1016/j.ejor.2018.06.004 10.5772/48467 10.1109/TII.2017.2766528 10.1109/JAS.2019.1911540 10.1016/j.ijpe.2004.10.002 10.1109/TITS.2020.2972389 10.1007/978-1-4684-2001-2_9 10.1109/TCYB.2019.2901834 10.1016/j.cor.2016.04.009 10.1109/TASE.2019.2953669 10.1016/j.omega.2018.03.004 10.1080/00207543.2016.1264642 10.1016/j.camwa.2012.02.031 10.1016/j.ejor.2006.07.029 10.1201/9781439808856 10.1109/TASE.2017.2741965 10.1016/j.ins.2014.03.127 10.1142/3376 10.1007/s13675-016-0075-x 10.1109/JAS.2019.1911378 10.1109/TCYB.2016.2574766 10.1016/s0305-0548(97)00031-2 10.1016/j.endm.2017.03.008 10.1109/MRA.2015.2415047 10.1109/ACCESS.2018.2861319 10.1016/j.cor.2012.07.013 10.1109/TASE.2016.2631491 10.1109/TII.2019.2901518 10.1109/ICNSC.2019.8743328 10.1080/00207543.2015.1108535 10.1007/978-3-319-07124-4_9 10.1109/TASE.2015.2503325 10.1109/TSMC.2014.2342199 10.1016/j.cie.2014.11.001 10.1109/TASE.2019.2909866 10.1109/TCYB.2018.2817240 10.1109/TASE.2017.2731981 10.1007/s10479-018-2852-9 10.1109/TASE.2019.2892480 10.1016/j.ejor.2005.12.009 10.1016/j.apm.2015.02.027 10.1109/TSMCA.2011.2147305 10.1007/s00170-006-0640-1 10.1109/TASE.2019.2958979 10.1126/science.220.4598.671 10.1109/TASE.2020.2971512 10.1109/JAS.2018.7511138 10.1016/j.ejor.2014.02.004 10.1016/j.omega.2013.10.002 10.1016/j.ejor.2015.07.001 10.1109/TII.2019.2944247 10.1109/TSMC.2015.2507161 10.1177/1687814017753912 10.1109/TCYB.2015.2478486 10.1007/978-1-4615-3126-5 10.1109/TSMC.2019.2907575 10.1016/0305-0483(89)90059-5 10.3934/jimo.2014.10.219 10.1016/j.ejor.2015.04.004 10.1007/s10479-017-2481-8 10.1016/j.cor.2019.07.016
ContentType	Journal Article
Copyright	Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2022
Copyright_xml	– notice: Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2022
DBID	97E RIA RIE AAYXX CITATION 7SC 7SP 7TB 8FD FR3 JQ2 L7M L~C L~D
DOI	10.1109/TASE.2020.3027532
DatabaseName	IEEE All-Society Periodicals Package (ASPP) 2005–Present IEEE All-Society Periodicals Package (ASPP) 1998–Present IEEE Electronic Library (IEL) CrossRef Computer and Information Systems Abstracts Electronics & Communications Abstracts Mechanical & Transportation Engineering Abstracts Technology Research Database 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 Mechanical & Transportation Engineering Abstracts Electronics & Communications Abstracts ProQuest Computer Science Collection Computer and Information Systems Abstracts Engineering Research Database Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Professional
DatabaseTitleList	Technology Research Database
Database_xml	– sequence: 1 dbid: RIE name: IEEE Electronic Library (IEL) url: https://ieeexplore.ieee.org/ sourceTypes: Publisher
DeliveryMethod	fulltext_linktorsrc
Discipline	Engineering
EISSN	1558-3783
EndPage	261
ExternalDocumentID	10_1109_TASE_2020_3027532 9238439
Genre	orig-research
GrantInformation_xml	– fundername: China Scholarship Council funderid: 10.13039/501100004543 – fundername: National Natural Science Foundation of China grantid: 62073069 funderid: 10.13039/501100001809 – fundername: National Key Research and Development Program of China grantid: 2017YFB0306400 funderid: 10.13039/501100012166
GroupedDBID	-~X 0R~ 29I 4.4 5GY 5VS 6IK 97E AAJGR AARMG AASAJ AAWTH ABAZT ABQJQ ABVLG ACGFO ACGFS ACIWK AENEX AETIX AGQYO AGSQL AHBIQ AIBXA AKJIK AKQYR ALMA_UNASSIGNED_HOLDINGS ATWAV BEFXN BFFAM BGNUA BKEBE BPEOZ CS3 DU5 EBS EJD F5P HZ~ H~9 IFIPE IPLJI JAVBF LAI M43 O9- OCL PQQKQ RIA RIE RNS AAYXX CITATION 7SC 7SP 7TB 8FD FR3 JQ2 L7M L~C L~D
ID	FETCH-LOGICAL-c293t-71113607f9ec160b16a939b133a5f4d43d00d6981b3e8ad376b09a35fcb010a43
IEDL.DBID	RIE
ISICitedReferencesCount	127
ISICitedReferencesURI	http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000739634600024&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN	1545-5955
IngestDate	Sun Jun 29 15:48:01 EDT 2025 Sat Nov 29 04:12:47 EST 2025 Tue Nov 18 20:48:39 EST 2025 Wed Aug 27 03:03:36 EDT 2025
IsPeerReviewed	false
IsScholarly	true
Issue	1
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-c293t-71113607f9ec160b16a939b133a5f4d43d00d6981b3e8ad376b09a35fcb010a43
Notes	ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14
ORCID	0000-0002-3404-9297 0000-0001-9088-9672 0000-0002-9142-1251 0000-0002-5858-4489 0000-0002-5408-8752
PQID	2616720574
PQPubID	27623
PageCount	11
ParticipantIDs	proquest_journals_2616720574 crossref_citationtrail_10_1109_TASE_2020_3027532 crossref_primary_10_1109_TASE_2020_3027532 ieee_primary_9238439
PublicationCentury	2000
PublicationDate	2022-Jan. 2022-1-00 20220101
PublicationDateYYYYMMDD	2022-01-01
PublicationDate_xml	– month: 01 year: 2022 text: 2022-Jan.
PublicationDecade	2020
PublicationPlace	New York
PublicationPlace_xml	– name: New York
PublicationTitle	IEEE transactions on automation science and engineering
PublicationTitleAbbrev	TASE
PublicationYear	2022
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 ref57 ref12 ref56 ref15 ref59 ref14 ref58 ref53 ref52 ref11 ref55 ref10 ref54 ref17 ref16 ref19 ref18 ref51 ref50 ref46 ref45 ref48 ref47 ref42 ref41 ref44 ref43 ref49 ref8 ref7 ref9 ref4 ref3 ref6 ref5 ref40 ref35 ref34 ref37 ref36 ref31 ref30 ref33 ref32 ref2 ref1 ref39 ref38 ref24 ref23 ref26 ref25 ref20 ref63 ref22 ref21 ref28 ref27 ref29 ref60 ref62 ref61
References_xml	– ident: ref49 doi: 10.1109/TASE.2019.2955988 – ident: ref6 doi: 10.1109/TSMC.2016.2616347 – ident: ref17 doi: 10.1016/j.ejor.2018.06.004 – ident: ref23 doi: 10.5772/48467 – ident: ref63 doi: 10.1109/TII.2017.2766528 – ident: ref56 doi: 10.1109/JAS.2019.1911540 – ident: ref7 doi: 10.1016/j.ijpe.2004.10.002 – ident: ref50 doi: 10.1109/TITS.2020.2972389 – ident: ref38 doi: 10.1007/978-1-4684-2001-2_9 – ident: ref41 doi: 10.1109/TCYB.2019.2901834 – ident: ref15 doi: 10.1016/j.cor.2016.04.009 – ident: ref33 doi: 10.1109/TASE.2019.2953669 – ident: ref29 doi: 10.1016/j.omega.2018.03.004 – ident: ref20 doi: 10.1080/00207543.2016.1264642 – ident: ref24 doi: 10.1016/j.camwa.2012.02.031 – ident: ref27 doi: 10.1016/j.ejor.2006.07.029 – ident: ref37 doi: 10.1201/9781439808856 – ident: ref46 doi: 10.1109/TASE.2017.2741965 – ident: ref31 doi: 10.1016/j.ins.2014.03.127 – ident: ref35 doi: 10.1142/3376 – ident: ref48 doi: 10.1007/s13675-016-0075-x – ident: ref57 doi: 10.1109/JAS.2019.1911378 – ident: ref45 doi: 10.1109/TCYB.2016.2574766 – ident: ref47 doi: 10.1016/s0305-0548(97)00031-2 – ident: ref32 doi: 10.1016/j.endm.2017.03.008 – ident: ref21 doi: 10.1109/MRA.2015.2415047 – ident: ref55 doi: 10.1109/ACCESS.2018.2861319 – ident: ref14 doi: 10.1016/j.cor.2012.07.013 – ident: ref5 doi: 10.1109/TASE.2016.2631491 – ident: ref39 doi: 10.1109/TII.2019.2901518 – ident: ref2 doi: 10.1109/ICNSC.2019.8743328 – ident: ref19 doi: 10.1080/00207543.2015.1108535 – ident: ref30 doi: 10.1007/978-3-319-07124-4_9 – ident: ref44 doi: 10.1109/TASE.2015.2503325 – ident: ref34 doi: 10.1109/TSMC.2014.2342199 – ident: ref3 doi: 10.1016/j.cie.2014.11.001 – ident: ref59 doi: 10.1109/TASE.2019.2909866 – ident: ref4 doi: 10.1109/TCYB.2018.2817240 – ident: ref53 doi: 10.1109/TASE.2017.2731981 – ident: ref18 doi: 10.1007/s10479-018-2852-9 – ident: ref60 doi: 10.1109/TASE.2019.2892480 – ident: ref26 doi: 10.1016/j.ejor.2005.12.009 – ident: ref12 doi: 10.1016/j.apm.2015.02.027 – ident: ref8 doi: 10.1109/TSMCA.2011.2147305 – ident: ref22 doi: 10.1007/s00170-006-0640-1 – ident: ref61 doi: 10.1109/TASE.2019.2958979 – ident: ref42 doi: 10.1126/science.220.4598.671 – ident: ref62 doi: 10.1109/TASE.2020.2971512 – ident: ref54 doi: 10.1109/JAS.2018.7511138 – ident: ref9 doi: 10.1016/j.ejor.2014.02.004 – ident: ref40 doi: 10.1016/j.omega.2013.10.002 – ident: ref13 doi: 10.1016/j.ejor.2015.07.001 – ident: ref1 doi: 10.1109/TII.2019.2944247 – ident: ref52 doi: 10.1109/TSMC.2015.2507161 – ident: ref43 doi: 10.1177/1687814017753912 – ident: ref25 doi: 10.1109/TCYB.2015.2478486 – ident: ref36 doi: 10.1007/978-1-4615-3126-5 – ident: ref58 doi: 10.1109/TSMC.2019.2907575 – ident: ref51 doi: 10.1016/0305-0483(89)90059-5 – ident: ref16 doi: 10.3934/jimo.2014.10.219 – ident: ref11 doi: 10.1016/j.ejor.2015.04.004 – ident: ref10 doi: 10.1007/s10479-017-2481-8 – ident: ref28 doi: 10.1016/j.cor.2019.07.016
SSID	ssj0024890
Score	2.6042743
Snippet	Wire rod and bar rolling is an important batch production process in steel production systems. A scheduling problem originated from this process is studied in...
SourceID	proquest crossref ieee
SourceType	Aggregation Database Enrichment Source Index Database Publisher
StartPage	251
SubjectTerms	Algorithms Batch production Batch production process Employment Greedy algorithms Hardness Heuristic Heuristic scheduling Industrial applications iterated greedy algorithm (IGA) Job shop scheduling Mixed integer Petri net (PN) Petri nets Production scheduling Scheduling Single machine scheduling Steel production Task analysis variable neighborhood descent (VND) Wire rod
Title	Heuristic Scheduling of Batch Production Processes Based on Petri Nets and Iterated Greedy Algorithms
URI	https://ieeexplore.ieee.org/document/9238439 https://www.proquest.com/docview/2616720574
Volume	19
WOSCitedRecordID	wos000739634600024&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: 1558-3783 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0024890 issn: 1545-5955 databaseCode: RIE dateStart: 20040101 isFulltext: true titleUrlDefault: https://ieeexplore.ieee.org/ providerName: IEEE
link	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1JSwMxFH5o8aAHd7Fu5OBJHE0ns-VYRdFLEVrB25DljRZqK52p4L_3JTNWRRG8DZMEhvmSvP17AMdGZaTkSwxkZm3gQmt0pIwISDZIE6I2UWJ9s4m018seHuTdApzOa2EQ0Sef4Zl79LF8OzEz5yo7J2UkIwG6CItpmta1Wp-8epn3pziNIIhlHDcRzA6X54Nu_4oswZAMVBekE-E3GeSbqvy4ib14uV7734etw2qjRrJujfsGLOB4E1a-kAtuAd7grKZhZn1CxrqU80c2KdgF3b5P7K6meiVYWFMsgCUNlWiZe-UabbEeViVTY8tuPfcyDbk0HfvGuqPHyXRYPT2X23B_fTW4vAmapgqBIcleBanrLZ_wtJBoOgnXnURJITWZqiouIhsJy7lNJGmzAjNl6f7RXCoRF0aT6aYisQOt8WSMu8CUdE5EEyotRaS5kiFygTpToUq1LOI28I_fnJuGcdw1vhjl3vLgMnfI5A6ZvEGmDSfzJS813cZfk7ccFPOJDQptOPjAMm8OZJmToZikISmn0d7vq_ZhOXSVDd67cgCtajrDQ1gyr9WwnB75vfYOGkrQWg
linkProvider	IEEE
linkToHtml	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1bSxwxFD6oLagPtlbFVdvmoU_F6WaTueVxFWWldhHcgm9DLmdU0F3ZmRX8955kxq1FEXwbJgkM8yU59-8A_LA6JyVfYaRy5yIfWqMjZWVEskFZgcbGqQvNJrLhML-4UGcLsD-vhUHEkHyGv_xjiOW7iZ15V1mXlJGcBOgifEjiWPSaaq1_zHp58Kh4nSBKVJK0McweV91R__yIbEFBJqoP00nxnxQKbVVe3MVBwBx_et-nfYa1VpFk_Qb5dVjA8RdYfUYvuAE4wFlDxMzOCRvnk84v2aRkB3T_XrGzhuyVgGFtuQBWNFShY_6Vb7XFhlhXTI8dOwnsyzTkE3XcA-vfXE6m1_XVbbUJf4-PRoeDqG2rEFmS7XWU-e7yKc9KhbaXctNLtZLKkLGqkzJ2sXScu1SRPisx145uIMOVlklpDRlvOpZbsDSejHEbmFbejWiFNkrGhmslkEs0uRY6M6pMOsCffnNhW85x3_ripgi2B1eFR6bwyBQtMh34OV9y1xBuvDV5w0Mxn9ii0IG9JyyL9khWBZmKaSZIPY13Xl_1HZYHoz-nxenJ8PcurAhf5xB8LXuwVE9n-BU-2vv6upp-C_vuERql06E
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=Heuristic+Scheduling+of+Batch+Production+Processes+Based+on+Petri+Nets+and+Iterated+Greedy+Algorithms&rft.jtitle=IEEE+transactions+on+automation+science+and+engineering&rft.au=Zhao%2C+Ziyan&rft.au=Liu%2C+Shixin&rft.au=Zhou%2C+Mengchu&rft.au=You%2C+Dan&rft.date=2022-01-01&rft.pub=IEEE&rft.issn=1545-5955&rft.volume=19&rft.issue=1&rft.spage=251&rft.epage=261&rft_id=info:doi/10.1109%2FTASE.2020.3027532&rft.externalDocID=9238439
thumbnail_l	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1545-5955&client=summon
thumbnail_m	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1545-5955&client=summon
thumbnail_s	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1545-5955&client=summon