<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD Journal Publishing DTD v2.3 20070202//EN" "journalpublishing.dtd">
<article article-type="review-article" dtd-version="2.3" xml:lang="EN" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">
<front>
<journal-meta>
<journal-id journal-id-type="publisher-id">Front. Ind. Eng.</journal-id>
<journal-title>Frontiers in Industrial Engineering</journal-title>
<abbrev-journal-title abbrev-type="pubmed">Front. Ind. Eng.</abbrev-journal-title>
<issn pub-type="epub">2813-6047</issn>
<publisher>
<publisher-name>Frontiers Media S.A.</publisher-name>
</publisher>
</journal-meta>
<article-meta>
<article-id pub-id-type="publisher-id">1337174</article-id>
<article-id pub-id-type="doi">10.3389/fieng.2024.1337174</article-id>
<article-categories>
<subj-group subj-group-type="heading">
<subject>Industrial Engineering</subject>
<subj-group>
<subject>Review</subject>
</subj-group>
</subj-group>
</article-categories>
<title-group>
<article-title>Enhancing multi-objective evolutionary algorithms with machine learning for scheduling problems: recent advances and survey</article-title>
<alt-title alt-title-type="left-running-head">Zhang et al.</alt-title>
<alt-title alt-title-type="right-running-head">
<ext-link ext-link-type="uri" xlink:href="https://doi.org/10.3389/fieng.2024.1337174">10.3389/fieng.2024.1337174</ext-link>
</alt-title>
</title-group>
<contrib-group>
<contrib contrib-type="author" corresp="yes">
<name>
<surname>Zhang</surname>
<given-names>Wenqiang</given-names>
</name>
<xref ref-type="aff" rid="aff1">
<sup>1</sup>
</xref>
<xref ref-type="corresp" rid="c001">&#x2a;</xref>
<uri xlink:href="https://loop.frontiersin.org/people/2394949/overview"/>
<role content-type="https://credit.niso.org/contributor-roles/conceptualization/"/>
<role content-type="https://credit.niso.org/contributor-roles/funding-acquisition/"/>
<role content-type="https://credit.niso.org/contributor-roles/methodology/"/>
<role content-type="https://credit.niso.org/contributor-roles/project-administration/"/>
<role content-type="https://credit.niso.org/contributor-roles/supervision/"/>
<role content-type="https://credit.niso.org/contributor-roles/Writing - review &#x26; editing/"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname>Xiao</surname>
<given-names>Guanwei</given-names>
</name>
<xref ref-type="aff" rid="aff1">
<sup>1</sup>
</xref>
<role content-type="https://credit.niso.org/contributor-roles/conceptualization/"/>
<role content-type="https://credit.niso.org/contributor-roles/data-curation/"/>
<role content-type="https://credit.niso.org/contributor-roles/investigation/"/>
<role content-type="https://credit.niso.org/contributor-roles/methodology/"/>
<role content-type="https://credit.niso.org/contributor-roles/writing-original-draft/"/>
<role content-type="https://credit.niso.org/contributor-roles/Writing - review &#x26; editing/"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname>Gen</surname>
<given-names>Mitsuo</given-names>
</name>
<xref ref-type="aff" rid="aff2">
<sup>2</sup>
</xref>
<uri xlink:href="https://loop.frontiersin.org/people/2104850/overview"/>
<role content-type="https://credit.niso.org/contributor-roles/conceptualization/"/>
<role content-type="https://credit.niso.org/contributor-roles/formal-analysis/"/>
<role content-type="https://credit.niso.org/contributor-roles/funding-acquisition/"/>
<role content-type="https://credit.niso.org/contributor-roles/investigation/"/>
<role content-type="https://credit.niso.org/contributor-roles/Writing - review &#x26; editing/"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname>Geng</surname>
<given-names>Huili</given-names>
</name>
<xref ref-type="aff" rid="aff1">
<sup>1</sup>
</xref>
<role content-type="https://credit.niso.org/contributor-roles/methodology/"/>
<role content-type="https://credit.niso.org/contributor-roles/Writing - review &#x26; editing/"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname>Wang</surname>
<given-names>Xiaomeng</given-names>
</name>
<xref ref-type="aff" rid="aff1">
<sup>1</sup>
</xref>
<role content-type="https://credit.niso.org/contributor-roles/methodology/"/>
<role content-type="https://credit.niso.org/contributor-roles/Writing - review &#x26; editing/"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname>Deng</surname>
<given-names>Miaolei</given-names>
</name>
<xref ref-type="aff" rid="aff1">
<sup>1</sup>
</xref>
<role content-type="https://credit.niso.org/contributor-roles/funding-acquisition/"/>
<role content-type="https://credit.niso.org/contributor-roles/validation/"/>
<role content-type="https://credit.niso.org/contributor-roles/Writing - review &#x26; editing/"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname>Zhang</surname>
<given-names>Guohui</given-names>
</name>
<xref ref-type="aff" rid="aff3">
<sup>3</sup>
</xref>
<role content-type="https://credit.niso.org/contributor-roles/conceptualization/"/>
<role content-type="https://credit.niso.org/contributor-roles/funding-acquisition/"/>
<role content-type="https://credit.niso.org/contributor-roles/validation/"/>
<role content-type="https://credit.niso.org/contributor-roles/Writing - review &#x26; editing/"/>
</contrib>
</contrib-group>
<aff id="aff1">
<sup>1</sup>
<institution>College of Information Science and Engineering</institution>, <institution>Henan University of Technology</institution>, <addr-line>Zhengzhou</addr-line>, <addr-line>Henan</addr-line>, <country>China</country>
</aff>
<aff id="aff2">
<sup>2</sup>
<institution>Fuzzy Logic Systems Institute/Tokyo University of Science</institution>, <addr-line>Iizuka</addr-line>, <country>Japan</country>
</aff>
<aff id="aff3">
<sup>3</sup>
<institution>School of Management Engineering</institution>, <institution>Zhengzhou University of Aeronautics</institution>, <addr-line>Zhengzhou</addr-line>, <country>China</country>
</aff>
<author-notes>
<fn fn-type="edited-by">
<p>
<bold>Edited by:</bold> <ext-link ext-link-type="uri" xlink:href="https://loop.frontiersin.org/people/1934526/overview">Kosmas Alexopoulos</ext-link>, University of Patras, Greece</p>
</fn>
<fn fn-type="edited-by">
<p>
<bold>Reviewed by:</bold> <ext-link ext-link-type="uri" xlink:href="https://loop.frontiersin.org/people/2016640/overview">Luiz Fernando Rodrigues Pinto</ext-link>, Universidade Nove de Julho, Brazil</p>
<p>
<ext-link ext-link-type="uri" xlink:href="https://loop.frontiersin.org/people/2011122/overview">Apoorv Maheshwari</ext-link>, Ernst and Young, United States</p>
</fn>
<corresp id="c001">&#x2a;Correspondence: Wenqiang Zhang, <email>zhangwq@haut.edu.cn</email>
</corresp>
</author-notes>
<pub-date pub-type="epub">
<day>28</day>
<month>02</month>
<year>2024</year>
</pub-date>
<pub-date pub-type="collection">
<year>2024</year>
</pub-date>
<volume>2</volume>
<elocation-id>1337174</elocation-id>
<history>
<date date-type="received">
<day>12</day>
<month>11</month>
<year>2023</year>
</date>
<date date-type="accepted">
<day>12</day>
<month>02</month>
<year>2024</year>
</date>
</history>
<permissions>
<copyright-statement>Copyright &#xa9; 2024 Zhang, Xiao, Gen, Geng, Wang, Deng and Zhang.</copyright-statement>
<copyright-year>2024</copyright-year>
<copyright-holder>Zhang, Xiao, Gen, Geng, Wang, Deng and Zhang</copyright-holder>
<license xlink:href="http://creativecommons.org/licenses/by/4.0/">
<p>This is an open-access article distributed under the terms of the Creative Commons Attribution License (CC BY). The use, distribution or reproduction in other forums is permitted, provided the original author(s) and the copyright owner(s) are credited and that the original publication in this journal is cited, in accordance with accepted academic practice. No use, distribution or reproduction is permitted which does not comply with these terms.</p>
</license>
</permissions>
<abstract>
<p>Multi-objective scheduling problems in workshops are commonly encountered challenges in the increasingly competitive market economy. These scheduling problems require a trade-off among multiple objectives such as time, energy consumption, and product quality. The importance of each optimization objective typically varies in different time periods or contexts, necessitating decision-makers to devise optimal scheduling plans accordingly. In actual production, decision-makers confront intricate multi-objective scheduling problems that demand balancing clients&#x2019; requirements and corporate interests while concurrently striving to reduce production cycles and costs. In solving various problems, multi-objective evolutionary algorithms have attracted the attention of researchers and gradually become one of the mainstream methods to solve these problems. In recent years, research combining multi-objective evolutionary algorithms with machine learning technology has shown great potential, opening up new prospects for improving the performance of multi-objective evolutionary methods. This article comprehensively reviews the latest application progress of machine learning in multi-objective evolutionary algorithms for scheduling problems. We review various machine learning techniques employed for enhancing multi-objective evolutionary algorithms, particularly focusing on different types of reinforcement learning methods. Different categories of scheduling problems addressed using these methods were also discussed, including flow-shop scheduling issues, job-shop scheduling challenges, and more. Finally, we highlighted the challenges faced by the field and outlined future research directions.</p>
</abstract>
<kwd-group>
<kwd>flow-shop scheduling problem</kwd>
<kwd>machine learning</kwd>
<kwd>job-shop scheduling problem</kwd>
<kwd>reinforcement learning</kwd>
<kwd>optimization algorithm</kwd>
<kwd>multi-objective evolutionary algorithm</kwd>
</kwd-group>
<custom-meta-wrap>
<custom-meta>
<meta-name>section-at-acceptance</meta-name>
<meta-value>Industrial Informatics</meta-value>
</custom-meta>
</custom-meta-wrap>
</article-meta>
</front>
<body>
<sec sec-type="intro" id="s1">
<title>1 Introduction</title>
<p>Scheduling problems are a prevalent class of operational research problems widely applied in practical work. Their central objective is to allocate limited resources to multiple tasks within certain constraints, aiming to satisfy or optimize one or more performance indicators. The specific process of scheduling involves assigning specific tasks to designated resources and prioritizing tasks on the same resource, ultimately determining the start and end times for each task on each resource. Efficient optimization techniques and scheduling methods are key to achieve energy conservation (<xref ref-type="bibr" rid="B44">Gao et al., 2020</xref>), reduce consumption (<xref ref-type="bibr" rid="B114">Makhadmeh et al., 2019</xref>), lower emissions (<xref ref-type="bibr" rid="B88">Li and Wang, 2022</xref>), reduce costs (<xref ref-type="bibr" rid="B148">Tang et al., 2021</xref>), and improve the optimality of production systems (<xref ref-type="bibr" rid="B69">Kenn&#xe9; and Gharbi, 2000</xref>), and are the core component to improving production efficiency and economic benefits. Scheduling problems find significant applications in various domains, including production planning, supply chain management, transportation, aerospace, entertainment, healthcare, and telecommunications, among others. Consequently, research on scheduling holds paramount theoretical and practical value. The study of production scheduling problems originated in the 1950s and has attracted considerable attention from researchers worldwide due to its practical significance.</p>
<p>In the field of production scheduling, shop scheduling problems are the earliest and most extensively studied categorty. Shop scheduling refers to the process of optimizing the allocation of resources such as equipment, personnel (<xref ref-type="bibr" rid="B109">Luo Q. et al., 2022</xref>), and raw materials (<xref ref-type="bibr" rid="B130">Ramya et al., 2019</xref>) in a factory to meet production plan requirements and maximize production efficiency. Its objective is to ensure accurate execution of production plans while reducing production costs and improving efficiency. Proper shop scheduling plays a crucial role in manufacturing by ensuring smooth production processes, minimizing waste and wait times (<xref ref-type="bibr" rid="B75">Koulamas and Kyparisis, 2021</xref>), and improving production quality and efficiency (<xref ref-type="bibr" rid="B197">Zhao et al., 2021a</xref>). Common types of shop scheduling include flow-shop scheduling for continuous production processes and job-shop scheduling for discrete production processes, with variations such as parallel machine scheduling (<xref ref-type="bibr" rid="B80">Lei and Liu, 2020</xref>), hybrid shop scheduling (<xref ref-type="bibr" rid="B10">Botta-Genoulaz, 2000</xref>), and flexible shop scheduling (<xref ref-type="bibr" rid="B94">Li X. et al., 2022</xref>), each having their unique characteristics and scheduling algorithms that companies can choose based on their specific needs to achieve optimal production benefits. <xref ref-type="fig" rid="F1">Figure 1</xref> illustrates the classification of shop scheduling problems.</p>
<fig id="F1" position="float">
<label>FIGURE 1</label>
<caption>
<p>Classification of shop scheduling problems.</p>
</caption>
<graphic xlink:href="fieng-02-1337174-g001.tif"/>
</fig>
<p>Several classic variants, such as the permutation flow-shop scheduling problem, hybrid flow-shop scheduling problem, job-shop scheduling problem, and flexible job-shop scheduling problem, among others, are encompassed by the shop scheduling problem. Building upon these classical problems, numerous other scheduling problems can be derived, such as the flexible job-shop scheduling problem considering composite processing limitations and the distributed flexible job-shop scheduling problem. Real-world shop scheduling can serve as a research problem, and researchers can tackle these problems by designing efficient scheduling algorithms.</p>
<p>Traditional job scheduling faces challenges in meeting market demands. Its main limitation lies in excessive focus on a single optimization goal, typically minimizing completion time (<xref ref-type="bibr" rid="B3">Ahmadian et al., 2021</xref>), while overlooking other crucial factors. Concerning production indicators, the emphasis solely on completion time (<xref ref-type="bibr" rid="B157">Umam et al., 2022</xref>) neglects considerations such as machine utilization (<xref ref-type="bibr" rid="B2">Abualigah and Diabat, 2021</xref>) and total processing time (<xref ref-type="bibr" rid="B26">Dai et al., 2019</xref>), making scheduling less adaptable to diverse market needs. Additionally, rigid scheduling strategies in traditional systems struggle to flexibly respond to market changes and demand fluctuations, resulting in delays or an inability to meet new market requirements. To better address market demands, current research is gradually shifting towards multi-objective optimization problems (MOPs), highlighting the importance of considering factors like machine utilization, delivery time (<xref ref-type="bibr" rid="B103">Liu et al., 2021</xref>), and inventory costs (<xref ref-type="bibr" rid="B134">San-Jos&#xe9; et al., 2019</xref>). Simultaneously, introducing more flexible and intelligent scheduling strategies and technologies becomes crucial for better adaptation to the ever-changing market environment. Therefore, research on MOPs in the field of scheduling holds significant engineering importance (<xref ref-type="bibr" rid="B79">Lei, 2009</xref>).</p>
<p>For most MOPs, the objectives are often in conflict. Consequently, optimizing all objectives simultaneously to their respective optimal values is unattainable. An array of compromise solutions among different objectives is referred to as the Pareto optimal set. The expression of MOP is (<xref ref-type="bibr" rid="B21">Cheung et al., 2016</xref>):<disp-formula id="e1">
<mml:math id="m1">
<mml:mtable class="eqnarray">
<mml:mtr>
<mml:mtd columnalign="right"/>
<mml:mtd columnalign="left">
<mml:mtext>min.</mml:mtext>
</mml:mtd>
<mml:mtd columnalign="left">
<mml:mi>F</mml:mi>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mi mathvariant="bold-italic">t</mml:mi>
</mml:mrow>
</mml:mfenced>
<mml:mo>&#x3d;</mml:mo>
<mml:msup>
<mml:mrow>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:msub>
<mml:mrow>
<mml:mi>f</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:msub>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mi mathvariant="bold-italic">t</mml:mi>
</mml:mrow>
</mml:mfenced>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi>f</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mn>2</mml:mn>
</mml:mrow>
</mml:msub>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mi mathvariant="bold-italic">t</mml:mi>
</mml:mrow>
</mml:mfenced>
<mml:mo>,</mml:mo>
<mml:mo>&#x2026;</mml:mo>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi>f</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>m</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mi mathvariant="bold-italic">t</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mrow>
<mml:mtext>T</mml:mtext>
</mml:mrow>
</mml:msup>
</mml:mtd>
</mml:mtr>
<mml:mtr>
<mml:mtd columnalign="right"/>
<mml:mtd columnalign="left">
<mml:mtext>s.&#x2009;t.&#x2009;</mml:mtext>
</mml:mtd>
<mml:mtd columnalign="left">
<mml:mi mathvariant="bold-italic">t</mml:mi>
<mml:mo>&#x2208;</mml:mo>
<mml:mi mathvariant="normal">&#x3a9;</mml:mi>
</mml:mtd>
</mml:mtr>
</mml:mtable>
</mml:math>
<label>(1)</label>
</disp-formula>where <italic>t</italic> &#x3d; (<italic>t</italic>
<sub>1</sub>, <italic>t</italic>
<sub>2</sub>, &#x2026; , <italic>t</italic>
<sub>
<italic>n</italic>
</sub>) &#x2208; &#x3a9; is a decision vector and &#x3a9; is the decision space. <italic>F</italic>(<italic>t</italic>) consists of <italic>m</italic> objective functions (<xref ref-type="bibr" rid="B88">Li and Wang, 2022</xref>). The objectives in Eq. <xref ref-type="disp-formula" rid="e1">1</xref> often manifest mutual conflicts (<xref ref-type="bibr" rid="B51">Gu and Wang, 2020</xref>), where the optimization of one objective tends to deteriorate another objective. To address this issue, Edgeworth and Pareto (<xref ref-type="bibr" rid="B144">Stadler, 1979</xref>) introduced the concept of Pareto optimality as a means to balance these objectives and attain relatively superior solutions. Presented below are fundamental definitions related to Pareto optimality (<xref ref-type="bibr" rid="B158">Voorneveld, 2003</xref>; <xref ref-type="bibr" rid="B28">Deb and Gupta, 2005</xref>; <xref ref-type="bibr" rid="B46">Gen et al., 2008</xref>; <xref ref-type="bibr" rid="B203">Zitzler et al., 2008</xref>).</p>
<p>
<statement content-type="definition" id="Definition_1">
<label>Definition 1</label>
<p>Pareto Dominance: If the vector <inline-formula id="inf1">
<mml:math id="m2">
<mml:mi mathvariant="bold-italic">u</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:msup>
<mml:mrow>
<mml:mrow>
<mml:mo stretchy="false">(</mml:mo>
<mml:mrow>
<mml:msub>
<mml:mrow>
<mml:mi mathvariant="bold-italic">u</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi mathvariant="bold-italic">u</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mn>2</mml:mn>
</mml:mrow>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:mo>&#x2026;</mml:mo>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi mathvariant="bold-italic">u</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>m</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
</mml:mrow>
<mml:mrow>
<mml:mtext>T</mml:mtext>
</mml:mrow>
</mml:msup>
</mml:math>
</inline-formula> is better than the vector <inline-formula id="inf2">
<mml:math id="m3">
<mml:mi mathvariant="bold-italic">v</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:msup>
<mml:mrow>
<mml:mrow>
<mml:mo stretchy="false">(</mml:mo>
<mml:mrow>
<mml:msub>
<mml:mrow>
<mml:mi mathvariant="bold-italic">v</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi mathvariant="bold-italic">v</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mn>2</mml:mn>
</mml:mrow>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:mo>&#x2026;</mml:mo>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi mathvariant="bold-italic">v</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>m</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
</mml:mrow>
<mml:mrow>
<mml:mtext>T</mml:mtext>
</mml:mrow>
</mml:msup>
</mml:math>
</inline-formula>, <italic>iff</italic> <italic>&#x2200;i</italic> &#x2208; {1, &#x2026; , <italic>m</italic>}, <italic>u</italic>
<sub>
<italic>i</italic>
</sub>&#x2a7d;<italic>v</italic>
<sub>
<italic>i</italic>
</sub> and <italic>u</italic> &#x2260; <italic>v</italic>. It is said that <italic>u</italic> dominates <italic>v</italic>, denoted as <italic>u</italic> &#x227a; <italic>v</italic>.</p>
</statement>
</p>
<p>
<statement content-type="definition" id="Definition_2">
<label>Definition 2</label>
<p>Pareto optimal solutions: There does not exist any feasible solution <italic>x</italic> &#x2208; <italic>D</italic> where all the objective values of <italic>f</italic>(<italic>x</italic>) are not worse than the objective values of <italic>f</italic>(<italic>x</italic>&#x2a;) and at least one objective value is strictly better than the corresponding objective value of <italic>f</italic>(<italic>x</italic>&#x2a;). The mathematical expression is represented in Eq. <xref ref-type="disp-formula" rid="e2">2</xref>.<disp-formula id="e2">
<mml:math id="m4">
<mml:msup>
<mml:mrow>
<mml:mi mathvariant="bold-italic">x</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mo>&#x2a;</mml:mo>
</mml:mrow>
</mml:msup>
<mml:mo>&#x2208;</mml:mo>
<mml:mi>D</mml:mi>
<mml:mo>,</mml:mo>
<mml:mo>&#x2204;</mml:mo>
<mml:mi mathvariant="bold-italic">x</mml:mi>
<mml:mspace width="0.3333em"/>
<mml:mi>i</mml:mi>
<mml:mi>n</mml:mi>
<mml:mi>D</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>f</mml:mi>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mi mathvariant="bold-italic">x</mml:mi>
</mml:mrow>
</mml:mfenced>
<mml:mo>&#x2a7d;</mml:mo>
<mml:mi>f</mml:mi>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:msup>
<mml:mrow>
<mml:mi mathvariant="bold-italic">x</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mo>&#x2a;</mml:mo>
</mml:mrow>
</mml:msup>
</mml:mrow>
</mml:mfenced>
</mml:math>
<label>(2)</label>
</disp-formula>
</p>
</statement>
</p>
<p>
<statement content-type="definition" id="Definition_3">
<label>Definition 3</label>
<p>Pareto Set: The amalgamation of all Pareto optimal solutions is commonly denoted as the Pareto set (PS). The mathematical expression is represented in Eq. <xref ref-type="disp-formula" rid="e3">3</xref>.<disp-formula id="e3">
<mml:math id="m5">
<mml:mi>P</mml:mi>
<mml:mi>S</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mfenced open="{" close="}">
<mml:mrow>
<mml:msub>
<mml:mrow>
<mml:mi mathvariant="bold-italic">x</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>p</mml:mi>
<mml:mi>s</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x2208;</mml:mo>
<mml:mi>D</mml:mi>
<mml:mo stretchy="false">&#x2223;</mml:mo>
<mml:mo>&#x2204;</mml:mo>
<mml:mi mathvariant="bold-italic">x</mml:mi>
<mml:mo>&#x2208;</mml:mo>
<mml:mi>D</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi mathvariant="bold-italic">x</mml:mi>
<mml:mo>&#x3c;</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi mathvariant="bold-italic">x</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>p</mml:mi>
<mml:mi>s</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:math>
<label>(3)</label>
</disp-formula>
</p>
</statement>
</p>
<p>
<statement content-type="definition" id="Definition_4">
<label>Definition 4</label>
<p>Pareto front: The assemblage of objective value vectors corresponding to each solution within the PS is referred to as the Pareto front (PF). The mathematical expression is represented in Eq. <xref ref-type="disp-formula" rid="e4">4</xref>.<disp-formula id="e4">
<mml:math id="m6">
<mml:mi>P</mml:mi>
<mml:mi>F</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mfenced open="{" close="}">
<mml:mrow>
<mml:mi>F</mml:mi>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mi mathvariant="bold-italic">x</mml:mi>
</mml:mrow>
</mml:mfenced>
<mml:mo>&#x2208;</mml:mo>
<mml:mi mathvariant="normal">&#x39b;</mml:mi>
<mml:mo stretchy="false">&#x2223;</mml:mo>
<mml:mi mathvariant="bold-italic">x</mml:mi>
<mml:mo>&#x2208;</mml:mo>
<mml:mi>P</mml:mi>
<mml:mi>S</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:math>
<label>(4)</label>
</disp-formula>
</p>
</statement>
</p>
<p>Scheduling is a highly intricate and multi-dimensional discrete optimization challenge encompassing the optimal arrangement of jobs and operations, and the assignment of machines. It can be formulated a function, denoted as follows:<disp-formula id="e5">
<mml:math id="m7">
<mml:mi>f</mml:mi>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:msup>
<mml:mrow>
<mml:mi mathvariant="bold-italic">x</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mo>&#x2a;</mml:mo>
</mml:mrow>
</mml:msup>
<mml:mo>,</mml:mo>
<mml:msup>
<mml:mrow>
<mml:mi mathvariant="bold-italic">y</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mo>&#x2a;</mml:mo>
</mml:mrow>
</mml:msup>
</mml:mrow>
</mml:mfenced>
<mml:mo>&#x3d;</mml:mo>
<mml:munder>
<mml:mrow>
<mml:mi>min</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="bold-italic">x</mml:mi>
<mml:mo>&#x2208;</mml:mo>
<mml:mi mathvariant="normal">&#x3a9;</mml:mi>
</mml:mrow>
</mml:munder>
<mml:mi>f</mml:mi>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mi mathvariant="bold-italic">x</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi mathvariant="bold-italic">y</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:math>
<label>(5)</label>
</disp-formula>In Eq. <xref ref-type="disp-formula" rid="e5">5</xref>, where <italic>x</italic> represents an <italic>n</italic>-dimensional vector, <italic>x</italic> &#x3d; (<italic>x</italic>
<sub>1</sub>, <italic>x</italic>
<sub>2</sub>, &#x2026; , <italic>x</italic>
<sub>
<italic>n</italic>
</sub>), representing the prioritized order of <italic>n</italic> jobs or operations. Similarly, <italic>y</italic> represents an <italic>n</italic>-dimensional vector, <italic>y</italic> &#x3d; (<italic>y</italic>
<sub>1</sub>, <italic>y</italic>
<sub>2</sub>, &#x2026; , <italic>y</italic>
<sub>
<italic>n</italic>
</sub>), indicating the allocation status of machines. The sequence of jobs determines the order of machine allocation (<xref ref-type="bibr" rid="B99">Lin and Gen, 2018</xref>).</p>
<p>Numerous multi-objective optimization approaches have been proposed, such as: heuristic approaches (<xref ref-type="bibr" rid="B37">Fattahi et al., 2007</xref>), multi-objective evolutionary algorithms (MOEAs) (<xref ref-type="bibr" rid="B45">Gen and Cheng, 2000</xref>; <xref ref-type="bibr" rid="B205">Zitzler et al., 2001</xref>; <xref ref-type="bibr" rid="B29">Deb et al., 2002</xref>; <xref ref-type="bibr" rid="B36">Espejo et al., 2009</xref>; <xref ref-type="bibr" rid="B27">Deb, 2011</xref>; <xref ref-type="bibr" rid="B188">Zhang et al., 2014</xref>), machine learning-based approaches (<xref ref-type="bibr" rid="B11">Brik et al., 2019</xref>), <italic>etc.</italic>
</p>
<p>Among them, MOEAs is a population-based evolutionary algorithm (EA) that generates new solutions by evaluating objective functions and using selection and recombination operators. The methods of MOEAs can generally be categorized into Pareto-dominance-based MOEAs (<xref ref-type="bibr" rid="B143">Srinivas and Deb, 1994</xref>), decomposition-based MOEAs (MOEA/D) (<xref ref-type="bibr" rid="B186">Zhang and Li, 2007</xref>), and indicator-based MOEAs (<xref ref-type="bibr" rid="B204">Zitzler and K&#xfc;nzli, 2004</xref>).</p>
<list list-type="simple">
<list-item>
<p>1. Pareto-dominance-based MOEAs: This method is based on Pareto dominance relationship, and by maintaining a set of non dominated solutions, the algorithm can iteratively evolve pareto optimal solutions that achieve compromise on multiple objectives. This algorithm adopts non dominated sorting and selection mechanisms, making the selected solutions more likely to make significant progress on the PF in each generation. The approach have been proven effective in solving MOPs with two or three objectives. However, when facing high-dimensional MOPs, many Pareto-dominance-based MOEAs may encounter selection pressure issues, making it challenging for them to evolve effectively towards the true PF. Due to the exponential growth of non-dominated solutions with an increasing number of objectives during the early iterations, the aforementioned issue arises. Consequently, the convergence-maintaining mechanism based solely on Pareto dominance (e.g., NSGA-III (<xref ref-type="bibr" rid="B176">Yi et al., 2020</xref>)) loses the pressure to drive the population towards the PF. Hence, relying solely on the criterion of Pareto dominance cannot effectively differentiate the convergence level of individuals. In light of this, the dual archive algorithm (<xref ref-type="bibr" rid="B105">Liu et al., 2019</xref>) boosts solution convergence, while the enhanced dual archive algorithm (<xref ref-type="bibr" rid="B84">Li et al., 2014</xref>) addresses the complexities associated with high-dimensional multi-objective problems. To achieve a harmonious equilibrium between population convergence and diversity, Wang and Tong (<xref ref-type="bibr" rid="B167">Wang and Tong, 2020</xref>) put forth a dimension-convergent MOEA.</p>
</list-item>
<list-item>
<p>2. Decomposition-based MOEAs: A novel approach called MOEA based on decomposition (MOEA/D). By leveraging decomposition, MOEA/D offers a promising avenue for multi-objective evolutionary optimization. It facilitates the efficient optimization of multiple objectives by breaking them down into simpler subproblems and leveraging inter-subproblem interactions. This approach has the potential to enhance the scalability and computational efficiency of multiobjective evolutionary optimization algorithms (<xref ref-type="bibr" rid="B155">Trivedi et al., 2016</xref>). In MOEA/D, the evolutionary operators are highly sensitive to the characteristics of the problem, particularly in different search stages where the characteristics often exhibit diversity. However, in existing integrated approaches, the same evolutionary operators are applied to all subproblems/subspaces. For complex MOPs, the characteristics of subproblems/subspaces vary, which significantly weakens their distribution. Furthermore, the distribution of high-dimensional MOPs cannot be effectively guaranteed, resulting in suboptimal performance.</p>
</list-item>
<list-item>
<p>3. Indicator-based MOEAs: A method of evaluating and comparing solution sets generated by algorithms by designing and utilizing performance indicators. These indicators typically include convergence, diversity, balance, <italic>etc.</italic>, aimed at helping optimization algorithms better understand and improve their performance when dealing with multi-objective problems. By introducing these indicators, indicator-based MOEAs provide researchers with an effective way to quantify and compare the performance of multi-objective optimization algorithms. Among the indicator-based MOEAs (<xref ref-type="bibr" rid="B6">Beume et al., 2007</xref>), the s-metric selection evolutionary multi-objective algorithm stands out as a widely recognized and representative method. Furthermore, there are other notable approaches in this domain, such as MOEA whose environmental selection is based on an enhanced inverted generational distance indicator with noncontributing solution detection (IGD-NS) (<xref ref-type="bibr" rid="B151">Tian et al., 2016</xref>) and MOEA methods based on IGD-NS (<xref ref-type="bibr" rid="B150">Tian et al., 2017</xref>), <italic>etc.</italic>
</p>
</list-item>
</list>
<p>Despite the tremendous success of existing MOEAs in addressing multi-objective problems, they are predominantly focused on unconstrained MOPs, and the performance of most MOEAs drastically deteriorates when confronted with large-scale MOPs. The emergence of machine learning (ML) has offered potential to enhance the performance of MOEAs. Early investigations into the integration of ML and EAs were initiated by Goldberg and Holland in 1988 (<xref ref-type="bibr" rid="B9">Booker et al., 1989</xref>).</p>
<p>This paper primarily emphasizes recent advancements in combining ML, particularly emerging reinforcement learning (RL), with MOEAs for solving multi-objective shop scheduling problems. In <xref ref-type="sec" rid="s2">Section 2</xref>, we provide an in-depth and comprehensive discussion on the background knowledge of scheduling problems and RL. Subsequently, in <xref ref-type="sec" rid="s3">Section 3</xref>, we investigate the detailed application of traditional MOEAs and RL in scheduling problems. Following that, in <xref ref-type="sec" rid="s4">Section 4</xref>, we present the latest progress in the application of enhanced MOEAs in the field of scheduling. Finally, in <xref ref-type="sec" rid="s5">Section 5</xref>, we summarize the paper and propose potential avenues for future research.</p>
</sec>
<sec id="s2">
<title>2 Shop scheduling problems</title>
<sec id="s2-1">
<title>2.1 Flow-shop scheduling problem</title>
<p>The flow-shop scheduling problem (FSP) is an NP-hard optimization problem (<xref ref-type="bibr" rid="B5">Berli&#x144;ska and Przybylski, 2021</xref>), and researchers typically employ nature-inspired EA or other meta-heuristic algorithms (<xref ref-type="bibr" rid="B48">Goli et al., 2023</xref>) to solve it. These algorithms often leverage inspiration from natural evolution processes, collective behavior, and physical laws to enhance search efficiency, using a variety of potential options to preserve population diversity and prevent being stuck in local optima (<xref ref-type="bibr" rid="B67">Katoch et al., 2021</xref>).</p>
<p>The FSP refers to the task of scheduling the sequence and timing of different operations in a manufacturing shop consisting of multiple machines. The objective is to achieve the optimal production efficiency and minimize the production cost.</p>
<p>The problem can be formulated using mathematical models that include the following elements.<list list-type="simple">
<list-item>
<p>&#x2022; Individually assigned to a specific machine, each job is executed solely once on that designated machine.</p>
</list-item>
<list-item>
<p>&#x2022; Each machine has a limited capacity, therefore only one job may be executed concurrently on each machine at any one time.</p>
</list-item>
<list-item>
<p>&#x2022; Every job can only be finished on a single machine; it cannot be changed to another.</p>
</list-item>
<list-item>
<p>&#x2022; Jobs are non-preemptive, once they commence running on a machine, they cannot be paused or transferred to other machines midway.</p>
</list-item>
<list-item>
<p>&#x2022; Regardless of changes to the schedule, the processing time for every job on every machine is fixed.</p>
</list-item>
<list-item>
<p>&#x2022; The order in which the machines are used is predetermined, and each job is completed on the machines in the designated sequence.</p>
</list-item>
</list>The following is a mathematical description of the FSP.<disp-formula id="e6">
<mml:math id="m8">
<mml:mi>c</mml:mi>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>j</mml:mi>
</mml:mrow>
</mml:mfenced>
<mml:mo>&#x3d;</mml:mo>
<mml:mi>t</mml:mi>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>j</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:math>
<label>(6)</label>
</disp-formula>
<disp-formula id="e7">
<mml:math id="m9">
<mml:mi>c</mml:mi>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>j</mml:mi>
</mml:mrow>
</mml:mfenced>
<mml:mo>&#x3d;</mml:mo>
<mml:mi>c</mml:mi>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>j</mml:mi>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:mfenced>
<mml:mo>&#x2b;</mml:mo>
<mml:mi>t</mml:mi>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>j</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:math>
<label>(7)</label>
</disp-formula>
<disp-formula id="e8">
<mml:math id="m10">
<mml:mi>c</mml:mi>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>j</mml:mi>
</mml:mrow>
</mml:mfenced>
<mml:mo>&#x3d;</mml:mo>
<mml:mi>c</mml:mi>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>1</mml:mn>
<mml:mo>,</mml:mo>
<mml:mi>j</mml:mi>
</mml:mrow>
</mml:mfenced>
<mml:mo>&#x2b;</mml:mo>
<mml:mi>t</mml:mi>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>j</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:math>
<label>(8)</label>
</disp-formula>
<disp-formula id="e9">
<mml:math id="m11">
<mml:mi>c</mml:mi>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>j</mml:mi>
</mml:mrow>
</mml:mfenced>
<mml:mo>&#x3d;</mml:mo>
<mml:mi>max</mml:mi>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mi>c</mml:mi>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>1</mml:mn>
<mml:mo>,</mml:mo>
<mml:mi>j</mml:mi>
</mml:mrow>
</mml:mfenced>
<mml:mo>,</mml:mo>
<mml:mi>c</mml:mi>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>j</mml:mi>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mfenced>
<mml:mo>&#x2b;</mml:mo>
<mml:mi>t</mml:mi>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>j</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:math>
<label>(9)</label>
</disp-formula>
<disp-formula id="e10">
<mml:math id="m12">
<mml:mspace width="0.3333em"/>
<mml:mi>M</mml:mi>
<mml:mi>a</mml:mi>
<mml:mi>k</mml:mi>
<mml:mi>e</mml:mi>
<mml:mi>S</mml:mi>
<mml:mi>p</mml:mi>
<mml:mi>a</mml:mi>
<mml:mi>n</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mi>min</mml:mi>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mi>c</mml:mi>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mi>n</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>m</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mfenced>
</mml:math>
<label>(10)</label>
</disp-formula>Where the completion time of task <italic>i</italic> on machine <italic>j</italic> equals its own processing time, as shown by Eq. <xref ref-type="disp-formula" rid="e6">6</xref>. Eq. <xref ref-type="disp-formula" rid="e7">7</xref> denotes the completion time of task <italic>i</italic> on machine <italic>j</italic> as the sum of the completion time of job <italic>i</italic> on the preceding machine and the processing time for the current operation. The completion time of task <italic>i</italic> on machine <italic>j</italic> is determined by adding the cumulative completion time of the previous job on machine <italic>j</italic> and the processing time necessary for the current operation, as stated in Eq. <xref ref-type="disp-formula" rid="e8">8</xref>. As demonstrated by Eq. <xref ref-type="disp-formula" rid="e9">9</xref>, the completion time of job <italic>i</italic> on machine <italic>j</italic> can be represented as the sum of the processing time for the current operation and the maximum value obtained by comparing the completion time of the <italic>i</italic> &#x2212; 1st job on machine <italic>j</italic> with the completion time of job <italic>i</italic> on machine <italic>j</italic> &#x2212; 1. Eq. <xref ref-type="disp-formula" rid="e10">10</xref> demonstrates that the makespan and overall completion time of the complete assembly line are contingent upon the finalization time of the last task <italic>n</italic> on the last machine <italic>m</italic>.</p>
<p>Typically, FSPs are categorized based on the sequence of operations and the attributes of the processing machines into various classifications, including permutation flow-shop scheduling Problem (PFSP) (<xref ref-type="bibr" rid="B121">de F&#xe1;tima Morais et al., 2022</xref>), no-wait flow-shop scheduling Problem (NWFSP) (<xref ref-type="bibr" rid="B198">Zhao et al., 2019</xref>), hybrid flow-shop scheduling Problem (HFSP) (<xref ref-type="bibr" rid="B38">Fernandez-Viagas et al., 2019</xref>), no-idle FSP (<xref ref-type="bibr" rid="B201">Zhou et al., 2014</xref>; <xref ref-type="bibr" rid="B190">Zhang W. et al., 2021</xref>), and block FSP (<xref ref-type="bibr" rid="B118">Miyata and Nagano, 2019</xref>), <italic>etc.</italic> <xref ref-type="fig" rid="F2">Figure 2</xref> represents a Gantt chart for a flow-shop.</p>
<fig id="F2" position="float">
<label>FIGURE 2</label>
<caption>
<p>A Gantt chart of a three-job, three-machine flow-shop.</p>
</caption>
<graphic xlink:href="fieng-02-1337174-g002.tif"/>
</fig>
</sec>
<sec id="s2-2">
<title>2.2 Hybrid flow-shop scheduling problem</title>
<p>The HFSP is an important production planning problem widely used in different manufacturing fields. Researchers use various algorithms to solve HFSP problems, considering different goals and process constraints.</p>
<p>The scheduling challenge in a hybrid-flow shop setting can be broadly defined as handling n jobs that follow similar processing routes across m processing stages. The presence of at least one parallel machine, and preferably two or more, is essential. Moreover, it is imperative that these parallel machines exhibit uniform processing capabilities.</p>
<p>With the provided processing times for all jobs, the primary goal of this issue is to ascertain the sequential arrangement of the n jobs both before and after each processing stage. Additionally, it involves allocating devices during each stage to minimize the total completion time of all jobs. The assumptions underlying the problem model are outlined below.<list list-type="simple">
<list-item>
<p>&#x2022; Each job can be processed on only one machine at the same time.</p>
</list-item>
<list-item>
<p>&#x2022; The same machine can only process one job at a time.</p>
</list-item>
<list-item>
<p>&#x2022; The processing duration for each job on a specific device is predetermined.</p>
</list-item>
<list-item>
<p>&#x2022; Once initiated, the processing procedure remains uninterrupted.</p>
</list-item>
<list-item>
<p>&#x2022; Sequential dependencies are present solely within the operations of a given job, with no inter-operation constraints across distinct jobs.</p>
</list-item>
<list-item>
<p>&#x2022; Unforeseen factors, such as machine malfunctions, are not taken into consideration.</p>
</list-item>
<list-item>
<p>&#x2022; Any additional time incurred from transitioning between jobs on the same machine is not factored into the analysis.</p>
</list-item>
</list>
</p>
<sec id="s2-2-1">
<title>2.2.1 Decision variables</title>
<p>
<italic>X</italic>
<sub>
<italic>q</italic>,<italic>j</italic>,<italic>i</italic>
</sub>: The feasibility of processing job <italic>j</italic> on machine <italic>q</italic> during operation <italic>i</italic>. A value of <italic>X</italic>
<sub>
<italic>q</italic>,<italic>j</italic>,<italic>i</italic>
</sub> &#x3d; 1 indicates the feasibility of processing, while <italic>X</italic>
<sub>
<italic>q</italic>,<italic>j</italic>,<italic>i</italic>
</sub> &#x3d; 0 signifies the impossibility of processing;</p>
<p>
<inline-formula id="inf3">
<mml:math id="m13">
<mml:msub>
<mml:mrow>
<mml:mi>Y</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:msub>
<mml:mrow>
<mml:mi>j</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:msub>
<mml:msub>
<mml:mrow>
<mml:mi>j</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mn>2</mml:mn>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:msub>
</mml:math>
</inline-formula>: The precedence relationship between job <italic>j</italic>
<sub>1</sub> and <italic>j</italic>
<sub>2</sub> in operation i. A value of <inline-formula id="inf4">
<mml:math id="m14">
<mml:msub>
<mml:mrow>
<mml:mi>Y</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:msub>
<mml:mrow>
<mml:mi>j</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:msub>
<mml:msub>
<mml:mrow>
<mml:mi>j</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mn>2</mml:mn>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:msub>
</mml:math>
</inline-formula> &#x3d; 1 indicates that <italic>j</italic>
<sub>1</sub> takes precedence, while <inline-formula id="inf5">
<mml:math id="m15">
<mml:msub>
<mml:mrow>
<mml:mi>Y</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:msub>
<mml:mrow>
<mml:mi>j</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:msub>
<mml:msub>
<mml:mrow>
<mml:mi>j</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mn>2</mml:mn>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:msub>
</mml:math>
</inline-formula> &#x3d; 0 indicates that <italic>j</italic>
<sub>1</sub> takes precedence.</p>
<p>The following is a mathematical representation of the HFSP.<disp-formula id="e11">
<mml:math id="m16">
<mml:mi>min</mml:mi>
<mml:mo>.</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi>T</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mtext>max&#x2009;</mml:mtext>
</mml:mrow>
</mml:msub>
</mml:math>
<label>(11)</label>
</disp-formula>
<disp-formula id="e12">
<mml:math id="m17">
<mml:msub>
<mml:mrow>
<mml:mi>T</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>max</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:mi>max</mml:mi>
<mml:mfenced open="{" close="}">
<mml:mrow>
<mml:msub>
<mml:mrow>
<mml:mi>F</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>j</mml:mi>
<mml:mi>i</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:math>
<label>(12)</label>
</disp-formula>
<disp-formula id="e13">
<mml:math id="m18">
<mml:msub>
<mml:mrow>
<mml:mi>F</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>j</mml:mi>
<mml:mi>i</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi>S</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>j</mml:mi>
<mml:mi>i</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x2b;</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi>T</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>j</mml:mi>
<mml:mi>i</mml:mi>
</mml:mrow>
</mml:msub>
</mml:math>
<label>(13)</label>
</disp-formula>
<disp-formula id="e14">
<mml:math id="m19">
<mml:mtext>s.&#x2009;t.</mml:mtext>
<mml:mstyle displaystyle="true">
<mml:munderover>
<mml:mrow>
<mml:mo>&#x2211;</mml:mo>
</mml:mrow>
<mml:mrow>
<mml:mi>q</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mrow>
<mml:msub>
<mml:mrow>
<mml:mi>B</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>i</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:munderover>
</mml:mstyle>
<mml:msub>
<mml:mrow>
<mml:mi>X</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>q</mml:mi>
<mml:mi>j</mml:mi>
<mml:mi>i</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>1</mml:mn>
</mml:math>
<label>(14)</label>
</disp-formula>
<disp-formula id="e15">
<mml:math id="m20">
<mml:msub>
<mml:mrow>
<mml:mi>S</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>j</mml:mi>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>&#x2b;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:msub>
<mml:mo>&#x2212;</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi>S</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>j</mml:mi>
<mml:mi>i</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x2a7e;</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi>T</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>j</mml:mi>
<mml:mi>i</mml:mi>
</mml:mrow>
</mml:msub>
</mml:math>
<label>(15)</label>
</disp-formula>
<disp-formula id="e16">
<mml:math id="m21">
<mml:msub>
<mml:mrow>
<mml:mi>Y</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:msub>
<mml:mrow>
<mml:mi>j</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:msub>
<mml:msub>
<mml:mrow>
<mml:mi>j</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mn>2</mml:mn>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:msub>
<mml:mo>&#x2b;</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi>Y</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:msub>
<mml:mrow>
<mml:mi>j</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mn>2</mml:mn>
</mml:mrow>
</mml:msub>
<mml:msub>
<mml:mrow>
<mml:mi>j</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:msub>
<mml:mo>&#x2a7e;</mml:mo>
<mml:mn>1</mml:mn>
<mml:mspace width="1em"/>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:msub>
<mml:mrow>
<mml:mi>j</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi>j</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mn>2</mml:mn>
</mml:mrow>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>1</mml:mn>
<mml:mo>,</mml:mo>
<mml:mo>&#x2026;</mml:mo>
<mml:mo>,</mml:mo>
<mml:mi>n</mml:mi>
<mml:mo>;</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi>j</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:msub>
<mml:mo>&#x2260;</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi>j</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mn>2</mml:mn>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:math>
<label>(16)</label>
</disp-formula>
<disp-formula id="e17">
<mml:math id="m22">
<mml:msub>
<mml:mrow>
<mml:mi>S</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:msub>
<mml:mrow>
<mml:mi>j</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:msub>
<mml:mi>i</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x2212;</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi>F</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:msub>
<mml:mrow>
<mml:mi>j</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mn>2</mml:mn>
</mml:mrow>
</mml:msub>
<mml:mi>i</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x2b;</mml:mo>
<mml:mi>C</mml:mi>
<mml:mo>&#xd7;</mml:mo>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mn>3</mml:mn>
<mml:mo>&#x2212;</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi>Y</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:msub>
<mml:mrow>
<mml:mi>j</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mn>2</mml:mn>
</mml:mrow>
</mml:msub>
<mml:msub>
<mml:mrow>
<mml:mi>j</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:msub>
<mml:mo>&#x2212;</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi>X</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:msub>
<mml:mrow>
<mml:mi>j</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:msub>
<mml:mi>q</mml:mi>
<mml:mi>i</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x2212;</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi>X</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:msub>
<mml:mrow>
<mml:mi>j</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mn>2</mml:mn>
</mml:mrow>
</mml:msub>
<mml:mi>q</mml:mi>
<mml:mi>i</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:mfenced>
<mml:mo>&#x2a7e;</mml:mo>
<mml:mn>0</mml:mn>
</mml:math>
<label>(17)</label>
</disp-formula>
</p>
<p>Eq. <xref ref-type="disp-formula" rid="e11">11</xref> represents the minimization of the overall completion time. Eq. <xref ref-type="disp-formula" rid="e12">12</xref> signifies the overall completion time for all jobs, which is the maximum completion time within the set of completion times for each job j at operation i. Eq. <xref ref-type="disp-formula" rid="e13">13</xref> represents the processing time for any job at any operation. Eq. <xref ref-type="disp-formula" rid="e14">14</xref> indicates that any operation for any job is performed by only one machine within that operation. Eq. <xref ref-type="disp-formula" rid="e15">15</xref> states that any job must complete the processing of the current operation before moving on to the next one. Eqs <xref ref-type="disp-formula" rid="e16">16</xref>, <xref ref-type="disp-formula" rid="e17">17</xref>, when combined, express that any machine within any operation cannot process more than one job at the same time.</p>
<p>The actual processing environment of enterprises is complex and ever-changing. The traditional formulation of the HFSP is no longer adequate to address the diverse requirements of enterprises. In response to specific demands, considering variations in constraints, characteristics of machining tasks, and the quantity of jobs, diverse extensions of the HFSP have surfaced. Examples include the multi-stage HFSP (<xref ref-type="bibr" rid="B58">Hoogeveen et al., 1996</xref>), reentrant HFSP (<xref ref-type="bibr" rid="B33">Dugardin et al., 2010</xref>), no-wait HFSP (<xref ref-type="bibr" rid="B35">Engin and G&#xfc;&#xe7;l&#xfc;, 2018</xref>), among others.</p>
</sec>
</sec>
<sec id="s2-3">
<title>2.3 Job-shop scheduling problem</title>
<p>The job-shop scheduling problem (JSP) is a fundamental combinatorial optimization issue in the field of operational research and management science (<xref ref-type="bibr" rid="B173">Xiong et al., 2022</xref>). JSP is commonly characterized as the efficient scheduling of <italic>n</italic> jobs on <italic>m</italic> machines, optimizing performance indicators under the assumptions of known processing techniques, machine sequences, and processing times for each job. When addressing JSPs, the following fundamental constraints need to be taken into consideration.<list list-type="simple">
<list-item>
<p>&#x2022; Every job is comprised of multiple operations that need to be accomplished.</p>
</list-item>
<list-item>
<p>&#x2022; A job can only be executed on a single machine at any given time.</p>
</list-item>
<list-item>
<p>&#x2022; The predetermined processing time for each operation on each machine has been determined.</p>
</list-item>
<list-item>
<p>&#x2022; All jobs are accessible and ready for processing from the start</p>
</list-item>
<list-item>
<p>&#x2022; Each machine can handle only one operation at a time.</p>
</list-item>
<list-item>
<p>&#x2022; All operations must be completed on the same group of machines.</p>
</list-item>
</list>
</p>
<p>In this paper, JSP as an integer programming model will be represented.<disp-formula id="e18">
<mml:math id="m23">
<mml:mtext>min.</mml:mtext>
<mml:munder>
<mml:mrow>
<mml:mi>max</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mn>1</mml:mn>
<mml:mo>&#x2264;</mml:mo>
<mml:mi>i</mml:mi>
<mml:mo>&#x2264;</mml:mo>
<mml:mi>n</mml:mi>
<mml:mo>,</mml:mo>
<mml:mn>1</mml:mn>
<mml:mo>&#x2264;</mml:mo>
<mml:mi>k</mml:mi>
<mml:mo>&#x2264;</mml:mo>
<mml:mi>m</mml:mi>
</mml:mrow>
</mml:munder>
<mml:mfenced open="{" close="}">
<mml:mrow>
<mml:msub>
<mml:mrow>
<mml:mi>c</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mi>k</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:math>
<label>(18)</label>
</disp-formula>
<disp-formula id="e19">
<mml:math id="m24">
<mml:mtext>s.&#x2009;t.</mml:mtext>
<mml:msub>
<mml:mrow>
<mml:mi>c</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mi>k</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x2212;</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi>s</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mi>k</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x2b;</mml:mo>
<mml:mi>M</mml:mi>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mn>1</mml:mn>
<mml:mo>&#x2212;</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi>a</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mi>h</mml:mi>
<mml:mi>k</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:mfenced>
<mml:mo>&#x2265;</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi>c</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mi>h</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:mo>&#x2200;</mml:mo>
<mml:mi>i</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>h</mml:mi>
</mml:math>
<label>(19)</label>
</disp-formula>
<disp-formula id="e20">
<mml:math id="m25">
<mml:msub>
<mml:mrow>
<mml:mi>x</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mi>j</mml:mi>
<mml:mi>k</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x3e;</mml:mo>
<mml:mn>0</mml:mn>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi>c</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>j</mml:mi>
<mml:mi>k</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x2212;</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi>c</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mi>k</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x2b;</mml:mo>
<mml:mi>M</mml:mi>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mn>1</mml:mn>
<mml:mo>&#x2212;</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi>x</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mi>j</mml:mi>
<mml:mi>k</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:mfenced>
<mml:mo>&#x2265;</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi>s</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>j</mml:mi>
<mml:mi>k</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:mo>&#x2200;</mml:mo>
<mml:mi>j</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>k</mml:mi>
</mml:math>
<label>(20)</label>
</disp-formula>
<disp-formula id="e21">
<mml:math id="m26">
<mml:msub>
<mml:mrow>
<mml:mi mathvariant="normal">c</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mtext>ik</mml:mtext>
</mml:mrow>
</mml:msub>
<mml:mo>&#x2265;</mml:mo>
<mml:mn>0</mml:mn>
<mml:mo>,</mml:mo>
<mml:mo>&#x2200;</mml:mo>
<mml:mi>i</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>k</mml:mi>
</mml:math>
<label>(21)</label>
</disp-formula>
</p>
<p>In Eq. <xref ref-type="disp-formula" rid="e18">18</xref>, Where <italic>n</italic> denotes the number of jobs, <italic>m</italic> represents the number of machines. In Eqs <xref ref-type="disp-formula" rid="e19">19</xref>&#x2013;<xref ref-type="disp-formula" rid="e21">21</xref>, <italic>s</italic>
<sub>
<italic>ik</italic>
</sub> and <italic>c</italic>
<sub>
<italic>ik</italic>
</sub> indicate the processing time and completion time of job <italic>i</italic> on machine <italic>k</italic>. <italic>i</italic>, <italic>j</italic> &#x2208; {1, 2, <italic>&#x2026;</italic> , <italic>n</italic>}; <italic>h</italic>, <italic>k</italic> &#x2208; {1, 2, <italic>&#x2026;</italic> , <italic>m</italic>}. Here, <italic>M</italic> signifies a sufficiently large positive value. The binary variable <italic>a</italic>
<sub>
<italic>ihk</italic>
</sub> with values 0 and 1 denotes the precedence relationship between jobs <italic>i</italic> and <italic>h</italic> on machine <italic>k</italic>; <italic>a</italic>
<sub>
<italic>ihk</italic>
</sub> being 0 implies job <italic>i</italic> is processed before job <italic>h</italic> on machine <italic>k</italic>, while <italic>a</italic>
<sub>
<italic>ihk</italic>
</sub> being 1 signifies the reverse. Similarly, the binary variable <italic>x</italic>
<sub>
<italic>ijk</italic>
</sub>, also with values 0 and 1, indicates the sequencing of jobs <italic>i</italic> and <italic>j</italic> on machine <italic>k</italic>; <italic>x</italic>
<sub>
<italic>ijk</italic>
</sub> being 0 denotes job <italic>i</italic> is scheduled before job <italic>j</italic> on machine <italic>k</italic>, whereas <italic>x</italic>
<sub>
<italic>ijk</italic>
</sub> being 1 implies the opposite. The objective of the JSP is to determine the optimal schedule of operations for all jobs that minimizes the makespan (<italic>C</italic>
<sub>max</sub>), which is defined as the maximum completion time among all jobs.</p>
<p>JSP is a highly complex problem due to its combinatorial nature and the large number of possible solutions. Finding an optimal solution to JSP is known to be NP-hard, which means that it is computationally intractable for large instances. Therefore, many heuristic and meta-heuristic algorithms have been proposed to find near-optimal solutions to JSP (<xref ref-type="bibr" rid="B156">Tsujimura et al., 1995</xref>; <xref ref-type="bibr" rid="B19">Cheng et al., 1996</xref>; <xref ref-type="bibr" rid="B20">1999</xref>; <xref ref-type="bibr" rid="B149">Tavakkoli-Moghaddam et al., 2005</xref>; <xref ref-type="bibr" rid="B56">Hao et al., 2017</xref>).</p>
<p>In addition, JSP has various forms and variants, including dynamic job-shop scheduling problem (<xref ref-type="bibr" rid="B129">Ramasesh, 1990</xref>; <xref ref-type="bibr" rid="B76">Kundakc&#x131; and Kulak, 2016</xref>; <xref ref-type="bibr" rid="B119">Mohan et al., 2019</xref>), flexible job-shop scheduling problem (FJSP) (<xref ref-type="bibr" rid="B125">Pezzella et al., 2008</xref>; <xref ref-type="bibr" rid="B184">Zhang G. et al., 2011</xref>; <xref ref-type="bibr" rid="B172">Xie et al., 2019</xref>), distributed job-shop scheduling problem (DJSP) (<xref ref-type="bibr" rid="B30">De Giovanni and Pezzella, 2010</xref>; <xref ref-type="bibr" rid="B117">Meng et al., 2020</xref>; <xref ref-type="bibr" rid="B132">&#x15e;ahman, 2021</xref>), and JSP with consideration of energy and environmental factors (<xref ref-type="bibr" rid="B64">Jiang et al., 2019</xref>; <xref ref-type="bibr" rid="B63">Wang et al., 2020</xref>), <italic>etc.</italic> <xref ref-type="fig" rid="F3">Figure 3</xref> represents a Gantt chart for a job-shop.</p>
<fig id="F3" position="float">
<label>FIGURE 3</label>
<caption>
<p>A Gantt chart of a three-job, three-machine job-shop.</p>
</caption>
<graphic xlink:href="fieng-02-1337174-g003.tif"/>
</fig>
</sec>
<sec id="s2-4">
<title>2.4 Flexible job-shop scheduling problem</title>
<p>The FJSP is a variant of the classical JSP that has gained significant attention in the field of research on JSP. In traditional JSP, each process must be completed on a specific machine tool, while flexible job shop scheduling allows each process to be carried out on multiple different machine tools, and the time required for the execution of the operation exhibits variation contingent upon the performance of the machine tool. This extension brings more problem complexity while reducing machine constraints and expanding the search space for feasible solutions.</p>
<p>The issue may be delineated in the following manner: The production system is comprised of a total of m machines and n distinct sorts of jobs. Every job comprises one or more operations, with a predetermined sequence of these operations. Every operation can be processed on multiple different machines, each with its own performance and processing speed. The scheduling objective is to choose the most appropriate machine for each operation, establish the optimal sequence and start time for each job operation on each machine, and optimize the system&#x2019;s performance indicators. Additionally, it is essential that the following limitations be duly met.<list list-type="simple">
<list-item>
<p>&#x2022; Initial Setup: At the beginning of the task, all jobs and equipment are ready and ready to start working immediately.</p>
</list-item>
<list-item>
<p>&#x2022; Machine Constraints: Each machine can only perform one operation at a time, meaning only one machining task is allowed to take place simultaneously.</p>
</list-item>
<list-item>
<p>&#x2022; Operation Selection: Each operation can be processed on multiple machines, but only one machine can be selected for processing at a time.</p>
</list-item>
<list-item>
<p>&#x2022; Continuous Processing: Once processing begins, it cannot be interrupted and must proceed continuously without pauses or interruptions.</p>
</list-item>
<list-item>
<p>&#x2022; Operation Sequence: Each job must follow the specified sequence of operations, with the next operation starting only after the completion of the previous one.</p>
</list-item>
<list-item>
<p>&#x2022; Job Priorities: All jobs have equal processing priorities, ensuring the fair allocation of processing times for all jobs and preventing prolonged waiting times for any particular job.</p>
</list-item>
</list>
</p>
<p>In 1990, Brucker and Schlie (<xref ref-type="bibr" rid="B12">Brucker and Schlie, 1990</xref>) first introduced the FJSP, and its solving methods can be broadly categorized into three main classes: exact algorithms (<xref ref-type="bibr" rid="B171">Woeginger, 2003</xref>), heuristic algorithms, and intelligent optimization algorithms (<xref ref-type="bibr" rid="B93">Li W. et al., 2021</xref>).</p>
<sec id="s2-4-1">
<title>2.4.1 Exact algorithms</title>
<p>Exact algorithms are a category of algorithms specifically designed to find the optimal solution to a given problem. These algorithms are recognized for their systematic and deterministic approaches, making them particularly suitable for addressing intricate combinatorial optimization problems. Some of the main exact algorithms include branch and bound (<xref ref-type="bibr" rid="B122">Narendra and Fukunaga, 1977</xref>), cutting-plane methods (<xref ref-type="bibr" rid="B68">Kelley, 1960</xref>), integer linear programming (<xref ref-type="bibr" rid="B135">Schrijver, 1998</xref>; <xref ref-type="bibr" rid="B120">Moon et al., 2004</xref>), mixed-integer linear programming (<xref ref-type="bibr" rid="B40">Floudas and Lin, 2005</xref>), and so on. Torabi et al. (<xref ref-type="bibr" rid="B153">Torabi et al., 2005</xref>) proposed a novel mixed integer nonlinear programming method for solving the common cycle multi product batch scheduling problem in flexible job shops. Emami et al. (<xref ref-type="bibr" rid="B34">Emami et al., 2016</xref>) developed an innovative Lagrangian relaxation algorithm for handling simultaneous order acceptance and scheduling problems in non identical parallel machine environments. Their method uses the cutting plane method to dynamically update Lagrange multipliers to improve the optimization efficiency of the problem.</p>
<p>The primary objective of exact algorithms is to determine the best solution to a given issue, as opposed to providing an approximation. In instances when issue sizes are modest, the processing time necessary to get the best solution by use of precise methods is often deemed satisfactory. Nevertheless, when the size of the issue rises, the computing complexity experiences a substantial increase. Therefore, the task of identifying the most efficient solution within a feasible time is a significant challenge and complexity, depending on the current computational resources, may become infeasible (<xref ref-type="bibr" rid="B99">Lin and Gen, 2018</xref>).</p>
</sec>
<sec id="s2-4-2">
<title>2.4.2 Heuristic algorithms</title>
<p>A heuristic algorithm is actually a set of rules with guiding properties, which are used to guide the algorithm in finding directions to solve problems in the search space. Under the guidance of these rules, the algorithm can find the optimal solution to the problem, but it may not necessarily be the optimal solution. At present, many heuristic algorithms have been widely applied to handle FJSP, with most of them using heuristic rules as the main method, which usually come from practical scheduling problems.</p>
<p>Scrich et al. (<xref ref-type="bibr" rid="B136">Scrich et al., 2004</xref>) proposed two heuristic algorithms based on taboo search when solving FJSP with the optimization objective of minimizing total delay: a hierarchical process and a multiple initiation process. The core idea of these algorithms is to generate initial solutions using scheduling rules, and then search in the critical path neighborhood represented by the disjunction graph to improve the solution. In addition, Shanker et al. (<xref ref-type="bibr" rid="B137">Shanker and Tzen, 1985</xref>) compared these heuristic algorithms with precise mixed integer programming and proposed a simulation model for system performance evaluation by combining four scheduling rules: first In first out, shortest processing, longest processing time, and most operations remaining first.</p>
<p>Heuristic algorithms have the ability to quickly respond and generate feasible scheduling solutions when solving specific problems. More importantly, the solving complexity of these algorithms remains low sensitivity as the problem size increases, making them still effective in dealing with large-scale problems. Therefore, heuristic algorithms play an important role in solving FJSP.</p>
</sec>
<sec id="s2-4-3">
<title>2.4.3 Intelligent optimization algorithms</title>
<p>Intelligent optimization algorithms are important research methods for solving FJSP, which can be divided into EA and swarm intelligence algorithms. The proposal of EA was inspired by natural evolution, and classic EA includes genetic algorithms (<xref ref-type="bibr" rid="B42">Gao et al., 2007</xref>; <xref ref-type="bibr" rid="B47">Gen et al., 2009</xref>), evolutionary strategies (<xref ref-type="bibr" rid="B7">Beyer and Schwefel, 2002</xref>), genetic programming (<xref ref-type="bibr" rid="B78">Langdon and Poli, 2013</xref>), and differential evolution (<xref ref-type="bibr" rid="B128">Price, 2013</xref>). Among these methods, genetic algorithm (GA) has the most extensive and in-depth research and application.</p>
<p>Gao et al. (<xref ref-type="bibr" rid="B42">Gao et al., 2007</xref>) adopts a hybrid method of a new GA and an innovative local search process (bottleneck shifting) to optimize the three objectives in FJSP: minimizing <italic>C</italic>
<sub>max</sub>, minimizing maximum machine workload, and minimizing total workload. The author verified the performance of their proposed method by conducting numerical experiments on a large number of representative problems to verify its effectiveness in solving FJSP. In addition, Gao et al. (<xref ref-type="bibr" rid="B43">Gao et al., 2008</xref>) have developed a hybrid GA to solve FJSP with three objectives, which uses two vectors to represent the solution. They adopt advanced crossover and mutation operations to adapt to the characteristics of special chromosome structures and problems. In order to enhance the search ability, GA individuals first improve through variable neighborhood descent. As applications based on the FJSP model, Chou et al. (<xref ref-type="bibr" rid="B22">Chou et al., 2014</xref>) reported a case study of multiobjective hybrid genetic algorithm for thin film transistor liquid crystal display module assembly scheduling. Jamrus et al. (<xref ref-type="bibr" rid="B62">Jamrus et al., 2015</xref>) proposed a multistage production distribution under uncertainty demands by discrete Particle Swarm Optimization approaches with extended priority based-hybrid genetic algorithm. Chamnanlor et al. (<xref ref-type="bibr" rid="B16">Chamnanlor et al., 2017</xref>) reported embedding ant system in genetic algorithm for re-entrant hybrid flow shop scheduling problems with time window constraints.</p>
<p>The swarm intelligence algorithm is an excellent method for solving FJSP. This type of algorithm has simple principles, strong robustness, and can find almost the best solution in a relatively short time, and is easy to implement.</p>
</sec>
</sec>
<sec id="s2-5">
<title>2.5 Distributed shop scheduling problem</title>
<p>The distributed shop scheduling problem (DSSP) is a study on optimizing the scheduling of job allocation between different factories and processing sequences within each factory in a distributed manufacturing context (<xref ref-type="bibr" rid="B152">Toptal and Sabuncuoglu, 2010</xref>). DSSP typically involves collaborative production among multiple factories or cooperative production among different companies, aiming to maximize production efficiency by optimizing scheduling indicators. DSSP is a problem involving multiple shops and multiple tasks, where each task requires processing in one or more shops. The objective of this problem is to complete all tasks as much as possible within a given time and minimize the total cost or maximize the total profit. Combining the traditional JSP, this paper presents the model of DJSP as follows.<list list-type="simple">
<list-item>
<p>&#x2022; Workshops and their internal manufacturing resources are distributed at different geographical locations, interconnected through a network to facilitate the exchange and sharing of manufacturing task and process information.</p>
</list-item>
<list-item>
<p>&#x2022; Each workshop and its internal manufacturing resources possess independent processing capabilities and intelligent decision-making capabilities. The processing capacities of various machine devices may be uniform or diverse, with fixed categories, quantities, and capabilities.</p>
</list-item>
<list-item>
<p>&#x2022; Strict processing sequence constraints exist between successive operations of the same jobs, necessitating sequential processing of each operation according to the technological order.</p>
</list-item>
<list-item>
<p>&#x2022; Different operations of the same jobs task must be completed within the same workshop.</p>
</list-item>
<list-item>
<p>&#x2022; During the shop scheduling process, jobs can be dynamically added, and global tasks may undergo reallocation and rescheduling based on demand.</p>
</list-item>
</list>
</p>
<p>The notations of mathematical model of DSSP is expressed as follows.</p>
<sec id="s2-5-1">
<title>2.5.1 Indices</title>
<p>
<italic>j</italic>, <italic>h</italic>: Index of job, (<italic>j</italic>, <italic>h</italic> &#x3d; 0, 1, 2, &#x2026; , <italic>n</italic>), where job 0 is a virtual job;</p>
<p>
<italic>i</italic>, <italic>l</italic>: Index of machine, (<italic>i</italic>, <italic>l</italic> &#x3d; 1, 2, &#x2026; , <italic>m</italic>);</p>
<p>
<italic>k</italic>: Index of factory, (<italic>k</italic> &#x3d; 1, 2, &#x2026; , <italic>f</italic>).</p>
</sec>
<sec id="s2-5-2">
<title>2.5.2 Parameters</title>
<p>
<italic>n</italic>: The number of jobs;</p>
<p>
<italic>m</italic>: The number of machines;</p>
<p>
<italic>f</italic>: The number of factories;</p>
<p>
<italic>p</italic>
<sub>
<italic>j</italic>,<italic>i</italic>
</sub>: Processing time of job <italic>j</italic> on machine <italic>i</italic>;</p>
<p>
<italic>S</italic>
<sub>
<italic>j</italic>,<italic>i</italic>
</sub>: Start time of job <italic>j</italic> on machine <italic>i</italic>;</p>
<p>
<italic>A</italic>: A positive infinity.</p>
</sec>
<sec id="s2-5-3">
<title>2.5.3 Decision variables</title>
<p>
<italic>X</italic>
<sub>
<italic>h</italic>,<italic>j</italic>,<italic>i</italic>,<italic>k</italic>
</sub>: 1 when job <italic>j</italic> is processed on machine <italic>i</italic> in factory <italic>k</italic> after job <italic>h</italic>, otherwise 0;</p>
<p>
<italic>a</italic>
<sub>
<italic>j</italic>,<italic>l</italic>,<italic>i</italic>
</sub>: 1 when job <italic>j</italic> is processed on machine <italic>i</italic> after completion on machine <italic>l</italic>, otherwise 0.</p>
</sec>
<sec id="s2-5-4">
<title>2.5.4 Mathematical model</title>
<p>The mixed-integer linear programming model (MILP) of DSSP with minimization of <italic>C</italic>
<sub>max</sub> is formulated as follows.<disp-formula id="e22">
<mml:math id="m27">
<mml:mtext>min.</mml:mtext>
<mml:msub>
<mml:mrow>
<mml:mi>C</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>max</mml:mi>
</mml:mrow>
</mml:msub>
</mml:math>
<label>(22)</label>
</disp-formula>
<disp-formula id="e23">
<mml:math id="m28">
<mml:mtext>s.&#x2009;t.</mml:mtext>
<mml:mstyle displaystyle="true">
<mml:munderover>
<mml:mrow>
<mml:mo>&#x2211;</mml:mo>
</mml:mrow>
<mml:mrow>
<mml:mi>h</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>0</mml:mn>
<mml:mo>,</mml:mo>
<mml:mi>h</mml:mi>
<mml:mo>&#x2260;</mml:mo>
<mml:mi>j</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>n</mml:mi>
</mml:mrow>
</mml:munderover>
</mml:mstyle>
<mml:mstyle displaystyle="true">
<mml:munderover>
<mml:mrow>
<mml:mo>&#x2211;</mml:mo>
</mml:mrow>
<mml:mrow>
<mml:mi>k</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mrow>
<mml:mi>f</mml:mi>
</mml:mrow>
</mml:munderover>
</mml:mstyle>
<mml:msub>
<mml:mrow>
<mml:mi>X</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>h</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>j</mml:mi>
<mml:mo>,</mml:mo>
<mml:mn>1</mml:mn>
<mml:mo>,</mml:mo>
<mml:mi>k</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:mo>&#x2200;</mml:mo>
<mml:mi>j</mml:mi>
</mml:math>
<label>(23)</label>
</disp-formula>
<disp-formula id="e24">
<mml:math id="m29">
<mml:mstyle displaystyle="true">
<mml:munderover>
<mml:mrow>
<mml:mo>&#x2211;</mml:mo>
</mml:mrow>
<mml:mrow>
<mml:mi>h</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>0</mml:mn>
<mml:mo>,</mml:mo>
<mml:mi>h</mml:mi>
<mml:mo>&#x2260;</mml:mo>
<mml:mi>j</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>n</mml:mi>
</mml:mrow>
</mml:munderover>
</mml:mstyle>
<mml:msub>
<mml:mrow>
<mml:mi>X</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>h</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>j</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>i</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>k</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:mstyle displaystyle="true">
<mml:munderover>
<mml:mrow>
<mml:mo>&#x2211;</mml:mo>
</mml:mrow>
<mml:mrow>
<mml:mi>h</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>0</mml:mn>
<mml:mo>,</mml:mo>
<mml:mi>h</mml:mi>
<mml:mo>&#x2260;</mml:mo>
<mml:mi>j</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>n</mml:mi>
</mml:mrow>
</mml:munderover>
</mml:mstyle>
<mml:msub>
<mml:mrow>
<mml:mi>X</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>h</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>j</mml:mi>
<mml:mo>,</mml:mo>
<mml:mn>1</mml:mn>
<mml:mo>,</mml:mo>
<mml:mi>k</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:mo>&#x2200;</mml:mo>
<mml:mi>j</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>i</mml:mi>
<mml:mo>&#x3e;</mml:mo>
<mml:mn>1</mml:mn>
<mml:mo>,</mml:mo>
<mml:mi>k</mml:mi>
</mml:math>
<label>(24)</label>
</disp-formula>
<disp-formula id="e25">
<mml:math id="m30">
<mml:mstyle displaystyle="true">
<mml:munderover>
<mml:mrow>
<mml:mo>&#x2211;</mml:mo>
</mml:mrow>
<mml:mrow>
<mml:mi>j</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>1</mml:mn>
<mml:mo>,</mml:mo>
<mml:mi>j</mml:mi>
<mml:mo>&#x2260;</mml:mo>
<mml:mi>h</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>n</mml:mi>
</mml:mrow>
</mml:munderover>
</mml:mstyle>
<mml:msub>
<mml:mrow>
<mml:mi>X</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>h</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>j</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>i</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>k</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x2264;</mml:mo>
<mml:mstyle displaystyle="true">
<mml:munderover>
<mml:mrow>
<mml:mo>&#x2211;</mml:mo>
</mml:mrow>
<mml:mrow>
<mml:mi>j</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>0</mml:mn>
<mml:mo>,</mml:mo>
<mml:mi>j</mml:mi>
<mml:mo>&#x2260;</mml:mo>
<mml:mi>h</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>n</mml:mi>
</mml:mrow>
</mml:munderover>
</mml:mstyle>
<mml:msub>
<mml:mrow>
<mml:mi>X</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>h</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>j</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>i</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>k</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:mo>&#x2200;</mml:mo>
<mml:mi>h</mml:mi>
<mml:mo>&#x3e;</mml:mo>
<mml:mn>1</mml:mn>
<mml:mo>,</mml:mo>
<mml:mi>i</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>k</mml:mi>
</mml:math>
<label>(25)</label>
</disp-formula>
<disp-formula id="e26">
<mml:math id="m31">
<mml:mstyle displaystyle="true">
<mml:munderover>
<mml:mrow>
<mml:mo>&#x2211;</mml:mo>
</mml:mrow>
<mml:mrow>
<mml:mi>j</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mrow>
<mml:mi>n</mml:mi>
</mml:mrow>
</mml:munderover>
</mml:mstyle>
<mml:msub>
<mml:mrow>
<mml:mi>X</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mn>0</mml:mn>
<mml:mo>,</mml:mo>
<mml:mi>j</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>i</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>k</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>1</mml:mn>
<mml:mo>,</mml:mo>
<mml:mo>&#x2200;</mml:mo>
<mml:mi>i</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>k</mml:mi>
</mml:math>
<label>(26)</label>
</disp-formula>
<disp-formula id="e27">
<mml:math id="m32">
<mml:mstyle displaystyle="true">
<mml:munderover>
<mml:mrow>
<mml:mo>&#x2211;</mml:mo>
</mml:mrow>
<mml:mrow>
<mml:mi>j</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mrow>
<mml:mi>n</mml:mi>
</mml:mrow>
</mml:munderover>
</mml:mstyle>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:msub>
<mml:mrow>
<mml:mi>X</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>h</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>j</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>i</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>k</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x2b;</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi>X</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>j</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>h</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>i</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>k</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:mfenced>
<mml:mo>&#x2264;</mml:mo>
<mml:mn>1</mml:mn>
<mml:mo>,</mml:mo>
<mml:mo>&#x2200;</mml:mo>
<mml:mi>j</mml:mi>
<mml:mo>&#x3e;</mml:mo>
<mml:mi>n</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>h</mml:mi>
<mml:mo>&#x3e;</mml:mo>
<mml:mi>j</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>i</mml:mi>
</mml:math>
<label>(27)</label>
</disp-formula>
<disp-formula id="e28">
<mml:math id="m33">
<mml:msub>
<mml:mrow>
<mml:mi>S</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>j</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>i</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x2265;</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi>S</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>j</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>l</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x2b;</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi>p</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>j</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>l</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:mo>&#x2200;</mml:mo>
<mml:mi>j</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>i</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>l</mml:mi>
<mml:mo>&#x2260;</mml:mo>
<mml:mi>i</mml:mi>
<mml:mo stretchy="false">&#x2223;</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi>a</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>j</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>l</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>i</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>1</mml:mn>
</mml:math>
<label>(28)</label>
</disp-formula>
<disp-formula id="e29">
<mml:math id="m34">
<mml:msub>
<mml:mrow>
<mml:mi>S</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>j</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>i</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x2265;</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi>S</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>h</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>i</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x2b;</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi>p</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>h</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>i</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x2212;</mml:mo>
<mml:mi>A</mml:mi>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mn>1</mml:mn>
<mml:mo>&#x2212;</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi>X</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>h</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>j</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>i</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>k</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:mfenced>
<mml:mo>,</mml:mo>
<mml:mo>&#x2200;</mml:mo>
<mml:mi>h</mml:mi>
<mml:mo>&#x3e;</mml:mo>
<mml:mn>0</mml:mn>
<mml:mo>,</mml:mo>
<mml:mi>j</mml:mi>
<mml:mo>&#x2260;</mml:mo>
<mml:mi>h</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>i</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>k</mml:mi>
</mml:math>
<label>(29)</label>
</disp-formula>
<disp-formula id="e30">
<mml:math id="m35">
<mml:msub>
<mml:mrow>
<mml:mi>C</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>max</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x2265;</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi>S</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>j</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>i</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x2b;</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi>p</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>j</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>i</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:mo>&#x2200;</mml:mo>
<mml:mi>i</mml:mi>
</mml:math>
<label>(30)</label>
</disp-formula>
<disp-formula id="e31">
<mml:math id="m36">
<mml:msub>
<mml:mrow>
<mml:mi>S</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>j</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>i</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x2265;</mml:mo>
<mml:mn>0</mml:mn>
<mml:mo>,</mml:mo>
<mml:mo>&#x2200;</mml:mo>
<mml:mi>k</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>i</mml:mi>
</mml:math>
<label>(31)</label>
</disp-formula>
<disp-formula id="e32">
<mml:math id="m37">
<mml:msub>
<mml:mrow>
<mml:mi>X</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>h</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>j</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>i</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>k</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:mfenced open="{" close="}">
<mml:mrow>
<mml:mn>0,1</mml:mn>
</mml:mrow>
</mml:mfenced>
<mml:mo>,</mml:mo>
<mml:mo>&#x2200;</mml:mo>
<mml:mi>j</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>h</mml:mi>
<mml:mo>&#x2260;</mml:mo>
<mml:mi>j</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>i</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>k</mml:mi>
</mml:math>
<label>(32)</label>
</disp-formula>
</p>
<p>Eq. <xref ref-type="disp-formula" rid="e22">22</xref> indicates that the objective is to minimize the total time of the manufacturing process. Eq. <xref ref-type="disp-formula" rid="e23">23</xref> ensures that each job can only be assigned to one factory. Eqs <xref ref-type="disp-formula" rid="e24">24</xref>, <xref ref-type="disp-formula" rid="e25">25</xref> ensure that all processing operations for a job are carried out in the same factory. Eq. <xref ref-type="disp-formula" rid="e26">26</xref> represents the initial operation for each job on each machine. Eq. <xref ref-type="disp-formula" rid="e27">27</xref> ensures that each operation can only have one adjacent operation. Eq. <xref ref-type="disp-formula" rid="e28">28</xref> indicates that the next operation for the same job cannot commence until the preceding operation is completed. Eq. <xref ref-type="disp-formula" rid="e29">29</xref> ensures that each machine must be in a non-occupied state before commencing processing. Eq. <xref ref-type="disp-formula" rid="e30">30</xref> defines the <italic>C</italic>
<sub>max</sub> of the problem. Eq. <xref ref-type="disp-formula" rid="e31">31</xref> ensures that the start time for processing is a non-negative value. Eq. <xref ref-type="disp-formula" rid="e32">32</xref> defines binary variables used to represent the status of each operation.</p>
<p>DSSP is an extension of the shop scheduling problem that considers collaboration and resource sharing among multiple factories and processing centers. Common models include distributed parallel machine scheduling (<xref ref-type="bibr" rid="B80">Lei and Liu, 2020</xref>), distributed flow-shop scheduling problem (<xref ref-type="bibr" rid="B54">Han X. et al., 2021</xref>), DJSP (<xref ref-type="bibr" rid="B132">&#x15e;ahman, 2021</xref>), distributed assembly shop scheduling problem (<xref ref-type="bibr" rid="B199">Zhao et al., 2021b</xref>), <italic>etc.</italic> To improve the efficiency and quality of problem-solving, researchers have proposed various optimization algorithms and methods (<xref ref-type="bibr" rid="B91">Li et al., 2022b</xref>; <xref ref-type="bibr" rid="B81">Lei and Su, 2023</xref>; <xref ref-type="bibr" rid="B142">Song et al., 2023</xref>; <xref ref-type="bibr" rid="B179">Ying et al., 2023</xref>; <xref ref-type="bibr" rid="B180">Yue et al., 2023</xref>). <xref ref-type="fig" rid="F4">Figure 4</xref> depicts a schematic diagram of a distributed shop. <xref ref-type="fig" rid="F5">Figure 5</xref> shows the distribution of different types of shops in the shop scheduling problems collected in this paper.</p>
<fig id="F4" position="float">
<label>FIGURE 4</label>
<caption>
<p>Schematic diagram of distributed shop scheduling.</p>
</caption>
<graphic xlink:href="fieng-02-1337174-g004.tif"/>
</fig>
<fig id="F5" position="float">
<label>FIGURE 5</label>
<caption>
<p>Proportion of various shop scheduling problems in this paper.</p>
</caption>
<graphic xlink:href="fieng-02-1337174-g005.tif"/>
</fig>
</sec>
</sec>
<sec id="s2-6">
<title>2.6 Distributed hybrid flow-shop scheduling problem</title>
<p>As the manufacturing industry shifts from a single factory to a multi factory model, distributed scheduling issues have become the focus. Among them, there is relatively little research on the distributed hybrid flow shop scheduling problem (DHFSP). Some studies have proposed algorithms to solve DHFSP, taking into account factors such as multiprocessor tasks (<xref ref-type="bibr" rid="B178">Ying and Lin, 2018</xref>; <xref ref-type="bibr" rid="B13">Cai et al., 2020</xref>), maximum completion time (<xref ref-type="bibr" rid="B55">Hao et al., 2019</xref>), and sequence dependent preparation time (<xref ref-type="bibr" rid="B82">Lei and Wang, 2020</xref>).</p>
<p>Studying the DHFSP problem is of great significance for improving production efficiency, reducing inventory costs, and better utilizing manufacturing resources. Compared to traditional HFSP problems, solving DHFSP problems can bring greater performance improvement to enterprises. In addition, DHFSP issues are widely present in multiple manufacturing scenarios, such as wafer manufacturing factories. However, due to the introduction of the factory allocation sub problem, the DHFSP problem is more complex and difficult to solve. Therefore, studying the DHFSP problem is of great significance.</p>
<sec id="s2-6-1">
<title>2.6.1 Homogeneous distributed hybrid flow-shop scheduling problem</title>
<p>Compared to HFSP, the homogeneous DHFSP requires addressing three sub-problems simultaneously: the allocation of jobs among workshops, the processing sequence of jobs within each workshop, and the selection of machines. The single-layer encoding approach used for HFSP is no longer suitable for this new problem. This chapter provides a detailed introduction to the homogeneous DHFSP and proposes a mathematical model based on mixed-integer linear programming to describe it.<list list-type="simple">
<list-item>
<p>&#x2022; All factories have the same number of stages, the same number of machines, and identical machine performance.</p>
</list-item>
<list-item>
<p>&#x2022; All jobs can freely choose to be processed in any factory.</p>
</list-item>
<list-item>
<p>&#x2022; At any given moment, each job can only be assigned to one factory.</p>
</list-item>
<list-item>
<p>&#x2022; Once a job begins processing in a certain factory, the assignment cannot be changed.</p>
</list-item>
</list>
</p>
<p>The notations of mathematical model of homogeneous DHFSP is expressed as follows.</p>
<sec id="s2-6-1-1">
<title>2.6.1.1 Parameters</title>
<p>
<italic>F</italic>: The collection of factories, (<italic>F</italic> &#x3d; 1, &#x2026; , <italic>f</italic>, &#x2026; <italic>i</italic>);</p>
<p>
<italic>L</italic>: The collection of stages, (<italic>L</italic> &#x3d; 1, &#x2026; , <italic>l</italic>, &#x2026; <italic>p</italic>);</p>
<p>
<italic>J</italic>: The collection of jobs, (<italic>J</italic> &#x3d; 1, &#x2026; , <italic>j</italic>, &#x2026; <italic>q</italic>);</p>
<p>
<italic>T</italic>: The collection of machine positions, (<italic>Q</italic> &#x3d; 1, &#x2026; , <italic>t</italic>, &#x2026; <italic>k</italic>);</p>
<p>
<italic>P</italic>
<sub>
<italic>f</italic>
</sub>: Machine collection for factory <italic>f</italic>;</p>
<p>
<italic>P</italic>
<sub>
<italic>l</italic>,<italic>f</italic>
</sub>: Set of machines in the <italic>l</italic>th stage of the factory <italic>f</italic>;</p>
<p>
<italic>S</italic>
<sub>
<italic>j</italic>,<italic>l</italic>
</sub>: The time required to complete job <italic>j</italic> during stage <italic>l</italic>;</p>
<p>
<italic>V</italic>
<sub>
<italic>j</italic>,<italic>l</italic>
</sub>: The start time of job <italic>j</italic> on stage <italic>l</italic>;</p>
<p>
<italic>I</italic>
<sub>
<italic>j</italic>,<italic>l</italic>
</sub>: The completion time of job <italic>j</italic> during stage <italic>l</italic>;</p>
<p>
<italic>PV</italic>
<sub>
<italic>f</italic>,<italic>p</italic>,<italic>t</italic>
</sub>: Starting time of machine <italic>p</italic> in factory <italic>f</italic> at time <italic>t</italic>;</p>
<p>
<italic>PI</italic>
<sub>
<italic>f</italic>,<italic>p</italic>,<italic>t</italic>
</sub>: The completion time of machine <italic>p</italic> in factory <italic>f</italic> at time <italic>t</italic>.</p>
</sec>
<sec id="s2-6-1-2">
<title>2.6.1.2 Decision variables</title>
<p>
<italic>A</italic>
<sub>
<italic>j</italic>,<italic>f</italic>
</sub>: If job <italic>j</italic> is allocated to factory <italic>f</italic>, it is represented as 1; otherwise, it is represented as 0.</p>
<p>
<italic>B</italic>
<sub>
<italic>j</italic>,<italic>l</italic>,<italic>f</italic>,<italic>p</italic>,<italic>t</italic>
</sub>: If job <italic>j</italic> is designated to the position <italic>t</italic> on machine <italic>p</italic> during stage <italic>l</italic> of factory <italic>f</italic> for processing, it is denoted as 1; otherwise, it is denoted as 0.</p>
</sec>
<sec id="s2-6-1-3">
<title>2.6.1.3 Mathematical model</title>
<p>The MILP of homogeneous DHFSP with minimization of <italic>C</italic>
<sub>max</sub> is formulated as follows.<disp-formula id="e33">
<mml:math id="m38">
<mml:mtext>min.</mml:mtext>
<mml:msub>
<mml:mrow>
<mml:mi>C</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>max</mml:mi>
</mml:mrow>
</mml:msub>
</mml:math>
<label>(33)</label>
</disp-formula>
<disp-formula id="e34">
<mml:math id="m39">
<mml:mtext>s.&#x2009;t.</mml:mtext>
<mml:msub>
<mml:mrow>
<mml:mi>C</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>max</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x2265;</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi>I</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>j</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>p</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:mo>&#x2200;</mml:mo>
<mml:mi>j</mml:mi>
<mml:mo>&#x2208;</mml:mo>
<mml:mi>J</mml:mi>
</mml:math>
<label>(34)</label>
</disp-formula>
<disp-formula id="e35">
<mml:math id="m40">
<mml:mstyle displaystyle="true">
<mml:munder>
<mml:mrow>
<mml:mo>&#x2211;</mml:mo>
</mml:mrow>
<mml:mrow>
<mml:mi>f</mml:mi>
<mml:mo>&#x2208;</mml:mo>
<mml:mi>F</mml:mi>
</mml:mrow>
</mml:munder>
</mml:mstyle>
<mml:msub>
<mml:mrow>
<mml:mi>A</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>j</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>f</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>1</mml:mn>
<mml:mo>,</mml:mo>
<mml:mo>&#x2200;</mml:mo>
<mml:mi>j</mml:mi>
<mml:mo>&#x2208;</mml:mo>
<mml:mi>J</mml:mi>
</mml:math>
<label>(35)</label>
</disp-formula>
<disp-formula id="e36">
<mml:math id="m41">
<mml:msub>
<mml:mrow>
<mml:mi>A</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>j</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>f</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:mstyle displaystyle="true">
<mml:munder>
<mml:mrow>
<mml:mo>&#x2211;</mml:mo>
</mml:mrow>
<mml:mrow>
<mml:mi>p</mml:mi>
<mml:mo>&#x2208;</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi>P</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>l</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>f</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:munder>
</mml:mstyle>
<mml:mstyle displaystyle="true">
<mml:munder>
<mml:mrow>
<mml:mo>&#x2211;</mml:mo>
</mml:mrow>
<mml:mrow>
<mml:mi>t</mml:mi>
<mml:mo>&#x2208;</mml:mo>
<mml:mi>T</mml:mi>
</mml:mrow>
</mml:munder>
</mml:mstyle>
<mml:msub>
<mml:mrow>
<mml:mi>B</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>j</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>l</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>f</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>p</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>t</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:mo>&#x2200;</mml:mo>
<mml:mi>l</mml:mi>
<mml:mo>&#x2208;</mml:mo>
<mml:mi>L</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>j</mml:mi>
<mml:mo>&#x2208;</mml:mo>
<mml:mi>J</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>f</mml:mi>
<mml:mo>&#x2208;</mml:mo>
<mml:mi>F</mml:mi>
</mml:math>
<label>(36)</label>
</disp-formula>
<disp-formula id="e37">
<mml:math id="m42">
<mml:mstyle displaystyle="true">
<mml:munder>
<mml:mrow>
<mml:mo>&#x2211;</mml:mo>
</mml:mrow>
<mml:mrow>
<mml:mi>j</mml:mi>
<mml:mo>&#x2208;</mml:mo>
<mml:mi>J</mml:mi>
</mml:mrow>
</mml:munder>
</mml:mstyle>
<mml:msub>
<mml:mrow>
<mml:mi>B</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>j</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>l</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>f</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>p</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>t</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x2264;</mml:mo>
<mml:mn>1</mml:mn>
<mml:mo>,</mml:mo>
<mml:mo>&#x2200;</mml:mo>
<mml:mi>f</mml:mi>
<mml:mo>&#x2208;</mml:mo>
<mml:mi>F</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>p</mml:mi>
<mml:mo>&#x2208;</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi>P</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>l</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>f</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:mi>t</mml:mi>
<mml:mo>&#x2208;</mml:mo>
<mml:mi>T</mml:mi>
</mml:math>
<label>(37)</label>
</disp-formula>
<disp-formula id="e38">
<mml:math id="m43">
<mml:mstyle displaystyle="true">
<mml:munder>
<mml:mrow>
<mml:mo>&#x2211;</mml:mo>
</mml:mrow>
<mml:mrow>
<mml:mi>j</mml:mi>
<mml:mo>&#x2208;</mml:mo>
<mml:mi>J</mml:mi>
</mml:mrow>
</mml:munder>
</mml:mstyle>
<mml:msub>
<mml:mrow>
<mml:mi>B</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>j</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>l</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>f</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>p</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>t</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x2265;</mml:mo>
<mml:mstyle displaystyle="true">
<mml:munder>
<mml:mrow>
<mml:mo>&#x2211;</mml:mo>
</mml:mrow>
<mml:mrow>
<mml:msup>
<mml:mrow>
<mml:mi>j</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mo>&#x2032;</mml:mo>
</mml:mrow>
</mml:msup>
<mml:mo>&#x2208;</mml:mo>
<mml:mi>J</mml:mi>
</mml:mrow>
</mml:munder>
</mml:mstyle>
<mml:msub>
<mml:mrow>
<mml:mi>B</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:msup>
<mml:mrow>
<mml:mi>j</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mo>&#x2032;</mml:mo>
</mml:mrow>
</mml:msup>
<mml:mo>,</mml:mo>
<mml:mi>l</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>f</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>p</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>t</mml:mi>
<mml:mo>&#x2b;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:mo>&#x2200;</mml:mo>
<mml:mi>f</mml:mi>
<mml:mo>&#x2208;</mml:mo>
<mml:mi>F</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>l</mml:mi>
<mml:mo>&#x2208;</mml:mo>
<mml:mi>L</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>p</mml:mi>
<mml:mo>&#x2208;</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi>P</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>l</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>f</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:mi>t</mml:mi>
<mml:mo>&#x2208;</mml:mo>
<mml:mfenced open="{" close="}">
<mml:mrow>
<mml:mn>1</mml:mn>
<mml:mo>,</mml:mo>
<mml:mo>&#x2026;</mml:mo>
<mml:mo>,</mml:mo>
<mml:mi>q</mml:mi>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:mfenced>
</mml:math>
<label>(38)</label>
</disp-formula>
<disp-formula id="e39">
<mml:math id="m44">
<mml:mi>P</mml:mi>
<mml:msub>
<mml:mrow>
<mml:mi>I</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>f</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>p</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>t</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:mi>P</mml:mi>
<mml:msub>
<mml:mrow>
<mml:mi>V</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>f</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>p</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>t</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x2b;</mml:mo>
<mml:mo>&#x2211;</mml:mo>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:msub>
<mml:mrow>
<mml:mi>S</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>j</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>l</mml:mi>
</mml:mrow>
</mml:msub>
<mml:msub>
<mml:mrow>
<mml:mi>B</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>j</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>l</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>f</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>p</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>t</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:mfenced>
<mml:mo>,</mml:mo>
<mml:mo>&#x2200;</mml:mo>
<mml:mi>f</mml:mi>
<mml:mo>&#x2208;</mml:mo>
<mml:mi>F</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>l</mml:mi>
<mml:mo>&#x2208;</mml:mo>
<mml:mi>L</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>p</mml:mi>
<mml:mo>&#x2208;</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi>P</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>l</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>f</mml:mi>
</mml:mrow>
</mml:msub>
</mml:math>
<label>(39)</label>
</disp-formula>
<disp-formula id="e40">
<mml:math id="m45">
<mml:mi>P</mml:mi>
<mml:msub>
<mml:mrow>
<mml:mi>V</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>f</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>p</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>t</mml:mi>
<mml:mo>&#x2b;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:msub>
<mml:mo>&#x2265;</mml:mo>
<mml:mi>P</mml:mi>
<mml:msub>
<mml:mrow>
<mml:mi>I</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>f</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>p</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>t</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:mo>&#x2200;</mml:mo>
<mml:mi>f</mml:mi>
<mml:mo>&#x2208;</mml:mo>
<mml:mi>F</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>p</mml:mi>
<mml:mo>&#x2208;</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi>P</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>f</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:mi>t</mml:mi>
<mml:mo>&#x2208;</mml:mo>
<mml:mfenced open="{" close="}">
<mml:mrow>
<mml:mn>1</mml:mn>
<mml:mo>,</mml:mo>
<mml:mo>&#x2026;</mml:mo>
<mml:mo>,</mml:mo>
<mml:mi>q</mml:mi>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:mfenced>
</mml:math>
<label>(40)</label>
</disp-formula>
<disp-formula id="e41">
<mml:math id="m46">
<mml:mi>P</mml:mi>
<mml:msub>
<mml:mrow>
<mml:mi>V</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>f</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>p</mml:mi>
<mml:mo>,</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:msub>
<mml:mo>&#x2265;</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi>v</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>j</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>j</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>l</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x2212;</mml:mo>
<mml:mi>P</mml:mi>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mn>1</mml:mn>
<mml:mo>&#x2212;</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi>B</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>j</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>l</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>f</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>p</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>t</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:mfenced>
<mml:mo>,</mml:mo>
<mml:mo>&#x2200;</mml:mo>
<mml:mi>f</mml:mi>
<mml:mo>&#x2208;</mml:mo>
<mml:mi>F</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>l</mml:mi>
<mml:mo>&#x2208;</mml:mo>
<mml:mi>L</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>p</mml:mi>
<mml:mo>&#x2208;</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi>P</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>f</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:mi>t</mml:mi>
<mml:mo>&#x2208;</mml:mo>
<mml:mi>T</mml:mi>
</mml:math>
<label>(41)</label>
</disp-formula>
<disp-formula id="e42">
<mml:math id="m47">
<mml:mi>P</mml:mi>
<mml:msub>
<mml:mrow>
<mml:mi>V</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>f</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>p</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>t</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x2264;</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi>V</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>j</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>l</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x2b;</mml:mo>
<mml:mi>P</mml:mi>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mn>1</mml:mn>
<mml:mo>&#x2212;</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi>B</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>j</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>l</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>f</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>p</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>t</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:mfenced>
<mml:mo>,</mml:mo>
<mml:mo>&#x2200;</mml:mo>
<mml:mi>f</mml:mi>
<mml:mo>&#x2208;</mml:mo>
<mml:mi>F</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>l</mml:mi>
<mml:mo>&#x2208;</mml:mo>
<mml:mi>L</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>j</mml:mi>
<mml:mo>&#x2208;</mml:mo>
<mml:mi>J</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>p</mml:mi>
<mml:mo>&#x2208;</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi>P</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>l</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>f</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:mi>t</mml:mi>
<mml:mo>&#x2208;</mml:mo>
<mml:mi>T</mml:mi>
</mml:math>
<label>(42)</label>
</disp-formula>
<disp-formula id="e43">
<mml:math id="m48">
<mml:mi>P</mml:mi>
<mml:msub>
<mml:mrow>
<mml:mi>V</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>f</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>p</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>t</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x2265;</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi>V</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>j</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>l</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x2212;</mml:mo>
<mml:mi>P</mml:mi>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mn>1</mml:mn>
<mml:mo>&#x2212;</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi>B</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>j</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>l</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>f</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>p</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>t</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:mfenced>
<mml:mo>,</mml:mo>
<mml:mo>&#x2200;</mml:mo>
<mml:mi>f</mml:mi>
<mml:mo>&#x2208;</mml:mo>
<mml:mi>F</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>l</mml:mi>
<mml:mo>&#x2208;</mml:mo>
<mml:mi>L</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>j</mml:mi>
<mml:mo>&#x2208;</mml:mo>
<mml:mi>J</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>p</mml:mi>
<mml:mo>&#x2208;</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi>P</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>l</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>f</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:mi>t</mml:mi>
<mml:mo>&#x2208;</mml:mo>
<mml:mi>T</mml:mi>
</mml:math>
<label>(43)</label>
</disp-formula>
<disp-formula id="e44">
<mml:math id="m49">
<mml:msub>
<mml:mrow>
<mml:mi>I</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>j</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>l</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi>V</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>j</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>l</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x2b;</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi>S</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>j</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>l</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:mo>&#x2200;</mml:mo>
<mml:mi>j</mml:mi>
<mml:mo>&#x2208;</mml:mo>
<mml:mi>J</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>l</mml:mi>
<mml:mo>&#x2208;</mml:mo>
<mml:mfenced open="{" close="}">
<mml:mrow>
<mml:mn>1</mml:mn>
<mml:mo>,</mml:mo>
<mml:mo>&#x2026;</mml:mo>
<mml:mo>,</mml:mo>
<mml:mi>p</mml:mi>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:mfenced>
</mml:math>
<label>(44)</label>
</disp-formula>
<disp-formula id="e45">
<mml:math id="m50">
<mml:msub>
<mml:mrow>
<mml:mi>I</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>j</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>l</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x2264;</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi>V</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>j</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>l</mml:mi>
<mml:mo>&#x2b;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:mo>&#x2200;</mml:mo>
<mml:mi>j</mml:mi>
<mml:mo>&#x2208;</mml:mo>
<mml:mi>J</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>l</mml:mi>
<mml:mo>&#x2208;</mml:mo>
<mml:mfenced open="{" close="}">
<mml:mrow>
<mml:mn>1</mml:mn>
<mml:mo>,</mml:mo>
<mml:mo>&#x2026;</mml:mo>
<mml:mo>,</mml:mo>
<mml:mi>p</mml:mi>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:mfenced>
</mml:math>
<label>(45)</label>
</disp-formula>
<disp-formula id="e46">
<mml:math id="m51">
<mml:mi>P</mml:mi>
<mml:msub>
<mml:mrow>
<mml:mi>V</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>f</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>p</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>t</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x2265;</mml:mo>
<mml:mn>0</mml:mn>
<mml:mo>,</mml:mo>
<mml:mo>&#x2200;</mml:mo>
<mml:mi>f</mml:mi>
<mml:mo>&#x2208;</mml:mo>
<mml:mi>F</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>p</mml:mi>
<mml:mo>&#x2208;</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi>P</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>f</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:mi>t</mml:mi>
<mml:mo>&#x2208;</mml:mo>
<mml:mi>T</mml:mi>
</mml:math>
<label>(46)</label>
</disp-formula>
<disp-formula id="e47">
<mml:math id="m52">
<mml:msub>
<mml:mrow>
<mml:mi>V</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>j</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>l</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x2265;</mml:mo>
<mml:mn>0</mml:mn>
<mml:mo>,</mml:mo>
<mml:mo>&#x2200;</mml:mo>
<mml:mi>j</mml:mi>
<mml:mo>&#x2208;</mml:mo>
<mml:mi>J</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>l</mml:mi>
<mml:mo>&#x2208;</mml:mo>
<mml:mi>L</mml:mi>
</mml:math>
<label>(47)</label>
</disp-formula>
</p>
<p>Eq. <xref ref-type="disp-formula" rid="e33">33</xref> represents the objective of homogeneous DHFSP optimization as minimizing <italic>C</italic>
<sub>max</sub>. Eq. <xref ref-type="disp-formula" rid="e34">34</xref> ensures that <italic>C</italic>
<sub>max</sub> is not less than the completion time of any factory. Eq. <xref ref-type="disp-formula" rid="e35">35</xref> restricts each job to be assigned to only one factory. Eq. <xref ref-type="disp-formula" rid="e36">36</xref> specifies that each job can be processed on only one machine in one stage within a factory at the same time. Eq. <xref ref-type="disp-formula" rid="e37">37</xref> indicates that each machine in each factory can only process one job at the same time. Eq. <xref ref-type="disp-formula" rid="e38">38</xref> indicates that each job selects a machine based on the machine&#x2019;s consecutive position and ensures the selection of the current position of the machine. Eqs <xref ref-type="disp-formula" rid="e39">39</xref>, <xref ref-type="disp-formula" rid="e40">40</xref> represent the start and end times of each machine position in each factory. Eq. <xref ref-type="disp-formula" rid="e41">41</xref> ensures that the start time of a job is not earlier than the start time of the machine in the factory. Eqs <xref ref-type="disp-formula" rid="e42">42</xref>, <xref ref-type="disp-formula" rid="e43">43</xref> describe the respective relationships between machine positions and job sequences. Eq. <xref ref-type="disp-formula" rid="e44">44</xref> defines the completion time of a job as the sum of the start time of the machine processing that job and the processing time. Eq. <xref ref-type="disp-formula" rid="e45">45</xref> indicates that the processing sequence is the same for all jobs. Eqs <xref ref-type="disp-formula" rid="e46">46</xref>, <xref ref-type="disp-formula" rid="e47">47</xref> ensure that the start time of each machine is not earlier than 0.</p>
</sec>
</sec>
<sec id="s2-6-2">
<title>2.6.2 Heterogeneous distributed hybrid flow-shop scheduling problem</title>
<p>Researchers have extended the homogenous DHFSP by considering the heterogeneity of the distributed factory structure, including variations in machine quantities and performance. The differences in machine performance are reflected in inconsistent processing times, and there are also sequence-dependent setup time constraints between different machines. This new problem is referred to as the heterogeneous DHFSP. The heterogeneous DHFSP introduces variations based on the DHFSP by incorporating multiple factory-specific processing environment differences. Building upon the description provided in <xref ref-type="sec" rid="s2-6-1">Section 2.6.1</xref>, the distinctive settings for the heterogeneous DHFSP are as follows.<list list-type="simple">
<list-item>
<p>&#x2022; There are <italic>i</italic> factory, each with the same number of stages, but the number of machines, processing time, and preparation time for each stage are different.</p>
</list-item>
<list-item>
<p>&#x2022; The preparation time of a machine is related to the sequence of jobs before and after processing, that is, it is sequence dependent.</p>
</list-item>
<list-item>
<p>&#x2022; The processing time and sequence related preparation time of the machine depend on the type of job.</p>
</list-item>
</list>
</p>
<p>The notations of mathematical model of heterogeneous DHFSP is expressed as follows.</p>
<sec id="s2-6-2-1">
<title>2.6.2.1 Parameters</title>
<p>
<italic>F</italic>: The collection of factories, (<italic>F</italic> &#x3d; 1, &#x2026; , <italic>f</italic>, &#x2026; <italic>i</italic>);</p>
<p>
<italic>L</italic>: The collection of stages, (<italic>L</italic> &#x3d; 1, &#x2026; , <italic>l</italic>, &#x2026; <italic>p</italic>);</p>
<p>
<italic>J</italic>: The collection of jobs, (<italic>J</italic> &#x3d; 1, &#x2026; , <italic>j</italic>, &#x2026; <italic>q</italic>);</p>
<p>
<italic>T</italic>: The collection of machine positions, (<italic>Q</italic> &#x3d; 1, &#x2026; , <italic>t</italic>, &#x2026; <italic>k</italic>);</p>
<p>
<italic>P</italic>
<sub>
<italic>f</italic>
</sub>: Machine collection for factory <italic>f</italic>;</p>
<p>
<italic>P</italic>
<sub>
<italic>l</italic>,<italic>f</italic>
</sub>: Set of machines in the <italic>l</italic>th stage of the factory <italic>f</italic>;</p>
<p>
<italic>S</italic>
<sub>
<italic>j</italic>,<italic>l</italic>,<italic>f</italic>,<italic>p</italic>
</sub>: The duration it takes for job <italic>j</italic> to be completed on machine <italic>p</italic> during stage <italic>l</italic> within factory <italic>f</italic>;</p>
<p>
<italic>V</italic>
<sub>
<italic>j</italic>,<italic>l</italic>
</sub>: The start time of job <italic>j</italic> on stage <italic>l</italic>;</p>
<p>
<italic>I</italic>
<sub>
<italic>j</italic>,<italic>l</italic>
</sub>: The completion time of job <italic>j</italic> during stage <italic>l</italic>;</p>
<p>
<italic>PV</italic>
<sub>
<italic>f</italic>,<italic>p</italic>,<italic>t</italic>
</sub>: Starting time of machine <italic>p</italic> in factory <italic>f</italic> at time <italic>t</italic>;</p>
<p>
<italic>PI</italic>
<sub>
<italic>f</italic>,<italic>p</italic>,<italic>t</italic>
</sub>: The completion time of machine <italic>p</italic> in factory <italic>f</italic> at time <italic>t</italic>;</p>
<p>
<italic>V</italic>
<sub>
<italic>j</italic>,<italic>j</italic>&#x2032;,<italic>l</italic>
</sub>: The initiation time for the setup from job <italic>j</italic> to job <italic>j</italic>&#x2032; during stage <italic>l</italic>, where if job <italic>j</italic> is the initial job to be processed, then <italic>j</italic>&#x2032; &#x3d; <italic>j</italic>.</p>
</sec>
<sec id="s2-6-2-2">
<title>2.6.2.2 Decision variables</title>
<p>
<italic>A</italic>
<sub>
<italic>j</italic>,<italic>f</italic>
</sub>: <italic>A</italic>
<sub>
<italic>j</italic>,<italic>f</italic>
</sub> is 1 if job <italic>j</italic> is allocated to factory <italic>f</italic>, and 0 otherwise.</p>
<p>
<italic>B</italic>
<sub>
<italic>j</italic>,<italic>l</italic>,<italic>f</italic>,<italic>p</italic>,<italic>t</italic>
</sub>: <italic>B</italic>
<sub>
<italic>j</italic>,<italic>l</italic>,<italic>f</italic>,<italic>p</italic>,<italic>t</italic>
</sub> is 1 if job <italic>j</italic> is designated to position <italic>t</italic> on machine <italic>p</italic> during stage <italic>l</italic> of factory <italic>f</italic> for processing, and 0 otherwise.</p>
</sec>
<sec id="s2-6-2-3">
<title>2.6.2.3 Mathematical model</title>
<p>The MILP of heterogeneous DHFSP with minimization of <italic>C</italic>
<sub>max</sub> is formulated as follows.<disp-formula id="e48">
<mml:math id="m53">
<mml:mtext>min.</mml:mtext>
<mml:msub>
<mml:mrow>
<mml:mi>C</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>max</mml:mi>
</mml:mrow>
</mml:msub>
</mml:math>
<label>(48)</label>
</disp-formula>
<disp-formula id="e49">
<mml:math id="m54">
<mml:mtext>s.&#x2009;t.</mml:mtext>
<mml:msub>
<mml:mrow>
<mml:mi>C</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>max</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x2265;</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi>I</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>j</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>p</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:mo>&#x2200;</mml:mo>
<mml:mi>j</mml:mi>
<mml:mo>&#x2208;</mml:mo>
<mml:mi>J</mml:mi>
</mml:math>
<label>(49)</label>
</disp-formula>
<disp-formula id="e50">
<mml:math id="m55">
<mml:mstyle displaystyle="true">
<mml:munder>
<mml:mrow>
<mml:mo>&#x2211;</mml:mo>
</mml:mrow>
<mml:mrow>
<mml:mi>f</mml:mi>
<mml:mo>&#x2208;</mml:mo>
<mml:mi>F</mml:mi>
</mml:mrow>
</mml:munder>
</mml:mstyle>
<mml:msub>
<mml:mrow>
<mml:mi>A</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>j</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>f</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>1</mml:mn>
<mml:mo>,</mml:mo>
<mml:mo>&#x2200;</mml:mo>
<mml:mi>j</mml:mi>
<mml:mo>&#x2208;</mml:mo>
<mml:mi>J</mml:mi>
</mml:math>
<label>(50)</label>
</disp-formula>
<disp-formula id="e51">
<mml:math id="m56">
<mml:msub>
<mml:mrow>
<mml:mi>A</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>j</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>f</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:mstyle displaystyle="true">
<mml:munder>
<mml:mrow>
<mml:mo>&#x2211;</mml:mo>
</mml:mrow>
<mml:mrow>
<mml:mi>p</mml:mi>
<mml:mo>&#x2208;</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi>P</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>l</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>f</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:munder>
</mml:mstyle>
<mml:mstyle displaystyle="true">
<mml:munder>
<mml:mrow>
<mml:mo>&#x2211;</mml:mo>
</mml:mrow>
<mml:mrow>
<mml:mi>t</mml:mi>
<mml:mo>&#x2208;</mml:mo>
<mml:mi>T</mml:mi>
</mml:mrow>
</mml:munder>
</mml:mstyle>
<mml:msub>
<mml:mrow>
<mml:mi>B</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>j</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>l</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>f</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>p</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>t</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:mo>&#x2200;</mml:mo>
<mml:mi>l</mml:mi>
<mml:mo>&#x2208;</mml:mo>
<mml:mi>L</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>j</mml:mi>
<mml:mo>&#x2208;</mml:mo>
<mml:mi>J</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>f</mml:mi>
<mml:mo>&#x2208;</mml:mo>
<mml:mi>F</mml:mi>
</mml:math>
<label>(51)</label>
</disp-formula>
<disp-formula id="e52">
<mml:math id="m57">
<mml:mstyle displaystyle="true">
<mml:munder>
<mml:mrow>
<mml:mo>&#x2211;</mml:mo>
</mml:mrow>
<mml:mrow>
<mml:mi>j</mml:mi>
<mml:mo>&#x2208;</mml:mo>
<mml:mi>J</mml:mi>
</mml:mrow>
</mml:munder>
</mml:mstyle>
<mml:msub>
<mml:mrow>
<mml:mi>B</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>j</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>l</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>f</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>p</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>t</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x2264;</mml:mo>
<mml:mn>1</mml:mn>
<mml:mo>,</mml:mo>
<mml:mo>&#x2200;</mml:mo>
<mml:mi>f</mml:mi>
<mml:mo>&#x2208;</mml:mo>
<mml:mi>F</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>p</mml:mi>
<mml:mo>&#x2208;</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi>P</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>l</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>f</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:mi>t</mml:mi>
<mml:mo>&#x2208;</mml:mo>
<mml:mi>T</mml:mi>
</mml:math>
<label>(52)</label>
</disp-formula>
<disp-formula id="e53">
<mml:math id="m58">
<mml:mstyle displaystyle="true">
<mml:munder>
<mml:mrow>
<mml:mo>&#x2211;</mml:mo>
</mml:mrow>
<mml:mrow>
<mml:mi>j</mml:mi>
<mml:mo>&#x2208;</mml:mo>
<mml:mi>J</mml:mi>
</mml:mrow>
</mml:munder>
</mml:mstyle>
<mml:msub>
<mml:mrow>
<mml:mi>B</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>j</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>l</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>f</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>p</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>t</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x2265;</mml:mo>
<mml:mstyle displaystyle="true">
<mml:munder>
<mml:mrow>
<mml:mo>&#x2211;</mml:mo>
</mml:mrow>
<mml:mrow>
<mml:msup>
<mml:mrow>
<mml:mi>j</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mo>&#x2032;</mml:mo>
</mml:mrow>
</mml:msup>
<mml:mo>&#x2208;</mml:mo>
<mml:mi>J</mml:mi>
</mml:mrow>
</mml:munder>
</mml:mstyle>
<mml:msub>
<mml:mrow>
<mml:mi>B</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:msup>
<mml:mrow>
<mml:mi>j</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mo>&#x2032;</mml:mo>
</mml:mrow>
</mml:msup>
<mml:mo>,</mml:mo>
<mml:mi>l</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>f</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>p</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>t</mml:mi>
<mml:mo>&#x2b;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:mo>&#x2200;</mml:mo>
<mml:mi>f</mml:mi>
<mml:mo>&#x2208;</mml:mo>
<mml:mi>F</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>l</mml:mi>
<mml:mo>&#x2208;</mml:mo>
<mml:mi>L</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>p</mml:mi>
<mml:mo>&#x2208;</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi>P</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>l</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>f</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:mi>t</mml:mi>
<mml:mo>&#x2208;</mml:mo>
<mml:mfenced open="{" close="}">
<mml:mrow>
<mml:mn>1</mml:mn>
<mml:mo>,</mml:mo>
<mml:mo>&#x2026;</mml:mo>
<mml:mo>,</mml:mo>
<mml:mi>q</mml:mi>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:mfenced>
</mml:math>
<label>(53)</label>
</disp-formula>
<disp-formula id="e54">
<mml:math id="m59">
<mml:mi>P</mml:mi>
<mml:msub>
<mml:mrow>
<mml:mi>I</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>f</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>p</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>t</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:mi>p</mml:mi>
<mml:msub>
<mml:mrow>
<mml:mi>V</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>f</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>p</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>t</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x2b;</mml:mo>
<mml:mo>&#x2211;</mml:mo>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:msub>
<mml:mrow>
<mml:mi>S</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>j</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>l</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>f</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>p</mml:mi>
</mml:mrow>
</mml:msub>
<mml:msub>
<mml:mrow>
<mml:mi>B</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>j</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>l</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>f</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>p</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>t</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:mfenced>
<mml:mo>,</mml:mo>
<mml:mo>&#x2200;</mml:mo>
<mml:mi>f</mml:mi>
<mml:mo>&#x2208;</mml:mo>
<mml:mi>F</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>l</mml:mi>
<mml:mo>&#x2208;</mml:mo>
<mml:mi>L</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>p</mml:mi>
<mml:mo>&#x2208;</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi>P</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>l</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>f</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:mi>t</mml:mi>
<mml:mo>&#x2208;</mml:mo>
<mml:mi>T</mml:mi>
</mml:math>
<label>(54)</label>
</disp-formula>
<disp-formula id="e55">
<mml:math id="m60">
<mml:mi>P</mml:mi>
<mml:msub>
<mml:mrow>
<mml:mi>V</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>f</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>p</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>t</mml:mi>
<mml:mo>&#x2b;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:msub>
<mml:mo>&#x2265;</mml:mo>
<mml:mi>P</mml:mi>
<mml:msub>
<mml:mrow>
<mml:mi>I</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>f</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>p</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>t</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:mo>&#x2200;</mml:mo>
<mml:mi>f</mml:mi>
<mml:mo>&#x2208;</mml:mo>
<mml:mi>F</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>p</mml:mi>
<mml:mo>&#x2208;</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi>P</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>l</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>f</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:mi>t</mml:mi>
<mml:mo>&#x2208;</mml:mo>
<mml:mfenced open="{" close="}">
<mml:mrow>
<mml:mn>1</mml:mn>
<mml:mo>,</mml:mo>
<mml:mo>&#x2026;</mml:mo>
<mml:mo>,</mml:mo>
<mml:mi>q</mml:mi>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:mfenced>
</mml:math>
<label>(55)</label>
</disp-formula>
<disp-formula id="e56">
<mml:math id="m61">
<mml:mtable class="eqnarray">
<mml:mtr>
<mml:mtd columnalign="right"/>
<mml:mtd columnalign="left">
</mml:mtd>
<mml:mtd columnalign="left">
<mml:mi>P</mml:mi>
<mml:msub>
<mml:mrow>
<mml:mi>V</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>f</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>p</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>t</mml:mi>
<mml:mo>&#x2b;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:msub>
<mml:mo>&#x2b;</mml:mo>
<mml:mi>P</mml:mi>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mn>1</mml:mn>
<mml:mo>&#x2212;</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi>B</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>j</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>l</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>f</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>p</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>t</mml:mi>
<mml:mo>&#x2b;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:mfenced>
<mml:mo>&#x2265;</mml:mo>
<mml:mi>P</mml:mi>
<mml:msub>
<mml:mrow>
<mml:mi>I</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>f</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>p</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>t</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mtd>
</mml:mtr>
<mml:mtr>
<mml:mtd columnalign="right"/>
<mml:mtd columnalign="left">
</mml:mtd>
<mml:mtd columnalign="left">
<mml:mo>&#x2b;</mml:mo>
<mml:mstyle displaystyle="true">
<mml:munder>
<mml:mrow>
<mml:mo>&#x2211;</mml:mo>
</mml:mrow>
<mml:mrow>
<mml:mi>j</mml:mi>
<mml:mo>&#x2208;</mml:mo>
<mml:mi>J</mml:mi>
</mml:mrow>
</mml:munder>
</mml:mstyle>
<mml:msub>
<mml:mrow>
<mml:mi>v</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>j</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>j</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>l</mml:mi>
</mml:mrow>
</mml:msub>
<mml:msub>
<mml:mrow>
<mml:mi>B</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>j</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>j</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>f</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>p</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>t</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:mo>&#x2200;</mml:mo>
<mml:mi>f</mml:mi>
<mml:mo>&#x2208;</mml:mo>
<mml:mi>F</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>l</mml:mi>
<mml:mo>&#x2208;</mml:mo>
<mml:mi>L</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>p</mml:mi>
<mml:mo>&#x2208;</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi>P</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>f</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:mi>t</mml:mi>
<mml:mo>&#x2208;</mml:mo>
<mml:mfenced open="{" close="}">
<mml:mrow>
<mml:mn>1</mml:mn>
<mml:mo>,</mml:mo>
<mml:mo>&#x2026;</mml:mo>
<mml:mo>,</mml:mo>
<mml:mi>q</mml:mi>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:mfenced>
</mml:mtd>
</mml:mtr>
</mml:mtable>
</mml:math>
<label>(56)</label>
</disp-formula>
<disp-formula id="e57">
<mml:math id="m62">
<mml:mi>P</mml:mi>
<mml:msub>
<mml:mrow>
<mml:mi>V</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>f</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>p</mml:mi>
<mml:mo>,</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:msub>
<mml:mo>&#x2265;</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi>v</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>j</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>j</mml:mi>
<mml:mo>,</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:msub>
<mml:mo>&#x2212;</mml:mo>
<mml:mi>P</mml:mi>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mn>1</mml:mn>
<mml:mo>&#x2212;</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi>B</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>j</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>l</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>f</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>p</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>t</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:mfenced>
<mml:mo>,</mml:mo>
<mml:mo>&#x2200;</mml:mo>
<mml:mi>f</mml:mi>
<mml:mo>&#x2208;</mml:mo>
<mml:mi>F</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>l</mml:mi>
<mml:mo>&#x2208;</mml:mo>
<mml:mi>L</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>p</mml:mi>
<mml:mo>&#x2208;</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi>P</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>f</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:mi>t</mml:mi>
<mml:mo>&#x2208;</mml:mo>
<mml:mi>T</mml:mi>
</mml:math>
<label>(57)</label>
</disp-formula>
<disp-formula id="e58">
<mml:math id="m63">
<mml:mi>P</mml:mi>
<mml:msub>
<mml:mrow>
<mml:mi>V</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>f</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>p</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>t</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x2264;</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi>v</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>j</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>l</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x2b;</mml:mo>
<mml:mi>P</mml:mi>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mn>1</mml:mn>
<mml:mo>&#x2212;</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi>B</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>j</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>l</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>f</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>p</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>t</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:mfenced>
<mml:mo>,</mml:mo>
<mml:mo>&#x2200;</mml:mo>
<mml:mi>f</mml:mi>
<mml:mo>&#x2208;</mml:mo>
<mml:mi>F</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>l</mml:mi>
<mml:mo>&#x2208;</mml:mo>
<mml:mi>L</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>j</mml:mi>
<mml:mo>&#x2208;</mml:mo>
<mml:mi>J</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>p</mml:mi>
<mml:mo>&#x2208;</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi>P</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>l</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>f</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:mi>t</mml:mi>
<mml:mo>&#x2208;</mml:mo>
<mml:mi>T</mml:mi>
</mml:math>
<label>(58)</label>
</disp-formula>
<disp-formula id="e59">
<mml:math id="m64">
<mml:mi>P</mml:mi>
<mml:msub>
<mml:mrow>
<mml:mi>V</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>f</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>p</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>t</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x2265;</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi>v</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>j</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>l</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x2212;</mml:mo>
<mml:mi>P</mml:mi>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mn>1</mml:mn>
<mml:mo>&#x2212;</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi>B</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>j</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>l</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>f</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>p</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>t</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:mfenced>
<mml:mo>,</mml:mo>
<mml:mo>&#x2200;</mml:mo>
<mml:mi>f</mml:mi>
<mml:mo>&#x2208;</mml:mo>
<mml:mi>F</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>l</mml:mi>
<mml:mo>&#x2208;</mml:mo>
<mml:mi>L</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>j</mml:mi>
<mml:mo>&#x2208;</mml:mo>
<mml:mi>J</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>p</mml:mi>
<mml:mo>&#x2208;</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi>P</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>l</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>f</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:mi>t</mml:mi>
<mml:mo>&#x2208;</mml:mo>
<mml:mi>T</mml:mi>
</mml:math>
<label>(59)</label>
</disp-formula>
<disp-formula id="e60">
<mml:math id="m65">
<mml:msub>
<mml:mrow>
<mml:mi>F</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>j</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>l</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi>V</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>j</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>l</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x2b;</mml:mo>
<mml:mstyle displaystyle="true">
<mml:munder>
<mml:mrow>
<mml:mo>&#x2211;</mml:mo>
</mml:mrow>
<mml:mrow>
<mml:mi>f</mml:mi>
<mml:mo>&#x2208;</mml:mo>
<mml:mi>F</mml:mi>
</mml:mrow>
</mml:munder>
</mml:mstyle>
<mml:mstyle displaystyle="true">
<mml:munder>
<mml:mrow>
<mml:mo>&#x2211;</mml:mo>
</mml:mrow>
<mml:mrow>
<mml:mi>p</mml:mi>
<mml:mo>&#x2208;</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi>P</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>l</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>f</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:munder>
</mml:mstyle>
<mml:mstyle displaystyle="true">
<mml:munder>
<mml:mrow>
<mml:mo>&#x2211;</mml:mo>
</mml:mrow>
<mml:mrow>
<mml:mi>t</mml:mi>
<mml:mo>&#x2208;</mml:mo>
<mml:mi>T</mml:mi>
</mml:mrow>
</mml:munder>
</mml:mstyle>
<mml:msub>
<mml:mrow>
<mml:mi>S</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>j</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>l</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>f</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>p</mml:mi>
</mml:mrow>
</mml:msub>
<mml:msub>
<mml:mrow>
<mml:mi>A</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>j</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>l</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>f</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>p</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>t</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:mo>&#x2200;</mml:mo>
<mml:mi>j</mml:mi>
<mml:mo>&#x2208;</mml:mo>
<mml:mi>J</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>l</mml:mi>
<mml:mo>&#x2208;</mml:mo>
<mml:mfenced open="{" close="}">
<mml:mrow>
<mml:mn>1</mml:mn>
<mml:mo>,</mml:mo>
<mml:mo>&#x2026;</mml:mo>
<mml:mo>,</mml:mo>
<mml:mi>p</mml:mi>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:mfenced>
</mml:math>
<label>(60)</label>
</disp-formula>
<disp-formula id="e61">
<mml:math id="m66">
<mml:msub>
<mml:mrow>
<mml:mi>I</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>j</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>l</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x2264;</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi>V</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>j</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>l</mml:mi>
<mml:mo>&#x2b;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:mo>&#x2200;</mml:mo>
<mml:mi>j</mml:mi>
<mml:mo>&#x2208;</mml:mo>
<mml:mi>J</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>l</mml:mi>
<mml:mo>&#x2208;</mml:mo>
<mml:mfenced open="{" close="}">
<mml:mrow>
<mml:mn>1</mml:mn>
<mml:mo>,</mml:mo>
<mml:mo>&#x2026;</mml:mo>
<mml:mo>,</mml:mo>
<mml:mi>p</mml:mi>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:mfenced>
</mml:math>
<label>(61)</label>
</disp-formula>
<disp-formula id="e62">
<mml:math id="m67">
<mml:mi>P</mml:mi>
<mml:msub>
<mml:mrow>
<mml:mi>V</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>f</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>p</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>t</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x2265;</mml:mo>
<mml:mn>0</mml:mn>
<mml:mo>,</mml:mo>
<mml:mo>&#x2200;</mml:mo>
<mml:mi>f</mml:mi>
<mml:mo>&#x2208;</mml:mo>
<mml:mi>F</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>p</mml:mi>
<mml:mo>&#x2208;</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi>P</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>f</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:mi>t</mml:mi>
<mml:mo>&#x2208;</mml:mo>
<mml:mi>T</mml:mi>
</mml:math>
<label>(62)</label>
</disp-formula>
</p>
<p>Eq. <xref ref-type="disp-formula" rid="e48">48</xref> represents the objective function aiming to minimize the maximum completion time. Eq. <xref ref-type="disp-formula" rid="e49">49</xref> denotes the objective value, ensuring it is greater than or equal to the completion time of any factory. Eq. <xref ref-type="disp-formula" rid="e50">50</xref> represents the constraint that each job can only be assigned to one factory. Eq. <xref ref-type="disp-formula" rid="e51">51</xref> ensures that each job can only be processed within one factory and only one machine can be selected at any given stage. Eq. <xref ref-type="disp-formula" rid="e52">52</xref> indicates that each machine is limited to handling a single job concurrently. Eq. <xref ref-type="disp-formula" rid="e53">53</xref> ensures that every job chooses a machine based on its sequential position and guarantees the selection of the machine currently in that position. Eqs <xref ref-type="disp-formula" rid="e54">54</xref> and <xref ref-type="disp-formula" rid="e55">55</xref> determine the start and end times of each machine&#x2019;s position in all factory. Eq. <xref ref-type="disp-formula" rid="e56">56</xref> represents the adjustment constraints for sequence-related setup times. Eq. <xref ref-type="disp-formula" rid="e57">57</xref> specifies that the initiation time of the initial job must not be earlier than the setup time for each machine within the factory. Eqs <xref ref-type="disp-formula" rid="e58">58</xref>, <xref ref-type="disp-formula" rid="e59">59</xref> define the corresponding relationships between machine positions and job sequences. Eq. <xref ref-type="disp-formula" rid="e60">60</xref> defines the completion time of a job. Eq. <xref ref-type="disp-formula" rid="e61">61</xref> defines that jobs pass through all stages within a factory in sequence. Eq. <xref ref-type="disp-formula" rid="e62">62</xref> specifies that no machine at any level of a manufacturing shall have a start time that is less than 0.</p>
<p>Researchers have conducted studies on single-objective DHFSP with the objective of minimizing the maximum completion time. Various algorithms have been employed to address this problem, including the adaptive iterative greedy algorithm (<xref ref-type="bibr" rid="B178">Ying and Lin, 2018</xref>), dynamic frog-leaping algorithm (<xref ref-type="bibr" rid="B13">Cai et al., 2020</xref>), hybrid brainstorming algorithm (<xref ref-type="bibr" rid="B55">Hao et al., 2019</xref>), artificial bee colony algorithm (<xref ref-type="bibr" rid="B95">Li Y. et al., 2019</xref>; <xref ref-type="bibr" rid="B96">Li et al., 2020b</xref>; <xref ref-type="bibr" rid="B97">Li Y. et al., 2021</xref>), multi-neighborhood iterative greedy algorithm (<xref ref-type="bibr" rid="B138">Shao et al., 2020</xref>), dual-population competitive cultural genetic algorithm (<xref ref-type="bibr" rid="B163">Wang and Wang, 2020</xref>), improved brainstorming algorithm (<xref ref-type="bibr" rid="B85">Li J. et al., 2021</xref>), iterative greedy algorithm (<xref ref-type="bibr" rid="B162">Wang and Wang, 2019</xref>), and teaching optimization algorithm (<xref ref-type="bibr" rid="B81">Lei and Su, 2023</xref>). The common objective of these algorithms is to minimize the maximum completion time.</p>
<p>For the homogeneous DHFSP, <xref ref-type="bibr" rid="B139">Shao et al. (2021)</xref> proposed a MOEA based on multi-neighborhood local search to solve the multi-objective DHFSP. Cai et al. (<xref ref-type="bibr" rid="B14">Cai et al., 2018</xref>) proposed an improved non-dominated sorting genetic algorithm II (NSGA-II) for finding the Pareto-optimal solutions of the multi-objective distributed permutation flow-shop scheduling problem (DPFSP). The algorithm utilizes new solution representation, new population re-initialization method, effective crossover and mutation operators, as well as local search technique.</p>
<p>Switching to the heterogeneous DHFSP, <xref ref-type="bibr" rid="B140">Shao et al. (2022)</xref> employed network meta-heuristic algorithm (NMA) to address the problem of energy and labor perception in distributed heterogeneous DHFSP (ELDHHFSP). Initially, the author introduced a MILP model to depict ELDHHFSP and defined multiple optimization objectives. Subsequently, the author proposed the NMA, which comprises two crucial components: a probabilistic network model and a learning-based local search, corresponding to global search and local search respectively. <xref ref-type="bibr" rid="B191">Zhang et al. (2023b)</xref> employed a multi-objective genetic algorithm along with particle swarm optimization and a Q-learning-based local search method to address the energy-efficient heterogeneous DHFSP. Their objectives were to optimize both the manufacturing <italic>C</italic>
<sub>max</sub> and total energy consumption. To expedite rapid convergence of the solution across multiple directions on the Pareto frontier, they employed multiple sets of particle swarm optimization as a global search strategy. To enhance the search for problem-specific knowledge, they designed two local search strategies to further improve the quality and diversity of solutions. Additionally, they utilized Q-Learning (QL) to guide variable domain exploration for a better balance between algorithm exploration and exploitation.</p>
<p>Currently, both Particle Swarm Optimization (PSO) an QL algorithms are highly regarded and essential in this field. PSO with its exceptional search and optimization capabilities, has become a preferred tool for researchers tackling job scheduling problems. Simultaneously, QL algorithms have gained widespread attention for their outstanding performance in the field of RL, offering an effective approach for systems to learn and optimize strategies in unknown environments. Next, we will delve into these two methods in detail.</p>
</sec>
</sec>
<sec id="s2-6-3">
<title>2.6.3 Particle swarm optimization and Q-learning</title>
<p>In 1995, James Kennedy and Russell Eberhart (<xref ref-type="bibr" rid="B70">Kennedy and Eberhart, 1995</xref>) were inspired by the foraging behavior of bird flocks and proposed the PSO algorithm. The inspiration of particle swarm optimization algorithm comes from the study of the foraging behavior of bird swarms, which help the entire population find the optimal destination through collective information sharing. Single objective PSO has significant advantages in convergence speed and is therefore widely used in solving MOP. <xref ref-type="bibr" rid="B25">Reyes-Sierra and Coello Coello (2006)</xref> have published a research result on using PSO to handle MOP, which is called multi objective particle swarm optimization (MOPSO). The conventional calculation steps for MOPSO are as follows.<list list-type="simple">
<list-item>
<p>&#x2022; Initialize the particle swarm, including setting the number of particles, velocities, and positions.</p>
</list-item>
<list-item>
<p>&#x2022; Evaluate the quality of particles using multiple fitness functions, typically employed in MOPSO.</p>
</list-item>
<list-item>
<p>&#x2022; Update the individual&#x2019;s historical best positions, which, in multi-objective algorithms, form a collection known as pbestset.</p>
</list-item>
<list-item>
<p>&#x2022; Update the global best position of the particle swarm, where in multi-objective algorithms, the global best positions constitute a set often referred to as gbestset.</p>
</list-item>
<list-item>
<p>&#x2022; Output the optimal solution.</p>
</list-item>
</list>
</p>
<p>Update the velocity and position of each particle based on the following formula.<disp-formula id="e63">
<mml:math id="m68">
<mml:mi>v</mml:mi>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mi mathvariant="bold-italic">t</mml:mi>
</mml:mrow>
</mml:mfenced>
<mml:mo>&#x3d;</mml:mo>
<mml:mi>w</mml:mi>
<mml:mi mathvariant="bold-italic">v</mml:mi>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mi mathvariant="bold-italic">t</mml:mi>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:mfenced>
<mml:mo>&#x2b;</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi>c</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:msub>
<mml:msub>
<mml:mrow>
<mml:mi>r</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:msub>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mi mathvariant="normal">p</mml:mi>
<mml:mi mathvariant="normal">b</mml:mi>
<mml:mi mathvariant="normal">e</mml:mi>
<mml:mi mathvariant="normal">s</mml:mi>
<mml:mi mathvariant="normal">t</mml:mi>
<mml:mo>&#x2212;</mml:mo>
<mml:mi>x</mml:mi>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mi mathvariant="bold-italic">t</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mfenced>
<mml:mo>&#x2b;</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi>c</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mn>2</mml:mn>
</mml:mrow>
</mml:msub>
<mml:msub>
<mml:mrow>
<mml:mi>r</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mn>2</mml:mn>
</mml:mrow>
</mml:msub>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mi mathvariant="normal">g</mml:mi>
<mml:mi mathvariant="normal">b</mml:mi>
<mml:mi mathvariant="normal">e</mml:mi>
<mml:mi mathvariant="normal">s</mml:mi>
<mml:mi mathvariant="normal">t</mml:mi>
<mml:mo>&#x2212;</mml:mo>
<mml:mi>x</mml:mi>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mi mathvariant="bold-italic">t</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mfenced>
</mml:math>
<label>(63)</label>
</disp-formula>
<disp-formula id="e64">
<mml:math id="m69">
<mml:mi>x</mml:mi>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mi mathvariant="bold-italic">t</mml:mi>
<mml:mo>&#x2b;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:mfenced>
<mml:mo>&#x3d;</mml:mo>
<mml:mi>x</mml:mi>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mi mathvariant="bold-italic">t</mml:mi>
</mml:mrow>
</mml:mfenced>
<mml:mo>&#x2b;</mml:mo>
<mml:mi>v</mml:mi>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mi mathvariant="bold-italic">t</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:math>
<label>(64)</label>
</disp-formula>In Eqs. <xref ref-type="disp-formula" rid="e63">63</xref>, <xref ref-type="disp-formula" rid="e64">64</xref> Where <italic>v</italic>(<italic>t</italic>) and <italic>x</italic>(<italic>t</italic>) respectively represent the velocity and position of a particle. The <italic>w</italic> is the inertia weight, <italic>c</italic>
<sub>1</sub> and <italic>c</italic>
<sub>2</sub> represent the cognitive learning factor and social learning factor, which can adjust the particle&#x2019;s proximity to its previous best distance. <italic>r</italic>
<sub>1</sub> and <italic>r</italic>
<sub>2</sub> are random numbers between 0 and 1 used to enhance the randomness of particle movement.</p>
<p>The MOPSO method, although proficient in addressing MOPs, faces certain challenges. One prominent drawback is its susceptibility to the choice of control parameters (<xref ref-type="bibr" rid="B189">Zhang W. et al., 2023</xref>), including the inertia weight <italic>w</italic>, cognitive learning factor <italic>c</italic>
<sub>1</sub>, and social learning factor <italic>c</italic>
<sub>2</sub>. Inadequately calibrated parameters may impede convergence, leading to suboptimal solutions. Furthermore, the algorithm&#x2019;s effectiveness can be influenced by the selection of fitness functions and their respective weights. To address these challenges, researchers have explored alternative optimization approaches. One intriguing avenue is the application of QL, a value-based RL algorithm.</p>
<p>In this algorithm, <italic>Q</italic> (<italic>s</italic>, <italic>a</italic>) represents the expected return value when taking action <italic>a</italic> in a specific state <italic>s</italic>. At each time step, the environment provides a corresponding reward based on the agent&#x2019;s action. The core idea of the algorithm is to construct a <italic>Q</italic>-table, which is used to store <italic>Q</italic>-values for different state-action pairs, and then select actions that maximize the expected return based on these <italic>Q</italic>-values.</p>
<p>When building QL, Firstly, it is necessary to define real-time rewards, which guides the agent to select actions to obtain the Q-table. The update of Q-values is as follows (<xref ref-type="bibr" rid="B169">Watkins and Dayan, 1992</xref>):<disp-formula id="e65">
<mml:math id="m70">
<mml:mi>Q</mml:mi>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mi>s</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>a</mml:mi>
</mml:mrow>
</mml:mfenced>
<mml:mo>&#x3d;</mml:mo>
<mml:mi>Q</mml:mi>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mi>s</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>a</mml:mi>
</mml:mrow>
</mml:mfenced>
<mml:mo>&#x2b;</mml:mo>
<mml:mi>&#x3b1;</mml:mi>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mi>R</mml:mi>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mi>s</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>a</mml:mi>
</mml:mrow>
</mml:mfenced>
<mml:mo>&#x2b;</mml:mo>
<mml:mi>&#x3b3;</mml:mi>
<mml:mi>max</mml:mi>
<mml:mi>Q</mml:mi>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:msup>
<mml:mrow>
<mml:mi>s</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mo>&#x2032;</mml:mo>
</mml:mrow>
</mml:msup>
<mml:mo>,</mml:mo>
<mml:msup>
<mml:mrow>
<mml:mi>a</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mo>&#x2032;</mml:mo>
</mml:mrow>
</mml:msup>
</mml:mrow>
</mml:mfenced>
<mml:mo>&#x2212;</mml:mo>
<mml:mi>Q</mml:mi>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mi>s</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>a</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mfenced>
</mml:math>
<label>(65)</label>
</disp-formula>In Eq. <xref ref-type="disp-formula" rid="e65">65</xref>, where the parameter <italic>&#x3b1;</italic> is the learning rate, with a value of 1, and the parameter <italic>&#x3b3;</italic> is the discount factor, which determines the extent of value iteration updates, ranging from 0 to 1. In this study, Q-values are stored in the Q-table and updated iteratively. The agent selects actions from the action set based on an <italic>&#x25b;</italic>-greedy behavioral policy. The symbol <italic>&#x25b;</italic> represents the probability of choosing a greedy action.</p>
<p>In order to enhance the flexibility of the PSO algorithm during the iteration process, cope with convergence difficulties and overcome local optimization problems, an effective method is to adopt an adaptive parameter adjustment strategy. This can be achieved by designing appropriate states, actions, and reward mechanisms, and utilizing QL. The QL based PSO (QL-PSO) (<xref ref-type="bibr" rid="B174">Xu and Pi, 2020</xref>) algorithm can better adapt to the characteristics of the problem, automatically adjust parameters to adapt to different problem instances, thereby improving its performance and robustness. This adaptive parameter adjustment strategy helps to overcome the limitations of conventional PSO algorithms and make them perform better in complex problems. The algorithm process of QL-PSO is roughly as follows (<xref ref-type="bibr" rid="B191">Zhang et al., 2023b</xref>).<list list-type="simple">
<list-item>
<p>&#x2022; Initialize particle swarm and evaluate particle quality.</p>
</list-item>
<list-item>
<p>&#x2022; Employ a mixed sampling strategy to divide the particle swarm into three sub-particle swarms and employ the PSO algorithm to update each sub-particle swarm.</p>
</list-item>
<list-item>
<p>&#x2022; Divide the entire particle swarm into three sub particle swarms again, and initialize the Q-table, actions, states, and rewards. Then use the QL algorithm for local search on each sub particle swarm.</p>
</list-item>
<list-item>
<p>&#x2022; Merge the three sub-particle swarms with the overall particle swarm from the end of the second step, employing a selection strategy based on Pareto dominating and dominated relationship-based fitness function (PDDR-FF) (<xref ref-type="bibr" rid="B188">Zhang et al., 2014</xref>), selecting the top 50% of particles ranked by fitness function values to form the next-generation of the new particle swarm.</p>
</list-item>
</list>
</p>
</sec>
</sec>
</sec>
<sec id="s3">
<title>3 Machine learning and multi-objective evolutionary algorithms</title>
<sec id="s3-1">
<title>3.1 Machine learning</title>
<p>Traditional methods encounter a trade-off between efficiency and quality. Meta-heuristic algorithms, while powerful, can be computationally expensive, making them less practical in dynamic environments with frequent events, where optimal solution quality may suffer. In contrast, rule-based methods provide solutions quickly but at the cost of sacrificing solution quality. These methods rely on limited information types and simple mathematical operations for decision-making.</p>
<p>During the search process, EAs accumulate valuable information related to search and population dynamics, as well as problem characteristics. ML techniques can harness this information to extract meaningful insights, enhancing the overall search performance of algorithms. ML techniques include statistical methods such as interpolation and regression (<xref ref-type="bibr" rid="B24">Cleveland et al., 2017</xref>), orthogonal experimental design (<xref ref-type="bibr" rid="B106">Lopes et al., 2020</xref>), opposition-based learning (<xref ref-type="bibr" rid="B113">Mahdavi et al., 2018</xref>), principal component analysis (<xref ref-type="bibr" rid="B1">Abdi and Williams, 2010</xref>), artificial neural networks (<xref ref-type="bibr" rid="B61">Ismayilov and Topcuoglu, 2020</xref>), support vector machines (<xref ref-type="bibr" rid="B126">Pisner and Schnyer, 2020</xref>), cluster analysis (<xref ref-type="bibr" rid="B154">Trebu&#x148;a and Hal&#x10d;inov&#xe1;, 2013</xref>), case-based reasoning (<xref ref-type="bibr" rid="B73">Kolodner, 1992</xref>), mean and variance (<xref ref-type="bibr" rid="B115">Makridakis et al., 2018</xref>), competitive learning (<xref ref-type="bibr" rid="B131">Rumelhart and Zipser, 1985</xref>), Bayesian networks (<xref ref-type="bibr" rid="B57">Heckerman, 2008</xref>), and RL (<xref ref-type="bibr" rid="B170">Wiering and Van Otterlo, 2012</xref>). The amalgamation of ML approaches with evolutionary computing has been empirically shown to provide benefits in terms of both convergence speed and solution quality. Early researchs (<xref ref-type="bibr" rid="B99">Lin and Gen, 2018</xref>) have proposed using ML techniques to enhance EAs. Supervised learning (<xref ref-type="bibr" rid="B65">Jourdan et al., 2006</xref>; <xref ref-type="bibr" rid="B185">Zhang J. et al., 2011</xref>) has faster convergence and better solution quality compared to evolutionary learning (<xref ref-type="bibr" rid="B74">Kotsiantis et al., 2007</xref>).</p>
<p>EAs does not rely on backpropagation and has become a powerful optimization tool due to its high parallelism and wide applicability. Their ability to conduct global searches in parameter space and robustness make them particularly effective, with relatively low demands on environmental reward settings. However, EAs exhibit lower sample efficiency, a relatively singular exploration approach, and a lack of learning and generalization capabilities.</p>
<p>Comparatively, with its characteristic of data-driven decision-making, ML can achieve performance in specific scenarios that approaches or even surpasses human capabilities. Yet, ML faces significant limitations. Primarily, its performance highly depends on the quality of training data, with low-quality data potentially leading to incomplete or inaccurate models. Secondly, the task-specific model types in ML hinder its ability to seamlessly perform diverse tasks. Lastly, the lack of generality in ML models prevents them from adapting to various unspecific tasks. Therefore, when considering the characteristics of EAs and ML, it is essential to choose an appropriate method based on the specific requirements of the problem or flexibly combine both in practical applications to leverage their respective strengths and compensate for their limitations.</p>
<p>Having discussed the characteristics of EAs and ML, our focus will now shift towards their integration, particularly the fusion of RL and MOEAs. This integration is not only aimed at overcoming their respective limitations but also at creating a more comprehensive and powerful optimization framework. In the following chapters, we will delve into the methods, advantages, and potential application areas of this integration.</p>
</sec>
<sec id="s3-2">
<title>3.2 Reinforcement learning</title>
<p>RL is a learning approach that seeks to optimize the total reward obtained via the iterative interaction between an autonomous agent and its surrounding environment (<xref ref-type="bibr" rid="B4">Arulkumaran et al., 2017</xref>). It can be delineated using the Markov Decision Process framework, which includes action space <italic>A</italic>, state space <italic>S</italic>, reward function <italic>r</italic>, state transition probability <italic>p</italic> and discount factor <italic>&#x3b3;</italic>. When the agent is in state <italic>s</italic> &#x2208; <italic>S</italic>, it can choose action <italic>a</italic> &#x2208; <italic>A</italic>, and the environment will transition to a new state <italic>s</italic>&#x2032; with probability <italic>p</italic> (<italic>s</italic>&#x2032;&#x7c;<italic>s</italic>, <italic>a</italic>) and provide a reward <italic>r</italic> (<italic>s</italic>, <italic>a</italic>, <italic>s</italic>&#x2032;). The agent&#x2019;s goal is to learn a policy <italic>&#x3c0;</italic>(<italic>a</italic>&#x7c;<italic>s</italic>) that maximizes the cumulative reward <inline-formula id="inf6">
<mml:math id="m71">
<mml:msub>
<mml:mrow>
<mml:mi>R</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>t</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:msubsup>
<mml:mrow>
<mml:mo movablelimits="false" form="prefix">&#x2211;</mml:mo>
</mml:mrow>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>0</mml:mn>
</mml:mrow>
<mml:mrow>
<mml:mi>&#x221e;</mml:mi>
</mml:mrow>
</mml:msubsup>
<mml:msup>
<mml:mrow>
<mml:mi>&#x3b3;</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>i</mml:mi>
</mml:mrow>
</mml:msup>
<mml:msub>
<mml:mrow>
<mml:mi>r</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>t</mml:mi>
<mml:mo>&#x2b;</mml:mo>
<mml:mi>i</mml:mi>
</mml:mrow>
</mml:msub>
</mml:math>
</inline-formula>, where <italic>&#x3b3;</italic> is the discount factor that balances the importance of immediate and future rewards.</p>
<p>In the context of scheduling inside a shop, the state space <italic>S</italic> may be used to denote the existing state of the shop, encompassing factors such as the condition of machines and the advancement of jobs. The action space <italic>A</italic> can represent scheduling decisions, such as which jobs to assign to which machines. The state transition probability <italic>p</italic> can represent the change in the shop state based on the scheduling decision. The reward function <italic>r</italic> can represent the reward obtained from the scheduling decision, such as the number of completed jobs and time saved. The discount factor <italic>&#x3b3;</italic> can represent the ratio between immediate and future rewards, typically between 0 and 1. The policy <italic>&#x3c0;</italic> of the agent may be used to make decisions depending on the current state of the shop, with the objective of maximizing the cumulative reward. The interaction process between an intelligent agent and its environment is shown in <xref ref-type="fig" rid="F6">Figure 6</xref>.</p>
<fig id="F6" position="float">
<label>FIGURE 6</label>
<caption>
<p>The interaction process of agents in RL.</p>
</caption>
<graphic xlink:href="fieng-02-1337174-g006.tif"/>
</fig>
<p>Through RL algorithms, shops can achieve intelligent scheduling to improve efficiency and quality. Compared to supervised learning and evolutionary learning, RL has the following advantages.<list list-type="simple">
<list-item>
<p>1. RL can operate without labeled data, which makes it more suitable for real-world environments.</p>
</list-item>
<list-item>
<p>2. It is more adaptive and can learn and make decisions in dynamic and complex environments.</p>
</list-item>
<list-item>
<p>3. RL receives real-time feedback by interacting with the environment, which helps with rapid learning and decision-making. Decision-making.</p>
</list-item>
<list-item>
<p>4. RL can explore and discover better solutions autonomously, without relying solely on human prior knowledge.</p>
</list-item>
<list-item>
<p>5. In some cases, RL may outperform supervised learning and evolutionary learning.</p>
</list-item>
</list>
</p>
</sec>
<sec id="s3-3">
<title>3.3 MOEAs and their application to scheduling problems</title>
<p>The extensive use of MOEAs has attracted significant attention in the context of multi-objective shop scheduling problems. This chapter will predominantly concentrate on recent advancements within this domain, providing an in-depth exposition of the pertinent progress achieved in recent years. Wang et al. (<xref ref-type="bibr" rid="B159">Wang et al., 2021</xref>) utilized a multi-objective mathematical model and a modified MOEA/D algorithm to address the energy-efficient scheduling problem in a distributed heterogeneous welding flow-shop scheduling problem, with the aim of minimizing both total energy consumption (TEC) and completion time simultaneously. In the revised MOEA/D algorithm, various genetic operators and problem-specific local search strategies were designed for multi-level optimization. However, the implementation and computational complexity of the aforementioned methods are high, which may require a long running time to achieve good results. In response to this, Zhang et al. (<xref ref-type="bibr" rid="B182">Zhang et al., 2022</xref>) proposed an automatic MOEA to solve the HFSP with <italic>C</italic>
<sub>max</sub> and total number of sublots as objectives. This study solely focuses on the two objectives of <italic>C</italic>
<sub>max</sub> and the total number of sub-batches, limiting its ability to tackle intricate production scheduling challenges. To address this issue, Han et al. (<xref ref-type="bibr" rid="B53">Han W. et al., 2021</xref>) proposed a heuristic decoding MOEA to solve the HFSP with worker constraint. The proposed method can effectively address complex production scheduling problems. Moreover, experimental results show that the proposed algorithm performs well in achieving the <italic>C</italic>
<sub>max</sub> objective. Deng and Wang (<xref ref-type="bibr" rid="B31">Deng and Wang, 2017</xref>) proposed a competitive memetic algorithm (CMA) to solve the multi-objective DPFSP with the criteria of <italic>C</italic>
<sub>max</sub> and total tardiness (TTD). The generality of the above-mentioned methods is relatively poor, as they cannot fully consider various uncertainties in the production process.</p>
<p>To tackle this challenge of generality, Wang et al. (<xref ref-type="bibr" rid="B160">Wang G.-G. et al., 2022</xref>) proposed a hybrid adaptive differential evolution algorithm to solve the multi-objective fuzzy JSP. Li et al. (<xref ref-type="bibr" rid="B98">Li Z. et al., 2019</xref>) proposed an elitist non-dominated sorting hybrid algorithm (ENSHA) to solve the multi-objective FJSP with sequence-dependent setup times/costs, which minimizes two objectives: maximum completion time and total setup cost. Gong et al. (<xref ref-type="bibr" rid="B50">Gong et al., 2020</xref>) proposed a hybrid artificial bee colony algorithm to solve the FJSP with worker flexibility. However, all the above algorithms are incapable of handling large-scale problems.</p>
<p>Within the domain of shop scheduling problems, the expansion of the problem&#x2019;s scale leads to an escalated requirement for computational resources and time (<xref ref-type="bibr" rid="B86">Li and Pan, 2015</xref>), while intensifying issues of resource competition and bottlenecks due to a larger number of tasks contending for limited resources (<xref ref-type="bibr" rid="B187">Zhang and Wu, 2010</xref>), thereby causing imbalances in resource utilization and production delays (<xref ref-type="bibr" rid="B49">Goli et al., 2019</xref>). To overcome the problem, <xref ref-type="bibr" rid="B146">Tan et al. (2021)</xref> proposed a fatigue-aware dual-resource-constrained flexible job-shop problem method, aimed at simultaneously alleviating fatigue and improving production efficiency through joint scheduling of machines and workers. A multi-objective optimization model was developed with the aim of reducing both the maximum worker fatigue and completion time. Furthermore, a suggested solution to address the issue included the development of an improved iteration of NSGA-II, known as Enhanced NSGA-II (ENSGA). The ENSGA algorithm has four distinct scheduling rules that have been specifically developed to provide solutions of superior quality. Additionally, two distinct area structures have been established, using an innovative methodology for designing critical routes. This technique serves to significantly enhance the efficacy of local search operations. Although this method performs well on large-scale problems, further experiments and data may be required to verify its universality on different domains and datasets.</p>
<p>Regarding the strong coupling dilemma in shop scheduling (<xref ref-type="bibr" rid="B41">Galiana et al., 2005</xref>), <xref ref-type="bibr" rid="B200">Zheng et al. (2020)</xref> proposed a collaborative EA with problem-specific strategies by combining estimation of distribution algorithm (EDA) and iterative greedy search (IG) to tackle the multi-objective fuzzy distributed hybrid flow-shop problem with fuzzy processing time and fuzzy delivery time. The following <xref ref-type="table" rid="T1">Table 1</xref> summarizes the applications of MOEAs in scheduling problems.</p>
<table-wrap id="T1" position="float">
<label>TABLE 1</label>
<caption>
<p>The application of MOEAs in shop scheduling problems.</p>
</caption>
<table>
<thead valign="top">
<tr>
<th align="center"/>
<th align="center">Methodology</th>
<th align="center">Shortcomings</th>
<th align="center">Article</th>
</tr>
</thead>
<tbody valign="top">
<tr>
<td rowspan="2" align="center">Hybrid flow shop</td>
<td align="center">Automatic MOEA</td>
<td rowspan="2" align="center">Poor generalizability</td>
<td align="center">
<xref ref-type="bibr" rid="B182">Zhang et al. (2022)</xref>
</td>
</tr>
<tr>
<td align="center">Heuristic decoding MOEA</td>
<td align="center">
<xref ref-type="bibr" rid="B53">Han et al. (2021a)</xref>
</td>
</tr>
<tr>
<td rowspan="2" align="center">Fuzzy Job-Shop</td>
<td align="center">Hybrid Adaptive Differential EA</td>
<td align="center">High time and space complexity</td>
<td align="center">
<xref ref-type="bibr" rid="B160">Wang et al. (2022a)</xref>
</td>
</tr>
<tr>
<td align="center">ENSHA</td>
<td align="center">Poor Scalability</td>
<td align="center">
<xref ref-type="bibr" rid="B98">Li et al. (2019b)</xref>
</td>
</tr>
<tr>
<td rowspan="2" align="center">Flexible job shop</td>
<td align="center">hybrid artificial bee colony algorithm</td>
<td align="center">High implementation complexity</td>
<td align="center">
<xref ref-type="bibr" rid="B50">Gong et al. (2020)</xref>
</td>
</tr>
<tr>
<td align="center">ENSGA</td>
<td align="center">Poor generalizability</td>
<td align="center">
<xref ref-type="bibr" rid="B146">Tan et al. (2021)</xref>
</td>
</tr>
<tr>
<td align="center">Distributed hybrid flow shop</td>
<td align="center">EDA&#x2b;IG</td>
<td align="center">Stochasticity</td>
<td align="center">
<xref ref-type="bibr" rid="B200">Zheng et al. (2020)</xref>
</td>
</tr>
<tr>
<td align="center">Distributed permutation flow shop</td>
<td align="center">CMA</td>
<td align="center">Poor generalizability</td>
<td align="center">
<xref ref-type="bibr" rid="B31">Deng and Wang (2017)</xref>
</td>
</tr>
<tr>
<td align="center">Distributed heterogeneous welding flow shop</td>
<td align="center">A multi-objective mathematical model and a modified MOEA/D algorithm</td>
<td align="center">The algorithm requires improvement</td>
<td align="center">
<xref ref-type="bibr" rid="B159">Wang et al. (2021)</xref>
</td>
</tr>
</tbody>
</table>
</table-wrap>
</sec>
<sec id="s3-4">
<title>3.4 Applications of ML in solving scheduling problems</title>
<p>When confronted with intricate shop scheduling dilemmas, MOEAs necessitate multiple iterations within the solution space, resulting in a relatively sluggish convergence speed and potential performance limitations (<xref ref-type="bibr" rid="B192">Zhang et al., 2019</xref>). In contrast, ML exhibits enhanced adaptability in dynamic shop scheduling scenarios and can leverage neural networks to augment its learning capabilities.</p>
<p>In the domain of DJSP, traditional scheduling methods often only consider existing jobs and ignore the possibility of new ones appearing at any time. To address this issue, Luo et al. (<xref ref-type="bibr" rid="B110">Luo, 2020</xref>) proposed a new job insertion policy leveraging the deep Q-learning network (DQN) algorithm, which can dynamically insert new jobs and optimize scheduling by real-time perception and decision-making of the current shop state. In addition to this, <xref ref-type="bibr" rid="B111">Luo et al. (2021a)</xref> also proposed an online rescheduling framework named two-layer DQN (THDQN) for the dynamic multi-objective flexible job-shop Problem with the insertion of new jobs. Four distinct objectives were introduced, in accordance with four distinct variations of reward functions, with each objective optimizing a tardiness or machine utilization metric. However, the aforementioned algorithms only consider a limited number of production environment factors, and all of them are value-based methods that cannot directly optimize policies. Therefore, Luo et al. (<xref ref-type="bibr" rid="B112">Luo et al., 2021b</xref>) used a real-time scheduling method for the dynamic part no-wait multi-objective FJSP in modern discrete flexible manufacturing systems, based on hierarchical multi-agent deep reinforcement learning (DRL) called hierarchical multi-agent proximal policy optimization (HMAPPO), which handles situations such as new job insertion and machine failures. The method consists of three intelligent agents based on proximal policy optimization (PPO), namely, the target agent, job agent, and machine agent.</p>
<p>With the intention of elevating generality in practical implementations, <xref ref-type="bibr" rid="B133">Samsonov et al. (2021)</xref> respectively used DQN and soft actor-critic (SAC) algorithms to solve the production planning and control problem in DJSP. <xref ref-type="bibr" rid="B77">Lang et al. (2020)</xref> used a discrete-event simulation model to train two DQN agents, where one agent is responsible for selecting operation sequences and the other is responsible for allocating jobs to machines. They applied this model to solve a FJSP with integrated process planning. The research shows that DQN appears to generalize the training data to other problem instances.</p>
<p>The aforementioned algorithm exhibits certain limitations with regards to training speed and efficiency, which may potentially encumber its training efficacy on large-scale datasets. Furthermore, the algorithm&#x2019;s intricacy and computational requirements might lead to suboptimal performance within resource-constrained environments, thereby imposing constraints on its feasibility for practical shop scheduling. To better mitigate these issues, <xref ref-type="bibr" rid="B101">Liu et al. (2022a)</xref> utilized a double deep Q-network (DDQN) algorithm to train a scheduling agent in a FJSP with constant job arrival times. The algorithm effectively captures the correlation between production information and scheduling objective in order to make timely scheduling choices. <xref ref-type="bibr" rid="B52">Hameed and Schwung (2020)</xref> proposed a method that combines distributed intelligent agent learning and internal agent interaction mechanisms, and uses graph neural networks as feature extraction models to address the scalability and environmental variability issues in JSP. The paper points out that compared to centralized optimization algorithms such as genetic algorithms, graph neural networks have greater advantages in representing complex and variable scheduling environments. Additionally, the authors validated the superiority of the proposed method in two experimental scenarios: a robot manufacturing unit and an injection molding machine. However, there are some potential challenges to the stability of this method. In actual shop production environments, complex work processes, resource constraints, and unforeseeable interference factors may result in this method not performing stably enough in response to specific workshop situations. This deficiency may be particularly evident in the face of sudden changes, urgent tasks, or resource bottlenecks, thereby affecting the accuracy and stability of scheduling results.</p>
<p>To improve these issues, <xref ref-type="bibr" rid="B183">Zhang et al. (2020)</xref> utilized the PPO algorithm to automatically learn the priority dispatching rule (PDR) and combined it with graph neural networks to effectively improve the generalization of the algorithm. <xref ref-type="bibr" rid="B108">Luo P. C. et al. (2022)</xref> used the PPO algorithm to solve the DJSP under resource constraints. <xref ref-type="bibr" rid="B161">Wang H. et al. (2022)</xref> have designed a new dynamic multi-objective scheduling algorithm (DMOSA) based on DRL, which utilizes two DQN and a real-time processing framework to handle changing events and generate comprehensive scheduling strategies. The method was subjected to simulation using six distinct kinds of dynamic events that are often seen in real-world production settings. The optimization procedure focused on three specific objectives: average machine utilization, average job processing delay rate and the longest job processing time. These objectives were pursued while adhering to a predefined set of limitations. With that being said, it is important to note that these algorithms may need substantial experimentation and refinement, including aspects such as reward mechanisms, neural network architecture, and scheduling policies, in order to effectively address a wider array of industrial production requirements. As a result, practical applications may entail a substantial amount of time and effort.</p>
<p>With the objective of improving scheduling efficiency and diminishing operating costs, <xref ref-type="bibr" rid="B83">Leng et al. (2022)</xref> developed a multi-objective DQN algorithm to determine the Pareto frontier. The purpose of reward shaping is to enhance the convergence of the neural network. The algorithm addressed the multi-objective reordering scheduling problem in automotive manufacturing systems with color batch requirements in the painting shop and sequencing requirements in the assembly shop. This approach requires offline training before implementation and may only be suitable for manufacturing factories with specific configurations. Therefore, it is necessary to further improve the practicality and adaptability of the algorithm.</p>
<p>The following is a summary of the application of RL in scheduling problems in <xref ref-type="table" rid="T2">Table 2</xref>.</p>
<table-wrap id="T2" position="float">
<label>TABLE 2</label>
<caption>
<p>The application of RL in shop scheduling problems.</p>
</caption>
<table>
<thead valign="top">
<tr>
<th align="center">Type of shop scheduling</th>
<th align="center">Methodology</th>
<th align="center">Shortcomings</th>
<th align="center">Ref</th>
</tr>
</thead>
<tbody valign="top">
<tr>
<td rowspan="3" align="center">Flexible job-shops</td>
<td align="center">DRL</td>
<td align="center">Poor flexibility</td>
<td align="center">
<xref ref-type="bibr" rid="B110">Luo (2020)</xref>
</td>
</tr>
<tr>
<td align="center">DDQN</td>
<td align="center">Poor generalizability</td>
<td align="center">
<xref ref-type="bibr" rid="B101">Liu et al. (2022a)</xref>
</td>
</tr>
<tr>
<td align="center">Two DQN agents</td>
<td align="center">Insufficient convergence quality and algorithm stability</td>
<td align="center">
<xref ref-type="bibr" rid="B77">Lang et al. (2020)</xref>
</td>
</tr>
<tr>
<td rowspan="3" align="center">Dynamic job-shop</td>
<td align="center">DQN and SAC</td>
<td align="center">Poor training efficiency</td>
<td align="center">
<xref ref-type="bibr" rid="B133">Samsonov et al. (2021)</xref>
</td>
</tr>
<tr>
<td align="center">PPO</td>
<td align="center">Poor Scalability</td>
<td align="center">
<xref ref-type="bibr" rid="B108">Luo et al. (2022a)</xref>
</td>
</tr>
<tr>
<td align="center">HMAPPO</td>
<td align="center">Poor generalization and scalability</td>
<td align="center">
<xref ref-type="bibr" rid="B112">Luo et al. (2021b)</xref>
</td>
</tr>
<tr>
<td rowspan="2" align="center">Job-shop</td>
<td align="center">Distributed intelligent agent</td>
<td align="center">Poor stability</td>
<td align="center">
<xref ref-type="bibr" rid="B52">Hameed and Schwung (2020)</xref>
</td>
</tr>
<tr>
<td align="center">PPO&#x2b;PDR</td>
<td align="center">Poor interpretability</td>
<td align="center">
<xref ref-type="bibr" rid="B183">Zhang et al. (2020)</xref>
</td>
</tr>
<tr>
<td rowspan="2" align="center">Dynamic flexible job-shop</td>
<td align="center">DMOSA based on DRL</td>
<td align="center">Poor generalizability and practicality</td>
<td align="center">
<xref ref-type="bibr" rid="B161">Wang et al. (2022b)</xref>
</td>
</tr>
<tr>
<td align="center">THDQN</td>
<td align="center">Poor flexibility</td>
<td align="center">
<xref ref-type="bibr" rid="B111">Luo et al. (2021a)</xref>
</td>
</tr>
<tr>
<td align="center">Assembly shop</td>
<td align="center">MODQA</td>
<td align="center">Poor practicality and generalizability</td>
<td align="center">
<xref ref-type="bibr" rid="B83">Leng et al. (2022)</xref>
</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>In summary, it can be inferred that ML, especially RL, has the following advantages and disadvantages in scheduling applications:</p>
<p>Advantages:<list list-type="simple">
<list-item>
<p>1. Efficiency: ML utilizes the insights of historical data to enhance the scheduling process, enabling the system to predict and optimize based on identified patterns and trends.</p>
</list-item>
<list-item>
<p>2. Adaptability: The ML model demonstrates the ability to dynamically adjust to constantly changing conditions.</p>
</list-item>
<list-item>
<p>3. Scalability: ML can be used to solve various complexity and scale scheduling problems from simple task scheduling to large-scale production scheduling.</p>
</list-item>
<list-item>
<p>4. Generalizability: Once an ML model is trained for a set of scheduling problems, it can be applied to similar scheduling problems in different fields.</p>
</list-item>
</list>
</p>
<p>Disadvantages:<list list-type="simple">
<list-item>
<p>1. Data requirements: Many scheduling problems have limited data, but ML models require a substantial amount of data for training and optimization.</p>
</list-item>
<list-item>
<p>2. Interpretability: Certain ML models, such as neural networks, might provide challenges in terms of comprehending their decision-making mechanisms.</p>
</list-item>
<list-item>
<p>3. Overfitting: Models trained in ML may excessively tailor themselves to the training data, resulting in poor performance when applied to new data or under conditions of change.</p>
</list-item>
</list>
</p>
<p>The strengths and weaknesses of RL in workshop scheduling problems are illustrated in <xref ref-type="fig" rid="F7">Figure 7</xref>.</p>
<fig id="F7" position="float">
<label>FIGURE 7</label>
<caption>
<p>Advantages and disadvantages of RL.</p>
</caption>
<graphic xlink:href="fieng-02-1337174-g007.tif"/>
</fig>
<p>Despite the advantages that ML holds in addressing scheduling issues, it is crucial to contemplate its limitations and potential drawbacks before practical implementation, ensuring the full realization of its immense potential.</p>
</sec>
</sec>
<sec id="s4">
<title>4 Enhancing MOEAs for solving shop scheduling problems</title>
<p>Enhancing MOEAs (EMOEAs) utilizes ML algorithms to model the objective function and then integrates the resulting model into MOEAs. Through this approach, MOEAs can better search the solution space and find optimal solutions. ML can assist MOEAs in exploring unknown domains and improving search efficiency, thus accelerating the solution process.</p>
<p>Meta-heuristic optimization techniques are commonly utilized to address intricate optimization problems across diverse domains, with MOEAs being a well-researched method due to its efficacy in tackling multi-objective problems. Nevertheless, conventional MOEAs approaches encounter drawbacks such as the need for manual tuning of algorithmic parameters to achieve optimal performance and suboptimal results in handling high-dimensional problems with large scales. To overcome these challenges, ML-assisted techniques have been proposed in recent years, some of which have demonstrated remarkable results in resolving scheduling problems. In this chapter, we will classify and present different methods based on the proportion and weight of RL and MOEAs in each approach, which include ML-assisted MOEAs, MOEAs-assisted ML, and collaborative MOEAs and ML.</p>
<sec id="s4-1">
<title>4.1 ML assists MOEAs</title>
<p>In conventional ML algorithms, <xref ref-type="bibr" rid="B124">Pericleous et al. (2017)</xref> investigated the hybridization of MOEA/D with six general-purpose heuristic methods to locally optimize solutions during the evolutionary process. Initially, six individual hybrid MOEA/D were considered, whereby the same local search heuristic method was applied at each step of evolution. Subsequently, in light of the characteristics of the issue and the objectives, the integration of MOEA/D with Meta-lamarckian learning (MLL) was used to dynamically choose the most effective local search heuristic approach from the general heuristic pool during each evolutionary phase and for every problem neighborhood.</p>
<p>
<xref ref-type="bibr" rid="B168">Wang and Tang (2017)</xref> proposed a machine-learning-based multi-objective memetic algorithm (ML-MOMA) to address the discrete PFSP. Within ML-MOMA, each solution is allocated an individual archive for storing its discovered non-dominated solutions, and a novel population update approach is devised based on these individual archives. Additionally, a novel adaptive multi-objective local search method is proposed, which utilizes the analysis of historical data acquired during the search process to dynamically decide the selection of non-dominated solutions for local search and the execution of local search itself.</p>
<p>In response to the labor shortages and social distancing challenges faced by manufacturing plants affected by COVID-19, <xref ref-type="bibr" rid="B92">Li et al. (2021b)</xref> studied an energy-efficient JSP with limited workers. The study established a multi-objective model with five objectives: maximum completion time, TTD, total idle time (TIT), total worker cost (TWC), and TEC. In order to address this particular many-objective optimization issue, a unique approach was taken by including a fitness assessment mechanism that relies on fuzzy correlation entropy. Additionally, two distinct techniques for constructing reference points were introduced to establish a connection between the many-objective optimization problem and fuzzy sets. An environmental selection mechanism was proposed to achieve a balance between solution convergence and variety, using the fuzzy correlation entropy and clustering approach.</p>
<p>
<xref ref-type="bibr" rid="B107">Lou et al. (2022)</xref> investigates the multi-objective FJSP with human factors to reduce costs and improve efficiency. However, traditional FJSP only consider machine flexibility, while ignoring human factors. Thus, this paper establishes a multi-objective mixed-integer nonlinear programming model and proposes a learning and decomposition-based multi-objective memetic algorithm (MOMA-LD) to simultaneously optimize three objectives: <italic>C</italic>
<sub>max</sub>, machine workload (MW), and total machine workload (TMW). By incorporating a learning-based adaptive local search algorithm into a decomposition-based MOEA. The MOMA-LD framework utilizes ML approaches to determine the suitability of local search solutions. It also dynamically allocates computing resources during the evolutionary process, taking into account the convergence level of the population.</p>
<p>
<xref ref-type="bibr" rid="B66">Karimi-Mamaghan et al. (2023)</xref> have spearheaded the conception of a cutting-edge and highly efficient iterative greedy algorithm, cultivated through their research. The algorithm&#x2019;s eminent contribution resides in its revolutionary perturbation mechanism, ingeniously employing QL to discern and select for appropriate perturbation operations among the search process. However, this approach is only applicable to single-objective problems.</p>
<p>In comparison to conventional ML, RL is better suited for exploration and decision-making problems, demonstrating greater adaptability and generalization capabilities. <xref ref-type="bibr" rid="B196">Zhao et al. (2023b)</xref> proposed a RL-based brain storm optimization (RLBSO) approach to tackle the multi-objective and energy-efficient distributed assembly NFSP. The optimization objectives include minimizing the <italic>C</italic>
<sub>max</sub>, minimizing the total TEC, and achieving a balanced resource allocation. Four operations were designed, including key factory insertion, key factory swap, key factory insertion into other factories, and key factory swap with other factories, to optimize the objective of minimizing the <italic>C</italic>
<sub>max</sub>. The QL mechanism was employed to guide the operation selection and avoid blind search during the iteration process. The product was assigned to factories in the objective space based on the processing time using a clustering-based learning mechanism to balance the resource allocation. To reduce the TEC, the operation speed on the non-critical path was slowed down, considering the characteristics of the NFSP. Moreover, the author (<xref ref-type="bibr" rid="B199">Zhao et al., 2021b</xref>) utilized the cooperative water wave optimization (CWWO) algorithm to address the distributed assembly scheduling problem in an no-idle flow-shop, enhancing the search capabilities of the algorithm by introducing RL, path relinking, VNS methodology, and multi-neighborhood perturbation strategies, ultimately improving the efficiency and stability of the problem-solving process. Nonetheless, this method only optimizes single-objective problems and is only applicable to specific distributed flow-shop scheduling problems, which limits its applicability.</p>
<p>
<xref ref-type="bibr" rid="B18">Cheng et al. (2022)</xref> advanced a hybrid job-shop and flow-shop production scheduling problem using velocity scaling and no idle time strategies. A MILP was formulated to optimize both production efficiency and energy consumption by determining the speed levels of operations and the production sequence for job-shop and flow-shop products. Following that, a novel hyper-heuristic method called multi-objective Q-learning-based hyper-heuristic with Bi-criteria selection (QHH-BS) was devised, which utilizes a multi-objective QL approach to generate a collection of PF solutions of superior quality. This algorithm introduces a novel three-layer encoding scheme for representing the production sequence of job-shop and flow-shop products. Additionally, a sequence implementation is employed, which incorporates both PF and indicator-based selection criteria to promote diversity and convergence. Furthermore, a QL algorithm with a reward mechanism based on multi-objective indicators is utilized to select an optimizer from a pool of three high-performing optimizers in each iteration, thereby facilitating improved exploration and exploitation.</p>
<p>
<xref ref-type="bibr" rid="B165">Wang J.-j. et al. (2023)</xref> utilizing the CMA to tackle the energy-aware distributed welding shop scheduling problem arising from the trends of globalization and sustainable industrial development, with the aim of simultaneously optimizing the minimal manufacturing cycle time and TEC. A proposal is made to improve the quality and diversity of the initial population by utilizing a hybrid initialization approach based on the modified Nawaz-Enscore-Ham (NEH) algorithm (<xref ref-type="bibr" rid="B39">Fernandez-Viagas et al., 2017</xref>). A feedback-based collaborative search is developed by effectively leveraging historical data, incorporating a collaboration selection method that aims to strike a balance between exploration and exploitation. Furthermore, the study proposes a number of problem-specific operators and introduces a local reinforcement method based on QL to augment the system&#x2019;s development capabilities.</p>
<p>
<xref ref-type="bibr" rid="B90">Li et al. (2023)</xref> proposed a MILP model and a learning-based reference vector membrane algorithm (LRVMA) to address the energy-efficient FJSP with type 2 processing times with multiple objectives, aiming to enhance profit and reduce energy consumption for better practical production simulation. The study included the development of four problem-specific beginning rules and the introduction of four problem-specific local search strategies. The Tchebycheff decomposition technique was successfully used to attain an efficient method for solution selection. Additionally, a parameter selection strategy based on RL was introduced to enhance the variety of non-dominated solutions. Furthermore, an energy-saving strategy was designed to reduce energy consumption.</p>
</sec>
<sec id="s4-2">
<title>4.2 MOEAs assists ML</title>
<p>This approach utilizes MOEAs algorithms for model optimization. Specifically, MOEAs improves the performance and prediction accuracy of the model by optimizing its hyperparameters or model selection. This approach can help ML algorithms overcome local optima and over fitting problems, and improve the model&#x2019;s generalization ability.</p>
<p>
<xref ref-type="bibr" rid="B72">Khadka and Tumer (2018)</xref> proposed a hybrid algorithm called evolutionary reinforcement learning (ERL) that combines EA and DRL to address issues related to sparse reward temporal credit assignment, effective exploration, and unstable convergence due to hyperparameter sensitivity in DRL algorithms. ERL leverages the advantages of EA, such as sequential credit assignment based on fitness indicators, diverse policy exploration, and stability improvement using population models, while also utilizing the gradient information of DRL algorithms to improve sample efficiency and learning speed.</p>
<p>Furthermore, The author introduces a method called Collaborative evolutionary reinforcement learning (CERL) (<xref ref-type="bibr" rid="B71">Khadka et al., 2019</xref>), designed to address the exploration problem and hyperparameter sensitivity in DRL. CERL employs multiple learning algorithms to simultaneously explore different regions of the solution space, and dynamically allocates computational resources to support the best learners. Neural evolution combines these algorithms to generate a new learner that outperforms all the constituent learners in the experiment, while also possessing higher sample efficiency. Pourchot and Sigaud (<xref ref-type="bibr" rid="B127">Pourchot and Sigaud, 2018</xref>) introduced a novel method that integrates Deep Neuroevolution with DRL to address the low sample efficiency of Deep Neuroevolution and the sensitivity to hyperparameters of Deep RL. They introduced a new algorithm, which combines the simple cross-entropy method with a new Deep RL algorithm called Twin Delayed Deep Deterministic Policy Gradient. <xref ref-type="bibr" rid="B8">Bodnar et al. (2020)</xref> presents a novel algorithm named PDERL to enhance the scalability of GA in RL. This algorithm integrates evolution and learning hierarchically by employing a learning-based mutation operator to compensate for the simplicity of GA gene encoding. <xref ref-type="bibr" rid="B145">Suri et al. (2020)</xref> provide a review of the strengths and limitations of RL and MOEAs in recent years, and discuss how to combine these two methods to address scalability and hyperparameter sensitivity issues in RL. Moreover, they propose an Evolution-based SAC algorithm based on the ERL framework, which integrates SAC algorithm and evolutionary strategies. <xref ref-type="bibr" rid="B23">Cideron et al. (2020)</xref> propose a novel RL algorithm, which combines the advantages of offline policy RL algorithms with the quality diversity (QD) approach. The authors train a population of offline deep DRL agents to maximize both diversity within the population and the agents&#x2019; rewards. QD-RL selects agents from the diversity-reward PF, enabling stable and efficient population updates. <xref ref-type="bibr" rid="B116">Marchesini et al. (2021)</xref> propose a novel hybrid framework that combines EAs and DRL to leverage the strengths of both approaches. To address the issue of high computational cost in evaluating ERL algorithms, the authors propose the SUPE-RL algorithm, which performs parallel evaluation of the population at fixed intervals during the RL process.</p>
<p>The above content indicates that EA-assisted RL is mainly applied to DRL, where the policy of DRL is used as individuals in the population for RL optimization. Although it belongs to evolutionary computation guided RL, the empirical guidance is relatively weak due to the randomness of the samples, which limits the improvement of environmental exploration capability.</p>
<p>In addition, the utilization of MOEAs assisted ML in shop scheduling is still in its nascent stage. For MOPs, reasonable and effective hybrid methods need to be designed to solve them. Therefore, this field still deserves further exploration and research.</p>
</sec>
<sec id="s4-3">
<title>4.3 The collaboration between MOEAs and ML</title>
<p>This approach combines the advantages of the previous two methods, namely, utilizing both MOEAs and ML for solving problems. In this approach, MOEAs and ML algorithms work together, providing information and feedback to each other, to achieve better solution results. Specifically, MOEAs can provide more data and optimization methods for ML, while ML can provide more accurate objective function modeling and prediction for MOEAs. This approach can help solve more complex problems, improve solution efficiency and accuracy.</p>
<p>
<xref ref-type="bibr" rid="B17">Chen et al. (2020)</xref> have proposed a self-learning genetic algorithm (SLGA) to solve the FJSP, which utilizes GA as the fundamental optimization technique and adapts its key parameters intelligently based on RL. The algorithm employs SARSA and QL algorithms as the initial and subsequent learning methods, respectively, and designs state determination and reward methods to realize RL in the GA environment. However, this method only considers <italic>C</italic>
<sub>max</sub> as the optimization objective.</p>
<p>
<xref ref-type="bibr" rid="B89">Li et al. (2022a)</xref> propose a multi-objective flexible job-shop scheduling problem with fuzzy processing times, aimed at optimizing the objectives of <italic>C</italic>
<sub>max</sub> and total machine load. To tackle MOFFJSP, a RL-based MOEA/D algorithm, called RMOEA/D, is presented. In this algorithm, the authors use an initial policy with three rules to obtain high-quality initial populations, propose a parameter adaptive strategy based on QL to guide population selection of the best parameters to increase diversity, design a RL-based variable neighborhood search to lead solution selection to the correct local search method, and use an elite archive to increase the utilization of discarded historical solutions.</p>
<p>
<xref ref-type="bibr" rid="B196">Zhao et al. (2023b)</xref> investigate an energy-efficient distributed NFSP with sequence-dependent setup times, aiming to minimize <italic>C</italic>
<sub>max</sub> while reducing TEC. They construct a mixed integer linear programming model and propose a cooperative meta-heuristic algorithm based on QL (CMAQ) to solve the problem. In CMAQ, a heuristic method named RNRa is proposed to generate initial solutions, and a dual QL-based two-population cooperation framework is designed to further optimize solutions. Based on the energy-efficient DNWFSP-SDST&#x2019;s characteristics, a knowledge-based energy-saving strategy is proposed to improve <italic>C</italic>
<sub>max</sub> and TEC. Furthermore, the author proposed a QL-based meta-heuristic algorithm (HHQL) (<xref ref-type="bibr" rid="B195">Zhao et al., 2023a</xref>), for solving the energy-efficient distributed blocking FSP (EEDBFSP). This algorithm first uses QL to select appropriate low-level heuristics (LLHs) from a pre-designed LLH set and employs QL for LLH selection based on historical feedback from LLHs. In addition, a concurrent initialization method is proposed to construct the initial population, taking into account both TTD and TEC. The <italic>&#x25b;</italic>-greedy strategy is incorporated into the LLH selection process, allowing the utilization of acquired knowledge while ensuring a specific degree of exploration.</p>
<p>
<xref ref-type="bibr" rid="B164">Wang and Wang (2021)</xref> proposes a CMA with a RL policy agent, along with a MILP, for the energy-aware distributed hybrid flow-shop problem to minimize both the <italic>C</italic>
<sub>max</sub> and energy consumption simultaneously. Initially, an encoding scheme and a rational decoding method are devised to account for the trade-off between the two conflicting objectives. Subsequently, two problem specific heuristic methods are introduced for hybrid initialization, aiming to generate diverse solutions. Furthermore, a solution selection method based on decomposition strategy effectively balances convergence and diversity, and the RL policy agent selects appropriate improvement operators to optimize the solutions. Fourth, the algorithm&#x2019;s developmental capability is further enhanced through the integration of reinforced search employing multiple problem-specific operators. Additionally, two energy-saving strategies are devised to improve non-dominated solutions.</p>
<p>
<xref ref-type="bibr" rid="B32">Du et al. (2023)</xref> introduced a novel approach for solving the FJSP with a time-of-use electricity price constraint. The proposed method, referred to as the estimation of distribution algorithm and deep Q-Network (EDA-DQN), is a hybrid multi-objective optimization algorithm. This problem encompasses various factors such as machine processing speed, setup time, idle time, and transportation time between machines, while simultaneously optimizing both the maximum completion time and total electricity price (TEP). The researchers devised two knowledge-based initialization strategies to enhance performance. The deep Q-network employed 34 state features to illustrate the scheduling situation. Additionally, nine knowledge-based actions were utilized to enhance the scheduling solution, complemented by a reward mechanism aligned with dual objectives. The study effectively showcased the success and performance of the suggested hybrid approach in addressing the integrated FJSP through comprehensive numerical assessments.</p>
<p>
<xref ref-type="table" rid="T3">Table 3</xref> is a brief overview of the applications of EMOEAs in scheduling problems. <xref ref-type="fig" rid="F8">Figure 8</xref> shows the taxonomy on the use of EMOEAs.</p>
<table-wrap id="T3" position="float">
<label>TABLE 3</label>
<caption>
<p>The application of EMOEAs in shop scheduling problems.</p>
</caption>
<table>
<thead valign="top">
<tr>
<th align="center"/>
<th align="center">Types of shop scheduling</th>
<th align="center">Methodology</th>
<th align="center">Optimization objectives</th>
<th align="center">Ref</th>
</tr>
</thead>
<tbody valign="top">
<tr>
<td rowspan="11" align="center">ML assists MOEA</td>
<td rowspan="3" align="center">Permutation flow-shop</td>
<td align="center">MLL-based hybrid MOEA/D</td>
<td align="center">
<italic>C</italic>
<sub>max</sub>&#x2b;TTD</td>
<td align="center">
<xref ref-type="bibr" rid="B124">Pericleous et al. (2017)</xref>
</td>
</tr>
<tr>
<td align="center">IG&#x2b;QL</td>
<td align="center">
<italic>C</italic>
<sub>max</sub>
</td>
<td align="center">
<xref ref-type="bibr" rid="B66">Karimi-Mamaghan et al. (2023)</xref>
</td>
</tr>
<tr>
<td align="center">ML-MOMA</td>
<td align="center">
<italic>C</italic>
<sub>max</sub>&#x2b;total flowtime&#x2b;TTD</td>
<td align="center">
<xref ref-type="bibr" rid="B168">Wang and Tang (2017)</xref>
</td>
</tr>
<tr>
<td rowspan="3" align="center">Flexible job-shop</td>
<td align="center">LRVMA</td>
<td align="center">
<italic>C</italic>
<sub>max</sub>&#x2b;EC</td>
<td align="center">
<xref ref-type="bibr" rid="B90">Li et al. (2023)</xref>
</td>
</tr>
<tr>
<td align="center">SLGA</td>
<td align="center">
<italic>C</italic>
<sub>max</sub>
</td>
<td align="center">
<xref ref-type="bibr" rid="B17">Chen et al. (2020)</xref>
</td>
</tr>
<tr>
<td align="center">MOMA-LD</td>
<td align="center">
<italic>C</italic>
<sub>max</sub>&#x2b;MW&#x2b;TMW</td>
<td align="center">
<xref ref-type="bibr" rid="B107">Lou et al. (2022)</xref>
</td>
</tr>
<tr>
<td align="center">Job-shop</td>
<td align="center">FEM</td>
<td align="center">
<italic>C</italic>
<sub>max</sub>&#x2b;TT&#x2b;TIT&#x2b;TWC&#x2b;TEC</td>
<td align="center">
<xref ref-type="bibr" rid="B92">Li et al. (2021b)</xref>
</td>
</tr>
<tr>
<td align="center">Hybrid workshop</td>
<td align="center">QHH-BS</td>
<td align="center">
<italic>C</italic>
<sub>max</sub>&#x2b;TEC</td>
<td align="center">
<xref ref-type="bibr" rid="B18">Cheng et al. (2022)</xref>
</td>
</tr>
<tr>
<td rowspan="3" align="center">Distributed Shop</td>
<td align="center">CMA &#x2b;adapted NEH&#x2b;QL</td>
<td align="center">
<italic>C</italic>
<sub>max</sub>&#x2b;TEC</td>
<td align="center">
<xref ref-type="bibr" rid="B195">Wang et al. (2023a)</xref>
</td>
</tr>
<tr>
<td align="center">RLBSO</td>
<td align="center">
<italic>C</italic>
<sub>max</sub>&#x2b;TEC</td>
<td align="center">
<xref ref-type="bibr" rid="B196">Zhao et al. (2023b)</xref>
</td>
</tr>
<tr>
<td align="center">CWWO&#x2b;RL</td>
<td align="center">
<italic>C</italic>
<sub>max</sub>
</td>
<td align="center">
<xref ref-type="bibr" rid="B199">Zhao et al. (2021b)</xref>
</td>
</tr>
<tr>
<td rowspan="5" align="center">The collaboration between MOEA and ML</td>
<td rowspan="2" align="center">Flexible job-shop</td>
<td align="center">Knowledge-based EDA-DQN</td>
<td align="center">
<italic>C</italic>
<sub>max</sub>&#x2b;TEP</td>
<td align="center">
<xref ref-type="bibr" rid="B32">Du et al. (2023)</xref>
</td>
</tr>
<tr>
<td align="center">RL-based MOEA/D</td>
<td align="center">
<italic>C</italic>
<sub>max</sub>&#x2b;TMW</td>
<td align="center">
<xref ref-type="bibr" rid="B89">Li et al. (2022a)</xref>
</td>
</tr>
<tr>
<td rowspan="3" align="center">Distributed shop</td>
<td align="center">CMAQ</td>
<td align="center">
<italic>C</italic>
<sub>max</sub>&#x2b;TEC</td>
<td align="center">
<xref ref-type="bibr" rid="B196">Zhao et al. (2023b)</xref>
</td>
</tr>
<tr>
<td align="center">CMA &#x2b; RL</td>
<td align="center">
<italic>C</italic>
<sub>max</sub>&#x2b;TEC</td>
<td align="center">
<xref ref-type="bibr" rid="B164">Wang and Wang (2021)</xref>
</td>
</tr>
<tr>
<td align="center">HHQL</td>
<td align="center">TEC&#x2b;TTD</td>
<td align="center">
<xref ref-type="bibr" rid="B195">Zhao et al. (2023a)</xref>
</td>
</tr>
</tbody>
</table>
</table-wrap>
<fig id="F8" position="float">
<label>FIGURE 8</label>
<caption>
<p>Taxonomy on the use of EMOEAs.</p>
</caption>
<graphic xlink:href="fieng-02-1337174-g008.tif"/>
</fig>
</sec>
<sec id="s4-4">
<title>4.4 The application of EMOEAs in other fields</title>
<p>The application prospects of EMOEAs are extensive. For instance, in the manufacturing industry, it can be utilized to optimize various product parameters to achieve the optimal balance between performance and cost-effectiveness. In the transportation sector, EMOEAs can be employed to plan traffic routes. In healthcare issues, such as predicting patients&#x2019; disease risks and treatment effects, as well as designing better treatment regimens. In the financial domain, it can be used to optimize investment portfolios to achieve better returns and risk control.</p>
<p>
<xref ref-type="bibr" rid="B194">Zhang Z. et al. (2023)</xref> have proposed a cost-oriented hybrid model multi-person assembly line balancing approach to address the uncertain demand environment. They have also designed a MOEA based on RL to solve the problem. The algorithm comprises a priority-based solution representation, as well as a new task-worker-sequence decoding approach that considers robustness and idle time reduction. The authors have put forward five types of crossover and three types of mutation operators, with QL strategy determining the crossover and mutation operators for each iteration to effectively obtain the pareto solution set. Finally, a time-based probabilistic adaptive strategy has been devised to efficiently coordinate the crossover and mutation operators. <xref ref-type="bibr" rid="B104">Liu et al. (2022b)</xref> proposed a problem decomposition framework to address MOPs, which involves decomposing MOPs into multiple objective knapsack problems and traveling salesman problems (TSP). They employed MOEAs and DRL methods to solve MOKP and TSP.</p>
<p>
<xref ref-type="bibr" rid="B59">Huang et al. (2020)</xref> put forward an adaptive terrain roughness multi-objective differential evolution algorithm based on information entropy and RL strategies, aimed at addressing the issues of redundant search and mapping imbalance in multi-objective problems. The algorithm estimates the local terrain&#x2019;s unimodal or multi-modal topological structure through information entropy and combines with RL strategies to determine the optimal probability distribution of the algorithm&#x2019;s search strategy set, thus effectively improving the convergence of the search algorithm during the optimization process. <xref ref-type="bibr" rid="B193">Zhang Y. et al. (2021)</xref> proposed a multi-objective deep reinforcement learning and EA for complex problems, applied to solve the multi-objective vehicle routing problem with time windows. The algorithm employs a decomposition strategy to generate a set of sub-problems for attention models, and introduces comprehensive contextual information to enhance the attention models. <xref ref-type="bibr" rid="B141">Song et al. (2022)</xref> investigated the problem of trajectory control and task offloading in a drone-assisted mobile edge computing system, using an evolutionary multi-objective reinforcement learning (EMORL) algorithm. They improved the original EMORL&#x2019;s multi-task and multi-objective proximal policy optimization by retaining all new learning tasks in the descendant population. <xref ref-type="bibr" rid="B166">Wang M. et al. (2023)</xref> employed a MOEA combines decomposition and harris hawks learning for medical ML, and applied it to medical cancer gene expression datasets as well as clinical data for lupus nephritis and pulmonary arterial hypertension.</p>
<p>In its early stages, the evolution of EMOEAs has already demonstrated significant potential across diverse fields. Through thorough exploration of algorithms and their applications, one can anticipate a forthcoming wave of innovation and development. EMOEAs are poised to become potent instruments for optimizing a range of practical problems, thereby driving progress and fostering innovation in relevant domains.</p>
</sec>
</sec>
<sec sec-type="conclusion" id="s5">
<title>5 Conclusion</title>
<p>Despite being combined with ML, particularly the popular RL in recent years, the capability of MOEAs for optimizing multiple objectives has not been fully demonstrated (<xref ref-type="bibr" rid="B181">Zhan et al., 2023</xref>), indicating significant room for improvement in MOEAs driven by RL. This paper focuses on presenting recent achievements in the field of shop scheduling and presents potential challenges that shop scheduling might face in the future:</p>
<p>First and foremost, research involving the utilization of EMOEAs to address shop scheduling problems remains in its nascent stage. Thus far, majority efforts have been largely confined to theoretical exploration, with limited instances in widespread implementation within actual production systems. Additionally, both MOEAs and ML methods have yet to receive exhaustive investigation in theory. The foundational theoretical research pertaining to EMOEAs presents a formidable challenge (<xref ref-type="bibr" rid="B15">Chai et al., 2013</xref>). Different categories of knowledge acquired during the evolutionary process may prove intricate to mathematically define, posing an imminent issue demanding resolution for practical applications (<xref ref-type="bibr" rid="B102">Liu et al., 2023</xref>).</p>
<p>Secondly, EMOEAs face challenges related to interpretability and robustness. Shop scheduling involves optimizing multiple objectives, such as minimizing production time and maximizing resource utilization. However, real-world shop scheduling data often exhibits complexity, variability, noise, and uncertainty. These factors can lead to ML models being influenced by biased approximations. Therefore, it is a significant undertaking to make significant progress in gaining a more profound comprehension of the ML models that can efficaciously contribute to evolutionary work in scheduling problems. Additionally, being able to provide a clear explanation for the strong performance of a chosen ML model in specific real-world scheduling applications is also a substantial endeavor.</p>
<p>Thirdly, with the emergence of EMOEAs, the issues surrounding fairness and verifiability in comparing their performance have become even more pronounced (<xref ref-type="bibr" rid="B60">Ishibuchi et al., 2022</xref>). When appraising the performance of MOEAs, ensuring absolute equity has grown exceedingly intricate due to the myriad of factors necessitating careful consideration. These factors encompass varying population sizes, a diverse array of testing problems, multiple performance evaluation indicators, and fluctuations in the conditions for algorithm termination, potentially leading to wholly disparate performance comparison outcomes.</p>
<p>Furthermore, the current majority of ML models often exhibit challenges in achieving comprehensive explication of their performance. Given this context, in light of these circumstances, determining how to rigorously verify and analyze the performance of emerging EMOEAs holds paramount significance in a scientifically rigorous manner (<xref ref-type="bibr" rid="B123">Osaba et al., 2021</xref>).</p>
<p>Finally, in distributed shop scheduling, there are multiple objectives that need to be optimized, such as minimizing production costs, maximizing production efficiency, and minimizing production cycles. These objectives may have mutual constraints and conflicts, and achieving a balance and trade-off among them is a challenging problem. The application of RL to the problem of multi-objective optimization in distributed shop scheduling holds significant potential for many applications and research endeavors. It has the capability to offer enhanced decision support for industrial production by enabling more intelligent and efficient processes.</p>
<p>Moreover, current research often only focuses on the optimization of machine resources, neglecting the impact of worker resource allocation on production efficiency. In fact, shop scheduling problems not only involve the allocation of machine resources but also require consideration of worker allocation and scheduling because machines need to be operated by workers. Therefore, future research needs to further consider the issue of dual resource constraints for machines and workers.</p>
<p>To advance the development of EMOEAs for addressing application problems in scheduling, the following potential directions and future research opportunities are presented below.<list list-type="simple">
<list-item>
<p>&#x2022; The optimization of EMOEAs is a crucial research direction. This involves integrating high-performing ML models that excel in both performance and computational economy with MOEAs. Rather than just emulating prevalent ML models, the focus is on the integration of these models. This integration aims to enhance efficiency and effectiveness. Mitigating computational costs is a key consideration. This includes not only the computational expenditure of evaluating ML models but also the fine-tuning process of the learning models themselves. Consequently, finding the optimal equilibrium between learning and optimization becomes a subject worthy of profound investigation in future research.</p>
</list-item>
<list-item>
<p>&#x2022; Applying MOEAs to assist ML in the context of shop scheduling is also a burgeoning research direction. Within ML, the quality of data and the selection of features are pivotal to model performance. MOEAs prove instrumental in discerning optimal feature subsets, thereby curtailing data dimensions and augmenting both training efficiency and model efficacy (<xref ref-type="bibr" rid="B202">Zhou et al., 2021</xref>). In the ML domain, hyperparameters wield substantial influence over model performance. Employing MOEAs facilitates the automated quest for fitting hyperparameter combinations that strike a balance among diverse performance indicators (<xref ref-type="bibr" rid="B100">Liu and Jin, 2019</xref>). Concerning model selection, MOEAs serve to guide the curation of the most suitable ML model for specific tasks. By optimizing multiple indicators, models that excel across various performance facets can be ascertained (<xref ref-type="bibr" rid="B175">Yang et al., 2018</xref>). In real-world datasets, the ubiquity of noise necessitates models fortified by MOEAs, enabling commendable performance amidst noisy data realms. For voluminous datasets, MOEAs aid in selecting the most representative sub-samples, thus mitigating training time while upholding model performance. Moreover, they engender equilibrium across multiple performance benchmarks and contribute to enhancing model interpretability to a significant degree.</p>
</list-item>
<list-item>
<p>&#x2022; Technological advancements have the potential to greatly enhance the effectiveness of Evolutionary EMOEAs when used to the resolution of scheduling problems (<xref ref-type="bibr" rid="B147">Tan and Ding, 2015</xref>). Technological advancements have the potential to greatly enhance the effectiveness of EMOEAs when used to the resolution of scheduling problems (<xref ref-type="bibr" rid="B87">Li et al., 2020a</xref>). To achieve better outcomes in complex and dynamic real-world scheduling environments, the development of tailored hardware and software solutions can be considered. Lastly, automated design also stands as a crucial direction driving the advancement of EMOEAs (<xref ref-type="bibr" rid="B177">Yi et al., 2023</xref>). Through automated design, it is possible to further elevate the performance of EMOEAs, reduce manual intervention, and expedite the optimization process.</p>
</list-item>
</list>
</p>
<p>The objective of this work is to examine and analyze efficient methodologies for resolving real-world scheduling challenges, with a specific focus on the utilization of EMOEAs. In comparison to traditional MOEAs, EMOEAs have exhibited significant potential and competitiveness. The paper commences with a straightforward shop scheduling problem and subsequently extends its scope to encompass various diverse scheduling issues. Then, by contrasting conventional MOEAs with recent EMOEAs, the application of EMOEAs is expounded upon from three perspectives: ML assists MOEAs, MOEAs assists ML, and the collaboration between MOEAs and ML. Finally, an exploration of potential challenges that EMOEAs might encounter in future applications is undertaken, followed by the presentation of several prospective research directions. These directions aim to propel the further advancement of EMOEAs in the realm of shop scheduling problems.</p>
</sec>
</body>
<back>
<sec id="s6">
<title>Author contributions</title>
<p>WZ: Conceptualization, Funding acquisition, Methodology, Project administration, Supervision, Writing&#x2013;review and editing. GX: Conceptualization, Data curation, Investigation, Methodology, Writing&#x2013;original draft, Writing&#x2013;review and editing. MG: Conceptualization, Formal Analysis, Funding acquisition, Investigation, Writing&#x2013;review and editing. HG: Methodology, Writing&#x2013;review and editing. XW: Methodology, Writing&#x2013;review and editing. MD: Funding acquisition, Validation, Writing&#x2013;review and editing. GZ: Conceptualization, Funding acquisition, Validation, Writing&#x2013;review and editing.</p>
</sec>
<sec sec-type="funding-information" id="s7">
<title>Funding</title>
<p>The author(s) declare financial support was received for the research, authorship, and/or publication of this article. National Natural Science Foundation of China (62276091, U1904167), Science &#x26; Technology Research Project of Henan Province (232102211049, 222102210140), Key Research and Development Special Program of Henan Province (231111221200), Zhengzhou Science and Technology Collaborative Innovation Project (21ZZXTCX19), Innovative Research Team (in Science and Technology) in University of Henan Province (21IRTSTHN018), and Scientific Research (C) of Japan Society of Promotion of Science (JSPS) (19K12148).</p>
</sec>
<sec sec-type="COI-statement" id="s8">
<title>Conflict of interest</title>
<p>The authors declare that the research was conducted in the absence of any commercial or financial relationships that could be construed as a potential conflict of interest.</p>
</sec>
<sec sec-type="disclaimer" id="s9">
<title>Publisher&#x2019;s note</title>
<p>All claims expressed in this article are solely those of the authors and do not necessarily represent those of their affiliated organizations, or those of the publisher, the editors and the reviewers. Any product that may be evaluated in this article, or claim that may be made by its manufacturer, is not guaranteed or endorsed by the publisher.</p>
</sec>
<ref-list>
<title>References</title>
<ref id="B1">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Abdi</surname>
<given-names>H.</given-names>
</name>
<name>
<surname>Williams</surname>
<given-names>L. J.</given-names>
</name>
</person-group> (<year>2010</year>). <article-title>Principal component analysis</article-title>. <source>WIREs Comput. Stat.</source> <volume>2</volume>, <fpage>433</fpage>&#x2013;<lpage>459</lpage>. <pub-id pub-id-type="doi">10.1002/wics.101</pub-id>
</citation>
</ref>
<ref id="B2">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Abualigah</surname>
<given-names>L.</given-names>
</name>
<name>
<surname>Diabat</surname>
<given-names>A.</given-names>
</name>
</person-group> (<year>2021</year>). <article-title>A novel hybrid antlion optimization algorithm for multi-objective task scheduling problems in cloud computing environments</article-title>. <source>Clust. Comput.</source> <volume>24</volume>, <fpage>205</fpage>&#x2013;<lpage>223</lpage>. <pub-id pub-id-type="doi">10.1007/s10586-020-03075-5</pub-id>
</citation>
</ref>
<ref id="B3">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Ahmadian</surname>
<given-names>M. M.</given-names>
</name>
<name>
<surname>Khatami</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Salehipour</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>Cheng</surname>
<given-names>T.</given-names>
</name>
</person-group> (<year>2021</year>). <article-title>Four decades of research on the open-shop scheduling problem to minimize the makespan</article-title>. <source>Eur. J. Operational Res.</source> <volume>295</volume>, <fpage>399</fpage>&#x2013;<lpage>426</lpage>. <pub-id pub-id-type="doi">10.1016/j.ejor.2021.03.026</pub-id>
</citation>
</ref>
<ref id="B4">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Arulkumaran</surname>
<given-names>K.</given-names>
</name>
<name>
<surname>Deisenroth</surname>
<given-names>M. P.</given-names>
</name>
<name>
<surname>Brundage</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Bharath</surname>
<given-names>A. A.</given-names>
</name>
</person-group> (<year>2017</year>). <article-title>Deep reinforcement learning: a brief survey</article-title>. <source>IEEE Signal Process. Mag.</source> <volume>34</volume>, <fpage>26</fpage>&#x2013;<lpage>38</lpage>. <pub-id pub-id-type="doi">10.1109/msp.2017.2743240</pub-id>
</citation>
</ref>
<ref id="B5">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Berli&#x144;ska</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Przybylski</surname>
<given-names>B.</given-names>
</name>
</person-group> (<year>2021</year>). <article-title>Scheduling for gathering multitype data with local computations</article-title>. <source>Eur. J. Operational Res.</source> <volume>294</volume>, <fpage>453</fpage>&#x2013;<lpage>459</lpage>. <pub-id pub-id-type="doi">10.1016/j.ejor.2021.01.043</pub-id>
</citation>
</ref>
<ref id="B6">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Beume</surname>
<given-names>N.</given-names>
</name>
<name>
<surname>Naujoks</surname>
<given-names>B.</given-names>
</name>
<name>
<surname>Emmerich</surname>
<given-names>M.</given-names>
</name>
</person-group> (<year>2007</year>). <article-title>Sms-emoa: multiobjective selection based on dominated hypervolume</article-title>. <source>Eur. J. Operational Res.</source> <volume>181</volume>, <fpage>1653</fpage>&#x2013;<lpage>1669</lpage>. <pub-id pub-id-type="doi">10.1016/j.ejor.2006.08.008</pub-id>
</citation>
</ref>
<ref id="B7">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Beyer</surname>
<given-names>H.-G.</given-names>
</name>
<name>
<surname>Schwefel</surname>
<given-names>H.-P.</given-names>
</name>
</person-group> (<year>2002</year>). <article-title>Evolution strategies&#x2013;a comprehensive introduction</article-title>. <source>Nat. Comput.</source> <volume>1</volume>, <fpage>3</fpage>&#x2013;<lpage>52</lpage>. <pub-id pub-id-type="doi">10.1023/a:1015059928466</pub-id>
</citation>
</ref>
<ref id="B8">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Bodnar</surname>
<given-names>C.</given-names>
</name>
<name>
<surname>Day</surname>
<given-names>B.</given-names>
</name>
<name>
<surname>Li&#xf3;</surname>
<given-names>P.</given-names>
</name>
</person-group> (<year>2020</year>). <article-title>Proximal distilled evolutionary reinforcement learning</article-title>. <source>Proc. AAAI Conf. Artif. Intell.</source> <volume>34</volume>, <fpage>3283</fpage>&#x2013;<lpage>3290</lpage>. <pub-id pub-id-type="doi">10.1609/aaai.v34i04.5728</pub-id>
</citation>
</ref>
<ref id="B9">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Booker</surname>
<given-names>L. B.</given-names>
</name>
<name>
<surname>Goldberg</surname>
<given-names>D. E.</given-names>
</name>
<name>
<surname>Holland</surname>
<given-names>J. H.</given-names>
</name>
</person-group> (<year>1989</year>). <article-title>Classifier systems and genetic algorithms</article-title>. <source>Artif. Intell.</source> <volume>40</volume>, <fpage>235</fpage>&#x2013;<lpage>282</lpage>. <pub-id pub-id-type="doi">10.1016/0004-3702(89)90050-7</pub-id>
</citation>
</ref>
<ref id="B10">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Botta-Genoulaz</surname>
<given-names>V.</given-names>
</name>
</person-group> (<year>2000</year>). <article-title>Hybrid flow shop scheduling with precedence constraints and time lags to minimize maximum lateness</article-title>. <source>Int. J. Prod. Econ.</source> <volume>64</volume>, <fpage>101</fpage>&#x2013;<lpage>111</lpage>. <pub-id pub-id-type="doi">10.1016/s0925-5273(99)00048-1</pub-id>
</citation>
</ref>
<ref id="B11">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Brik</surname>
<given-names>B.</given-names>
</name>
<name>
<surname>Bettayeb</surname>
<given-names>B.</given-names>
</name>
<name>
<surname>Sahnoun</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Duval</surname>
<given-names>F.</given-names>
</name>
</person-group> (<year>2019</year>). <article-title>Towards predicting system disruption in industry 4.0: machine learning-based approach</article-title>. <source>Procedia Comput. Sci.</source> <volume>151</volume>, <fpage>667</fpage>&#x2013;<lpage>674</lpage>. <pub-id pub-id-type="doi">10.1016/j.procs.2019.04.089</pub-id>
</citation>
</ref>
<ref id="B12">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Brucker</surname>
<given-names>P.</given-names>
</name>
<name>
<surname>Schlie</surname>
<given-names>R.</given-names>
</name>
</person-group> (<year>1990</year>). <article-title>Job-shop scheduling with multipurpose machines</article-title>. <source>Computing</source> <volume>45</volume>, <fpage>369</fpage>&#x2013;<lpage>375</lpage>. <pub-id pub-id-type="doi">10.1007/bf02238804</pub-id>
</citation>
</ref>
<ref id="B13">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Cai</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Zhou</surname>
<given-names>R.</given-names>
</name>
<name>
<surname>Lei</surname>
<given-names>D.</given-names>
</name>
</person-group> (<year>2020</year>). <article-title>Dynamic shuffled frog-leaping algorithm for distributed hybrid flow shop scheduling with multiprocessor tasks</article-title>. <source>Eng. Appl. Artif. Intell.</source> <volume>90</volume>, <fpage>103540</fpage>. <pub-id pub-id-type="doi">10.1016/j.engappai.2020.103540</pub-id>
</citation>
</ref>
<ref id="B14">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Cai</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Yang</surname>
<given-names>K.</given-names>
</name>
<name>
<surname>Liu</surname>
<given-names>K.</given-names>
</name>
</person-group> (<year>2018</year>). <article-title>Multi-objective optimization of the distributed permutation flow shop scheduling problem with transportation and eligibility constraints</article-title>. <source>J. Operations Res. Soc. China</source> <volume>6</volume>, <fpage>391</fpage>&#x2013;<lpage>416</lpage>. <pub-id pub-id-type="doi">10.1007/s40305-017-0165-3</pub-id>
</citation>
</ref>
<ref id="B15">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Chai</surname>
<given-names>T.</given-names>
</name>
<name>
<surname>Jin</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Sendhoff</surname>
<given-names>B.</given-names>
</name>
</person-group> (<year>2013</year>). <article-title>Evolutionary complex engineering optimization: opportunities and challenges [guest editorial]</article-title>. <source>IEEE Comput. Intell. Mag.</source> <volume>8</volume>, <fpage>12</fpage>&#x2013;<lpage>15</lpage>. <pub-id pub-id-type="doi">10.1109/mci.2013.2264563</pub-id>
</citation>
</ref>
<ref id="B16">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Chamnanlor</surname>
<given-names>C.</given-names>
</name>
<name>
<surname>Sethanan</surname>
<given-names>K.</given-names>
</name>
<name>
<surname>Gen</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Chien</surname>
<given-names>C.-F.</given-names>
</name>
</person-group> (<year>2017</year>). <article-title>Embedding ant system in genetic algorithm for re-entrant hybrid flow shop scheduling problems with time window constraints</article-title>. <source>J. Intelligent Manuf.</source> <volume>28</volume>, <fpage>1915</fpage>&#x2013;<lpage>1931</lpage>. <pub-id pub-id-type="doi">10.1007/s10845-015-1078-9</pub-id>
</citation>
</ref>
<ref id="B17">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Chen</surname>
<given-names>R.</given-names>
</name>
<name>
<surname>Yang</surname>
<given-names>B.</given-names>
</name>
<name>
<surname>Li</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Wang</surname>
<given-names>S.</given-names>
</name>
</person-group> (<year>2020</year>). <article-title>A self-learning genetic algorithm based on reinforcement learning for flexible job-shop scheduling problem</article-title>. <source>Comput. Industrial Eng.</source> <volume>149</volume>, <fpage>106778</fpage>. <pub-id pub-id-type="doi">10.1016/j.cie.2020.106778</pub-id>
</citation>
</ref>
<ref id="B18">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Cheng</surname>
<given-names>L.</given-names>
</name>
<name>
<surname>Tang</surname>
<given-names>Q.</given-names>
</name>
<name>
<surname>Zhang</surname>
<given-names>L.</given-names>
</name>
<name>
<surname>Zhang</surname>
<given-names>Z.</given-names>
</name>
</person-group> (<year>2022</year>). <article-title>Multi-objective q-learning-based hyper-heuristic with bi-criteria selection for energy-aware mixed shop scheduling</article-title>. <source>Swarm Evol. Comput.</source> <volume>69</volume>, <fpage>100985</fpage>. <pub-id pub-id-type="doi">10.1016/j.swevo.2021.100985</pub-id>
</citation>
</ref>
<ref id="B19">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Cheng</surname>
<given-names>R.</given-names>
</name>
<name>
<surname>Gen</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Tsujimura</surname>
<given-names>Y.</given-names>
</name>
</person-group> (<year>1996</year>). <article-title>A tutorial survey of job-shop scheduling problems using genetic algorithms&#x2014;I. representation</article-title>. <source>Comput. Industrial Eng.</source> <volume>30</volume>, <fpage>983</fpage>&#x2013;<lpage>997</lpage>. <pub-id pub-id-type="doi">10.1016/0360-8352(96)00047-2</pub-id>
</citation>
</ref>
<ref id="B20">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Cheng</surname>
<given-names>R.</given-names>
</name>
<name>
<surname>Gen</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Tsujimura</surname>
<given-names>Y.</given-names>
</name>
</person-group> (<year>1999</year>). <article-title>A tutorial survey of job-shop scheduling problems using genetic algorithms, part II: hybrid genetic search strategies</article-title>. <source>Comput. Industrial Eng.</source> <volume>36</volume>, <fpage>343</fpage>&#x2013;<lpage>364</lpage>. <pub-id pub-id-type="doi">10.1016/s0360-8352(99)00136-9</pub-id>
</citation>
</ref>
<ref id="B21">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Cheung</surname>
<given-names>Y.-M.</given-names>
</name>
<name>
<surname>Gu</surname>
<given-names>F.</given-names>
</name>
<name>
<surname>Liu</surname>
<given-names>H.-L.</given-names>
</name>
</person-group> (<year>2016</year>). <article-title>Objective extraction for many-objective optimization problems: algorithm and test problems</article-title>. <source>IEEE Trans. Evol. Comput.</source> <volume>20</volume>, <fpage>755</fpage>&#x2013;<lpage>772</lpage>. <pub-id pub-id-type="doi">10.1109/tevc.2016.2519758</pub-id>
</citation>
</ref>
<ref id="B22">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Chou</surname>
<given-names>C.-W.</given-names>
</name>
<name>
<surname>Chien</surname>
<given-names>C.-F.</given-names>
</name>
<name>
<surname>Gen</surname>
<given-names>M.</given-names>
</name>
</person-group> (<year>2014</year>). <article-title>A multiobjective hybrid genetic algorithm for tft-lcd module assembly scheduling</article-title>. <source>IEEE Trans. Automation Sci. Eng.</source> <volume>11</volume>, <fpage>692</fpage>&#x2013;<lpage>705</lpage>. <pub-id pub-id-type="doi">10.1109/tase.2014.2316193</pub-id>
</citation>
</ref>
<ref id="B23">
<citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname>Cideron</surname>
<given-names>G.</given-names>
</name>
<name>
<surname>Pierrot</surname>
<given-names>T.</given-names>
</name>
<name>
<surname>Perrin</surname>
<given-names>N.</given-names>
</name>
<name>
<surname>Beguir</surname>
<given-names>K.</given-names>
</name>
<name>
<surname>Sigaud</surname>
<given-names>O.</given-names>
</name>
</person-group> (<year>2020</year>). <source>Qd-rl: efficient mixing of quality and diversity in reinforcement learning</source>, <fpage>28</fpage>&#x2013;<lpage>73</lpage>. <comment>
<italic>arXiv preprint arXiv:2006.08505</italic>
</comment>.</citation>
</ref>
<ref id="B24">
<citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname>Cleveland</surname>
<given-names>W. S.</given-names>
</name>
<name>
<surname>Grosse</surname>
<given-names>E.</given-names>
</name>
<name>
<surname>Shyu</surname>
<given-names>W. M.</given-names>
</name>
</person-group> (<year>2017</year>). &#x201c;<article-title>Local regression models</article-title>,&#x201d; in <source>Statistical models in S</source> (<publisher-loc>London, New York</publisher-loc>: <publisher-name>Routledge</publisher-name>), <fpage>309</fpage>&#x2013;<lpage>376</lpage>.</citation>
</ref>
<ref id="B25">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Reyes-Sierra</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Coello Coello</surname>
<given-names>C. A.</given-names>
</name>
</person-group> (<year>2006</year>). <article-title>Multi-objective particle swarm optimizers: a survey of the state-of-the-art</article-title>. <source>Int. J. Comput. Intell. Res.</source> <volume>2</volume>, <fpage>287</fpage>&#x2013;<lpage>308</lpage>. <pub-id pub-id-type="doi">10.5019/j.ijcir.2006.68</pub-id>
</citation>
</ref>
<ref id="B26">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Dai</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Tang</surname>
<given-names>D.</given-names>
</name>
<name>
<surname>Giret</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>Salido</surname>
<given-names>M. A.</given-names>
</name>
</person-group> (<year>2019</year>). <article-title>Multi-objective optimization for energy-efficient flexible job shop scheduling problem with transportation constraints</article-title>. <source>Robotics Computer-Integrated Manuf.</source> <volume>59</volume>, <fpage>143</fpage>&#x2013;<lpage>157</lpage>. <pub-id pub-id-type="doi">10.1016/j.rcim.2019.04.006</pub-id>
</citation>
</ref>
<ref id="B27">
<citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname>Deb</surname>
<given-names>K.</given-names>
</name>
</person-group> (<year>2011</year>). &#x201c;<article-title>Multi-objective optimisation using evolutionary algorithms: an introduction</article-title>,&#x201d; in <source>Multi-objective evolutionary optimisation for product design and manufacturing</source> (<publisher-name>Springer</publisher-name>), <fpage>3</fpage>&#x2013;<lpage>34</lpage>.</citation>
</ref>
<ref id="B28">
<citation citation-type="confproc">
<person-group person-group-type="author">
<name>
<surname>Deb</surname>
<given-names>K.</given-names>
</name>
<name>
<surname>Gupta</surname>
<given-names>H.</given-names>
</name>
</person-group> (<year>2005</year>). &#x201c;<article-title>Searching for robust pareto-optimal solutions in multi-objective optimization</article-title>,&#x201d; in <conf-name>International Conference on Evolutionary Multi-Criterion Optimization</conf-name>, <conf-loc>Guanajuato, Mexico</conf-loc>, <conf-date>9-11 March, 2005</conf-date> (<publisher-name>Springer</publisher-name>), <fpage>150</fpage>&#x2013;<lpage>164</lpage>.</citation>
</ref>
<ref id="B29">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Deb</surname>
<given-names>K.</given-names>
</name>
<name>
<surname>Pratap</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>Agarwal</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Meyarivan</surname>
<given-names>T.</given-names>
</name>
</person-group> (<year>2002</year>). <article-title>A fast and elitist multiobjective genetic algorithm: nsga-ii</article-title>. <source>IEEE Trans. Evol. Comput.</source> <volume>6</volume>, <fpage>182</fpage>&#x2013;<lpage>197</lpage>. <pub-id pub-id-type="doi">10.1109/4235.996017</pub-id>
</citation>
</ref>
<ref id="B30">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>De Giovanni</surname>
<given-names>L.</given-names>
</name>
<name>
<surname>Pezzella</surname>
<given-names>F.</given-names>
</name>
</person-group> (<year>2010</year>). <article-title>An improved genetic algorithm for the distributed and flexible job-shop scheduling problem</article-title>. <source>Eur. J. Operational Res.</source> <volume>200</volume>, <fpage>395</fpage>&#x2013;<lpage>408</lpage>. <pub-id pub-id-type="doi">10.1016/j.ejor.2009.01.008</pub-id>
</citation>
</ref>
<ref id="B31">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Deng</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Wang</surname>
<given-names>L.</given-names>
</name>
</person-group> (<year>2017</year>). <article-title>A competitive memetic algorithm for multi-objective distributed permutation flow shop scheduling problem</article-title>. <source>Swarm Evol. Comput.</source> <volume>32</volume>, <fpage>121</fpage>&#x2013;<lpage>131</lpage>. <pub-id pub-id-type="doi">10.1016/j.swevo.2016.06.002</pub-id>
</citation>
</ref>
<ref id="B32">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Du</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Li</surname>
<given-names>J.-q.</given-names>
</name>
<name>
<surname>Chen</surname>
<given-names>X.-l.</given-names>
</name>
<name>
<surname>Duan</surname>
<given-names>P.-y.</given-names>
</name>
<name>
<surname>Pan</surname>
<given-names>Q.-k.</given-names>
</name>
</person-group> (<year>2023</year>). <article-title>Knowledge-based reinforcement learning and estimation of distribution algorithm for flexible job shop scheduling problem</article-title>. <source>IEEE Trans. Emerg. Top. Comput. Intell.</source> <volume>7</volume>, <fpage>1036</fpage>&#x2013;<lpage>1050</lpage>. <pub-id pub-id-type="doi">10.1109/tetci.2022.3145706</pub-id>
</citation>
</ref>
<ref id="B33">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Dugardin</surname>
<given-names>F.</given-names>
</name>
<name>
<surname>Yalaoui</surname>
<given-names>F.</given-names>
</name>
<name>
<surname>Amodeo</surname>
<given-names>L.</given-names>
</name>
</person-group> (<year>2010</year>). <article-title>New multi-objective method to solve reentrant hybrid flow shop scheduling problem</article-title>. <source>Eur. J. Operational Res.</source> <volume>203</volume>, <fpage>22</fpage>&#x2013;<lpage>31</lpage>. <pub-id pub-id-type="doi">10.1016/j.ejor.2009.06.031</pub-id>
</citation>
</ref>
<ref id="B34">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Emami</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Sabbagh</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Moslehi</surname>
<given-names>G.</given-names>
</name>
</person-group> (<year>2016</year>). <article-title>A Lagrangian relaxation algorithm for order acceptance and scheduling problem: a globalised robust optimisation approach</article-title>. <source>Int. J. Comput. Integr. Manuf.</source> <volume>29</volume>, <fpage>535</fpage>&#x2013;<lpage>560</lpage>. <pub-id pub-id-type="doi">10.1080/0951192x.2015.1068452</pub-id>
</citation>
</ref>
<ref id="B35">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Engin</surname>
<given-names>O.</given-names>
</name>
<name>
<surname>G&#xfc;&#xe7;l&#xfc;</surname>
<given-names>A.</given-names>
</name>
</person-group> (<year>2018</year>). <article-title>A new hybrid ant colony optimization algorithm for solving the no-wait flow shop scheduling problems</article-title>. <source>Appl. Soft Comput.</source> <volume>72</volume>, <fpage>166</fpage>&#x2013;<lpage>176</lpage>. <pub-id pub-id-type="doi">10.1016/j.asoc.2018.08.002</pub-id>
</citation>
</ref>
<ref id="B36">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Espejo</surname>
<given-names>P. G.</given-names>
</name>
<name>
<surname>Ventura</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Herrera</surname>
<given-names>F.</given-names>
</name>
</person-group> (<year>2010</year>). <article-title>A survey on the application of genetic programming to classification</article-title>. <source>IEEE Trans. Syst. Man, Cybern. Part C Appl. Rev.</source> <volume>40</volume>, <fpage>121</fpage>&#x2013;<lpage>144</lpage>. <pub-id pub-id-type="doi">10.1109/tsmcc.2009.2033566</pub-id>
</citation>
</ref>
<ref id="B37">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Fattahi</surname>
<given-names>P.</given-names>
</name>
<name>
<surname>Saidi Mehrabad</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Jolai</surname>
<given-names>F.</given-names>
</name>
</person-group> (<year>2007</year>). <article-title>Mathematical modeling and heuristic approaches to flexible job shop scheduling problems</article-title>. <source>J. Intelligent Manuf.</source> <volume>18</volume>, <fpage>331</fpage>&#x2013;<lpage>342</lpage>. <pub-id pub-id-type="doi">10.1007/s10845-007-0026-8</pub-id>
</citation>
</ref>
<ref id="B38">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Fernandez-Viagas</surname>
<given-names>V.</given-names>
</name>
<name>
<surname>Perez-Gonzalez</surname>
<given-names>P.</given-names>
</name>
<name>
<surname>Framinan</surname>
<given-names>J. M.</given-names>
</name>
</person-group> (<year>2019</year>). <article-title>Efficiency of the solution representations for the hybrid flow shop scheduling problem with makespan objective</article-title>. <source>Comput. Operations Res.</source> <volume>109</volume>, <fpage>77</fpage>&#x2013;<lpage>88</lpage>. <pub-id pub-id-type="doi">10.1016/j.cor.2019.05.002</pub-id>
</citation>
</ref>
<ref id="B39">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Fernandez-Viagas</surname>
<given-names>V.</given-names>
</name>
<name>
<surname>Ruiz</surname>
<given-names>R.</given-names>
</name>
<name>
<surname>Framinan</surname>
<given-names>J. M.</given-names>
</name>
</person-group> (<year>2017</year>). <article-title>A new vision of approximate methods for the permutation flowshop to minimise makespan: state-of-the-art and computational evaluation</article-title>. <source>Eur. J. Operational Res.</source> <volume>257</volume>, <fpage>707</fpage>&#x2013;<lpage>721</lpage>. <pub-id pub-id-type="doi">10.1016/j.ejor.2016.09.055</pub-id>
</citation>
</ref>
<ref id="B40">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Floudas</surname>
<given-names>C. A.</given-names>
</name>
<name>
<surname>Lin</surname>
<given-names>X.</given-names>
</name>
</person-group> (<year>2005</year>). <article-title>Mixed integer linear programming in process scheduling: modeling, algorithms, and applications</article-title>. <source>Ann. Operations Res.</source> <volume>139</volume>, <fpage>131</fpage>&#x2013;<lpage>162</lpage>. <pub-id pub-id-type="doi">10.1007/s10479-005-3446-x</pub-id>
</citation>
</ref>
<ref id="B41">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Galiana</surname>
<given-names>F. D.</given-names>
</name>
<name>
<surname>Bouffard</surname>
<given-names>F.</given-names>
</name>
<name>
<surname>Arroyo</surname>
<given-names>J. M.</given-names>
</name>
<name>
<surname>Restrepo</surname>
<given-names>J. F.</given-names>
</name>
</person-group> (<year>2005</year>). <article-title>Scheduling and pricing of coupled energy and primary, secondary, and tertiary reserves</article-title>. <source>Proc. IEEE</source> <volume>93</volume>, <fpage>1970</fpage>&#x2013;<lpage>1983</lpage>. <pub-id pub-id-type="doi">10.1109/jproc.2005.857492</pub-id>
</citation>
</ref>
<ref id="B42">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Gao</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Gen</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Sun</surname>
<given-names>L.</given-names>
</name>
<name>
<surname>Zhao</surname>
<given-names>X.</given-names>
</name>
</person-group> (<year>2007</year>). <article-title>A hybrid of genetic algorithm and bottleneck shifting for multiobjective flexible job shop scheduling problems</article-title>. <source>Comput. Industrial Eng.</source> <volume>53</volume>, <fpage>149</fpage>&#x2013;<lpage>162</lpage>. <pub-id pub-id-type="doi">10.1016/j.cie.2007.04.010</pub-id>
</citation>
</ref>
<ref id="B43">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Gao</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Sun</surname>
<given-names>L.</given-names>
</name>
<name>
<surname>Gen</surname>
<given-names>M.</given-names>
</name>
</person-group> (<year>2008</year>). <article-title>A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems</article-title>. <source>Comput. Operations Res.</source> <volume>35</volume>, <fpage>2892</fpage>&#x2013;<lpage>2907</lpage>. <pub-id pub-id-type="doi">10.1016/j.cor.2007.01.001</pub-id>
</citation>
</ref>
<ref id="B44">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Gao</surname>
<given-names>K.</given-names>
</name>
<name>
<surname>Huang</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Sadollah</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>Wang</surname>
<given-names>L.</given-names>
</name>
</person-group> (<year>2020</year>). <article-title>A review of energy-efficient scheduling in intelligent production systems</article-title>. <source>Complex and Intelligent Syst.</source> <volume>6</volume>, <fpage>237</fpage>&#x2013;<lpage>249</lpage>. <pub-id pub-id-type="doi">10.1007/s40747-019-00122-6</pub-id>
</citation>
</ref>
<ref id="B45">
<citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname>Gen</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Cheng</surname>
<given-names>R.</given-names>
</name>
</person-group> (<year>2000</year>). <source>Genetic algorithms and engineering optimization, vol. 7</source>. <publisher-name>John Wiley and Sons</publisher-name>.</citation>
</ref>
<ref id="B46">
<citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname>Gen</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Cheng</surname>
<given-names>R.</given-names>
</name>
<name>
<surname>Lin</surname>
<given-names>L.</given-names>
</name>
</person-group> (<year>2008</year>). <source>Network models and optimization: multiobjective genetic algorithm approach</source>. <publisher-name>Springer Science and Business Media</publisher-name>.</citation>
</ref>
<ref id="B47">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Gen</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Gao</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Lin</surname>
<given-names>L.</given-names>
</name>
</person-group> (<year>2009</year>). <article-title>Multistage-based genetic algorithm for flexible job-shop scheduling problem</article-title>. <source>Intelligent Evol. Syst. IES</source> <volume>187</volume>, <fpage>183</fpage>&#x2013;<lpage>196</lpage>.</citation>
</ref>
<ref id="B48">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Goli</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>Ala</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>Hajiaghaei-Keshteli</surname>
<given-names>M.</given-names>
</name>
</person-group> (<year>2023</year>). <article-title>Efficient multi-objective meta-heuristic algorithms for energy-aware non-permutation flow-shop scheduling problem</article-title>. <source>Expert Syst. Appl.</source> <volume>213</volume>, <fpage>119077</fpage>. <pub-id pub-id-type="doi">10.1016/j.eswa.2022.119077</pub-id>
</citation>
</ref>
<ref id="B49">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Goli</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>Babaee Tirkolaee</surname>
<given-names>E.</given-names>
</name>
<name>
<surname>Soltani</surname>
<given-names>M.</given-names>
</name>
</person-group> (<year>2019</year>). <article-title>A robust just-in-time flow shop scheduling problem with outsourcing option on subcontractors</article-title>. <source>Prod. Manuf. Res.</source> <volume>7</volume>, <fpage>294</fpage>&#x2013;<lpage>315</lpage>. <pub-id pub-id-type="doi">10.1080/21693277.2019.1620651</pub-id>
</citation>
</ref>
<ref id="B50">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Gong</surname>
<given-names>G.</given-names>
</name>
<name>
<surname>Chiong</surname>
<given-names>R.</given-names>
</name>
<name>
<surname>Deng</surname>
<given-names>Q.</given-names>
</name>
<name>
<surname>Gong</surname>
<given-names>X.</given-names>
</name>
</person-group> (<year>2020</year>). <article-title>A hybrid artificial bee colony algorithm for flexible job shop scheduling with worker flexibility</article-title>. <source>Int. J. Prod. Res.</source> <volume>58</volume>, <fpage>4406</fpage>&#x2013;<lpage>4420</lpage>. <pub-id pub-id-type="doi">10.1080/00207543.2019.1653504</pub-id>
</citation>
</ref>
<ref id="B51">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Gu</surname>
<given-names>Z.-M.</given-names>
</name>
<name>
<surname>Wang</surname>
<given-names>G.-G.</given-names>
</name>
</person-group> (<year>2020</year>). <article-title>Improving NSGA-III algorithms with information feedback models for large-scale many-objective optimization</article-title>. <source>Future Gener. Comput. Syst.</source> <volume>107</volume>, <fpage>49</fpage>&#x2013;<lpage>69</lpage>. <pub-id pub-id-type="doi">10.1016/j.future.2020.01.048</pub-id>
</citation>
</ref>
<ref id="B52">
<citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname>Hameed</surname>
<given-names>M. S. A.</given-names>
</name>
<name>
<surname>Schwung</surname>
<given-names>A.</given-names>
</name>
</person-group> (<year>2020</year>). <source>Reinforcement learning on job shop scheduling problems using graph networks</source>. <comment>
<italic>arXiv preprint arXiv:2009.03836</italic>
</comment>.</citation>
</ref>
<ref id="B53">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Han</surname>
<given-names>W.</given-names>
</name>
<name>
<surname>Deng</surname>
<given-names>Q.</given-names>
</name>
<name>
<surname>Gong</surname>
<given-names>G.</given-names>
</name>
<name>
<surname>Zhang</surname>
<given-names>L.</given-names>
</name>
<name>
<surname>Luo</surname>
<given-names>Q.</given-names>
</name>
</person-group> (<year>2021a</year>). <article-title>Multi-objective evolutionary algorithms with heuristic decoding for hybrid flow shop scheduling problem with worker constraint</article-title>. <source>Expert Syst. Appl.</source> <volume>168</volume>, <fpage>114282</fpage>. <pub-id pub-id-type="doi">10.1016/j.eswa.2020.114282</pub-id>
</citation>
</ref>
<ref id="B54">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Han</surname>
<given-names>X.</given-names>
</name>
<name>
<surname>Han</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Chen</surname>
<given-names>Q.</given-names>
</name>
<name>
<surname>Li</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Sang</surname>
<given-names>H.</given-names>
</name>
<name>
<surname>Liu</surname>
<given-names>Y.</given-names>
</name>
<etal/>
</person-group> (<year>2021b</year>). <article-title>Distributed flow shop scheduling with sequence-dependent setup times using an improved iterated greedy algorithm</article-title>. <source>Complex Syst. Model. Simul.</source> <volume>1</volume>, <fpage>198</fpage>&#x2013;<lpage>217</lpage>. <pub-id pub-id-type="doi">10.23919/csms.2021.0018</pub-id>
</citation>
</ref>
<ref id="B55">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Hao</surname>
<given-names>J.-H.</given-names>
</name>
<name>
<surname>Li</surname>
<given-names>J.-Q.</given-names>
</name>
<name>
<surname>Du</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Song</surname>
<given-names>M.-X.</given-names>
</name>
<name>
<surname>Duan</surname>
<given-names>P.</given-names>
</name>
<name>
<surname>Zhang</surname>
<given-names>Y.-Y.</given-names>
</name>
</person-group> (<year>2019</year>). <article-title>Solving distributed hybrid flowshop scheduling problems by a hybrid brain storm optimization algorithm</article-title>. <source>IEEE Access</source> <volume>7</volume>, <fpage>66879</fpage>&#x2013;<lpage>66894</lpage>. <pub-id pub-id-type="doi">10.1109/access.2019.2917273</pub-id>
</citation>
</ref>
<ref id="B56">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Hao</surname>
<given-names>X.</given-names>
</name>
<name>
<surname>Gen</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Lin</surname>
<given-names>L.</given-names>
</name>
<name>
<surname>Suer</surname>
<given-names>G. A.</given-names>
</name>
</person-group> (<year>2017</year>). <article-title>Effective multiobjective EDA for bi-criteria stochastic job-shop scheduling problem</article-title>. <source>J. Intelligent Manuf.</source> <volume>28</volume>, <fpage>833</fpage>&#x2013;<lpage>845</lpage>. <pub-id pub-id-type="doi">10.1007/s10845-014-1026-0</pub-id>
</citation>
</ref>
<ref id="B57">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Heckerman</surname>
<given-names>D.</given-names>
</name>
</person-group> (<year>2008</year>). <article-title>A tutorial on learning with bayesian networks</article-title>. <source>Innovations Bayesian Netw. Theory Appl.</source>, <fpage>33</fpage>&#x2013;<lpage>82</lpage>.</citation>
</ref>
<ref id="B58">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Hoogeveen</surname>
<given-names>J. A.</given-names>
</name>
<name>
<surname>Lenstra</surname>
<given-names>J. K.</given-names>
</name>
<name>
<surname>Veltman</surname>
<given-names>B.</given-names>
</name>
</person-group> (<year>1996</year>). <article-title>Preemptive scheduling in a two-stage multiprocessor flow shop is np-hard</article-title>. <source>Eur. J. Operational Res.</source> <volume>89</volume>, <fpage>172</fpage>&#x2013;<lpage>175</lpage>. <pub-id pub-id-type="doi">10.1016/0377-2217(94)00235-5</pub-id>
</citation>
</ref>
<ref id="B59">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Huang</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Li</surname>
<given-names>W.</given-names>
</name>
<name>
<surname>Tian</surname>
<given-names>F.</given-names>
</name>
<name>
<surname>Meng</surname>
<given-names>X.</given-names>
</name>
</person-group> (<year>2020</year>). <article-title>A fitness landscape ruggedness multiobjective differential evolution algorithm with a reinforcement learning strategy</article-title>. <source>Appl. Soft Comput.</source> <volume>96</volume>, <fpage>106693</fpage>. <pub-id pub-id-type="doi">10.1016/j.asoc.2020.106693</pub-id>
</citation>
</ref>
<ref id="B60">
<citation citation-type="confproc">
<person-group person-group-type="author">
<name>
<surname>Ishibuchi</surname>
<given-names>H.</given-names>
</name>
<name>
<surname>Pang</surname>
<given-names>L. M.</given-names>
</name>
<name>
<surname>Shang</surname>
<given-names>K.</given-names>
</name>
</person-group> (<year>2022</year>). &#x201c;<article-title>Difficulties in fair performance comparison of multiobjective evolutionary algorithms</article-title>,&#x201d; in <conf-name>Proceedings of the Genetic and Evolutionary Computation Conference Companion</conf-name>, <conf-loc>Boston, Massachusetts</conf-loc>, <conf-date>July 9-13, 2022</conf-date>, <fpage>937</fpage>&#x2013;<lpage>957</lpage>.</citation>
</ref>
<ref id="B61">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Ismayilov</surname>
<given-names>G.</given-names>
</name>
<name>
<surname>Topcuoglu</surname>
<given-names>H. R.</given-names>
</name>
</person-group> (<year>2020</year>). <article-title>Neural network based multi-objective evolutionary algorithm for dynamic workflow scheduling in cloud computing</article-title>. <source>Future Gener. Comput. Syst.</source> <volume>102</volume>, <fpage>307</fpage>&#x2013;<lpage>322</lpage>. <pub-id pub-id-type="doi">10.1016/j.future.2019.08.012</pub-id>
</citation>
</ref>
<ref id="B62">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Jamrus</surname>
<given-names>T.</given-names>
</name>
<name>
<surname>Chien</surname>
<given-names>C.-F.</given-names>
</name>
<name>
<surname>Gen</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Sethanan</surname>
<given-names>K.</given-names>
</name>
</person-group> (<year>2015</year>). <article-title>Multistage production distribution under uncertain demands with integrated discrete particle swarm optimization and extended priority-based hybrid genetic algorithm</article-title>. <source>Fuzzy Optim. Decis. Mak.</source> <volume>14</volume>, <fpage>265</fpage>&#x2013;<lpage>287</lpage>. <pub-id pub-id-type="doi">10.1007/s10700-014-9200-6</pub-id>
</citation>
</ref>
<ref id="B63">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Jiang</surname>
<given-names>E. d.</given-names>
</name>
<name>
<surname>Wang</surname>
<given-names>L.</given-names>
</name>
<name>
<surname>Peng</surname>
<given-names>Z.</given-names>
</name>
</person-group> (<year>2020</year>). <article-title>Solving energy-efficient distributed job shop scheduling via multi-objective evolutionary algorithm with decomposition</article-title>. <source>Swarm Evol. Comput.</source> <volume>58</volume>, <fpage>100745</fpage>. <pub-id pub-id-type="doi">10.1016/j.swevo.2020.100745</pub-id>
</citation>
</ref>
<ref id="B64">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Jiang</surname>
<given-names>T.</given-names>
</name>
<name>
<surname>Zhang</surname>
<given-names>C.</given-names>
</name>
<name>
<surname>Sun</surname>
<given-names>Q.-M.</given-names>
</name>
</person-group> (<year>2019</year>). <article-title>Green job shop scheduling problem with discrete whale optimization algorithm</article-title>. <source>IEEE Access</source> <volume>7</volume>, <fpage>43153</fpage>&#x2013;<lpage>43166</lpage>. <pub-id pub-id-type="doi">10.1109/access.2019.2908200</pub-id>
</citation>
</ref>
<ref id="B65">
<citation citation-type="confproc">
<person-group person-group-type="author">
<name>
<surname>Jourdan</surname>
<given-names>L.</given-names>
</name>
<name>
<surname>Dhaenens</surname>
<given-names>C.</given-names>
</name>
<name>
<surname>Talbi</surname>
<given-names>E.-G.</given-names>
</name>
</person-group> (<year>2006</year>). &#x201c;<article-title>Using datamining techniques to help metaheuristics: a short survey</article-title>,&#x201d; in <conf-name>Hybrid Metaheuristics: Third International Workshop, HM 2006</conf-name>, <conf-loc>Gran Canaria, Spain</conf-loc>, <conf-date>October 13-14, 2006</conf-date> (<publisher-name>Springer</publisher-name>), <fpage>57</fpage>&#x2013;<lpage>69</lpage>.</citation>
</ref>
<ref id="B66">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Karimi-Mamaghan</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Mohammadi</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Pasdeloup</surname>
<given-names>B.</given-names>
</name>
<name>
<surname>Meyer</surname>
<given-names>P.</given-names>
</name>
</person-group> (<year>2023</year>). <article-title>Learning to select operators in meta-heuristics: an integration of q-learning into the iterated greedy algorithm for the permutation flowshop scheduling problem</article-title>. <source>Eur. J. Operational Res.</source> <volume>304</volume>, <fpage>1296</fpage>&#x2013;<lpage>1330</lpage>. <pub-id pub-id-type="doi">10.1016/j.ejor.2022.03.054</pub-id>
</citation>
</ref>
<ref id="B67">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Katoch</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Chauhan</surname>
<given-names>S. S.</given-names>
</name>
<name>
<surname>Kumar</surname>
<given-names>V.</given-names>
</name>
</person-group> (<year>2021</year>). <article-title>A review on genetic algorithm: past, present, and future</article-title>. <source>Multimedia Tools Appl.</source> <volume>80</volume>, <fpage>8091</fpage>&#x2013;<lpage>8126</lpage>. <pub-id pub-id-type="doi">10.1007/s11042-020-10139-6</pub-id>
</citation>
</ref>
<ref id="B68">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Kelley Jr</surname>
<given-names>J. E.</given-names>
</name>
</person-group> (<year>1960</year>). <article-title>The cutting-plane method for solving convex programs</article-title>. <source>J. Soc. Industrial Appl. Math.</source> <volume>8</volume>, <fpage>703</fpage>&#x2013;<lpage>712</lpage>. <pub-id pub-id-type="doi">10.1137/0108053</pub-id>
</citation>
</ref>
<ref id="B69">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Kenn&#xe9;</surname>
<given-names>J. P.</given-names>
</name>
<name>
<surname>Gharbi</surname>
<given-names>A.</given-names>
</name>
</person-group> (<year>2000</year>). <article-title>Production planning problem in manufacturing systems with general failure and repair time distributions</article-title>. <source>Prod. Plan. Control</source> <volume>11</volume>, <fpage>581</fpage>&#x2013;<lpage>588</lpage>. <pub-id pub-id-type="doi">10.1080/095372800414142</pub-id>
</citation>
</ref>
<ref id="B70">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Kennedy</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Eberhart</surname>
<given-names>R.</given-names>
</name>
</person-group> (<year>1995</year>). <article-title>Particle swarm optimization. In <italic>Proceedings of ICNN&#x2019;95-international Conference on neural networks</italic>
</article-title>. <source>(IEEE)</source> <volume>4</volume>, <fpage>1942</fpage>&#x2013;<lpage>1948</lpage>. <pub-id pub-id-type="doi">10.1109/ICNN.1995.488968</pub-id>
</citation>
</ref>
<ref id="B71">
<citation citation-type="confproc">
<person-group person-group-type="author">
<name>
<surname>Khadka</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Majumdar</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Nassar</surname>
<given-names>T.</given-names>
</name>
<name>
<surname>Dwiel</surname>
<given-names>Z.</given-names>
</name>
<name>
<surname>Tumer</surname>
<given-names>E.</given-names>
</name>
<name>
<surname>Miret</surname>
<given-names>S.</given-names>
</name>
<etal/>
</person-group> (<year>2019</year>). &#x201c;<article-title>Collaborative evolutionary reinforcement learning</article-title>,&#x201d; in <conf-name>International Conference on Machine Learning (PMLR)</conf-name>, <conf-loc>Long Beach, CA, USA</conf-loc>, <conf-date>June 10-15, 2019</conf-date>, <fpage>3341</fpage>&#x2013;<lpage>3350</lpage>.</citation>
</ref>
<ref id="B72">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Khadka</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Tumer</surname>
<given-names>K.</given-names>
</name>
</person-group> (<year>2018</year>). <article-title>Evolution-guided policy gradient in reinforcement learning</article-title>. <source>Adv. Neural Inf. Process. Syst.</source> <volume>31</volume>.</citation>
</ref>
<ref id="B73">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Kolodner</surname>
<given-names>J. L.</given-names>
</name>
</person-group> (<year>1992</year>). <article-title>An introduction to case-based reasoning</article-title>. <source>Artif. Intell. Rev.</source> <volume>6</volume>, <fpage>3</fpage>&#x2013;<lpage>34</lpage>. <pub-id pub-id-type="doi">10.1007/bf00155578</pub-id>
</citation>
</ref>
<ref id="B74">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Kotsiantis</surname>
<given-names>S. B.</given-names>
</name>
<name>
<surname>Zaharakis</surname>
<given-names>I.</given-names>
</name>
<name>
<surname>Pintelas</surname>
<given-names>P.</given-names>
</name>
</person-group> (<year>2007</year>). <article-title>Supervised machine learning: a review of classification techniques</article-title>. <source>Emerg. Artif. Intell. Appl. Comput. Eng.</source> <volume>160</volume>, <fpage>3</fpage>&#x2013;<lpage>24</lpage>.</citation>
</ref>
<ref id="B75">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Koulamas</surname>
<given-names>C.</given-names>
</name>
<name>
<surname>Kyparisis</surname>
<given-names>G. J.</given-names>
</name>
</person-group> (<year>2021</year>). <article-title>The no-wait flow shop with rejection</article-title>. <source>Int. J. Prod. Res.</source> <volume>59</volume>, <fpage>1852</fpage>&#x2013;<lpage>1859</lpage>. <pub-id pub-id-type="doi">10.1080/00207543.2020.1727042</pub-id>
</citation>
</ref>
<ref id="B76">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Kundakc&#x131;</surname>
<given-names>N.</given-names>
</name>
<name>
<surname>Kulak</surname>
<given-names>O.</given-names>
</name>
</person-group> (<year>2016</year>). <article-title>Hybrid genetic algorithms for minimizing makespan in dynamic job shop scheduling problem</article-title>. <source>Comput. Industrial Eng.</source> <volume>96</volume>, <fpage>31</fpage>&#x2013;<lpage>51</lpage>. <pub-id pub-id-type="doi">10.1016/j.cie.2016.03.011</pub-id>
</citation>
</ref>
<ref id="B77">
<citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname>Lang</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Behrendt</surname>
<given-names>F.</given-names>
</name>
<name>
<surname>Lanzerath</surname>
<given-names>N.</given-names>
</name>
<name>
<surname>Reggelin</surname>
<given-names>T.</given-names>
</name>
<name>
<surname>M&#xfc;ller</surname>
<given-names>M.</given-names>
</name>
</person-group> (<year>2020</year>). &#x201c;<article-title>Integration of deep reinforcement learning and discrete-event simulation for real-time scheduling of a flexible job shop production</article-title>,&#x201d; in <source>2020 winter simulation conference (WSC)</source> (<publisher-name>IEEE</publisher-name>), <fpage>3057</fpage>&#x2013;<lpage>3068</lpage>.</citation>
</ref>
<ref id="B78">
<citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname>Langdon</surname>
<given-names>W. B.</given-names>
</name>
<name>
<surname>Poli</surname>
<given-names>R.</given-names>
</name>
</person-group> (<year>2013</year>). <source>Foundations of genetic programming</source>. <publisher-name>Springer Science and Business Media</publisher-name>.</citation>
</ref>
<ref id="B79">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Lei</surname>
<given-names>D.</given-names>
</name>
</person-group> (<year>2009</year>). <article-title>Multi-objective production scheduling: a survey</article-title>. <source>Int. J. Adv. Manuf. Technol.</source> <volume>43</volume>, <fpage>926</fpage>&#x2013;<lpage>938</lpage>. <pub-id pub-id-type="doi">10.1007/s00170-008-1770-4</pub-id>
</citation>
</ref>
<ref id="B80">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Lei</surname>
<given-names>D.</given-names>
</name>
<name>
<surname>Liu</surname>
<given-names>M.</given-names>
</name>
</person-group> (<year>2020</year>). <article-title>An artificial bee colony with division for distributed unrelated parallel machine scheduling with preventive maintenance</article-title>. <source>Comput. Industrial Eng.</source> <volume>141</volume>, <fpage>106320</fpage>. <pub-id pub-id-type="doi">10.1016/j.cie.2020.106320</pub-id>
</citation>
</ref>
<ref id="B81">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Lei</surname>
<given-names>D.</given-names>
</name>
<name>
<surname>Su</surname>
<given-names>B.</given-names>
</name>
</person-group> (<year>2023</year>). <article-title>A multi-class teaching-learning-based optimization for multi-objective distributed hybrid flow shop scheduling</article-title>. <source>Knowledge-Based Syst.</source> <volume>263</volume>, <fpage>110252</fpage>. <pub-id pub-id-type="doi">10.1016/j.knosys.2023.110252</pub-id>
</citation>
</ref>
<ref id="B82">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Lei</surname>
<given-names>D.</given-names>
</name>
<name>
<surname>Wang</surname>
<given-names>T.</given-names>
</name>
</person-group> (<year>2020</year>). <article-title>Solving distributed two-stage hybrid flowshop scheduling using a shuffled frog-leaping algorithm with memeplex grouping</article-title>. <source>Eng. Optim.</source> <volume>52</volume>, <fpage>1461</fpage>&#x2013;<lpage>1474</lpage>. <pub-id pub-id-type="doi">10.1080/0305215x.2019.1674295</pub-id>
</citation>
</ref>
<ref id="B83">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Leng</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Wang</surname>
<given-names>X.</given-names>
</name>
<name>
<surname>Wu</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Jin</surname>
<given-names>C.</given-names>
</name>
<name>
<surname>Tang</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Liu</surname>
<given-names>R.</given-names>
</name>
<etal/>
</person-group> (<year>2022</year>). <article-title>A multi-objective reinforcement learning approach for resequencing scheduling problems in automotive manufacturing systems</article-title>. <source>Int. J. Prod. Res.</source> <volume>61</volume>, <fpage>5156</fpage>&#x2013;<lpage>5175</lpage>. <pub-id pub-id-type="doi">10.1080/00207543.2022.2098871</pub-id>
</citation>
</ref>
<ref id="B84">
<citation citation-type="confproc">
<person-group person-group-type="author">
<name>
<surname>Li</surname>
<given-names>B.</given-names>
</name>
<name>
<surname>Li</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Tang</surname>
<given-names>K.</given-names>
</name>
<name>
<surname>Yao</surname>
<given-names>X.</given-names>
</name>
</person-group> (<year>2014</year>). &#x201c;<article-title>An improved two archive algorithm for many-objective optimization</article-title>,&#x201d; in <conf-name>2014 IEEE Congress on Evolutionary Computation (CEC)</conf-name>, <conf-loc>Beijing, China</conf-loc>, <conf-date>06-11 July 2014</conf-date> (<publisher-name>IEEE</publisher-name>), <fpage>2869</fpage>&#x2013;<lpage>2876</lpage>.</citation>
</ref>
<ref id="B85">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Li</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Li</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Zhang</surname>
<given-names>L.</given-names>
</name>
<name>
<surname>Sang</surname>
<given-names>H.</given-names>
</name>
<name>
<surname>Han</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Chen</surname>
<given-names>Q.</given-names>
</name>
</person-group> (<year>2021a</year>). <article-title>Solving type-2 fuzzy distributed hybrid flowshop scheduling using an improved brain storm optimization algorithm</article-title>. <source>Int. J. Fuzzy Syst.</source> <volume>23</volume>, <fpage>1194</fpage>&#x2013;<lpage>1212</lpage>. <pub-id pub-id-type="doi">10.1007/s40815-021-01050-9</pub-id>
</citation>
</ref>
<ref id="B86">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Li</surname>
<given-names>J.-Q.</given-names>
</name>
<name>
<surname>Pan</surname>
<given-names>Q.-k.</given-names>
</name>
</person-group> (<year>2015</year>). <article-title>Solving the large-scale hybrid flow shop scheduling problem with limited buffers by a hybrid artificial bee colony algorithm</article-title>. <source>Inf. Sci.</source> <volume>316</volume>, <fpage>487</fpage>&#x2013;<lpage>502</lpage>. <pub-id pub-id-type="doi">10.1016/j.ins.2014.10.009</pub-id>
</citation>
</ref>
<ref id="B87">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Li</surname>
<given-names>J.-Y.</given-names>
</name>
<name>
<surname>Zhan</surname>
<given-names>Z.-H.</given-names>
</name>
<name>
<surname>Liu</surname>
<given-names>R.-D.</given-names>
</name>
<name>
<surname>Wang</surname>
<given-names>C.</given-names>
</name>
<name>
<surname>Kwong</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Zhang</surname>
<given-names>J.</given-names>
</name>
</person-group> (<year>2021</year>). <article-title>Generation-level parallelism for evolutionary computation: a pipeline-based parallel particle swarm optimization</article-title>. <source>IEEE Trans. Cybern.</source> <volume>51</volume>, <fpage>4848</fpage>&#x2013;<lpage>4859</lpage>. <pub-id pub-id-type="doi">10.1109/tcyb.2020.3028070</pub-id>
</citation>
</ref>
<ref id="B88">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Li</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Wang</surname>
<given-names>G.-G.</given-names>
</name>
</person-group> (<year>2022</year>). <article-title>A review of green shop scheduling problem</article-title>. <source>Inf. Sci.</source> <volume>589</volume>, <fpage>478</fpage>&#x2013;<lpage>496</lpage>. <pub-id pub-id-type="doi">10.1016/j.ins.2021.12.122</pub-id>
</citation>
</ref>
<ref id="B89">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Li</surname>
<given-names>R.</given-names>
</name>
<name>
<surname>Gong</surname>
<given-names>W.</given-names>
</name>
<name>
<surname>Lu</surname>
<given-names>C.</given-names>
</name>
</person-group> (<year>2022a</year>). <article-title>A reinforcement learning based RMOEA/D for bi-objective fuzzy flexible job shop scheduling</article-title>. <source>Expert Syst. Appl.</source> <volume>203</volume>, <fpage>117380</fpage>. <pub-id pub-id-type="doi">10.1016/j.eswa.2022.117380</pub-id>
</citation>
</ref>
<ref id="B90">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Li</surname>
<given-names>R.</given-names>
</name>
<name>
<surname>Gong</surname>
<given-names>W.</given-names>
</name>
<name>
<surname>Lu</surname>
<given-names>C.</given-names>
</name>
<name>
<surname>Wang</surname>
<given-names>L.</given-names>
</name>
</person-group> (<year>2023</year>). <article-title>A learning-based memetic algorithm for energy-efficient flexible job shop scheduling with type-2 fuzzy processing time</article-title>. <source>IEEE Trans. Evol. Comput.</source> <volume>27</volume>, <fpage>610</fpage>&#x2013;<lpage>620</lpage>. <pub-id pub-id-type="doi">10.1109/tevc.2022.3175832</pub-id>
</citation>
</ref>
<ref id="B91">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Li</surname>
<given-names>R.</given-names>
</name>
<name>
<surname>Gong</surname>
<given-names>W.</given-names>
</name>
<name>
<surname>Wang</surname>
<given-names>L.</given-names>
</name>
<name>
<surname>Lu</surname>
<given-names>C.</given-names>
</name>
<name>
<surname>Jiang</surname>
<given-names>S.</given-names>
</name>
</person-group> (<year>2022b</year>). <article-title>Two-stage knowledge-driven evolutionary algorithm for distributed green flexible job shop scheduling with type-2 fuzzy processing time</article-title>. <source>Swarm Evol. Comput.</source> <volume>74</volume>, <fpage>101139</fpage>. <pub-id pub-id-type="doi">10.1016/j.swevo.2022.101139</pub-id>
</citation>
</ref>
<ref id="B92">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Li</surname>
<given-names>W.</given-names>
</name>
<name>
<surname>He</surname>
<given-names>L.</given-names>
</name>
<name>
<surname>Cao</surname>
<given-names>Y.</given-names>
</name>
</person-group> (<year>2022</year>). <article-title>Many-objective evolutionary algorithm with reference point-based fuzzy correlation entropy for energy-efficient job shop scheduling with limited workers</article-title>. <source>IEEE Trans. Cybern.</source> <volume>52</volume>, <fpage>10721</fpage>&#x2013;<lpage>10734</lpage>. <pub-id pub-id-type="doi">10.1109/tcyb.2021.3069184</pub-id>
</citation>
</ref>
<ref id="B93">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Li</surname>
<given-names>W.</given-names>
</name>
<name>
<surname>Wang</surname>
<given-names>G.-G.</given-names>
</name>
<name>
<surname>Gandomi</surname>
<given-names>A. H.</given-names>
</name>
</person-group> (<year>2021c</year>). <article-title>A survey of learning-based intelligent optimization algorithms</article-title>. <source>Archives Comput. Methods Eng.</source> <volume>28</volume>, <fpage>3781</fpage>&#x2013;<lpage>3799</lpage>. <pub-id pub-id-type="doi">10.1007/s11831-021-09562-1</pub-id>
</citation>
</ref>
<ref id="B94">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Li</surname>
<given-names>X.</given-names>
</name>
<name>
<surname>Guo</surname>
<given-names>X.</given-names>
</name>
<name>
<surname>Tang</surname>
<given-names>H.</given-names>
</name>
<name>
<surname>Wu</surname>
<given-names>R.</given-names>
</name>
<name>
<surname>Wang</surname>
<given-names>L.</given-names>
</name>
<name>
<surname>Pang</surname>
<given-names>S.</given-names>
</name>
<etal/>
</person-group> (<year>2022c</year>). <article-title>Survey of integrated flexible job shop scheduling problems</article-title>. <source>Comput. Industrial Eng.</source> <volume>174</volume>, <fpage>108786</fpage>. <pub-id pub-id-type="doi">10.1016/j.cie.2022.108786</pub-id>
</citation>
</ref>
<ref id="B95">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Li</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Li</surname>
<given-names>F.</given-names>
</name>
<name>
<surname>Pan</surname>
<given-names>Q.-K.</given-names>
</name>
<name>
<surname>Gao</surname>
<given-names>L.</given-names>
</name>
<name>
<surname>Tasgetiren</surname>
<given-names>M. F.</given-names>
</name>
</person-group> (<year>2019a</year>). <article-title>An artificial bee colony algorithm for the distributed hybrid flowshop scheduling problem</article-title>. <source>Procedia Manuf.</source> <volume>39</volume>, <fpage>1158</fpage>&#x2013;<lpage>1166</lpage>. <pub-id pub-id-type="doi">10.1016/j.promfg.2020.01.354</pub-id>
</citation>
</ref>
<ref id="B96">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Li</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Li</surname>
<given-names>X.</given-names>
</name>
<name>
<surname>Gao</surname>
<given-names>L.</given-names>
</name>
<name>
<surname>Meng</surname>
<given-names>L.</given-names>
</name>
</person-group> (<year>2020b</year>). <article-title>An improved artificial bee colony algorithm for distributed heterogeneous hybrid flowshop scheduling problem with sequence-dependent setup times</article-title>. <source>Comput. Industrial Eng.</source> <volume>147</volume>, <fpage>106638</fpage>. <pub-id pub-id-type="doi">10.1016/j.cie.2020.106638</pub-id>
</citation>
</ref>
<ref id="B97">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Li</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Li</surname>
<given-names>X.</given-names>
</name>
<name>
<surname>Gao</surname>
<given-names>L.</given-names>
</name>
<name>
<surname>Zhang</surname>
<given-names>B.</given-names>
</name>
<name>
<surname>Pan</surname>
<given-names>Q.-K.</given-names>
</name>
<name>
<surname>Tasgetiren</surname>
<given-names>M. F.</given-names>
</name>
<etal/>
</person-group> (<year>2021d</year>). <article-title>A discrete artificial bee colony algorithm for distributed hybrid flowshop scheduling problem with sequence-dependent setup times</article-title>. <source>Int. J. Prod. Res.</source> <volume>59</volume>, <fpage>3880</fpage>&#x2013;<lpage>3899</lpage>. <pub-id pub-id-type="doi">10.1080/00207543.2020.1753897</pub-id>
</citation>
</ref>
<ref id="B98">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Li</surname>
<given-names>Z.</given-names>
</name>
<name>
<surname>Qian</surname>
<given-names>B.</given-names>
</name>
<name>
<surname>Hu</surname>
<given-names>R.</given-names>
</name>
<name>
<surname>Chang</surname>
<given-names>L.</given-names>
</name>
<name>
<surname>Yang</surname>
<given-names>J.</given-names>
</name>
</person-group> (<year>2019b</year>). <article-title>An elitist nondominated sorting hybrid algorithm for multi-objective flexible job-shop scheduling problem with sequence-dependent setups</article-title>. <source>Knowledge-Based Syst.</source> <volume>173</volume>, <fpage>83</fpage>&#x2013;<lpage>112</lpage>. <pub-id pub-id-type="doi">10.1016/j.knosys.2019.02.027</pub-id>
</citation>
</ref>
<ref id="B99">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Lin</surname>
<given-names>L.</given-names>
</name>
<name>
<surname>Gen</surname>
<given-names>M.</given-names>
</name>
</person-group> (<year>2018</year>). <article-title>Hybrid evolutionary optimisation with learning for production scheduling: state-of-the-art survey on algorithms and applications</article-title>. <source>Int. J. Prod. Res.</source> <volume>56</volume>, <fpage>193</fpage>&#x2013;<lpage>223</lpage>. <pub-id pub-id-type="doi">10.1080/00207543.2018.1437288</pub-id>
</citation>
</ref>
<ref id="B100">
<citation citation-type="confproc">
<person-group person-group-type="author">
<name>
<surname>Liu</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Jin</surname>
<given-names>Y.</given-names>
</name>
</person-group> (<year>2019</year>). &#x201c;<article-title>Evolving hyperparameters for training deep neural networks against adversarial attacks</article-title>,&#x201d; in <conf-name>2019 IEEE Symposium Series on Computational Intelligence (SSCI)</conf-name>, <conf-loc>Xiamen, China</conf-loc>, <conf-date>06-09 December 2019</conf-date> (<publisher-name>IEEE</publisher-name>), <fpage>1778</fpage>&#x2013;<lpage>1785</lpage>.</citation>
</ref>
<ref id="B101">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Liu</surname>
<given-names>R.</given-names>
</name>
<name>
<surname>Piplani</surname>
<given-names>R.</given-names>
</name>
<name>
<surname>Toro</surname>
<given-names>C.</given-names>
</name>
</person-group> (<year>2022a</year>). <article-title>Deep reinforcement learning for dynamic scheduling of a flexible job shop</article-title>. <source>Int. J. Prod. Res.</source> <volume>60</volume>, <fpage>4049</fpage>&#x2013;<lpage>4069</lpage>. <pub-id pub-id-type="doi">10.1080/00207543.2022.2058432</pub-id>
</citation>
</ref>
<ref id="B102">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Liu</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Lin</surname>
<given-names>Q.</given-names>
</name>
<name>
<surname>Li</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Tan</surname>
<given-names>K. C.</given-names>
</name>
</person-group> (<year>2023</year>). <article-title>A survey on learnable evolutionary algorithms for scalable multiobjective optimization</article-title>. <source>IEEE Trans. Evol. Comput.</source> <volume>27</volume>, <fpage>1941</fpage>&#x2013;<lpage>1961</lpage>. <pub-id pub-id-type="doi">10.1109/tevc.2023.3250350</pub-id>
</citation>
</ref>
<ref id="B103">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Liu</surname>
<given-names>W.</given-names>
</name>
<name>
<surname>Dridi</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Fei</surname>
<given-names>H.</given-names>
</name>
<name>
<surname>El Hassani</surname>
<given-names>A. H.</given-names>
</name>
</person-group> (<year>2021</year>). <article-title>Hybrid metaheuristics for solving a home health care routing and scheduling problem with time windows, synchronized visits and lunch breaks</article-title>. <source>Expert Syst. Appl.</source> <volume>183</volume>, <fpage>115307</fpage>. <pub-id pub-id-type="doi">10.1016/j.eswa.2021.115307</pub-id>
</citation>
</ref>
<ref id="B104">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Liu</surname>
<given-names>W.</given-names>
</name>
<name>
<surname>Wang</surname>
<given-names>R.</given-names>
</name>
<name>
<surname>Zhang</surname>
<given-names>T.</given-names>
</name>
<name>
<surname>Li</surname>
<given-names>K.</given-names>
</name>
<name>
<surname>Li</surname>
<given-names>W.</given-names>
</name>
<name>
<surname>Ishibuchi</surname>
<given-names>H.</given-names>
</name>
<etal/>
</person-group> (<year>2023</year>). <article-title>Hybridization of evolutionary algorithm and deep reinforcement learning for multi-objective orienteering optimization</article-title>. <source>IEEE Trans. Evol. Comput.</source> <volume>27</volume>, <fpage>1260</fpage>&#x2013;<lpage>1274</lpage>. <pub-id pub-id-type="doi">10.1109/tevc.2022.3199045</pub-id>
</citation>
</ref>
<ref id="B105">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Liu</surname>
<given-names>X.-F.</given-names>
</name>
<name>
<surname>Zhou</surname>
<given-names>Y.-R.</given-names>
</name>
<name>
<surname>Yu</surname>
<given-names>X.</given-names>
</name>
<name>
<surname>Lin</surname>
<given-names>Y.</given-names>
</name>
</person-group> (<year>2019</year>). <article-title>Dual-archive-based particle swarm optimization for dynamic optimization</article-title>. <source>Appl. Soft Comput.</source> <volume>85</volume>, <fpage>105876</fpage>. <pub-id pub-id-type="doi">10.1016/j.asoc.2019.105876</pub-id>
</citation>
</ref>
<ref id="B106">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Lopes</surname>
<given-names>F.</given-names>
</name>
<name>
<surname>Agnelo</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Teixeira</surname>
<given-names>C. A.</given-names>
</name>
<name>
<surname>Laranjeiro</surname>
<given-names>N.</given-names>
</name>
<name>
<surname>Bernardino</surname>
<given-names>J.</given-names>
</name>
</person-group> (<year>2020</year>). <article-title>Automating orthogonal defect classification using machine learning algorithms</article-title>. <source>Future Gener. Comput. Syst.</source> <volume>102</volume>, <fpage>932</fpage>&#x2013;<lpage>947</lpage>. <pub-id pub-id-type="doi">10.1016/j.future.2019.09.009</pub-id>
</citation>
</ref>
<ref id="B107">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Lou</surname>
<given-names>H.</given-names>
</name>
<name>
<surname>Wang</surname>
<given-names>X.</given-names>
</name>
<name>
<surname>Dong</surname>
<given-names>Z.</given-names>
</name>
<name>
<surname>Yang</surname>
<given-names>Y.</given-names>
</name>
</person-group> (<year>2022</year>). <article-title>Memetic algorithm based on learning and decomposition for multiobjective flexible job shop scheduling considering human factors</article-title>. <source>Swarm Evol. Comput.</source> <volume>75</volume>, <fpage>101204</fpage>. <pub-id pub-id-type="doi">10.1016/j.swevo.2022.101204</pub-id>
</citation>
</ref>
<ref id="B108">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Luo</surname>
<given-names>P. C.</given-names>
</name>
<name>
<surname>Xiong</surname>
<given-names>H. Q.</given-names>
</name>
<name>
<surname>Zhang</surname>
<given-names>B. W.</given-names>
</name>
<name>
<surname>Peng</surname>
<given-names>J. Y.</given-names>
</name>
<name>
<surname>Xiong</surname>
<given-names>Z. F.</given-names>
</name>
</person-group> (<year>2022a</year>). <article-title>Multi-resource constrained dynamic workshop scheduling based on proximal policy optimisation</article-title>. <source>Int. J. Prod. Res.</source> <volume>60</volume>, <fpage>5937</fpage>&#x2013;<lpage>5955</lpage>. <pub-id pub-id-type="doi">10.1080/00207543.2021.1975057</pub-id>
</citation>
</ref>
<ref id="B109">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Luo</surname>
<given-names>Q.</given-names>
</name>
<name>
<surname>Deng</surname>
<given-names>Q.</given-names>
</name>
<name>
<surname>Gong</surname>
<given-names>G.</given-names>
</name>
<name>
<surname>Guo</surname>
<given-names>X.</given-names>
</name>
<name>
<surname>Liu</surname>
<given-names>X.</given-names>
</name>
</person-group> (<year>2022b</year>). <article-title>A distributed flexible job shop scheduling problem considering worker arrangement using an improved memetic algorithm</article-title>. <source>Expert Syst. Appl.</source> <volume>207</volume>, <fpage>117984</fpage>. <pub-id pub-id-type="doi">10.1016/j.eswa.2022.117984</pub-id>
</citation>
</ref>
<ref id="B110">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Luo</surname>
<given-names>S.</given-names>
</name>
</person-group> (<year>2020</year>). <article-title>Dynamic scheduling for flexible job shop with new job insertions by deep reinforcement learning</article-title>. <source>Appl. Soft Comput.</source> <volume>91</volume>, <fpage>106208</fpage>. <pub-id pub-id-type="doi">10.1016/j.asoc.2020.106208</pub-id>
</citation>
</ref>
<ref id="B111">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Luo</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Zhang</surname>
<given-names>L.</given-names>
</name>
<name>
<surname>Fan</surname>
<given-names>Y.</given-names>
</name>
</person-group> (<year>2021a</year>). <article-title>Dynamic multi-objective scheduling for flexible job shop by deep reinforcement learning</article-title>. <source>Comput. Industrial Eng.</source> <volume>159</volume>, <fpage>107489</fpage>. <pub-id pub-id-type="doi">10.1016/j.cie.2021.107489</pub-id>
</citation>
</ref>
<ref id="B112">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Luo</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Zhang</surname>
<given-names>L.</given-names>
</name>
<name>
<surname>Fan</surname>
<given-names>Y.</given-names>
</name>
</person-group> (<year>2022</year>). <article-title>Real-time scheduling for dynamic partial-no-wait multiobjective flexible job shop by deep reinforcement learning</article-title>. <source>IEEE Trans. Automation Sci. Eng.</source> <volume>19</volume>, <fpage>3020</fpage>&#x2013;<lpage>3038</lpage>. <pub-id pub-id-type="doi">10.1109/tase.2021.3104716</pub-id>
</citation>
</ref>
<ref id="B113">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Mahdavi</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Rahnamayan</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Deb</surname>
<given-names>K.</given-names>
</name>
</person-group> (<year>2018</year>). <article-title>Opposition based learning: a literature review</article-title>. <source>Swarm Evol. Comput.</source> <volume>39</volume>, <fpage>1</fpage>&#x2013;<lpage>23</lpage>. <pub-id pub-id-type="doi">10.1016/j.swevo.2017.09.010</pub-id>
</citation>
</ref>
<ref id="B114">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Makhadmeh</surname>
<given-names>S. N.</given-names>
</name>
<name>
<surname>Khader</surname>
<given-names>A. T.</given-names>
</name>
<name>
<surname>Al-Betar</surname>
<given-names>M. A.</given-names>
</name>
<name>
<surname>Naim</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Abasi</surname>
<given-names>A. K.</given-names>
</name>
<name>
<surname>Alyasseri</surname>
<given-names>Z. A. A.</given-names>
</name>
</person-group> (<year>2019</year>). <article-title>Optimization methods for power scheduling problems in smart home: survey</article-title>. <source>Renew. Sustain. Energy Rev.</source> <volume>115</volume>, <fpage>109362</fpage>. <pub-id pub-id-type="doi">10.1016/j.rser.2019.109362</pub-id>
</citation>
</ref>
<ref id="B115">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Makridakis</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Spiliotis</surname>
<given-names>E.</given-names>
</name>
<name>
<surname>Assimakopoulos</surname>
<given-names>V.</given-names>
</name>
</person-group> (<year>2018</year>). <article-title>Statistical and machine learning forecasting methods: concerns and ways forward</article-title>. <source>PloS One</source> <volume>13</volume>, <fpage>e0194889</fpage>. <pub-id pub-id-type="doi">10.1371/journal.pone.0194889</pub-id>
</citation>
</ref>
<ref id="B116">
<citation citation-type="confproc">
<person-group person-group-type="author">
<name>
<surname>Marchesini</surname>
<given-names>E.</given-names>
</name>
<name>
<surname>Corsi</surname>
<given-names>D.</given-names>
</name>
<name>
<surname>Farinelli</surname>
<given-names>A.</given-names>
</name>
</person-group> (<year>2021</year>). &#x201c;<article-title>Genetic soft updates for policy evolution in deep reinforcement learning</article-title>,&#x201d; in <conf-name>International Conference on Learning Representations</conf-name>, <conf-loc>Austria</conf-loc>, <conf-date>May 3-7, 2021</conf-date>.</citation>
</ref>
<ref id="B117">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Meng</surname>
<given-names>L.</given-names>
</name>
<name>
<surname>Zhang</surname>
<given-names>C.</given-names>
</name>
<name>
<surname>Ren</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Zhang</surname>
<given-names>B.</given-names>
</name>
<name>
<surname>Lv</surname>
<given-names>C.</given-names>
</name>
</person-group> (<year>2020</year>). <article-title>Mixed-integer linear programming and constraint programming formulations for solving distributed flexible job shop scheduling problem</article-title>. <source>Comput. Industrial Eng.</source> <volume>142</volume>, <fpage>106347</fpage>. <pub-id pub-id-type="doi">10.1016/j.cie.2020.106347</pub-id>
</citation>
</ref>
<ref id="B118">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Miyata</surname>
<given-names>H. H.</given-names>
</name>
<name>
<surname>Nagano</surname>
<given-names>M. S.</given-names>
</name>
</person-group> (<year>2019</year>). <article-title>The blocking flow shop scheduling problem: a comprehensive and conceptual review</article-title>. <source>Expert Syst. Appl.</source> <volume>137</volume>, <fpage>130</fpage>&#x2013;<lpage>156</lpage>. <pub-id pub-id-type="doi">10.1016/j.eswa.2019.06.069</pub-id>
</citation>
</ref>
<ref id="B119">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Mohan</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Lanka</surname>
<given-names>K.</given-names>
</name>
<name>
<surname>Rao</surname>
<given-names>A. N.</given-names>
</name>
</person-group> (<year>2019</year>). <article-title>A review of dynamic job shop scheduling techniques</article-title>. <source>Procedia Manuf.</source> <volume>30</volume>, <fpage>34</fpage>&#x2013;<lpage>39</lpage>. <pub-id pub-id-type="doi">10.1016/j.promfg.2019.02.006</pub-id>
</citation>
</ref>
<ref id="B120">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Moon &#x2a;</surname>
<given-names>C.</given-names>
</name>
<name>
<surname>Kim</surname>
<given-names>J. S.</given-names>
</name>
<name>
<surname>Gen</surname>
<given-names>M.</given-names>
</name>
</person-group> (<year>2004</year>). <article-title>Advanced planning and scheduling based on precedence and resource constraints for e-plant chains</article-title>. <source>Int. J. Prod. Res.</source> <volume>42</volume>, <fpage>2941</fpage>&#x2013;<lpage>2955</lpage>. <pub-id pub-id-type="doi">10.1080/00207540410001691956</pub-id>
</citation>
</ref>
<ref id="B121">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Morais</surname>
<given-names>M. d. F.</given-names>
</name>
<name>
<surname>Ribeiro</surname>
<given-names>M. H. D. M.</given-names>
</name>
<name>
<surname>da Silva</surname>
<given-names>R. G.</given-names>
</name>
<name>
<surname>Mariani</surname>
<given-names>V. C.</given-names>
</name>
<name>
<surname>Coelho</surname>
<given-names>L. d. S.</given-names>
</name>
</person-group> (<year>2022</year>). <article-title>Discrete differential evolution metaheuristics for permutation flow shop scheduling problems</article-title>. <source>Comput. Industrial Eng.</source> <volume>166</volume>, <fpage>107956</fpage>. <pub-id pub-id-type="doi">10.1016/j.cie.2022.107956</pub-id>
</citation>
</ref>
<ref id="B122">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Narendra</surname>
</name>
<name>
<surname>Fukunaga</surname>
</name>
</person-group> (<year>1977</year>). <article-title>A branch and bound algorithm for feature subset selection</article-title>. <source>IEEE Trans. Comput.</source> <volume>C-26</volume>, <fpage>917</fpage>&#x2013;<lpage>922</lpage>. <pub-id pub-id-type="doi">10.1109/tc.1977.1674939</pub-id>
</citation>
</ref>
<ref id="B123">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Osaba</surname>
<given-names>E.</given-names>
</name>
<name>
<surname>Villar-Rodriguez</surname>
<given-names>E.</given-names>
</name>
<name>
<surname>Del Ser</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Nebro</surname>
<given-names>A. J.</given-names>
</name>
<name>
<surname>Molina</surname>
<given-names>D.</given-names>
</name>
<name>
<surname>LaTorre</surname>
<given-names>A.</given-names>
</name>
<etal/>
</person-group> (<year>2021</year>). <article-title>A tutorial on the design, experimentation and application of metaheuristic algorithms to real-world optimization problems</article-title>. <source>Swarm Evol. Comput.</source> <volume>64</volume>, <fpage>100888</fpage>. <pub-id pub-id-type="doi">10.1016/j.swevo.2021.100888</pub-id>
</citation>
</ref>
<ref id="B124">
<citation citation-type="confproc">
<person-group person-group-type="author">
<name>
<surname>Pericleous</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Konstantinidis</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>Achilleos</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>Papadopoulos</surname>
<given-names>G. A.</given-names>
</name>
</person-group> (<year>2017</year>). &#x201c;<article-title>Generic hybridization of moea/d with learning for permutation flow shop scheduling problem</article-title>,&#x201d; in <conf-name>2017 8th International Conference on Information, Intelligence, Systems and Applications (IISA)</conf-name>, <conf-loc>Larnaca, Cyprus</conf-loc>, <conf-date>27-30 August 2017</conf-date> (<publisher-name>IEEE</publisher-name>), <fpage>1</fpage>&#x2013;<lpage>6</lpage>.</citation>
</ref>
<ref id="B125">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Pezzella</surname>
<given-names>F.</given-names>
</name>
<name>
<surname>Morganti</surname>
<given-names>G.</given-names>
</name>
<name>
<surname>Ciaschetti</surname>
<given-names>G.</given-names>
</name>
</person-group> (<year>2008</year>). <article-title>A genetic algorithm for the flexible job-shop scheduling problem</article-title>. <source>Comput. Operations Res.</source> <volume>35</volume>, <fpage>3202</fpage>&#x2013;<lpage>3212</lpage>. <pub-id pub-id-type="doi">10.1016/j.cor.2007.02.014</pub-id>
</citation>
</ref>
<ref id="B126">
<citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname>Pisner</surname>
<given-names>D. A.</given-names>
</name>
<name>
<surname>Schnyer</surname>
<given-names>D. M.</given-names>
</name>
</person-group> (<year>2020</year>). &#x201c;<article-title>Support vector machine</article-title>,&#x201d; in <source>Machine learning</source> (<publisher-name>Elsevier</publisher-name>), <fpage>101</fpage>&#x2013;<lpage>121</lpage>.</citation>
</ref>
<ref id="B127">
<citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname>Pourchot</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>Sigaud</surname>
<given-names>O.</given-names>
</name>
</person-group> (<year>2018</year>). <source>Cem-rl: combining evolutionary and gradient-based methods for policy search</source>. <comment>
<italic>arXiv preprint arXiv:1810.01222</italic>
</comment>.</citation>
</ref>
<ref id="B128">
<citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname>Price</surname>
<given-names>K. V.</given-names>
</name>
</person-group> (<year>2013</year>). &#x201c;<article-title>Differential evolution</article-title>,&#x201d; in <source>Handbook of optimization: from classical to modern approach</source> (<publisher-name>Springer</publisher-name>), <fpage>187</fpage>&#x2013;<lpage>214</lpage>.</citation>
</ref>
<ref id="B129">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Ramasesh</surname>
<given-names>R.</given-names>
</name>
</person-group> (<year>1990</year>). <article-title>Dynamic job shop scheduling: a survey of simulation research</article-title>. <source>Omega</source> <volume>18</volume>, <fpage>43</fpage>&#x2013;<lpage>57</lpage>. <pub-id pub-id-type="doi">10.1016/0305-0483(90)90017-4</pub-id>
</citation>
</ref>
<ref id="B130">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Ramya</surname>
<given-names>G.</given-names>
</name>
<name>
<surname>Chandrasekaran</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Shankar</surname>
<given-names>E.</given-names>
</name>
</person-group> (<year>2019</year>). <article-title>Case study analysis of job shop scheduling and its integration with material requirement planning</article-title>. <source>Mater. Today Proc.</source> <volume>16</volume>, <fpage>1034</fpage>&#x2013;<lpage>1042</lpage>. <pub-id pub-id-type="doi">10.1016/j.matpr.2019.05.192</pub-id>
</citation>
</ref>
<ref id="B131">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Rumelhart</surname>
<given-names>D. E.</given-names>
</name>
<name>
<surname>Zipser</surname>
<given-names>D.</given-names>
</name>
</person-group> (<year>1985</year>). <article-title>Feature discovery by competitive learning</article-title>. <source>Cognitive Sci.</source> <volume>9</volume>, <fpage>75</fpage>&#x2013;<lpage>112</lpage>. <pub-id pub-id-type="doi">10.1207/s15516709cog0901_5</pub-id>
</citation>
</ref>
<ref id="B132">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>&#x15e;ahman</surname>
<given-names>M. A.</given-names>
</name>
</person-group> (<year>2021</year>). <article-title>A discrete spotted hyena optimizer for solving distributed job shop scheduling problems</article-title>. <source>Appl. Soft Comput.</source> <volume>106</volume>, <fpage>107349</fpage>. <pub-id pub-id-type="doi">10.1016/j.asoc.2021.107349</pub-id>
</citation>
</ref>
<ref id="B133">
<citation citation-type="confproc">
<person-group person-group-type="author">
<name>
<surname>Samsonov</surname>
<given-names>V.</given-names>
</name>
<name>
<surname>Kemmerling</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Paegert</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>L&#xfc;tticke</surname>
<given-names>D.</given-names>
</name>
<name>
<surname>Sauermann</surname>
<given-names>F.</given-names>
</name>
<name>
<surname>G&#xfc;tzlaff</surname>
<given-names>A.</given-names>
</name>
<etal/>
</person-group> (<year>2021</year>). &#x201c;<article-title>Manufacturing control in job shop environments with reinforcement learning</article-title>,&#x201d; in <conf-name>ICAART</conf-name>, <fpage>589</fpage>&#x2013;<lpage>597</lpage>.</citation>
</ref>
<ref id="B134">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>San-Jos&#xe9;</surname>
<given-names>L. A.</given-names>
</name>
<name>
<surname>Sicilia</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Gonz&#xe1;lez-De-la Rosa</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Febles-Acosta</surname>
<given-names>J.</given-names>
</name>
</person-group> (<year>2019</year>). <article-title>Analysis of an inventory system with discrete scheduling period, time-dependent demand and backlogged shortages</article-title>. <source>Comput. Operations Res.</source> <volume>109</volume>, <fpage>200</fpage>&#x2013;<lpage>208</lpage>. <pub-id pub-id-type="doi">10.1016/j.cor.2019.05.003</pub-id>
</citation>
</ref>
<ref id="B135">
<citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname>Schrijver</surname>
<given-names>A.</given-names>
</name>
</person-group> (<year>1998</year>). <source>Theory of linear and integer programming</source>. <publisher-name>John Wiley and Sons</publisher-name>.</citation>
</ref>
<ref id="B136">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Scrich</surname>
<given-names>C. R.</given-names>
</name>
<name>
<surname>Armentano</surname>
<given-names>V. A.</given-names>
</name>
<name>
<surname>Laguna</surname>
<given-names>M.</given-names>
</name>
</person-group> (<year>2004</year>). <article-title>Tardiness minimization in a flexible job shop: a tabu search approach</article-title>. <source>J. Intelligent Manuf.</source> <volume>15</volume>, <fpage>103</fpage>&#x2013;<lpage>115</lpage>. <pub-id pub-id-type="doi">10.1023/b:jims.0000010078.30713.e9</pub-id>
</citation>
</ref>
<ref id="B137">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Shanker</surname>
<given-names>K.</given-names>
</name>
<name>
<surname>Tzen</surname>
<given-names>Y.-J. J.</given-names>
</name>
</person-group> (<year>1985</year>). <article-title>A loading and dispatching problem in a random flexible manufacturing system</article-title>. <source>Int. J. Prod. Res.</source> <volume>23</volume>, <fpage>579</fpage>&#x2013;<lpage>595</lpage>. <pub-id pub-id-type="doi">10.1080/00207548508904730</pub-id>
</citation>
</ref>
<ref id="B138">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Shao</surname>
<given-names>W.</given-names>
</name>
<name>
<surname>Shao</surname>
<given-names>Z.</given-names>
</name>
<name>
<surname>Pi</surname>
<given-names>D.</given-names>
</name>
</person-group> (<year>2020</year>). <article-title>Modeling and multi-neighborhood iterated greedy algorithm for distributed hybrid flow shop scheduling problem</article-title>. <source>Knowledge-Based Syst.</source> <volume>194</volume>, <fpage>105527</fpage>. <pub-id pub-id-type="doi">10.1016/j.knosys.2020.105527</pub-id>
</citation>
</ref>
<ref id="B139">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Shao</surname>
<given-names>W.</given-names>
</name>
<name>
<surname>Shao</surname>
<given-names>Z.</given-names>
</name>
<name>
<surname>Pi</surname>
<given-names>D.</given-names>
</name>
</person-group> (<year>2021</year>). <article-title>Multi-objective evolutionary algorithm based on multiple neighborhoods local search for multi-objective distributed hybrid flow shop scheduling problem</article-title>. <source>Expert Syst. Appl.</source> <volume>183</volume>, <fpage>115453</fpage>. <pub-id pub-id-type="doi">10.1016/j.eswa.2021.115453</pub-id>
</citation>
</ref>
<ref id="B140">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Shao</surname>
<given-names>W.</given-names>
</name>
<name>
<surname>Shao</surname>
<given-names>Z.</given-names>
</name>
<name>
<surname>Pi</surname>
<given-names>D.</given-names>
</name>
</person-group> (<year>2022</year>). <article-title>A network memetic algorithm for energy and labor-aware distributed heterogeneous hybrid flow shop scheduling problem</article-title>. <source>Swarm Evol. Comput.</source> <volume>75</volume>, <fpage>101190</fpage>. <pub-id pub-id-type="doi">10.1016/j.swevo.2022.101190</pub-id>
</citation>
</ref>
<ref id="B141">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Song</surname>
<given-names>F.</given-names>
</name>
<name>
<surname>Xing</surname>
<given-names>H.</given-names>
</name>
<name>
<surname>Wang</surname>
<given-names>X.</given-names>
</name>
<name>
<surname>Luo</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Dai</surname>
<given-names>P.</given-names>
</name>
<name>
<surname>Xiao</surname>
<given-names>Z.</given-names>
</name>
<etal/>
</person-group> (<year>2022</year>). <article-title>Evolutionary multi-objective reinforcement learning based trajectory control and task offloading in uav-assisted mobile edge computing</article-title>. <source>IEEE Trans. Mob. Comput.</source> <volume>22</volume>, <fpage>7387</fpage>&#x2013;<lpage>7405</lpage>. <pub-id pub-id-type="doi">10.1109/TMC.2022.3208457</pub-id>
</citation>
</ref>
<ref id="B142">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Song</surname>
<given-names>H.-B.</given-names>
</name>
<name>
<surname>Yang</surname>
<given-names>Y.-H.</given-names>
</name>
<name>
<surname>Lin</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Ye</surname>
<given-names>J.-X.</given-names>
</name>
</person-group> (<year>2023</year>). <article-title>An effective hyper heuristic-based memetic algorithm for the distributed assembly permutation flow-shop scheduling problem</article-title>. <source>Appl. Soft Comput.</source> <volume>135</volume>, <fpage>110022</fpage>. <pub-id pub-id-type="doi">10.1016/j.asoc.2023.110022</pub-id>
</citation>
</ref>
<ref id="B143">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Srinivas</surname>
<given-names>N.</given-names>
</name>
<name>
<surname>Deb</surname>
<given-names>K.</given-names>
</name>
</person-group> (<year>1994</year>). <article-title>Muiltiobjective optimization using nondominated sorting in genetic algorithms</article-title>. <source>Evol. Comput.</source> <volume>2</volume>, <fpage>221</fpage>&#x2013;<lpage>248</lpage>. <pub-id pub-id-type="doi">10.1162/evco.1994.2.3.221</pub-id>
</citation>
</ref>
<ref id="B144">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Stadler</surname>
<given-names>W.</given-names>
</name>
</person-group> (<year>1979</year>). <article-title>A survey of multicriteria optimization or the vector maximum problem, part i: 1776&#x2013;1960</article-title>. <source>J. Optim. Theory Appl.</source> <volume>29</volume>, <fpage>1</fpage>&#x2013;<lpage>52</lpage>. <pub-id pub-id-type="doi">10.1007/bf00932634</pub-id>
</citation>
</ref>
<ref id="B145">
<citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname>Suri</surname>
<given-names>K.</given-names>
</name>
<name>
<surname>Shi</surname>
<given-names>X. Q.</given-names>
</name>
<name>
<surname>Plataniotis</surname>
<given-names>K. N.</given-names>
</name>
<name>
<surname>Lawryshyn</surname>
<given-names>Y. A.</given-names>
</name>
</person-group> (<year>2020</year>). <source>Maximum mutation reinforcement learning for scalable control</source>. <comment>
<italic>arXiv preprint arXiv:2007.13690</italic>
</comment>.</citation>
</ref>
<ref id="B146">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Tan</surname>
<given-names>W.</given-names>
</name>
<name>
<surname>Yuan</surname>
<given-names>X.</given-names>
</name>
<name>
<surname>Wang</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Zhang</surname>
<given-names>X.</given-names>
</name>
</person-group> (<year>2021</year>). <article-title>A fatigue-conscious dual resource constrained flexible job shop scheduling problem by enhanced nsga-ii: an application from casting workshop</article-title>. <source>Comput. Industrial Eng.</source> <volume>160</volume>, <fpage>107557</fpage>. <pub-id pub-id-type="doi">10.1016/j.cie.2021.107557</pub-id>
</citation>
</ref>
<ref id="B147">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Tan</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Ding</surname>
<given-names>K.</given-names>
</name>
</person-group> (<year>2016</year>). <article-title>A survey on gpu-based implementation of swarm intelligence algorithms</article-title>. <source>IEEE Trans. Cybern.</source> <volume>46</volume>, <fpage>2028</fpage>&#x2013;<lpage>2041</lpage>. <pub-id pub-id-type="doi">10.1109/tcyb.2015.2460261</pub-id>
</citation>
</ref>
<ref id="B148">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Tang</surname>
<given-names>X.</given-names>
</name>
<name>
<surname>Cao</surname>
<given-names>W.</given-names>
</name>
<name>
<surname>Tang</surname>
<given-names>H.</given-names>
</name>
<name>
<surname>Deng</surname>
<given-names>T.</given-names>
</name>
<name>
<surname>Mei</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Liu</surname>
<given-names>Y.</given-names>
</name>
<etal/>
</person-group> (<year>2022</year>). <article-title>Cost-efficient workflow scheduling algorithm for applications with deadline constraint on heterogeneous clouds</article-title>. <source>IEEE Trans. Parallel Distributed Syst.</source> <volume>33</volume>, <fpage>2079</fpage>&#x2013;<lpage>2092</lpage>. <pub-id pub-id-type="doi">10.1109/tpds.2021.3134247</pub-id>
</citation>
</ref>
<ref id="B149">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Tavakkoli-Moghaddam</surname>
<given-names>R.</given-names>
</name>
<name>
<surname>Jolai</surname>
<given-names>F.</given-names>
</name>
<name>
<surname>Vaziri</surname>
<given-names>F.</given-names>
</name>
<name>
<surname>Ahmed</surname>
<given-names>P.</given-names>
</name>
<name>
<surname>Azaron</surname>
<given-names>A.</given-names>
</name>
</person-group> (<year>2005</year>). <article-title>A hybrid method for solving stochastic job shop scheduling problems</article-title>. <source>Appl. Math. Comput.</source> <volume>170</volume>, <fpage>185</fpage>&#x2013;<lpage>206</lpage>. <pub-id pub-id-type="doi">10.1016/j.amc.2004.11.036</pub-id>
</citation>
</ref>
<ref id="B150">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Tian</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Cheng</surname>
<given-names>R.</given-names>
</name>
<name>
<surname>Zhang</surname>
<given-names>X.</given-names>
</name>
<name>
<surname>Cheng</surname>
<given-names>F.</given-names>
</name>
<name>
<surname>Jin</surname>
<given-names>Y.</given-names>
</name>
</person-group> (<year>2018</year>). <article-title>An indicator-based multiobjective evolutionary algorithm with reference point adaptation for better versatility</article-title>. <source>IEEE Trans. Evol. Comput.</source> <volume>22</volume>, <fpage>609</fpage>&#x2013;<lpage>622</lpage>. <pub-id pub-id-type="doi">10.1109/tevc.2017.2749619</pub-id>
</citation>
</ref>
<ref id="B151">
<citation citation-type="confproc">
<person-group person-group-type="author">
<name>
<surname>Tian</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Zhang</surname>
<given-names>X.</given-names>
</name>
<name>
<surname>Cheng</surname>
<given-names>R.</given-names>
</name>
<name>
<surname>Jin</surname>
<given-names>Y.</given-names>
</name>
</person-group> (<year>2016</year>). &#x201c;<article-title>A multi-objective evolutionary algorithm based on an enhanced inverted generational distance metric</article-title>,&#x201d; in <conf-name>2016 IEEE Congress on Evolutionary Computation (CEC)</conf-name>, <conf-loc>Vancouver, British Columbia, Canada</conf-loc>, <conf-date>24-29 July 2016</conf-date> (<publisher-name>IEEE</publisher-name>), <fpage>5222</fpage>&#x2013;<lpage>5229</lpage>.</citation>
</ref>
<ref id="B152">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Toptal</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>Sabuncuoglu</surname>
<given-names>I.</given-names>
</name>
</person-group> (<year>2010</year>). <article-title>Distributed scheduling: a review of concepts and applications</article-title>. <source>Int. J. Prod. Res.</source> <volume>48</volume>, <fpage>5235</fpage>&#x2013;<lpage>5262</lpage>. <pub-id pub-id-type="doi">10.1080/00207540903121065</pub-id>
</citation>
</ref>
<ref id="B153">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Torabi</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Karimi</surname>
<given-names>B.</given-names>
</name>
<name>
<surname>Fatemi Ghomi</surname>
<given-names>S.</given-names>
</name>
</person-group> (<year>2005</year>). <article-title>The common cycle economic lot scheduling in flexible job shops: the finite horizon case</article-title>. <source>Int. J. Prod. Econ.</source> <volume>97</volume>, <fpage>52</fpage>&#x2013;<lpage>65</lpage>. <pub-id pub-id-type="doi">10.1016/j.ijpe.2004.05.005</pub-id>
</citation>
</ref>
<ref id="B154">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Trebu&#x148;a</surname>
<given-names>P.</given-names>
</name>
<name>
<surname>Hal&#x10d;inov&#xe1;</surname>
<given-names>J.</given-names>
</name>
</person-group> (<year>2013</year>). <article-title>Mathematical tools of cluster analysis</article-title>. <source>Appl. Math.</source> <volume>04</volume>, <fpage>814</fpage>&#x2013;<lpage>816</lpage>. <pub-id pub-id-type="doi">10.4236/am.2013.45111</pub-id>
</citation>
</ref>
<ref id="B155">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Trivedi</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>Srinivasan</surname>
<given-names>D.</given-names>
</name>
<name>
<surname>Sanyal</surname>
<given-names>K.</given-names>
</name>
<name>
<surname>Ghosh</surname>
<given-names>A.</given-names>
</name>
</person-group> (<year>2016</year>). <article-title>A survey of multiobjective evolutionary algorithms based on decomposition</article-title>. <source>IEEE Trans. Evol. Comput.</source> <volume>21</volume>, <fpage>440</fpage>&#x2013;<lpage>462</lpage>. <pub-id pub-id-type="doi">10.1109/TEVC.2016.2608507</pub-id>
</citation>
</ref>
<ref id="B156">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Tsujimura</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Gen</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Kubota</surname>
<given-names>E.</given-names>
</name>
</person-group> (<year>1995</year>). <article-title>Solving job-shop scheduling problem with fuzzy processing time using genetic algorithm</article-title>. <source>J. Jpn. Soc. Fuzzy Theory Syst.</source> <volume>7</volume>, <fpage>1073</fpage>&#x2013;<lpage>1083</lpage>. <pub-id pub-id-type="doi">10.3156/jfuzzy.7.5_1073</pub-id>
</citation>
</ref>
<ref id="B157">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Umam</surname>
<given-names>M. S.</given-names>
</name>
<name>
<surname>Mustafid</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Suryono</surname>
<given-names>S.</given-names>
</name>
</person-group> (<year>2022</year>). <article-title>A hybrid genetic algorithm and tabu search for minimizing makespan in flow shop scheduling problem</article-title>. <source>J. King Saud University-Computer Inf. Sci.</source> <volume>34</volume>, <fpage>7459</fpage>&#x2013;<lpage>7467</lpage>. <pub-id pub-id-type="doi">10.1016/j.jksuci.2021.08.025</pub-id>
</citation>
</ref>
<ref id="B158">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Voorneveld</surname>
<given-names>M.</given-names>
</name>
</person-group> (<year>2003</year>). <article-title>Characterization of pareto dominance</article-title>. <source>Operations Res. Lett.</source> <volume>31</volume>, <fpage>7</fpage>&#x2013;<lpage>11</lpage>. <pub-id pub-id-type="doi">10.1016/s0167-6377(02)00189-x</pub-id>
</citation>
</ref>
<ref id="B159">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Wang</surname>
<given-names>G.</given-names>
</name>
<name>
<surname>Li</surname>
<given-names>X.</given-names>
</name>
<name>
<surname>Gao</surname>
<given-names>L.</given-names>
</name>
<name>
<surname>Li</surname>
<given-names>P.</given-names>
</name>
</person-group> (<year>2021</year>). <article-title>Energy-efficient distributed heterogeneous welding flow shop scheduling problem using a modified moea/d</article-title>. <source>Swarm Evol. Comput.</source> <volume>62</volume>, <fpage>100858</fpage>. <pub-id pub-id-type="doi">10.1016/j.swevo.2021.100858</pub-id>
</citation>
</ref>
<ref id="B160">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Wang</surname>
<given-names>G.-G.</given-names>
</name>
<name>
<surname>Gao</surname>
<given-names>D.</given-names>
</name>
<name>
<surname>Pedrycz</surname>
<given-names>W.</given-names>
</name>
</person-group> (<year>2022a</year>). <article-title>Solving multiobjective fuzzy job-shop scheduling problem by a hybrid adaptive differential evolution algorithm</article-title>. <source>IEEE Trans. Industrial Inf.</source> <volume>18</volume>, <fpage>8519</fpage>&#x2013;<lpage>8528</lpage>. <pub-id pub-id-type="doi">10.1109/tii.2022.3165636</pub-id>
</citation>
</ref>
<ref id="B161">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Wang</surname>
<given-names>H.</given-names>
</name>
<name>
<surname>Cheng</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Liu</surname>
<given-names>C.</given-names>
</name>
<name>
<surname>Zhang</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Hu</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Chen</surname>
<given-names>L.</given-names>
</name>
</person-group> (<year>2022b</year>). <article-title>Multi-objective reinforcement learning framework for dynamic flexible job shop scheduling problem with uncertain events</article-title>. <source>Appl. Soft Comput.</source> <volume>131</volume>, <fpage>109717</fpage>. <pub-id pub-id-type="doi">10.1016/j.asoc.2022.109717</pub-id>
</citation>
</ref>
<ref id="B162">
<citation citation-type="confproc">
<person-group person-group-type="author">
<name>
<surname>Wang</surname>
<given-names>J.-J.</given-names>
</name>
<name>
<surname>Wang</surname>
<given-names>L.</given-names>
</name>
</person-group> (<year>2019</year>). &#x201c;<article-title>An iterated greedy algorithm for distributed hybrid flowshop scheduling problem with total tardiness minimization</article-title>,&#x201d; in <conf-name>2019 IEEE 15th International Conference on Automation Science and Engineering (CASE)</conf-name>, <conf-loc>Vancouver, BC, Canada</conf-loc>, <conf-date>22-26 August 2019</conf-date> (<publisher-name>IEEE</publisher-name>), <fpage>350</fpage>&#x2013;<lpage>355</lpage>.</citation>
</ref>
<ref id="B163">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Wang</surname>
<given-names>J.-J.</given-names>
</name>
<name>
<surname>Wang</surname>
<given-names>L.</given-names>
</name>
</person-group> (<year>2021</year>). <article-title>A bi-population cooperative memetic algorithm for distributed hybrid flow-shop scheduling</article-title>. <source>IEEE Trans. Emerg. Top. Comput. Intell.</source> <volume>5</volume>, <fpage>947</fpage>&#x2013;<lpage>961</lpage>. <pub-id pub-id-type="doi">10.1109/tetci.2020.3022372</pub-id>
</citation>
</ref>
<ref id="B164">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Wang</surname>
<given-names>J.-J.</given-names>
</name>
<name>
<surname>Wang</surname>
<given-names>L.</given-names>
</name>
</person-group> (<year>2022</year>). <article-title>A cooperative memetic algorithm with learning-based agent for energy-aware distributed hybrid flow-shop scheduling</article-title>. <source>IEEE Trans. Evol. Comput.</source> <volume>26</volume>, <fpage>461</fpage>&#x2013;<lpage>475</lpage>. <pub-id pub-id-type="doi">10.1109/tevc.2021.3106168</pub-id>
</citation>
</ref>
<ref id="B165">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Wang</surname>
<given-names>J.-J.</given-names>
</name>
<name>
<surname>Wang</surname>
<given-names>L.</given-names>
</name>
<name>
<surname>Xiu</surname>
<given-names>X.</given-names>
</name>
</person-group> (<year>2023a</year>). <article-title>A cooperative memetic algorithm for energy-aware distributed welding shop scheduling problem</article-title>. <source>Eng. Appl. Artif. Intell.</source> <volume>120</volume>, <fpage>105877</fpage>. <pub-id pub-id-type="doi">10.1016/j.engappai.2023.105877</pub-id>
</citation>
</ref>
<ref id="B166">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Wang</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Li</surname>
<given-names>X.</given-names>
</name>
<name>
<surname>Chen</surname>
<given-names>L.</given-names>
</name>
<name>
<surname>Chen</surname>
<given-names>H.</given-names>
</name>
</person-group> (<year>2023b</year>). <article-title>Medical machine learning based on multiobjective evolutionary algorithm using learning decomposition</article-title>. <source>Expert Syst. Appl.</source> <volume>216</volume>, <fpage>119450</fpage>. <pub-id pub-id-type="doi">10.1016/j.eswa.2022.119450</pub-id>
</citation>
</ref>
<ref id="B167">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Wang</surname>
<given-names>P.</given-names>
</name>
<name>
<surname>Tong</surname>
<given-names>X.</given-names>
</name>
</person-group> (<year>2020</year>). <article-title>A dimension convergence-based evolutionary algorithm for many-objective optimization problems</article-title>. <source>IEEE Access</source> <volume>8</volume>, <fpage>224631</fpage>&#x2013;<lpage>224642</lpage>. <pub-id pub-id-type="doi">10.1109/access.2020.3043253</pub-id>
</citation>
</ref>
<ref id="B168">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Wang</surname>
<given-names>X.</given-names>
</name>
<name>
<surname>Tang</surname>
<given-names>L.</given-names>
</name>
</person-group> (<year>2017</year>). <article-title>A machine-learning based memetic algorithm for the multi-objective permutation flowshop scheduling problem</article-title>. <source>Comput. Operations Res.</source> <volume>79</volume>, <fpage>60</fpage>&#x2013;<lpage>77</lpage>. <pub-id pub-id-type="doi">10.1016/j.cor.2016.10.003</pub-id>
</citation>
</ref>
<ref id="B169">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Watkins</surname>
<given-names>C. J.</given-names>
</name>
<name>
<surname>Dayan</surname>
<given-names>P.</given-names>
</name>
</person-group> (<year>1992</year>). <article-title>Q-learning</article-title>. <source>Mach. Learn.</source> <volume>8</volume>, <fpage>279</fpage>&#x2013;<lpage>292</lpage>. <pub-id pub-id-type="doi">10.1023/a:1022676722315</pub-id>
</citation>
</ref>
<ref id="B170">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Wiering</surname>
<given-names>M. A.</given-names>
</name>
<name>
<surname>Van Otterlo</surname>
<given-names>M.</given-names>
</name>
</person-group> (<year>2012</year>). <article-title>Reinforcement learning</article-title>. <source>Adapt. Learn. Optim.</source> <volume>12</volume>, <fpage>729</fpage>.</citation>
</ref>
<ref id="B171">
<citation citation-type="confproc">
<person-group person-group-type="author">
<name>
<surname>Woeginger</surname>
<given-names>G. J.</given-names>
</name>
</person-group> (<year>2003</year>). &#x201c;<article-title>Exact algorithms for np-hard problems: a survey</article-title>,&#x201d; in <conf-name>Combinatorial Optimization&#x2014;Eureka, You Shrink! Papers Dedicated to Jack Edmonds 5th International Workshop</conf-name>, <conf-loc>Aussois, France</conf-loc>, <conf-date>March 5&#x2013;9, 2001</conf-date> (<publisher-name>Springer</publisher-name>), <fpage>185</fpage>&#x2013;<lpage>207</lpage>.</citation>
</ref>
<ref id="B172">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Xie</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Gao</surname>
<given-names>L.</given-names>
</name>
<name>
<surname>Peng</surname>
<given-names>K.</given-names>
</name>
<name>
<surname>Li</surname>
<given-names>X.</given-names>
</name>
<name>
<surname>Li</surname>
<given-names>H.</given-names>
</name>
</person-group> (<year>2019</year>). <article-title>Review on flexible job shop scheduling</article-title>. <source>IET Collab. Intell. Manuf.</source> <volume>1</volume>, <fpage>67</fpage>&#x2013;<lpage>77</lpage>. <pub-id pub-id-type="doi">10.1049/iet-cim.2018.0009</pub-id>
</citation>
</ref>
<ref id="B173">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Xiong</surname>
<given-names>H.</given-names>
</name>
<name>
<surname>Shi</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Ren</surname>
<given-names>D.</given-names>
</name>
<name>
<surname>Hu</surname>
<given-names>J.</given-names>
</name>
</person-group> (<year>2022</year>). <article-title>A survey of job shop scheduling problem: the types and models</article-title>. <source>Comput. Operations Res.</source> <volume>142</volume>, <fpage>105731</fpage>. <pub-id pub-id-type="doi">10.1016/j.cor.2022.105731</pub-id>
</citation>
</ref>
<ref id="B174">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Xu</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Pi</surname>
<given-names>D.</given-names>
</name>
</person-group> (<year>2020</year>). <article-title>A reinforcement learning-based communication topology in particle swarm optimization</article-title>. <source>Neural Comput. Appl.</source> <volume>32</volume>, <fpage>10007</fpage>&#x2013;<lpage>10032</lpage>. <pub-id pub-id-type="doi">10.1007/s00521-019-04527-9</pub-id>
</citation>
</ref>
<ref id="B175">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Yang</surname>
<given-names>C.</given-names>
</name>
<name>
<surname>Ding</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Jin</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Wang</surname>
<given-names>C.</given-names>
</name>
<name>
<surname>Chai</surname>
<given-names>T.</given-names>
</name>
</person-group> (<year>2019</year>). <article-title>Multitasking multiobjective evolutionary operational indices optimization of beneficiation processes</article-title>. <source>IEEE Trans. Automation Sci. Eng.</source> <volume>16</volume>, <fpage>1046</fpage>&#x2013;<lpage>1057</lpage>. <pub-id pub-id-type="doi">10.1109/tase.2018.2865593</pub-id>
</citation>
</ref>
<ref id="B176">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Yi</surname>
<given-names>J.-H.</given-names>
</name>
<name>
<surname>Xing</surname>
<given-names>L.-N.</given-names>
</name>
<name>
<surname>Wang</surname>
<given-names>G.-G.</given-names>
</name>
<name>
<surname>Dong</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Vasilakos</surname>
<given-names>A. V.</given-names>
</name>
<name>
<surname>Alavi</surname>
<given-names>A. H.</given-names>
</name>
<etal/>
</person-group> (<year>2020</year>). <article-title>Behavior of crossover operators in NSGA-III for large-scale optimization problems</article-title>. <source>Inf. Sci.</source> <volume>509</volume>, <fpage>470</fpage>&#x2013;<lpage>487</lpage>. <pub-id pub-id-type="doi">10.1016/j.ins.2018.10.005</pub-id>
</citation>
</ref>
<ref id="B177">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Yi</surname>
<given-names>W.</given-names>
</name>
<name>
<surname>Qu</surname>
<given-names>R.</given-names>
</name>
<name>
<surname>Jiao</surname>
<given-names>L.</given-names>
</name>
<name>
<surname>Niu</surname>
<given-names>B.</given-names>
</name>
</person-group> (<year>2023</year>). <article-title>Automated design of metaheuristics using reinforcement learning within a novel general search framework</article-title>. <source>IEEE Trans. Evol. Comput.</source> <volume>27</volume>, <fpage>1072</fpage>&#x2013;<lpage>1084</lpage>. <pub-id pub-id-type="doi">10.1109/tevc.2022.3197298</pub-id>
</citation>
</ref>
<ref id="B178">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Ying</surname>
<given-names>K.-C.</given-names>
</name>
<name>
<surname>Lin</surname>
<given-names>S.-W.</given-names>
</name>
</person-group> (<year>2018</year>). <article-title>Minimizing makespan for the distributed hybrid flowshop scheduling problem with multiprocessor tasks</article-title>. <source>Expert Syst. Appl.</source> <volume>92</volume>, <fpage>132</fpage>&#x2013;<lpage>141</lpage>. <pub-id pub-id-type="doi">10.1016/j.eswa.2017.09.032</pub-id>
</citation>
</ref>
<ref id="B179">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Ying</surname>
<given-names>K.-C.</given-names>
</name>
<name>
<surname>Pourhejazy</surname>
<given-names>P.</given-names>
</name>
<name>
<surname>Cheng</surname>
<given-names>C.-Y.</given-names>
</name>
<name>
<surname>Syu</surname>
<given-names>R.-S.</given-names>
</name>
</person-group> (<year>2023</year>). <article-title>Supply chain-oriented permutation flowshop scheduling considering flexible assembly and setup times</article-title>. <source>Int. J. Prod. Res.</source> <volume>61</volume>, <fpage>258</fpage>&#x2013;<lpage>281</lpage>. <pub-id pub-id-type="doi">10.1080/00207543.2020.1842938</pub-id>
</citation>
</ref>
<ref id="B180">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Yue</surname>
<given-names>L.</given-names>
</name>
<name>
<surname>Wang</surname>
<given-names>H.</given-names>
</name>
<name>
<surname>Mumtaz</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Rauf</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Li</surname>
<given-names>Z.</given-names>
</name>
</person-group> (<year>2023</year>). <article-title>Energy-efficient scheduling of a two-stage flexible printed circuit board flow shop using a hybrid pareto spider monkey optimisation algorithm</article-title>. <source>J. Industrial Inf. Integration</source> <volume>31</volume>, <fpage>100412</fpage>. <pub-id pub-id-type="doi">10.1016/j.jii.2022.100412</pub-id>
</citation>
</ref>
<ref id="B181">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Zhan</surname>
<given-names>Z.-H.</given-names>
</name>
<name>
<surname>Li</surname>
<given-names>J.-Y.</given-names>
</name>
<name>
<surname>Kwong</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Zhang</surname>
<given-names>J.</given-names>
</name>
</person-group> (<year>2023</year>). <article-title>Learning-aided evolution for optimization</article-title>. <source>IEEE Trans. Evol. Comput.</source> <volume>27</volume>, <fpage>1794</fpage>&#x2013;<lpage>1808</lpage>. <pub-id pub-id-type="doi">10.1109/tevc.2022.3232776</pub-id>
</citation>
</ref>
<ref id="B182">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Zhang</surname>
<given-names>B.</given-names>
</name>
<name>
<surname>Pan</surname>
<given-names>Q.-k.</given-names>
</name>
<name>
<surname>Meng</surname>
<given-names>L.-l.</given-names>
</name>
<name>
<surname>Lu</surname>
<given-names>C.</given-names>
</name>
<name>
<surname>Mou</surname>
<given-names>J.-h.</given-names>
</name>
<name>
<surname>Li</surname>
<given-names>J.-q.</given-names>
</name>
</person-group> (<year>2022</year>). <article-title>An automatic multi-objective evolutionary algorithm for the hybrid flowshop scheduling problem with consistent sublots</article-title>. <source>Knowledge-Based Syst.</source> <volume>238</volume>, <fpage>107819</fpage>. <pub-id pub-id-type="doi">10.1016/j.knosys.2021.107819</pub-id>
</citation>
</ref>
<ref id="B183">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Zhang</surname>
<given-names>C.</given-names>
</name>
<name>
<surname>Song</surname>
<given-names>W.</given-names>
</name>
<name>
<surname>Cao</surname>
<given-names>Z.</given-names>
</name>
<name>
<surname>Zhang</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Tan</surname>
<given-names>P. S.</given-names>
</name>
<name>
<surname>Chi</surname>
<given-names>X.</given-names>
</name>
</person-group> (<year>2020</year>). <article-title>Learning to dispatch for job shop scheduling via deep reinforcement learning</article-title>. <source>Adv. Neural Inf. Process. Syst.</source> <volume>33</volume>, <fpage>1621</fpage>&#x2013;<lpage>1632</lpage>.</citation>
</ref>
<ref id="B184">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Zhang</surname>
<given-names>G.</given-names>
</name>
<name>
<surname>Gao</surname>
<given-names>L.</given-names>
</name>
<name>
<surname>Shi</surname>
<given-names>Y.</given-names>
</name>
</person-group> (<year>2011a</year>). <article-title>An effective genetic algorithm for the flexible job-shop scheduling problem</article-title>. <source>Expert Syst. Appl.</source> <volume>38</volume>, <fpage>3563</fpage>&#x2013;<lpage>3573</lpage>. <pub-id pub-id-type="doi">10.1016/j.eswa.2010.08.145</pub-id>
</citation>
</ref>
<ref id="B185">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Zhang</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Zhan</surname>
<given-names>Z.-h.</given-names>
</name>
<name>
<surname>Lin</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Chen</surname>
<given-names>N.</given-names>
</name>
<name>
<surname>Gong</surname>
<given-names>Y. J.</given-names>
</name>
<name>
<surname>Zhong</surname>
<given-names>J.-h.</given-names>
</name>
<etal/>
</person-group> (<year>2011b</year>). <article-title>Evolutionary computation meets machine learning: a survey</article-title>. <source>IEEE Comput. Intell. Mag.</source> <volume>6</volume>, <fpage>68</fpage>&#x2013;<lpage>75</lpage>. <pub-id pub-id-type="doi">10.1109/mci.2011.942584</pub-id>
</citation>
</ref>
<ref id="B186">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Zhang</surname>
<given-names>Q.</given-names>
</name>
<name>
<surname>Li</surname>
<given-names>H.</given-names>
</name>
</person-group> (<year>2007</year>). <article-title>MOEA/D: a multiobjective evolutionary algorithm based on decomposition</article-title>. <source>IEEE Trans. Evol. Comput.</source> <volume>11</volume>, <fpage>712</fpage>&#x2013;<lpage>731</lpage>. <pub-id pub-id-type="doi">10.1109/tevc.2007.892759</pub-id>
</citation>
</ref>
<ref id="B187">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Zhang</surname>
<given-names>R.</given-names>
</name>
<name>
<surname>Wu</surname>
<given-names>C.</given-names>
</name>
</person-group> (<year>2010</year>). <article-title>A hybrid approach to large-scale job shop scheduling</article-title>. <source>Appl. Intell.</source> <volume>32</volume>, <fpage>47</fpage>&#x2013;<lpage>59</lpage>. <pub-id pub-id-type="doi">10.1007/s10489-008-0134-y</pub-id>
</citation>
</ref>
<ref id="B188">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Zhang</surname>
<given-names>W.</given-names>
</name>
<name>
<surname>Gen</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Jo</surname>
<given-names>J.</given-names>
</name>
</person-group> (<year>2014</year>). <article-title>Hybrid sampling strategy-based multiobjective evolutionary algorithm for process planning and scheduling problem</article-title>. <source>J. Intelligent Manuf.</source> <volume>25</volume>, <fpage>881</fpage>&#x2013;<lpage>897</lpage>. <pub-id pub-id-type="doi">10.1007/s10845-013-0814-2</pub-id>
</citation>
</ref>
<ref id="B189">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Zhang</surname>
<given-names>W.</given-names>
</name>
<name>
<surname>Geng</surname>
<given-names>H.</given-names>
</name>
<name>
<surname>Li</surname>
<given-names>C.</given-names>
</name>
<name>
<surname>Gen</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Zhang</surname>
<given-names>G.</given-names>
</name>
<name>
<surname>Deng</surname>
<given-names>M.</given-names>
</name>
</person-group> (<year>2023a</year>). <article-title>Q-learning-based multi-objective particle swarm optimization with local search within factories for energy-efficient distributed flow-shop scheduling problem</article-title>. <source>J. Intelligent Manuf.</source>, <fpage>1</fpage>&#x2013;<lpage>24</lpage>. <pub-id pub-id-type="doi">10.1007/s10845-023-02227-9</pub-id>
</citation>
</ref>
<ref id="B190">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Zhang</surname>
<given-names>W.</given-names>
</name>
<name>
<surname>Hou</surname>
<given-names>W.</given-names>
</name>
<name>
<surname>Li</surname>
<given-names>C.</given-names>
</name>
<name>
<surname>Yang</surname>
<given-names>W.</given-names>
</name>
<name>
<surname>Gen</surname>
<given-names>M.</given-names>
</name>
</person-group> (<year>2021a</year>). <article-title>Multidirection update-based multiobjective particle swarm optimization for mixed no-idle flow-shop scheduling problem</article-title>. <source>Complex Syst. Model. Simul.</source> <volume>1</volume>, <fpage>176</fpage>&#x2013;<lpage>197</lpage>. <pub-id pub-id-type="doi">10.23919/csms.2021.0017</pub-id>
</citation>
</ref>
<ref id="B191">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Zhang</surname>
<given-names>W.</given-names>
</name>
<name>
<surname>Li</surname>
<given-names>C.</given-names>
</name>
<name>
<surname>Gen</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Yang</surname>
<given-names>W.</given-names>
</name>
<name>
<surname>Zhang</surname>
<given-names>G.</given-names>
</name>
</person-group> (<year>2024</year>). <article-title>A multiobjective memetic algorithm with particle swarm optimization and q-learning-based local search for energy-efficient distributed heterogeneous hybrid flow-shop scheduling problem</article-title>. <source>Expert Syst. Appl.</source> <volume>237</volume>, <fpage>121570</fpage>. <pub-id pub-id-type="doi">10.1016/j.eswa.2023.121570</pub-id>
</citation>
</ref>
<ref id="B192">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Zhang</surname>
<given-names>W.</given-names>
</name>
<name>
<surname>Wang</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Yang</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Gen</surname>
<given-names>M.</given-names>
</name>
</person-group> (<year>2019</year>). <article-title>Hybrid multiobjective evolutionary algorithm based on differential evolution for flow shop scheduling problems</article-title>. <source>Comput. Industrial Eng.</source> <volume>130</volume>, <fpage>661</fpage>&#x2013;<lpage>670</lpage>. <pub-id pub-id-type="doi">10.1016/j.cie.2019.03.019</pub-id>
</citation>
</ref>
<ref id="B193">
<citation citation-type="confproc">
<person-group person-group-type="author">
<name>
<surname>Zhang</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Wang</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Zhang</surname>
<given-names>Z.</given-names>
</name>
<name>
<surname>Zhou</surname>
<given-names>Y.</given-names>
</name>
</person-group> (<year>2021b</year>). &#x201c;<article-title>Modrl/d-el: multiobjective deep reinforcement learning with evolutionary learning for multiobjective optimization</article-title>,&#x201d; in <conf-name>2021 International Joint Conference on Neural Networks (IJCNN)</conf-name>, <conf-loc>Shenzhen, China</conf-loc>, <conf-date>July 18-22, 2021</conf-date> (<publisher-name>IEEE</publisher-name>), <fpage>1</fpage>&#x2013;<lpage>8</lpage>.</citation>
</ref>
<ref id="B194">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Zhang</surname>
<given-names>Z.</given-names>
</name>
<name>
<surname>Tang</surname>
<given-names>Q.</given-names>
</name>
<name>
<surname>Chica</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Li</surname>
<given-names>Z.</given-names>
</name>
</person-group> (<year>2023c</year>). <article-title>Reinforcement learning-based multiobjective evolutionary algorithm for mixed-model multimanned assembly line balancing under uncertain demand</article-title>. <source>IEEE Trans. Cybern.</source>, <fpage>1</fpage>&#x2013;<lpage>14</lpage>. <pub-id pub-id-type="doi">10.1109/tcyb.2022.3229666</pub-id>
</citation>
</ref>
<ref id="B195">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Zhao</surname>
<given-names>F.</given-names>
</name>
<name>
<surname>Di</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Wang</surname>
<given-names>L.</given-names>
</name>
</person-group> (<year>2023a</year>). <article-title>A hyperheuristic with q-learning for the multiobjective energy-efficient distributed blocking flow shop scheduling problem</article-title>. <source>IEEE Trans. Cybern.</source> <volume>53</volume>, <fpage>3337</fpage>&#x2013;<lpage>3350</lpage>. <pub-id pub-id-type="doi">10.1109/tcyb.2022.3192112</pub-id>
</citation>
</ref>
<ref id="B196">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Zhao</surname>
<given-names>F.</given-names>
</name>
<name>
<surname>Jiang</surname>
<given-names>T.</given-names>
</name>
<name>
<surname>Wang</surname>
<given-names>L.</given-names>
</name>
</person-group> (<year>2023b</year>). <article-title>A reinforcement learning driven cooperative meta-heuristic algorithm for energy-efficient distributed no-wait flow-shop scheduling with sequence-dependent setup time</article-title>. <source>IEEE Trans. Industrial Inf.</source> <volume>19</volume>, <fpage>8427</fpage>&#x2013;<lpage>8440</lpage>. <pub-id pub-id-type="doi">10.1109/tii.2022.3218645</pub-id>
</citation>
</ref>
<ref id="B197">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Zhao</surname>
<given-names>F.</given-names>
</name>
<name>
<surname>Ma</surname>
<given-names>R.</given-names>
</name>
<name>
<surname>Wang</surname>
<given-names>L.</given-names>
</name>
</person-group> (<year>2022</year>). <article-title>A self-learning discrete jaya algorithm for multiobjective energy-efficient distributed no-idle flow-shop scheduling problem in heterogeneous factory system</article-title>. <source>IEEE Trans. Cybern.</source> <volume>52</volume>, <fpage>12675</fpage>&#x2013;<lpage>12686</lpage>. <pub-id pub-id-type="doi">10.1109/tcyb.2021.3086181</pub-id>
</citation>
</ref>
<ref id="B198">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Zhao</surname>
<given-names>F.</given-names>
</name>
<name>
<surname>Qin</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Zhang</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Ma</surname>
<given-names>W.</given-names>
</name>
<name>
<surname>Zhang</surname>
<given-names>C.</given-names>
</name>
<name>
<surname>Song</surname>
<given-names>H.</given-names>
</name>
</person-group> (<year>2019</year>). <article-title>A hybrid biogeography-based optimization with variable neighborhood search mechanism for no-wait flow shop scheduling problem</article-title>. <source>Expert Syst. Appl.</source> <volume>126</volume>, <fpage>321</fpage>&#x2013;<lpage>339</lpage>. <pub-id pub-id-type="doi">10.1016/j.eswa.2019.02.023</pub-id>
</citation>
</ref>
<ref id="B199">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Zhao</surname>
<given-names>F.</given-names>
</name>
<name>
<surname>Zhang</surname>
<given-names>L.</given-names>
</name>
<name>
<surname>Cao</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Tang</surname>
<given-names>J.</given-names>
</name>
</person-group> (<year>2021b</year>). <article-title>A cooperative water wave optimization algorithm with reinforcement learning for the distributed assembly no-idle flowshop scheduling problem</article-title>. <source>Comput. Industrial Eng.</source> <volume>153</volume>, <fpage>107082</fpage>. <pub-id pub-id-type="doi">10.1016/j.cie.2020.107082</pub-id>
</citation>
</ref>
<ref id="B200">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Zheng</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Wang</surname>
<given-names>L.</given-names>
</name>
<name>
<surname>Wang</surname>
<given-names>J.-j.</given-names>
</name>
</person-group> (<year>2020</year>). <article-title>A cooperative coevolution algorithm for multi-objective fuzzy distributed hybrid flow shop</article-title>. <source>Knowledge-Based Syst.</source> <volume>194</volume>, <fpage>105536</fpage>. <pub-id pub-id-type="doi">10.1016/j.knosys.2020.105536</pub-id>
</citation>
</ref>
<ref id="B201">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Zhou</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Chen</surname>
<given-names>H.</given-names>
</name>
<name>
<surname>Zhou</surname>
<given-names>G.</given-names>
</name>
</person-group> (<year>2014</year>). <article-title>Invasive weed optimization algorithm for optimization no-idle flow shop scheduling problem</article-title>. <source>Neurocomputing</source> <volume>137</volume>, <fpage>285</fpage>&#x2013;<lpage>292</lpage>. <pub-id pub-id-type="doi">10.1016/j.neucom.2013.05.063</pub-id>
</citation>
</ref>
<ref id="B202">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Zhou</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Kang</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Kwong</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Wang</surname>
<given-names>X.</given-names>
</name>
<name>
<surname>Zhang</surname>
<given-names>Q.</given-names>
</name>
</person-group> (<year>2021</year>). <article-title>An evolutionary multi-objective optimization framework of discretization-based feature selection for classification</article-title>. <source>Swarm Evol. Comput.</source> <volume>60</volume>, <fpage>100770</fpage>. <pub-id pub-id-type="doi">10.1016/j.swevo.2020.100770</pub-id>
</citation>
</ref>
<ref id="B203">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Zitzler</surname>
<given-names>E.</given-names>
</name>
<name>
<surname>Knowles</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Thiele</surname>
<given-names>L.</given-names>
</name>
</person-group> (<year>2008</year>). <article-title>Quality assessment of pareto set approximations</article-title>. <source>Multiobjective Optim. Interact. Evol. Approaches</source>, <fpage>373</fpage>&#x2013;<lpage>404</lpage>.</citation>
</ref>
<ref id="B204">
<citation citation-type="confproc">
<person-group person-group-type="author">
<name>
<surname>Zitzler</surname>
<given-names>E.</given-names>
</name>
<name>
<surname>K&#xfc;nzli</surname>
<given-names>S.</given-names>
</name>
</person-group> (<year>2004</year>). &#x201c;<article-title>Indicator-based selection in multiobjective search</article-title>,&#x201d; in <conf-name>International Conference on Parallel Problem Solving from Nature</conf-name>, <conf-loc>Birmingham, United Kingdom</conf-loc>, <conf-date>18-22 September, 2004</conf-date> (<publisher-name>Springer</publisher-name>), <fpage>832</fpage>&#x2013;<lpage>842</lpage>.</citation>
</ref>
<ref id="B205">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Zitzler</surname>
<given-names>E.</given-names>
</name>
<name>
<surname>Laumanns</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Thiele</surname>
<given-names>L.</given-names>
</name>
</person-group> (<year>2001</year>). <article-title>SPEA2: improving the strength pareto evolutionary algorithm</article-title>. <source>TIK-Report</source> <volume>103</volume>. <pub-id pub-id-type="doi">10.3929/ethz-a-004284029</pub-id>
</citation>
</ref>
</ref-list>
</back>
</article>