Review

Distributed shop scheduling: A comprehensive review on classifications, models and algorithms


  • In the intelligent manufacturing environment, modern industry is developing at a faster pace, and there is an urgent need for reasonable production scheduling to ensure an organized production order and a dependable production guarantee for enterprises. Additionally, production cooperation between enterprises and different branches of enterprises is increasingly common, and distributed manufacturing has become a prevalent production model. In light of these developments, this paper presents the research background and current state of distributed shop scheduling. It summarizes relevant research on issues that align with the new manufacturing model, explores hot topics and concerns and focuses on the classification of distributed parallel machine scheduling, distributed flow shop scheduling, distributed job shop scheduling and distributed assembly shop scheduling. The paper investigates these scheduling problems in terms of single-objective and multi-objective optimization, as well as processing constraints. It also summarizes the relevant optimization algorithms and their limitations. It also provides an overview of research methods and objects, highlighting the development of solution methods and research trends for new problems. Finally, the paper analyzes future research directions in this field.

    Citation: Jianguo Duan, Mengting Wang, Qinglei Zhang, Jiyun Qin. Distributed shop scheduling: A comprehensive review on classifications, models and algorithms[J]. Mathematical Biosciences and Engineering, 2023, 20(8): 15265-15308. doi: 10.3934/mbe.2023683

    Related Papers:

    [1] Masoud Saade, Samiran Ghosh, Malay Banerjee, Vitaly Volpert . An epidemic model with time delays determined by the infectivity and disease durations. Mathematical Biosciences and Engineering, 2023, 20(7): 12864-12888. doi: 10.3934/mbe.2023574
    [2] Sarita Bugalia, Jai Prakash Tripathi, Hao Wang . Mathematical modeling of intervention and low medical resource availability with delays: Applications to COVID-19 outbreaks in Spain and Italy. Mathematical Biosciences and Engineering, 2021, 18(5): 5865-5920. doi: 10.3934/mbe.2021295
    [3] Mostafa Adimy, Abdennasser Chekroun, Claudia Pio Ferreira . Global dynamics of a differential-difference system: a case of Kermack-McKendrick SIR model with age-structured protection phase. Mathematical Biosciences and Engineering, 2020, 17(2): 1329-1354. doi: 10.3934/mbe.2020067
    [4] Dongmei Li, Bing Chai, Weihua Liu, Panpan Wen, Ruixue Zhang . Qualitative analysis of a class of SISM epidemic model influenced by media publicity. Mathematical Biosciences and Engineering, 2020, 17(5): 5727-5751. doi: 10.3934/mbe.2020308
    [5] Lin Zhao, Zhi-Cheng Wang, Liang Zhang . Threshold dynamics of a time periodic and two–group epidemic model with distributed delay. Mathematical Biosciences and Engineering, 2017, 14(5&6): 1535-1563. doi: 10.3934/mbe.2017080
    [6] J. Amador, D. Armesto, A. Gómez-Corral . Extreme values in SIR epidemic models with two strains and cross-immunity. Mathematical Biosciences and Engineering, 2019, 16(4): 1992-2022. doi: 10.3934/mbe.2019098
    [7] Edoardo Beretta, Dimitri Breda . An SEIR epidemic model with constant latency time and infectious period. Mathematical Biosciences and Engineering, 2011, 8(4): 931-952. doi: 10.3934/mbe.2011.8.931
    [8] Sarafa A. Iyaniwura, Rabiu Musa, Jude D. Kong . A generalized distributed delay model of COVID-19: An endemic model with immunity waning. Mathematical Biosciences and Engineering, 2023, 20(3): 5379-5412. doi: 10.3934/mbe.2023249
    [9] Majid Jaberi-Douraki, Seyed M. Moghadas . Optimal control of vaccination dynamics during an influenza epidemic. Mathematical Biosciences and Engineering, 2014, 11(5): 1045-1063. doi: 10.3934/mbe.2014.11.1045
    [10] Kenji Itao, Fumiya Omata, Yoshitaka Nishikawa, Tetsuro Oda, Toshiharu Sasaki, Cherri Zhang, John Solomon Maninang, Takayuki Yamaguchi . Threshold phenomena with respect to the initiation of depopulation in a simple model of foot-and-mouth disease. Mathematical Biosciences and Engineering, 2019, 16(5): 5931-5946. doi: 10.3934/mbe.2019297
  • In the intelligent manufacturing environment, modern industry is developing at a faster pace, and there is an urgent need for reasonable production scheduling to ensure an organized production order and a dependable production guarantee for enterprises. Additionally, production cooperation between enterprises and different branches of enterprises is increasingly common, and distributed manufacturing has become a prevalent production model. In light of these developments, this paper presents the research background and current state of distributed shop scheduling. It summarizes relevant research on issues that align with the new manufacturing model, explores hot topics and concerns and focuses on the classification of distributed parallel machine scheduling, distributed flow shop scheduling, distributed job shop scheduling and distributed assembly shop scheduling. The paper investigates these scheduling problems in terms of single-objective and multi-objective optimization, as well as processing constraints. It also summarizes the relevant optimization algorithms and their limitations. It also provides an overview of research methods and objects, highlighting the development of solution methods and research trends for new problems. Finally, the paper analyzes future research directions in this field.



    Mathematical modeling plays a crucial role in comprehending the transmission dynamics of infectious diseases, predicting the future trajectory of outbreaks, and assessing strategies for epidemic control [1]. Its significance has been underscored by successive epidemics of viral infections, such as HIV since the 1980s [2,3], the SARS epidemic in 2002–2003 [4,5], H5N1 influenza in 2005 [6,7], H1N1 in 2009 [8,9], Ebola in 2014 [10,11], and the recent COVID-19 pandemic [12,13].

    Following the classical SIR (susceptible-infected-recovered) model developed by Kermack and McKendrick after the Spanish flu epidemic [14], several notable advancements have been made in epidemiological modeling. These advancements include the development of multi-compartment models [15,16,17,18,19], models incorporating either time-varying or non-linear disease transmission rates [20,21], multi-patch models [22,23], and multi-group models that consider the effect of disease and population heterogeneity [24]. Additionally, there are epidemic models that incorporate vaccinations and other control measures [25,26,27,28,29,30]. Moreover, spatio-temporal models have been employed to describe the random movement of individuals and the spatial distribution of infections [31,32]. In [33], the authors investigated a model that integrated asymptomatic and dead-infective subpopulations, along with vaccination, antiviral treatment controls, and impulsive culling actions. Reference [34] is devoted to multiple pathogen interactions in disease transmission with a susceptible-infected-susceptible (SIS) model for each pathogen. For a comprehensive review of the literature, monographs [35,36] and review articles in [37,38] are available.

    Time delays related to infection latency, disease duration and immunity waning directly influence disease transmission dynamics, response strategies, and the overall control of infectious outbreaks [39,40,41,42]. Despite advancements, limited research has been conducted on the impact of time delays in recovery and death rates within epidemiological models. In [43], the authors introduced a compartmental epidemiological model that incorporated distributed recovery and death rates. Under certain assumptions, this model can be reduced to the conventional SIR model. However, in most cases, the dynamics of the epidemic progression in this new model exhibit notable distinctions. To determine the distributed recovery and death rates, the authors evaluated COVID-19 data. By validating the model with epidemiological data from various countries, it demonstrated an improved agreement with the data compared to the SIR model. Furthermore, the authors estimated the time-dependent disease transmission rate. In [44], the authors utilized the average disease duration as the delay parameter to introduce a time delay in the recovery and death rates. The distributed model was discussed, and a delay model was derived. Epidemic characterization of the delay model was obtained. A numerical comparison was conducted among the distributed model, delay model, and conventional SIR model. Additionally, a method to estimate the disease duration using real disease incidence data was presented. The authors validated the delay model using epidemiological data from the COVID-19 epidemic and discussed the main outcomes and epidemiological implications of the proposed model. Moreover, apart from [44], the model proposed in [45] incorporated the infectivity period and disease duration instead of the incubation period, and did not include mandatory quarantine. This model considered the presence of exposed individuals and incorporated two time delays, namely the infectivity and disease duration.

    In this study, we investigate epidemic models of either two viruses or viral strains. In the first model, we consider the presence of two viral strains, assuming that individuals recovered from either strain developed immunity to both strains. In the second model, we explore the scenario where individuals who have recovered from the first strain can be infected by the second strain, and similarly, individuals who have recovered from the second strain can be infected by the first strain. Here, we use the aforementioned modeling approach, based on distributed and point-wise delays in recovery and death rates.

    The paper is structured as follows. In the first part, we introduce the model with distributed recovery and death rates in the presence of cross-immunity. We thoroughly examine the positiveness of solutions. Next, we reduce the distributed model to a conventional ODE model. Subsequently, we derive the delay model from the distributed model. Additionally, we determine the characteristics of epidemic progression for the delay model. Moreover, this structure is followed for the model without cross-immunity. The main outcomes of the proposed models and their epidemiological implications are discussed in the concluding section.

    The recovery and death rates of infected individuals are influenced by the time elapsed since the onset of the disease. In this section, we will develop a model that takes the number of newly infected individuals and their time-dependent recovery and death rates into account [45]. We will examine various characteristics of this model and demonstrate that the conventional SIR model can be derived from the model under certain assumptions [43,44,45].

    The following compartments of the total population N are considered:

    S(t) - susceptible individuals. They are not infected and can contract the disease.

    I1(t) - infected of the first viral strain. They are infectious and can transmit disease.

    I2(t) - infected of the second viral strain. They are infectious and can transmit disease.

    R1(t) - recovered from the first viral strain. They have recovered from the infection and are no longer infected. They are immune to both strains.

    R2(t) - recovered from the second viral strain. They have recovered from the infection and are no longer infected. They are immune to both strains.

    D1(t) - deceased from the first viral strain.

    D2(t) - deceased from the second viral strain.

    We will use the following parameters and functions:

    ● The transmission rate of the first viral strain is denoted as β1, while the transmission rate of the second viral strain is denoted as β2.

    ● As a function of time since infection η, the recovery rate of individuals infected with the first viral strain is represented by r1(η). Similarly, as a function of time since infection η, the recovery rate of individuals infected with the second viral strain, is represented by r2(η).

    ● As a function of time since infection η, the mortality rate of the first viral strain is denoted as d1(η). Likewise, the mortality rate of the second viral strain is represented by d2(η).

    ● The number of newly infected individuals by the first viral strain and the second viral strain, denoted as J1(t) and J2(t), respectively, is determined by the relations J1(t)=(β1SI1)/N and J2(t)=(β2SI2)/N, respectively.

    ● The total number of individuals who have recovered from the first viral strain and the second viral strain at time t is represented by t0r1(tη)J1(η)dη and t0r2(tη)J2(η)dη, respectively.

    ● The total number of individuals who have died from the first viral strain and the second viral strain at time t is represented by t0d1(tη)J1(η)dη and t0d2(tη)J2(η)dη, respectively.

    The two-strain model with distributed recovery and death rates has the following form:

    dSdt=J1(t)J2(t), (2.1)
    dI1dt=J1(t)t0r1(tη)J1(η)dηt0d1(tη)J1(η)dη, (2.2)
    dI2dt=J2(t)t0r2(tη)J2(η)dηt0d2(tη)J2(η)dη, (2.3)
    dR1dt=t0r1(tη)J1(η)dη, (2.4)
    dR2dt=t0r2(tη)J2(η)dη, (2.5)
    dD1dt=t0d1(tη)J1(η)dη, (2.6)
    dD2dt=t0d2(tη)J2(η)dη. (2.7)

    The system is subject to the following initial condition:

    S(0)=S0>0,  I1(0)=I1,0>0,  I2(0)=I2,0>0,  R1(0)=R2(0)=D1(0)=D2(0)=0, (2.8)

    where I1,0 and I2,0 are sufficiently small as compared to N. We suppose that the total population is constant :

    N=S(t)+I1(t)+I2(t)+R1(t)+R2(t)+D1(t)+D2(t). (2.9)

    We establish the positiveness of the solution to this problem on a time interval t[0,T), where T(0,+). We assume that the recovery and death rates satisfy the following inequalities:

    t0η(r1(tη)+d1(tη))dη1, (2.10)
    t0η(r2(tη)+d2(tη))dη1, (2.11)

    for any η0 and t0>η. These assumptions dictate that the number of recoveries and deaths on a given time interval cannot exceed the whole population.

    Lemma 1. If conditions (2.10) and (2.11) are satisfied, then any solution of systems (2.1)–(2.7) with the initial condition (2.8) satisfies the inequality 0XN, where

    X{S(t),I1(t),I2(t),R1(t),R2(t),D1(t),D2(t)}.

    Proof. From Eq (2.1), we observe that if there exists a time t>0 such that S(t)=0, then dSdt|t=t=0. This implies that S(t)0 for t>0. By examining Eqs (2.4)–(2.7), we can deduce that R1(t), R2(t), D1(t), and D2(t) also remain positive for all values of t0. At t=0, we have J1(0)=β1S0I1,0/N>0 and J2(0)=β2S0I2,0/N>0. Let t0>0 be such that J1(t) and J2(t) remain non-negative for 0t<t0. Next, we have the following:

    I1(t0)=t00J1(t)dtR1(t0)D1(t0),I2(t0)=t00J2(t)dtR2(t0)D2(t0).

    Integrating Eqs (2.4)–(2.7) with respect to t from 0 to t0, and taking into account the initial conditions given in (2.8), we obtain the following:

    R1(t0)+D1(t0)=t00(t0(r1(tη)+d1(tη))J1(η)dη)dt,R2(t0)+D2(t0)=t00(t0(r2(tη)+d2(tη))J2(η)dη)dt.

    Changing the order of integration and taking the inequalities (2.10) and (2.11) into account, we discover the following:

    R1(t0)+D1(t0)=t00(t0η(r1(tη)+d1(tη))dt)J1(η)dηt00J1(η)dη, (2.12)
    R2(t0)+D2(t0)=t00(t0η(r2(tη)+d2(tη))dt)J2(η)dηt00J2(η)dη. (2.13)

    It follows from inequalities (2.12) and (2.13) that I1(t0) and I2(t0) are non-negative. Consequently, J1(t0) and J2(t0) are also non-negative. This implies that I1(t), I2(t), J1(t), and J2(t) remain non-negative for all t0. Furthermore, we have the relation (2.9). Hence, any solution to the system lies within the range of 0 and N, there by ensuring the non-negativity of the solution.

    In this section, we show how models (2.1)–(2.7) can be reduced to the conventional ODE model. We consider the recovery and death rates in the following form:

    r1(t)={r1,0 , 0t<τ10 , t>τ1,     d1(t)={d1,0 , 0t<τ10 , t>τ1, (2.14)
    r2(t)={r2,0 , 0t<τ20 , t>τ2,     d2(t)={d2,0 , 0t<τ20 , t>τ2. (2.15)

    The disease durations τ1 and τ2 and the parameters r1,0, r2,0, d1,0 and d2,0 are positive constants. By substituting these functions into Eqs (2.4)–(2.7), we obtain the following expressions:

    dR1dt=r1,0ttτ1J1(η)dη,   dD1dt=d1,0ttτ1J1(η)dη, (2.16)
    dR2dt=r2,0ttτ2J2(η)dη,   dD2dt=d2,0ttτ2J2(η)dη. (2.17)

    By integrating Eq (2.16) from tτ1 to t and Eq (2.17) from tτ2 to t, we obtain the following:

    R1(t)R1(tτ1)=r1,0ttτ1(ssτ1J1(η)dη)ds, (2.18)
    D1(t)D1(tτ1)=d1,0ttτ1(ssτ1J1(η)dη)ds, (2.19)
    R2(t)R2(tτ2)=r2,0ttτ2(ssτ2J2(η)dη)ds, (2.20)
    D2(t)D2(tτ2)=d2,0ttτ2(ssτ2J2(η)dη)ds. (2.21)

    Therefore,

    I1(t)=ttτ1J1(η)dη(R1(t)R1(tτ1))(D1(t)D1(tτ1)), (2.22)
    I2(t)=ttτ2J2(η)dη(R2(t)R2(tτ1))(D2(t)D2(tτ1)). (2.23)

    We note that (R1(t)R1(tτ1)) and (D1(t)D1(tτ1)) correspond to the number of individuals who have recovered and died from the first viral strain during the time interval (tτ1,t), respectively. Similarly, (R2(t)R2(tτ2)) and (D2(t)D2(tτ2)) represent the number of individuals who have recovered and died from the second viral strain during the time interval (tτ2,t), respectively. From Eqs (2.18)–(2.21), we have the following:

    I1(t)=ttτ1J1(η)dη(r1,0+d1,0)ttτ1(ssτ1J1(η)dη)ds, (2.24)
    I2(t)=ttτ2J2(η)dη(r2,0+d2,0)ttτ2(ssτ2J2(η)dη)ds. (2.25)

    Now, from (2.22)–(2.25),

    dI1dt=β1SNI1(r1,0+d1,0)ttτ1J1(η)dη=β1SNI1(r1,0+d1,0)[I1(t)+(r1,0+d1,0)ttτ1(ssτ1J1(η)dη)ds],dI2dt=β2SNI2(r2,0+d2,0)ttτ2J2(η)dη=β2SNI2(r2,0+d2,0)[I2(t)+(r2,0+d2,0)ttτ2(ssτ2J2(η)dη)ds].

    Under the assumption that (r1,0+d1,0) and (r2,0+d2,0) are sufficiently small, we can disregard the terms involving (r1,0+d1,0)2 and (r2,0+d2,0)2. Consequently, we obtain the following:

    dI1dtβ1SNI1(r1,0+d1,0)I1,dI2dtβ2SNI2(r2,0+d2,0)I2.

    In this case, the system represented by Eqs (2.1)–(2.7) is simplified to the following conventional ODE model:

    dSdt=β1SNI1β2SNI2,dI1dt=β1SNI1(r1,0+d1,0)I1,dI2dt=β2SNI2(r2,0+d2,0)I2,dR1dt=r1,0I1,    dR2dt=r2,0I2,dD1dt=d1,0I1,   dD2dt=d2,0I2.

    Therefore, assuming that the recovery and death rates have uniform distributions as given in Eqs (2.14) and (2.15), and that they are sufficiently small, we can reduce models (2.1)–(2.7) to the ODE model. However, it is important to note that, in general, these assumptions may not hold, and we can consider different distributions for recovery and death rates.

    Let us recall that the duration of the first disease is denoted by τ1, and the duration of the second disease by τ2. Additionally, suppose that individuals J1(tτ1) and J2(tτ2) infected at time tτ1 and tτ2, respectively, either recover or die at time t with certain probabilities. This assumption corresponds to the following choices for the functions r1(tη), r2(tη), d1(tη), and d2(tη):

    r1(tτ1)=r1,0δ(tητ1), r2(tτ2)=r2,0δ(tητ2),
    d1(tτ1)=d1,0δ(tητ1), d2(tτ2)=d2,0δ(tητ2),

    where r1,0, r2,0, d1,0, d2,0 are constants, r1,0+d1,0=1 and r2,0+d2,0=1, and δ is the Dirac delta-function. Then,

    dR1dt=t0r1(tη)J1(η)dη=r1,0t0δ(tητ1)J1(η)dη=r1,0J1(tτ1),
    dR2dt=t0r2(tη)J2(η)dη=r2,0t0δ(tητ2)J2(η)dη=r2,0J2(tτ2),
    dD1dt=t0d1(tη)J1(η)dη=d1,0t0δ(tητ1)J1(η)dη=d1,0J1(tτ1),
    dD2dt=t0d2(tη)J2(η)dη=d2,0t0δ(tητ2)J2(η)dη=d2,0J2(tτ2).

    Therefore, the systems (2.1)–(2.7) are reduced to the following delay model:

    dSdt=J1(t)J2(t), (3.1)
    dIidt=Ji(t)Ji(tτi),i=1,2, (3.2)
    dRidt=ri,0Ji(tτi),i=1,2, (3.3)
    dDidt=di,0Ji(tτi),i=1,2 (3.4)

    with J1(t)=J2(t)=0 for t<0.

    Let us consider Eq (3.2) for the infected compartments:

    dIidt=βiS(t)Ii(t)NβiS(tτi)Ii(tτi)N,    i=1,2. (3.5)

    To determine the basic reproduction numbers R01 and R02. We set S(t)=S(tτ1)=S(tτ2)=S0 since the number of susceptible individuals is close to its initial condition in the beginning of the epidemic. Then, according to (3.5), we have

    dIidt=βiS0N(Ii(t)Ii(tτi)),    i=1,2.

    Substituting Ii(t)=I0ieλit, i=1,2, we have for i=1,2

    λi=βiS0N(1eλiτi). (3.6)

    Let

    Gi(λi)=βiS0N(1eλiτi).

    It is evident that Eq (3.6) have solutions (i.e., λ1=λ2=0) and a non-zero solution, the sign of which is determined by Gi(0). Denote

    R0i=Gi(0)=βiS0τiN.

    Let R01>1 and R02>1. This means that G1(0)>1 and G2(0)>1. We see that G1(λ1) and G2(λ2) are increasing functions of λ1 and λ2, respectively, with G1(λ1)β1S0N as λ1 and G2(λ2)β2S0N as λ2. This implies that Eq (3.6) has positive solutions, (i.e., there exist λ1>0 and λ2>0 such that Gi(λi)=λi, i=1,2).

    If Gi(0)<1, then

    Gi(λi)=βiS0τiNeλiτi<1,

    for all λ10 and λ20. Hence, there is no positive solution to the equation Gi(λi)=λi, i=1,2. Consequently, the basic reproduction numbers can be expressed as follows:

    R0i=βiS0τiN,   i=1,2.

    Next, we aim to estimate the final size of the susceptible compartment S=limtS(t). Integrating (3.2), we obtain the following:

    I1(t)=ttτ1J1(η)dη,I2(t)=ttτ2J2(η)dη.

    From (3.1), we obtain the following:

    dS(t)dt=β1S(t)Nttτ1J1(η)dηβ2S(t)Nttτ2J2(η)dη.

    Then, integrating from 0 to , we obtain the following:

    ln(S0S)=β1N0(ttτ1J1(η)dη)dt+β2N0(ttτ2J2(η)dη)dt.

    Changing the order of integration, we obtain the following:

    ln(S0S)=β1N[0τ1(η+τ10J1(η)dt)dη+0(η+τ1ηJ1(η)dt)dη]+β2N[0τ2(η+τ20J2(η)dt)dη+0(η+τ2ηJ2(η)dt)dη].=β1N[0τ1(η+τ1)J1(η)dη+0τ1J1(η)dη]+β2N[0τ2(η+τ2)J2(η)dη+0τ2J2(η)dη].

    Now, integrating (3.1) from 0 to , we obtain the following:

    0(J1(η)+J2(η))dη=S0S.

    Since J1(t)=0 for all t[τ1,0] and J2(t)=0 for all t[τ2,0], then

    ln(S0S)=β1N0τ1J1(η)dη+β2N0τ2J2(η)dηmax(β1τ1S0N,β2τ2S0N)1S00(J1(η)+J2(η))dη.

    Thus, we obtain an upper bound for the final size:

    ln(S0S)max(R01,R02)(1SS0).

    In the same way, we obtain a lower bound for the final size:

    ln(S0S)min(R01,R02)(1SS0)

    Hence, we obtain a two-sided estimate for S:

    min(R01,R02)(1SS0)ln(S0S)max(R01,R02)(1SS0). (3.7)

    Let us recall that in the case of a single strain, there is an equation for S instead of the inequalities.

    For the delay models (3.1)–(3.4), we compare the maximum of infected by each virus. We chose the following values for the parameters: N=104, I1,0=I2,0=1, β2=0.2, r1,0=0.7, r2,0=0.6, d1,0=0.3, d2,0=0.4, τ1=15.7 and τ2=17.7.

    Figure 1 shows the number of infected individuals in time for each strain. In the first case, when R01>R02, the maximum of infected individuals is higher for the first strain. In the other case, when R01<R02, we obtain the same result. Therefore, the domination of the strains is not uniquely determined by the basic reproduction numbers but rather by the individual parameters.

    Figure 1.  The number of infected individuals by each strain for R01>R02 (left), R01<R02 (right). The values of parameters: N=104, I1,0=I2,0=1, β2=0.2, r1,0=0.7, r2,0=0.6, d1,0=0.3, d2,0=0.4, τ1=15.7 and τ2=17.7.

    Next, we choose the following values for the parameters: N=104, I1,0=I2,0=1, r1,0=0.7, r2,0=0.6, d1,0=0.3, d2,0=0.4, τ1=15.7 and τ2=17.7, and vary the values of β1 and β2 in the interval [0.1,0.5]. Figures 24 display the dependence of the maximal number of infected I1m and I2m, the time to the maximal number of infected for the first and the second virus and the total number of infected of the two virus of the models (3.1)–(3.4) on β1, β2.

    Figure 2.  Dependence of the maximal number of infected individuals by each strain on : (a) β1 for β2=0.2 (b) β2 for β1=0.25. Dependence of the maximal number of infected individuals on β1, β2 : (c) the first strain (d) the second strain. The values of parameters: N=104, I1,0=I2,0=1, r1,0=0.7, r2,0=0.6, d1,0=0.3, d2,0=0.4, τ1=15.7 and τ2=17.7.
    Figure 3.  (a) Dependence of the time to reach the maximal number of infected by each strain on β1 for β2=0.2. (b) Dependence of the time to reach the maximal number of infected on β1, β2 by the first strain. The values of parameters: N=104, I1,0=I2,0=1, r1,0=0.7, r2,0=0.6, d1,0=0.3, d2,0=0.4, τ1=15.7 and τ2=17.7.
    Figure 4.  Dependence of the total number of infected by each strain on : (a) β1 for β2=0.2 (b) β2 for β1=0.25. Dependence of the total number of infected on β1, β2 by : (c) the first strain (d) the second strain. The values of parameters: N=104, I1,0=I2,0=1, r1,0=0.7, r2,0=0.6, d1,0=0.3, d2,0=0.4, τ1=15.7 and τ2=17.7.

    Figure 2(a) shows when the transmission rate, β2, is fixed and the evolution of the epidemic peak is examined in relation to variations in β1. As β1 increases, the epidemic peak corresponding to the first virus also increases; for the second virus, the epidemic peak gradually decreases, and the number of individuals infected by the second virus decreases.

    In other words, when comparing the impact of the first and second virus by modifying the transmission rate of the first virus, while keeping the transmission rate of the second epidemic constant, we observe that the first virus becomes more prevalent and reaches a higher epidemic peak as the transmission rate increases. On the other hand, the second virus is gradually eliminated, and its epidemic peak decreases as the transmission rate of the first virus increases.

    It is interesting to note that in Figure 2(b), when β1 is fixed and β2 varies, we observe the opposite phenomenon. As β2 increases, the epidemic peak corresponding to the second virus also increases; while for the first virus, the epidemic peak gradually decreases. The last two graphs (c) and (d) present the variation of the epidemic peak for both viruses in relation to β1 and β2. These observations underscore the importance of the transmission rate in the spread of epidemics and how different values of β1 and β2 can influence the evolution of different epidemics.

    The relationship between the timing of the epidemic peak and β1 and β2 can be complex. For β1>β2, if the two viruses infect the same number of individuals, then the first strain reaches the maximum faster than the other. Additionally, if the difference between β1 and β2 is large, then we can expect that the difference between t1m and t2m is also large, though this is not the case here. If β1>β2, the first strain infects more individuals to reach the maximum though it is faster, and the second strain infects less individuals to reach the maximum, though it is slower. Therefore, if β1 is very large compared to β2, this does not imply that t1m will be very large compared to t2m. As a result, the difference between the transmission rates does not strongly influence the peak time. Thus, t1m is either equal or very close to t2m (see Figure 3).

    In terms of the dependence on β1 and β2 for the number of individuals affected by the first and second viruses, we can observe a similar phenomenon as seen in the epidemic peak (see Figure 4). As β1 increases, the number of individuals affected by the first virus tends to increase. This indicates that a higher transmission rate for the first virus leads to a larger population being infected by it compared to a larger population affected by the first virus. On the other hand, as β1 increases, the number of individuals affected by the second virus gradually decreases. This suggests that the second virus experiences a decline in its transmission and a lower number of individuals become infected by it.

    Similarly, when β2 is varied while keeping β1 constant, higher values of β2 can lead to an increase in the number of individuals affected by the second virus; alternatively, the number of individuals affected by the first virus may decrease.

    Finally, we estimate the inequality terms of (3.7). Let

    Sl=min(R01,R02)(1SS0),Sm=ln(S0S),Su=max(R01,R02)(1SS0).

    In Figure 5, we can see that the graph of Sm is very close to the graph of Su. This result suggests the following conjecture:

    ln(S0S)max(R01,R02)(1SS0).
    Figure 5.  Simulation of inequality terms (3.7) as a function of : (a) β1 for β2=0.2 (b) β2 for β1=0.25. The values of parameters: N=104, I1,0=I2,0=1, r1,0=0.7, r2,0=0.6, d1,0=0.3, d2,0=0.4, τ1=15.7 and τ2=17.7.

    In this section, we study a similar model assuming that individuals who have recovered from the first viral strain can be infected by the second viral strain, and individuals who have recovered from the second viral strain can be infected by the first viral strain.

    Let J12(t)=(ϵ1β2I2R1)/N represent the number of individuals who have previously recovered from the first viral strain and are newly infected with the second viral strain. Similarly, J21(t)=(ϵ2β1I1R2)/N represents the number of individuals who have previously recovered from the second viral strain and are newly infected with the first viral strain, where ϵ1 and ϵ2 are constants that indicate the level of cross-immunity. For ϵ1=ϵ2=0, there is complete cross-immunity. For ϵ1= ϵ2=1, there is the absence of cross-immunity. In this modified system, we introduce additional variables to account for individuals who have recovered from one strain and are subsequently infected with the other strain. Let us define the following variables:

    I12(t) - infected with the first viral strain initially and later infected with the second viral strain.

    I21(t) - infected with the second viral strain initially and later infected with the first viral strain.

    R12(t) - recovered from the first viral strain initially and later infected with the second viral strain, becoming immune to both strains.

    R21(t) - recovered from the second viral strain initially and later infected with the first viral strain, becoming immune to both strains.

    D12(t) - recovered from the first viral strain initially and later die due to the second viral strain.

    D21(t) - recovered from the second viral strain initially and later die due to the first viral strain.

    The individuals that are recovered and infected at time tη with the first viral strain and the second viral strain are represented by J21(tη) and J12(tη), respectively. With these additional variables, the system can be expressed as follows, using the same notations as in the second section :

    dSdt=J1(t)J2(t), (5.1)
    dI1dt=J1(t)t0r1(tη)J1(η)dηt0d1(tη)J1(η)dη, (5.2)
    dI2dt=J2(t)t0r2(tη)J2(η)dηt0d2(tη)J2(η)dη, (5.3)
    dR1dt=t0r1(tη)J1(η)dηJ12(t), (5.4)
    dR2dt=t0r2(tη)J2(η)dηJ21(t), (5.5)
    dI12dt=J12(t)t0r2(tη)J12(η)dηt0d2(tη)J12(η)dη, (5.6)
    dI21dt=J21(t)t0r1(tη)J21(η)dηt0d1(tη)J21(η)dη, (5.7)
    dR12dt=t0r2(tη)J12(η)dη, (5.8)
    dR21dt=t0r1(tη)J21(η)dη, (5.9)
    dD1dt=t0d1(tη)J1(η)dη, (5.10)
    dD2dt=t0d2(tη)J2(η)dη, (5.11)
    dD12dt=t0d2(tη)J12(η)dη, (5.12)
    dD21dt=t0d1(tη)J21(η)dη. (5.13)

    The system is subject to the following initial condition:

    S(0)=S0>0,  I1(0)=I1,0>0,  I2(0)=I2,0>0,  R1(0)=R2(0)=I12(0)=I21(0)=R12(0)=R21(0)=D1(0)=D2(0)=D12(0)=D21(0)=0, (5.14)

    where I1,0 and I2,0 are sufficiently small as compared to N. We assume that the total population is constant :

    N=S(t)+I1(t)+I2(t)+R1(t)+R2(t)+I12(t)+I21(t)+R12(t)+R21(t)+D1(t)+D2(t)+D12(t)+D21(t). (5.15)

    We prove the positivity of the solution to this problem on a time interval [0,T) where T(0,+). We make the assumption that the recovery and death rates satisfy the inequalities (2.10) and (2.11).

    Lemma 2. If conditions (2.10) and (2.11) are satisfied, then any solution of systems (5.1)–(5.13) with the initial condition (5.14) satisfies the inequality 0XN, where

    X{S(t),I1(t),I2(t),R1(t),R2(t),I12(t),I21(t),R12(t),R21(t),D1(t),D2(t),D12(t),D21(t)}.

    Proof. From Eq (5.1), we can observe that if there exists a t>0 such that S(t)=0, then dSdt|t=t=0. This implies that S(t)0 for t>0. Furthermore, based on Eqs (5.4), (5.5), and (5.8)–(5.13), we can conclude that R1(t), R2(t), R12(t), R21(t), D1(t), D2(t), D12(t), and D21(t) also remain positive for all values of t. At t=0, we have J1(0)=β1S0I1,0/N>0, J2(0)=β2S0I2,0/N>0 and J12(0)=J21(0)=0. Suppose t0>0 be such that J1(t), J2(t), J12(t), J21(t) remain non-negative for 0t<t0. Next, we have the following:

    I1(t0)=t00J1(t)dtR1(t0)D1(t0)t00J12(t)dt,I2(t0)=t00J2(t)dtR2(t0)D2(t0)t00J21(t)dt.

    By integrating (5.4), (5.5), (5.10) and (5.11) with respect to t from 0 to t0, and using the initial conditions given in (5.14), obtain the following:

    R1(t0)+D1(t0)=t00(t0(r1(tη)+d1(tη))J1(η)dη)dtt00J12(t)dt,R2(t0)+D2(t0)=t00(t0(r2(tη)+d2(tη))J2(η)dη)dtt00J21(t)dt.

    Changing the order of integration and using the inequalities (2.10) and (2.11), we observe the following:

    R1(t0)+D1(t0)=t00(t0η(r1(tη)+d1(tη))dt)J1(η)dηt00J12(t)dtt00J1(η)dηt00J12(t)dt, (5.16)
    R2(t0)+D2(t0)=t00(t0η(r2(tη)+d2(tη))dt)J2(η)dηt00J21(t)dtt00J2(η)dηt00J21(t)dt. (5.17)

    It follows from the inequalities (5.16) and (5.17) that I1(t0) and I2(t0) are both non-negative. Consequently, J1(t0), J2(t0), J12(t0) and J21(t0) are also non-negative. Thus, we have shown that I1(t), I2(t), J1(t), J2(t), J12(t) and J21(t) remain non-negative for all t0. On the other hand, we have the following:

    I12(t0)=t00J12(t)dtR12(t0)D12(t0),I21(t0)=t00J21(t)dtR21(t0)D21(t0).

    By integrating (5.8), (5.9), (5.12) and (5.13) with respect to t from 0 to t0 and using the initial conditions (5.14), we obtain the following:

    R12(t0)+D12(t0)=t00(t0(r2(tη)+d2(tη))J12(η)dη)dt,R21(t0)+D21(t0)=t00(t0(r1(tη)+d1(tη))J21(η)dη)dt.

    Changing the order of integration and using inequalities (2.10) and (2.11), we observe the following:

    R12(t0)+D12(t0)=t00(t0η(r2(tη)+d2(tη))dt)J12(η)dηt00J12(η)dη, (5.18)
    R21(t0)+D21(t0)=t00(t0η(r1(tη)+d1(tη))dt)J21(η)dηt00J21(η)dη. (5.19)

    It follows from the inequalities (5.18) and (5.19) that I12(t0) and I21(t0) are both non-negative. Consequently, I12(t) and I21(t) remain non-negative for all t0. Furthermore, we have (5.15). Thus, any solution of system (5.1)–(5.13) lies between 0 and N, thereby ensuring the non-negativity of the solution.

    In this section, we demonstrate that models (5.1)–(5.13) can be reduced to a conventional ODE model under certain assumptions. Let us assume that the recovery and death rates are given by the following functions :

    r1(t)={r1,0 , 0t<τ10 , t>τ1,     d1(t)={d1,0 , 0t<τ10 , t>τ1, (5.20)
    r2(t)={r2,0 , 0t<τ20 , t>τ2,     d2(t)={d2,0 , 0t<τ20 , t>τ2, (5.21)

    The disease durations τ1,τ2>0 and the parameters r1,0, r2,0, d1,0 and d2,0 are positive constants. By substituting these functions in (5.4), (5.5) and (5.8)–(5.13), we obtain the following:

    dR1dt=r1,0ttτ1J1(η)dηJ12(t),   dD1dt=d1,0ttτ1J1(η)dη, (5.22)
    dR2dt=r2,0ttτ2J2(η)dηJ21(t),   dD2dt=d2,0ttτ2J2(η)dη, (5.23)
    dR12dt=r2,0ttτ2J12(η)dη,   dD12dt=d2,0ttτ2J12(η)dη, (5.24)
    dR21dt=r1,0ttτ1J21(η)dη,   dD21dt=d1,0ttτ1J21(η)dη. (5.25)

    By integrating Eqs (5.22) and (5.25) from tτ1 to t, and Eqs (5.23) and (5.24) from tτ2 to t, we obtain the following:

    R1(t)R1(tτ1)=r1,0ttτ1(ssτ1J1(η)dη)dsttτ1J12(η)dη, (5.26)
    D1(t)D1(tτ1)=d1,0ttτ1(ssτ1J1(η)dη)ds, (5.27)
    R2(t)R2(tτ2)=r2,0ttτ2(ssτ2J2(η)dη)dsttτ2J21(η)dη, (5.28)
    D2(t)D2(tτ2)=d2,0ttτ2(ssτ2J2(η)dη)ds, (5.29)
    R21(t)R21(tτ1)=r1,0ttτ1(ssτ1J21(η)dη)ds, (5.30)
    D21(t)D21(tτ1)=d1,0ttτ1(ssτ1J21(η)dη)ds, (5.31)
    R12(t)R12(tτ2)=r2,0ttτ2(ssτ2J12(η)dη)ds, (5.32)
    D12(t)D12(tτ2)=d2,0ttτ2(ssτ2J12(η)dη)ds. (5.33)

    Thus,

    I1(t)=ttτ1J1(η)dη(R1(t)R1(tτ1))+ttτ1J12(η)dη(D1(t)D1(tτ1)), (5.34)
    I2(t)=ttτ2J2(η)dη(R2(t)R2(tτ2))+ttτ2J21(η)dη(D2(t)D2(tτ2)), (5.35)
    I21(t)=ttτ1J21(η)dη(R21(t)R21(tτ1))(D21(t)D21(tτ1)), (5.36)
    I12(t)=ttτ2J12(η)dη(R12(t)R12(tτ2))(D12(t)D12(tτ2)), (5.37)

    where (R1(t)R1(tτ1)) and (D1(t)D1(tτ1)) represent the number of individuals who have recovered and died from the first viral strain during the time interval (tτ1,t), respectively. Similarly, (R2(t)R2(tτ2)) and (D2(t)D2(tτ2)) represent the number of individuals who have recovered and died from the second viral strain during the time interval (tτ2,t), respectively. Moreover, the expressions (R21(t)R21(tτ1)), (R12(t)R12(tτ2)), (D21(t)D21(tτ1)), and (D12(t)D12(tτ2)) characterize the difference in the number of recovered and died individuals for two viral strains at different time intervals. Hence, from (5.26)–(5.33), we have the following:

    I1(t)=ttτ1J1(η)dη(r1,0+d1,0)ttτ1(ssτ1J1(η)dη)ds, (5.38)
    I2(t)=ttτ2J2(η)dη(r2,0+d2,0)ttτ2(ssτ2J2(η)dη)ds, (5.39)
    I21(t)=ttτ1J21(η)dη(r1,0+d1,0)ttτ1(ssτ1J21(η)dη)ds, (5.40)
    I12(t)=ttτ2J12(η)dη(r2,0+d2,0)ttτ2(ssτ2J12(η)dη)ds. (5.41)

    Now, from (5.38)–(5.41),

    dI1dt=β1SNI1(r1,0+d1,0)ttτ1J1(η)dη=β1SNI1(r1,0+d1,0)[I1(t)+(r1,0+d1,0)ttτ1(ssτ1J1(η)dη)ds], (5.42)
    dI2dt=β2SNI2(r2,0+d2,0)ttτ2J2(η)dη=β2SNI2(r2,0+d2,0)[I2(t)+(r2,0+d2,0)ttτ2(ssτ2J2(η)dη)ds], (5.43)
    dI21dt=ϵ2β1R2NI1(r1,0+d1,0)ttτ1J21(η)dη=ϵ2β1R2NI1(r1,0+d1,0)[I21(t)+(r1,0+d1,0)ttτ1(ssτ1J21(η)dη)ds], (5.44)
    dI12dt=ϵ1β2R1NI2(r2,0+d2,0)ttτ2J2(η)dη=ϵ1β2R1NI2(r2,0+d2,0)[I12(t)+(r2,0+d2,0)ttτ2(ssτ2J12(η)dη)ds]. (5.45)

    Assuming that (r1,0+d1,0) and (r2,0+d2,0) are small enough, we neglect the terms involving (r1,0+d1,0)2 and (r2,0+d2,0)2. Hence, we obtain the following:

    dI1dtβ1SNI1(r1,0+d1,0)I1, (5.46)
    dI2dtβ2SNI2(r2,0+d2,0)I2, (5.47)
    dI21dtϵ2β1R2NI1(r1,0+d1,0)I21, (5.48)
    dI12dtϵ1β2R1NI2(r2,0+d2,0)I12. (5.49)

    In this case, systems (5.1)–(5.13) is reduced to the following conventional ODE model:

    dSdt=β1SNI1β2SNI2,dI1dt=β1SNI1(r1,0+d1,0)I1,dI2dt=β2SNI2(r2,0+d2,0)I2,dR1dt=r1,0I1ϵ1β2R1NI2,dR2dt=r2,0I2ϵ2β1R2NI1,dI21dt=ϵ2β1R2NI1(r1,0+d1,0)I21,dI12dt=ϵ1β2R1NI2(r2,0+d2,0)I12,dR21dt=r1,0I21,   dR12dt=r2,0I12,dD1dt=d1,0I1,   dD2dt=d2,0I2,   dD21dt=d1,0I21,   dD12dt=d2,0I12.

    Therefore, if we assume that the recovery and death rates described in Eqs (5.20) and (5.21) follow uniform distributions and are sufficiently small, we can reduce the model given by Eqs (5.1)–(5.13) to the ODE model. However, in general, these assumptions may not hold. Another approximation of recovery and death rate distributions is considered in the next section.

    Let us recall that the duration of the first and the second disease are denoted by τ1 and τ2, respectively. Furthermore, suppose that individuals J1(tτ1) and J21(tτ1) infected at time tτ1 and individuals J2(tτ2) and J12(tτ2) infected at time tτ2, either recover or die at time t with certain probabilities. This assumption corresponds to the following choice of the functions r1(tη), r2(tη), d1(tη) and d2(tη):

    r1(tτ1)=r1,0δ(tητ1), r2(tτ2)=r2,0δ(tητ2),d1(tτ1)=d1,0δ(tητ1), d2(tτ2)=d2,0δ(tητ2),

    where r1,0, r2,0, d1,0, d2,0 are constants, r1,0+d1,0=1 and r2,0+d2,0=1, and δ is the Dirac delta-function. Then

    dR1dt=t0r1(tη)J1(η)dηJ12(t)=r1,0t0δ(tητ1)J1(η)dηJ12(t)=r1,0J1(tτ1)J12(t),dR2dt=t0r2(tη)J2(η)dηJ21(t)=r2,0t0δ(tητ2)J2(η)dηJ21(t)=r2,0J2(tτ2)J21(t),dR12dt=t0r2(tη)J12(η)dη=r2,0t0δ(tητ2)J12(η)dη=r2,0J12(tτ2),dR21dt=t0r1(tη)J21(η)dη=r1,0t0δ(tητ1)J21(η)dη=r1,0J21(tτ1),dD1dt=t0d1(tη)J1(η)dη=d1,0t0δ(tητ1)J1(η)dη=d1,0J1(tτ1),dD2dt=t0d2(tη)J2(η)dη=d2,0t0δ(tητ2)J2(η)dη=d2,0J2(tτ2),dD12dt=t0d2(tη)J12(η)dη=d2,0t0δ(tητ2)J12(η)dη=d2,0J12(tτ2),dD21dt=t0d1(tη)J21(η)dη=d1,0t0δ(tητ1)J21(η)dη=d1,0J21(tτ1).

    Therefore, systems (5.1)–(5.13) is reduced to the following delay model:

    dSdt=J1(t)J2(t), (6.1)
    dIidt=Ji(t)Ji(tτi),i=1,2, (6.2)
    dRidt=ri,0Ji(tτi)Jij(t),i,j=1,2,ji, (6.3)
    dIijdt=Jij(t)Jij(tτj),i,j=1,2,ji, (6.4)
    dRijdt=rj,0Jij(tτj),i,j=1,2,ji, (6.5)
    dDidt=di,0Ji(tτi),i=1,2, (6.6)
    dDijdt=dj,0Jij(tτj),i,j=1,2,ji (6.7)

    with J1(t)=J2(t)=J12(t)=J21(t)=0 for t<0.

    Using the arguments similar to those in Subsections 3.2 and 3.3, it can be demonstrated that the basic reproduction numbers can be expressed as follows:

    R0i=βiS0τiN,   i=1,2.

    Additionally, we obtain a two-sided estimate for S:

    min(R01,R02)(1SS0)ln(S0S)max(R01,R02)(1SS0).

    Using the Figure 5, we obtain the following:

    ln(S0S)max(R01,R02)(1SS0).

    For the delay models (6.1)–(6.7), we compare the maximum number of infected individuals and the timing of this peak, as well as the total number of infected individuals caused by each virus. We choose the following values for the parameters: population size N=104, initial infections I1,0=I2,0=1, delays τ1=15.7 and τ2=17.7, and transmission rates β1=0.25, β2=0.2 and the constants r1,0=0.7, r2,0=0.6, d1,0=0.3, d2,0=0.4. Additionally, we set ϵ1=0.8 and ϵ2=1.

    In the first infection, where β1>β2, Figure 6 shows that the maximal number of infected individuals during the first strain is higher than the maximal number of infected individuals observed during the second strain. In the second infection, it is worth noting that the maximum value of I21 is lower than the maximum value of I12 where, in this case, the maximum depends on the parameters β1, β2, ϵ1, ϵ2, r1,0 and r2,0.

    Figure 6.  The number of infected individuals by the first strain (left) and the second strain (right). The values of parameters: N=104, I1,0=I2,0=1, β1=0.25, β2=0.2, r1,0=0.7, r2,0=0.6, d1,0=0.3, d2,0=0.4, τ1=15.7 and τ2=17.7.
    Figure 7.  Dependence of the total number of infected by each strain on : (a) β1 for β2=0.2 (b) β2 for β1=0.25. Dependence of the total number of infected on β1, β2 by : (c) the first strain (d) the second strain. The values of parameters: N=104, I1,0=I2,0=1, r1,0=0.7, r2,0=0.6, d1,0=0.3, d2,0=0.4, τ1=15.7 and τ2=17.7.

    The maximum number of infected individuals behaves similarly to a single strain scenario, where the maximum is determined by the strain with the larger transmission rate (i.e, (I1+I21)m>(I2+I12)m). Furthermore, with regards to the timing of the maximum, the difference between the transmission rates does not strongly influence on the peak time. Thus, t1m is very close to t2m.

    Next, let us consider another set of parameters - N=104, I1,0=I2,0=1, r1,0=0.7, r2,0=0.6, d1,0=0.3, d2,0=0.4, τ1=15.7, τ2=17.7 - and vary the values of β1 and β2 within the range of [0.1,0.5]. During the first infection with a fixed transmission rate β2 (β2<β1), increasing the transmission rate β1 causes the total number of individuals infected by the first strain (R1f+D1f) to approach the entire population N, while the total number of individuals infected by the second strain (R2f+D2f) diminishes significantly, nearly reaching zero. Conversely, with a fixed transmission rate β1 (β1<β2), by increasing the transmission rate β2, the total number of individuals infected by the second strain (R2f+D2f) approaches the entire population N, while the total number of individuals infected by the first strain (R1f+D1f) decreases significantly, nearly reaching zero. Notably, 70 of those infected by the first strain and 60 of those infected by the second strain have recovered.

    In the second infection, by increasing the transmission rate β1 (β2<β1), the total number of individuals infected by the second strain (R12f+D12f) approaches 70 of the total population N, while the total number of individuals infected by the first strain (R21f+D21f) approaches a very small value close to zero. On the other hand, increasing the transmission rate β2 (β1<β2) causes the total number of individuals infected by the first strain (R21f+D21f) to approach 60 of the total population N, while the total number of individuals infected by the second strain (R12f+D12f) approaches a very small value close to zero.

    Consequently, if β1 is increased, then the number of individuals affected by the first virus (R1f+D1f+R21f+D21f) also increases. This indicates that a higher transmission rate for the first virus leads to a larger proportion of the population being infected by it.

    Conversely, with an increase in β1, the number of individuals affected by the second virus (R2f+D2f+R12f+D12f) gradually decreases. This suggests that the transmission of the second virus diminishes, thereby resulting in a lower number of individuals becoming infected by it.

    Similarly, when β2 is changed while keeping β1 constant, increasing β2 can lead to a higher number of individuals being affected by the second virus, while the number of individuals affected by the first virus may decrease. Note that the total number of infected individuals exceeds the total population because there are individuals who have been infected by both strain.

    In this paper we introduced two epidemiological models, each of which described the dynamics of the dual viral strain SIRD model with distributed recovery and death rates to track the impact of multiple strains variants during an epidemic. In the first model, some individuals may be infected by the first strain and others by the second strain. Furthermore, individuals who have recovered from either strain develop immunity to both strains. In the second model, we explored the scenario where individuals who have recovered from the first strain can be infected by the second strain, and similarly, individuals who have recovered from the second strain can be infected by the first strain.

    The proposed distributed delay models, represented by integro-differential equations, offer a more accurate description of epidemic dynamics. However, these models are relatively complex and require knowledge of distributed recovery and death rates, which may not be readily available in the literature. To compensate this disadvantage of the distributed models, we derived two simplified models from each model to address different limiting cases. In the first case, assuming that the recovery and death rates are uniformly distributed, we obtained a conventional compartmental ODE model. In the second case, considering the recovery and death rate distributions as delta-function, we obtained a novel delay model that has not been previously explored in the epidemiological literature. As mentioned in [43,44,45], since distributed recovery and death rates are commonly described by a Gamma-distribution, approximating them with a delta-function can provide a more accurate representation, especially in capturing the dynamics during the initial phase of infection. The point-wise delay models, based on the duration of the disease and known recovery and death rates, provide a simple and biologically meaningful representation of epidemics.

    For these delay model we determined the reproduction numbers for each strain R0j,  j=1,2. We employed these delay models to perform a numerical comparison of the maximum number of infected individuals, the peak timing and the total number of infected cases by each virus. This analysis was conducted by utilizing the final size of the recovered and deceased individuals. The transmission rates of the diseases played a crucial role in determining these outcomes, as they significantly influenced the dynamics of the epidemics being studied.

    We compared the two models with and without cross-immunity. The maximum number of infected individuals in the model without cross-immunity was higher than in the other model because there were individuals who had been infected with both viruses. The timing of the maximum was either equal or very close between the two models. In the model without cross-immunity, the total number of infected individuals surpassed the total population because some individuals could be infected by both strains simultaneously. As a consequence, the number of infected individuals would be higher compared to the total number of infected individuals in the other model (with cross-immunity). As result, cross-immunity between the two viruses can significantly reduce their global spread. Individuals already immunized against one of the viruses would decrease the total number of cases of diseases caused by these pathogens. If a large part of the population acquires this cross-immunity, it would limit the spread of viruses and minimize their impact on public health. In the absence of cross-immunity, the spread of both viruses would accelerate, potentially leading to serious co-infections and increasing the burden on healthcare systems. Therefore, it is crucial to understand and promote cross-immunity to better prevent and control these viral diseases.

    Comparing our results with the data, we used the example of Omicron and Delta variants in COVID-19, where Omicron exhibited a higher transmission rate. In [46], the authors showed that the duration of encounters played a crucial role in modeling and significantly impacted disease progression and the competition between variants, where the faster spreading strain dominated over the slower strain. Reference [12] reports that Omicron rapidly spread across France and displayed higher fitness compared to Delta. Additionally, reference [13] estimated that the total number of individuals infected by Omicron exceeds the total number of those infected by Delta. All of these works confirm our result that the rate of transmission is crucial in which strain dominates the other. In general, the strain with a higher transmission rate (Omicron) tends to have a higher maximum number of infected individuals and a higher total number of infected individuals compared to the other strain (Delta).

    The authors declare they have not used Artificial Intelligence (AI) tools in the creation of this article.

    The authors declare there is no conflict of interest.

    The authors express their gratitude to the referees for careful reading and valuable comments which led to an important improvement of the original version of this work. This work has been supported by PHC (Partenariat Hubert Curien) FRANCE-MAGHREB project having the code number 22MAG22–47518WK. V.V was supported by the Ministry of Science and Higher Education of the Russian Federation (megagrant agreement No. 075-15-2022-1115).



    [1] G. Tang, H. Mai, How does manufacturing intelligentization influence innovation in china from a nonlinear perspective and economic servitization background?, Sustainability, 14 (2022), 14032–14032. https://doi.org/10.3390/su142114032 doi: 10.3390/su142114032
    [2] H. Zhang, G. Xu, R. Pan, H. Ge, A novel heuristic method for the energy-efficient flexible job-shop scheduling problem with sequence-dependent set-up and transportation time, Eng. Optim., 54 (2022), 1646–1667. https://doi.org/10.1080/0305215X.2021.1949007 doi: 10.1080/0305215X.2021.1949007
    [3] Ö. Tosun, M. K. Marichelvam, N. Tosun, A literature review on hybrid flow shop scheduling, J. Oper. Manage., 12 (2020), 156–194. https://doi.org/10.1504/IJAOM.2020.108263 doi: 10.1504/IJAOM.2020.108263
    [4] L. Wang, Shop Scheduling with Genetic Algorithms, Tsinghua University & Springer Press, Beijing, 2003.
    [5] W. Xu, R. Wu, L. Wang, X. Zhao, X. Li, Solving a multi-objective distributed scheduling problem for building material equipment group enterprises by measuring quality indicator with a product gene evaluation approach, Comput. Ind. Eng., 168 (2022), 108142. https://doi.org/10.1016/j.cie.2022.108142 doi: 10.1016/j.cie.2022.108142
    [6] Y. Koren, S. J. Hu, P. Gu, M. Shpitalni, Open-architecture products, CIRP Ann., 62 (2013), 719–729. https://doi.org/10.1016/j.cirp.2013.06.001 doi: 10.1016/j.cirp.2013.06.001
    [7] F. Tao, Q. Qi, A. Liu, A. Kusiak, Data-driven smart manufacturing, J. Manuf. Syst., 48 (2018), 157–169. https://doi.org/10.1016/j.jmsy.2018.01.006 doi: 10.1016/j.jmsy.2018.01.006
    [8] J. Leng, Z. Chen, W. Sha, Z. Lin, J. Lin, Q. Liu, Digital twins-based flexible operating of open architecture production line for individualized manufacturing, Adv. Eng. Inf., 53 (2022), 101676. https://doi.org/10.1016/j.aei.2022.101676 doi: 10.1016/j.aei.2022.101676
    [9] W. Shen, L. Wang, Q. Hao, Agent-based distributed manufacturing process planning and scheduling: a state-of-the-art survey, IEEE Trans. Syst. Man Cybern. Syst., 36 (2006), 563–577. https://doi.org/10.1109/TSMCC.2006.874022 doi: 10.1109/TSMCC.2006.874022
    [10] R. Agarwal, P. De, C. E. Wells, Cooperative distributed problem solving: an investigation in the domain of job shop scheduling, in Proceedings of the Twenty-Eighth Annual Hawaii International Conference on System Sciences, IEEE, 3 (1995), 4–12. https://doi.org/10.1109/HICSS.1995.375579
    [11] C. P. Gomes, A. Tate, L. Thomas, A distributed scheduling framework, in Proceedings Sixth International Conference on Tools with Artificial Intelligence. TAI 94, IEEE, (1994), 49–55. https://doi.org/10.1109/TAI.1994.346514
    [12] A. Toptal, I. Sabuncuoglu, Distributed scheduling: a review of concepts and applications, Int. J. Prod. Res., 48 (2010), 5235–5262. https://doi.org/10.1080/00207540903121065 doi: 10.1080/00207540903121065
    [13] Z. Shao, W. Shao, D. Pi, Effective heuristics and metaheuristics for the distributed fuzzy blocking flow-shop scheduling problem, Swarm Evol. Comput., 59 (2020), 100747. https://doi.org/10.1016/j.swevo.2020.100747 doi: 10.1016/j.swevo.2020.100747
    [14] S. Apte, N. Petrovsky, Will blockchain technology revolutionize excipient supply chain management?, J. Excipients Food Chem., 7 (2016), 76–78.
    [15] F. Tao, J. Cheng, Q. Qi, M. Zhang, H. Zhang, F. Sui, Digital twin-driven product design, manufacturing and service with big data, Int. J. Adv. Manuf. Technol., 94 (2018), 3563–3576. https://doi.org/10.1007/s00170-017-0233-1 doi: 10.1007/s00170-017-0233-1
    [16] J. Yli-Huumo, D. Ko, S. Choi, S. Park, K. Smolander, Where is current research on blockchain technology?—a systematic review, PLoS One, 11 (2016), e163477. https://doi.org/10.1371/journal.pone.0163477 doi: 10.1371/journal.pone.0163477
    [17] J. Leng, P. Jiang, K. Xu, Q. Liu, J. L. Zhao, Y. Bian, et al., Makerchain: A blockchain with chemical signature for self-organizing process in social manufacturing, J. Clean. Prod., 234 (2019), 767–778. https://doi.org/10.1016/j.jclepro.2019.06.265 doi: 10.1016/j.jclepro.2019.06.265
    [18] Y. Wu, Cloud-edge orchestration for the internet of things: architecture and AI-powered data processing, IEEE Internet Things, 8 (2021), 12792–12805. https://doi.org/10.1109/JIOT.2020.3014845 doi: 10.1109/JIOT.2020.3014845
    [19] J. Leng, Z. Chen, W. Sha, S. Ye, Q. Liu, X. Chen, Cloud-edge orchestration-based bi-level autonomous process control for mass individualization of rapid printed circuit boards prototyping services, J. Manuf. Syst., 63 (2022), 143–161. https://doi.org/10.1016/j.jmsy.2022.03.008 doi: 10.1016/j.jmsy.2022.03.008
    [20] L. Wang, W. Shen, Process Planning and Scheduling for Distributed Manufacturing, Springer Science & Business Media, 2007.
    [21] P. Wu, Y. Wang, J. Cheng, Y. Li, An improved mixed-integer programming approach for bi-objective parallel machine scheduling and location, Comput. Ind. Eng., 174 (2022), 108813. https://doi.org/10.1016/j.cie.2022.108813 doi: 10.1016/j.cie.2022.108813
    [22] V. Heinz, A. Novák, M. Vlk, Z. Hanzálek, Constraint programming and constructive heuristics for parallel machine scheduling with sequence-dependent setups and common servers, Comput. Ind. Eng., 172 (2022), 108586. https://doi.org/10.1016/j.cie.2022.108586 doi: 10.1016/j.cie.2022.108586
    [23] G. Song, R. Leus, Parallel machine scheduling under uncertainty: Models and exact algorithms, INFORMS J. Comput., 34 (2022), 3059–3079. https://doi.org/10.1287/ijoc.2022.1229 doi: 10.1287/ijoc.2022.1229
    [24] N. Farmand, H. Zarei, M. Rasti-Barzoki, Two meta-heuristic algorithms for optimizing a multi-objective supply chain scheduling problem in an identical parallel machines environment, Int. J. Ind. Eng. Comput., 12 (2021), 249–272. https://doi.org/10.5267/j.ijiec.2021.3.002 doi: 10.5267/j.ijiec.2021.3.002
    [25] M. Abedi, H. Seidgar, H. Fazlollahtabar, R. Bijani, Bi-objective optimisation for scheduling the identical parallel batch-processing machines with arbitrary job sizes, unequal job release times and capacity limits, Int. J. Prod. Res., 53 (2015), 1680–1711. https://doi.org/10.1080/00207543.2014.952795
    [26] Y. Zheng, Y. Yuan, Q. Zheng, D. Lei, A hybrid imperialist competitive algorithm for the distributed unrelated parallel machines scheduling problem, Symmetry, 14 (2022), 204. https://doi.org/10.3390/sym14020204 doi: 10.3390/sym14020204
    [27] R. Logendran, B. McDonell, B. Smucker, Scheduling unrelated parallel machines with sequence-dependent setups, Comput. Oper. Res., 34 (2007), 3420–3438. https://doi.org/10.1016/j.cor.2006.02.006 doi: 10.1016/j.cor.2006.02.006
    [28] J. Behnamian, S. F. Ghomi, The heterogeneous multi-factory production network scheduling with adaptive communication policy and parallel machine, Inf. Sci., 219 (2013), 181–196. https://doi.org/10.1016/j.ins.2012.07.020 doi: 10.1016/j.ins.2012.07.020
    [29] D. Lei, M. Liu, An artificial bee colony with division for distributed unrelated parallel machine scheduling with preventive maintenance, Comput. Ind. Eng., 141 (2020), 106320–106320. https://doi.org/10.1016/j.cie.2020.106320 doi: 10.1016/j.cie.2020.106320
    [30] G. Bektur, T. Saraç, A mathematical model and heuristic algorithms for an unrelated parallel machine scheduling problem with sequence-dependent setup times, machine eligibility restrictions and a common server, Comput. Ind. Eng., 103 (2018), 46–63. https://doi.org/10.1016/j.cor.2018.10.010
    [31] H. Jouhari, D. Lei, M. A. Al-qaness, , M. A. Elaziz, A. A. Ewees, O. Farouk, Sine-cosine algorithm to enhance simulated annealing for unrelated parallel machine scheduling with setup times, Mathematics, 7 (2019), 1120. https://doi.org/10.3390/math7111120 doi: 10.3390/math7111120
    [32] D. Lei, Y. Yuan, J. Cai, D. Bai, An imperialist competitive algorithm with memory for distributed unrelated parallel machines scheduling, Int. J. Prod. Res., 58 (2020), 597–614. https://doi.org/10.1080/00207543.2019.1598596 doi: 10.1080/00207543.2019.1598596
    [33] D. Li, J. Wang, R. Qiang, R. Chiong, A hybrid differential evolution algorithm for parallel machine scheduling of lace dyeing considering colour families, sequence-dependent setup and machine eligibility, Int. J. Prod. Res., 59 (2020), 1–17. https://doi.org/10.1080/00207543.2020.1740341
    [34] D. Lei, Y. Yuan, J. Cai, An improved artificial bee colony for multi-objective distributed unrelated parallel machine scheduling, Int. J. Prod. Res., 59 (2020), 1–13. https://doi.org/10.1080/00207543.2020.1775911 doi: 10.1080/00207543.2020.1775911
    [35] B. Shahidi-Zadeh, R. Tavakkoli-Moghaddam, A. Taheri-Moghadam, I. Rastgar, Solving a bi-objective unrelated parallel batch processing machines scheduling problem: A comparison study, Comput. Ind. Eng., 88 (2017), 71–90. https://doi.org/10.1016/j.cor.2017.06.019 doi: 10.1016/j.cor.2017.06.019
    [36] Y. He, C. W. Hui, Automatic rule combination approach for single-stage process scheduling problems, AIChE J., 53 (2007), 2026–2047. https://doi.org/10.1002/aic.11236 doi: 10.1002/aic.11236
    [37] Z. Pan, D. Lei, L. Wang, A knowledge-based two-population optimization algorithm for distributed energy-efficient parallel machines scheduling, IEEE Trans. Cybern., 52 (2020), 5051–5063. https://doi.org/10.1109/TCYB.2020.3026571 doi: 10.1109/TCYB.2020.3026571
    [38] L. Zhang, Q. Deng, Y. Zhao, Q. Fan, X. Liu, G. Gong, Joint optimization of demand-side operational utility and manufacture-side energy consumption in a distributed parallel machine environment, Comput. Ind. Eng., 164 (2022), 107863. https://doi.org/10.1016/j.cie.2021.107863 doi: 10.1016/j.cie.2021.107863
    [39] X. Wu, A. Che, A memetic differential evolution algorithm for energy-efficient parallel machine scheduling, Omega, 82 (2018), 155–165. https://doi.org/10.1016/j.omega.2018.01.001 doi: 10.1016/j.omega.2018.01.001
    [40] J. Behnamian, M. Zandieh, S. F. Ghomi, Parallel-machine scheduling problems with sequence-dependent setup times using an ACO, SA and VNS hybrid algorithm, Expert Syst. Appl., 36 (2009), 9637–9644. https://doi.org/10.1016/j.eswa.2008.10.007
    [41] M. Yazdani, S. Gohari, B. Naderi, Multi-factory parallel machine problems: Improved mathematical models and artificial bee colony algorithm, Comput. Ind. Eng., 81 (2015), 36–45. https://doi.org/10.1016/j.cie.2014.12.023 doi: 10.1016/j.cie.2014.12.023
    [42] J. Behnamian, S. F. Ghomi, The heterogeneous multi-factory production network scheduling with adaptive communication policy and parallel machine, Inf. Sci., 219 (2013), 181–196. https://doi.org/10.1016/j.ins.2012.07.020 doi: 10.1016/j.ins.2012.07.020
    [43] J. Behnamian, Matheuristic for the decentralized factories scheduling problem, Appl. Math. Model., 47 (2017), 668–684. https://doi.org/10.1016/j.apm.2017.02.033 doi: 10.1016/j.apm.2017.02.033
    [44] J. Behnamian, Heterogeneous networked cooperative scheduling with anarchic particle swarm optimization, IEEE Trans. Eng. Manage., 64 (2017), 166–178. https://doi.org/10.1016/j.apm.2017.02.033 doi: 10.1016/j.apm.2017.02.033
    [45] J. Behnamian, S. M. T. F. Ghomi, Multi-objective multi-factory scheduling, RAIRO-Oper. Res., 55 (2021), S1447–S1467. https://doi.org/10.1051/ro/2020044 doi: 10.1051/ro/2020044
    [46] J. Behnamian, H. Asgari, A hyper-heuristic for distributed parallel machine scheduling with machine-dependent processing and sequence-dependent setup times, RAIRO-Oper. Res., 56 (2022), 4129–4143. https://doi.org/10.1051/ro/2022194 doi: 10.1051/ro/2022194
    [47] S. Hatami, R. Ruiz, C. Andrés-Romano, Heuristics for a distributed parallel machine assembly scheduling problem with eligibility constraints, in 2015 International Conference on Industrial Engineering and Systems Management (IESM), (2015), 145–153. https://doi.org/10.1109/IESM.2015.7380149
    [48] S. Hatami, R. R. García, C. A. Romano, The Distributed Assembly Parallel Machine Scheduling Problem with eligibility constraints, Int. J. Eng. Sci., 3 (2015), 13–23. https://doi.org/10.4995/ijpme.2015.3345 doi: 10.4995/ijpme.2015.3345
    [49] A. Hamzadayı, An effective benders decomposition algorithm for solving the distributed permutation flowshop scheduling problem, Comput. Oper. Res., 123 (2020), 105006. https://doi.org/10.1016/j.cor.2020.105006 doi: 10.1016/j.cor.2020.105006
    [50] V. Fernandez-Viagas, J. M. Framinan, A bounded-search iterated greedy algorithm for the distributed permutation flowshop scheduling problem, Int. J. Prod. Res., 53 (2015), 1111–1123. https://doi.org/10.1080/00207543.2014.948578 doi: 10.1080/00207543.2014.948578
    [51] J. Y. Mao, Q. K. Pan, Z. H. Miao, L. Gao, S. Chen, A hash map-based memetic algorithm for the distributed permutation flowshop scheduling problem with preventive maintenance to minimize total flowtime, Knowl. Based Syst., 242 (2022), 108413. https://doi.org/10.1016/j.knosys.2022.108413 doi: 10.1016/j.knosys.2022.108413
    [52] K. Wang, Y. Huang, H. Qin, A fuzzy logic-based hybrid estimation of distribution algorithm for distributed permutation flowshop scheduling problems under machine breakdown, J. Oper. Res. Soc., 67 (2016), 68–82. https://doi.org/10.1057/jors.2015.50 doi: 10.1057/jors.2015.50
    [53] B. Naderi, R. Ruiz, The distributed permutation flowshop scheduling problem, Comput. Oper. Res., 37 (2010), 754–768. https://doi.org/10.1016/j.cor.2009.06.019 doi: 10.1016/j.cor.2009.06.019
    [54] E. Taillard, Some efficient heuristic methods for the flow shop sequencing problem, Eur. J. Oper. Res., 47 (1990), 65–74. https://doi.org/10.1016/0377-2217(90)90090-X doi: 10.1016/0377-2217(90)90090-X
    [55] J. Gao, R. Chen, W. Deng, An efficient tabu search algorithm for the distributed permutation flowshop scheduling problem, Int. J. Prod. Res., 51 (2013), 641–651. https://doi.org/10.1080/00207543.2011.644819 doi: 10.1080/00207543.2011.644819
    [56] S. Y. Wang, L. Wang, M. Liu, Y. Xu, An effective estimation of distribution algorithm for solving the distributed permutation flow-shop scheduling problem, Int. J. Prod. Econ., 145 (2013), 387–396. https://doi.org/10.1016/j.ijpe.2013.05.004 doi: 10.1016/j.ijpe.2013.05.004
    [57] D. Ferone, S. Hatami, E. M. González‐Neira, A. A. Juan, P. Festa, A biased‐randomized iterated local search for the distributed assembly permutation flow‐shop problem, Int. Trans. Oper. Res., 27 (2020), 1368–1391. https://doi.org/10.1111/itor.12719 doi: 10.1111/itor.12719
    [58] J. P. Huang, Q. K. Pan, L. Gao, An effective iterated greedy method for the distributed permutation flowshop scheduling problem with sequence-dependent setup times, Swarm Evol. Comput., 59 (2020), 100742. https://doi.org/10.1016/j.swevo.2020.100742 doi: 10.1016/j.swevo.2020.100742
    [59] Y. Xu, L. Wang, S. Wang, M. Liu, An effective hybrid immune algorithm for solving the distributed permutation flow-shop scheduling problem, Eng. Optim., 46 (2014), 1269–1283. https://doi.org/10.1080/0305215X.2013.827673 doi: 10.1080/0305215X.2013.827673
    [60] A. Ali, Y. Gajpal, T. Y. Elmekkawy, Distributed permutation flowshop scheduling problem with total completion time objective, Opsearch, (2020), 1–23. https://doi.org/10.1007/s12597-020-00484-3
    [61] A. Hamzadayı, An effective benders decomposition algorithm for solving the distributed permutation flowshop scheduling problem, Comput. Oper. Res., 123 (2020), 105006. https://doi.org/10.1016/j.cor.2020.105006 doi: 10.1016/j.cor.2020.105006
    [62] J. Y. Mao, Q. K. Pan, Z. H. Miao, L. Gao, S. Chen, A hash map-based memetic algorithm for the distributed permutation flowshop scheduling problem with preventive maintenance to minimize total flowtime, Knowl. Based Syst., 242 (2022), 108413. https://doi.org/10.1016/j.knosys.2022.108413 doi: 10.1016/j.knosys.2022.108413
    [63] Y. Yu, F. Q. Zhang, G. D. Yang, Y. Wang, J. P. Huang, Y. Y. Han, A discrete artificial bee colony method based on variable neighborhood structures for the distributed permutation flowshop problem with sequence-dependent setup times, Swarm Evol. Comput., 75 (2022), 101179. https://doi.org/10.1016/j.swevo.2022.101179 doi: 10.1016/j.swevo.2022.101179
    [64] V. Fernandez-Viagas, P. Perez-Gonzalez, J. M. Framinan, The distributed permutation flow shop to minimise the total flowtime, Comput. Ind. Eng., 118 (2018), 464–477. https://doi.org/10.1016/j.cie.2018.03.014 doi: 10.1016/j.cie.2018.03.014
    [65] A. Khare, S. Agrawal, Effective heuristics and metaheuristics to minimise total tardiness for the distributed permutation flowshop scheduling problem, Int. J. Prod. Res., 59 (2021), 7266–7282. https://doi.org/10.1080/00207543.2020.1837982 doi: 10.1080/00207543.2020.1837982
    [66] Y. Z. Li, Q. K. Pan, X. He, H. Y. Sang, K. Z. Gao, X. L. Jing, The distributed flowshop scheduling problem with delivery dates and cumulative payoffs, Comput. Ind. Eng., 165 (2022), 107961. https://doi.org/10.1016/j.cie.2022.107961 doi: 10.1016/j.cie.2022.107961
    [67] P. A. Villarinho, J. Panadero, L. S. Pessoa, A. A. Juan, F. L. C. Oliveira, A simheuristic algorithm for the stochastic permutation flow‐shop problem with delivery dates and cumulative payoffs, Int. Trans. Oper. Res., 28 (2021), 716–737. https://doi.org/10.1111/itor.12862 doi: 10.1111/itor.12862
    [68] Q. Li, J. Li, X. Zhang, B. Zhang, A wale optimization algorithm for distributed flow shop with batch delivery, Soft Comput., 25 (2021), 1–14.
    [69] A. P. Rifai, H. T. Nguyen, S. Z. M. Dawal, Multi-objective adaptive large neighborhood search for distributed reentrant permutation flow shop scheduling, Appl. Soft Comput., 40 (2016), 42–57. https://doi.org/10.1016/j.asoc.2015.11.034 doi: 10.1016/j.asoc.2015.11.034
    [70] J. Deng, L. Wang, A competitive memetic algorithm for multi-objective distributed permutation flow shop scheduling problem, Swarm Evol. Comput., 32 (2017), 121–131. https://doi.org/10.1016/j.swevo.2016.06.002 doi: 10.1016/j.swevo.2016.06.002
    [71] Z. Yan, R. Shi, K. Du, L. Yi, The role of green production process innovation in green manufacturing: empirical evidence from OECD countries, Appl. Econ., 54 (2022), 6755–6767. https://doi.org/10.1080/00036846.2022.2083569 doi: 10.1080/00036846.2022.2083569
    [72] C. Zhang, W. Ji, Digital twin-driven carbon emission prediction and low-carbon control of intelligent manufacturing job-shop, Procedia CIRP, 83 (2019), 624–629. https://doi.org/10.1016/j.procir.2019.04.095 doi: 10.1016/j.procir.2019.04.095
    [73] X. Wu, A. Che, Energy-efficient no-wait permutation flow shop scheduling by adaptive multi-objective variable neighborhood search, Omega, 94 (2020), 102117–102117. https://doi.org/10.1016/j.omega.2019.102117 doi: 10.1016/j.omega.2019.102117
    [74] J. F. Chen, L. Wang, Z. P. Peng, A collaborative optimization algorithm for energy-efficient multi-objective distributed no-idle flow-shop scheduling, Swarm Evol. Comput., 50 (2019), 100557–100557. https://doi.org/10.1016/j.swevo.2019.100557 doi: 10.1016/j.swevo.2019.100557
    [75] T. Meng, Q. K. Pan, L. Wang, A distributed permutation flowshop scheduling problem with the customer order constraint, Knowl. Based Syst., 184 (2019), 104894–104894. https://doi.org/10.1016/j.knosys.2019.104894 doi: 10.1016/j.knosys.2019.104894
    [76] K. Wang, Y. Huang, H. Qin, A fuzzy logic-based hybrid estimation of distribution algorithm for distributed permutation flowshop scheduling problems under machine breakdown, J. Oper. Res. Soc., 67 (2016), 68–82. https://doi.org/10.1057/jors.2015.50 doi: 10.1057/jors.2015.50
    [77] J. Y. Mao, Q. K. Pan, Z. H. Miao, L. Gao, An effective multi-start iterated greedy algorithm to minimize makespan for the distributed permutation flowshop scheduling problem with preventive maintenance, Expert Syst. Appl., 169 (2021), 114495. https://doi.org/10.1016/j.eswa.2020.114495 doi: 10.1016/j.eswa.2020.114495
    [78] W. Shao, D. Pi, Z. Shao, Optimization of makespan for the distributed no-wait flow shop scheduling problem with iterated greedy algorithms, Knowl. Based Syst., 137 (2017), 163–181. https://doi.org/10.1016/j.knosys.2017.09.026 doi: 10.1016/j.knosys.2017.09.026
    [79] S. W. Lin, K. C. Ying, Minimizing makespan for solving the distributed no-wait flowshop scheduling problem, Comput. Ind. Eng., 99 (2016), 202–209. https://doi.org/10.1016/j.cie.2016.07.027 doi: 10.1016/j.cie.2016.07.027
    [80] G. Zhang, K. Xing, Differential evolution metaheuristics for distributed limited-buffer flowshop scheduling with makespan criterion, Comput. Oper. Res., 108 (2019), 33–43. https://doi.org/10.1016/j.cor.2019.04.002 doi: 10.1016/j.cor.2019.04.002
    [81] F. Zhao, L. Zhao, L. Wang, H. Song, An ensemble discrete differential evolution for the distributed blocking flowshop scheduling with minimizing makespan criterion, Expert Syst. Appl., 160 (2020), 113678. https://doi.org/10.1016/j.eswa.2020.113678 doi: 10.1016/j.eswa.2020.113678
    [82] X. Han, Y. Han, Q. Chen, J. Li, H. Sang, Y. Liu, et al., Distributed flow shop scheduling with sequence-dependent setup times using an improved iterated greedy algorithm, Complex Syst., 1 (2021), 198–217. https://doi.org/10.23919/CSMS.2021.0018 doi: 10.23919/CSMS.2021.0018
    [83] X. Han, Y. Han, B. Zhang, H. Qin, J. Li, Y. Liu, et al., An effective iterative greedy algorithm for distributed blocking flowshop scheduling problem with balanced energy costs criterion, Appl. Soft Comput., 129 (2022), 109502. https://doi.org/10.1016/j.asoc.2022.109502 doi: 10.1016/j.asoc.2022.109502
    [84] W. Shao, D. Pi, Z. Shao, A Pareto-based estimation of distribution algorithm for solving multiobjective distributed no-wait flow-shop scheduling problem with sequence-dependent setup time, IEEE Trans. Autom. Sci. Eng., 16 (2019), 1344–1360. https://doi.org/10.1109/TASE.2018.2886303 doi: 10.1109/TASE.2018.2886303
    [85] J. P. Huang, Q. K. Pan, L. Gao, An effective iterated greedy method for the distributed permutation flowshop scheduling problem with sequence-dependent setup times, Swarm Evol. Comput., 59 (2020), 100742. https://doi.org/10.1016/j.swevo.2020.100742 doi: 10.1016/j.swevo.2020.100742
    [86] J. P. Huang, Q. K. Pan, Z. H. Miao, L. Gao, Effective constructive heuristics and discrete bee colony optimization for distributed flowshop with setup times, Eng. Appl. Artif. Intell., 97 (2021), 104016. https://doi.org/10.1016/j.engappai.2020.104016 doi: 10.1016/j.engappai.2020.104016
    [87] T. Meng, Q. K. Pan, L. Wang, A distributed permutation flowshop scheduling problem with the customer order constraint, Knowl. Based Syst., 184 (2019), 104894. https://doi.org/10.1016/j.knosys.2019.104894 doi: 10.1016/j.knosys.2019.104894
    [88] S. Cai, K. Yang, K. Liu, Multi-objective optimization of the distributed permutation flow shop scheduling problem with transportation and eligibility constraints, J. Oper. Res. Soc. China, 6 (2018), 391–416. https://doi.org/10.1007/s40305-017-0165-3 doi: 10.1007/s40305-017-0165-3
    [89] S. Hatami, R. Ruiz, C. A. Romano, Two simple constructive algorithms for the distributed assembly permutation flowshop scheduling problem, in Managing Complexity: Challenges for Industrial Engineering and Operations Management, (2014), 139–145.
    [90] Q. K. Pan, L. Gao, L. X. Yu, F. M. Jose, Effective constructive heuristics and meta-heuristics for the distributed assembly permutation flowshop scheduling problem, Appl. Soft Comput., 81 (2019), 105492. https://doi.org/10.1016/j.asoc.2019.105492 doi: 10.1016/j.asoc.2019.105492
    [91] X. Li, X. Zhang, M. Yin, J. Wang, A genetic algorithm for the distributed assembly permutation flowshop scheduling problem, in 2015 IEEE Congress on Evolutionary Computation (CEC), IEEE, (2015), 3096–3101. https://doi.org/10.1109/CEC.2015.7257275
    [92] D. Ferone, S. Hatami, E. M. González‐Neira, A. A. Juan, P. Festa, A biased‐randomized iterated local search for the distributed assembly permutation flow‐shop problem, Int. Trans. Oper. Res., 27 (2020), 1368–1391. https://doi.org/10.1111/itor.12719 doi: 10.1111/itor.12719
    [93] J. Lin, Z. J. Wang, X. Li, A backtracking search hyper-heuristic for the distributed assembly flow-shop scheduling problem, Swarm Evol. Comput., 36 (2017), 124–135. https://doi.org/10.1016/j.swevo.2017.04.007 doi: 10.1016/j.swevo.2017.04.007
    [94] G. Zhang, K. Xing, F. Cao, Scheduling distributed flowshops with flexible assembly and set-up time to minimise makespan, Int. J. Prod. Res., 56 (2018), 3226–3244. https://doi.org/10.1080/00207543.2017.1401241 doi: 10.1080/00207543.2017.1401241
    [95] J. Deng, L. Wang, S. Y. Wang, X. L. Zheng, A competitive memetic algorithm for the distributed two-stage assembly flow-shop scheduling problem, Int. J. Prod. Res., 54 (2016), 3561–3577. https://doi.org/10.1080/00207543.2015.1084063 doi: 10.1080/00207543.2015.1084063
    [96] H. Y. Sang, Q. K. Pan, J. Q. Li, P. Wang, Y. Y. Han, K. Z. Gao, et al., Effective invasive weed optimization algorithms for distributed assembly permutation flowshop problem with total flowtime criterion, Swarm Evol. Comput., 44 (2019), 64–73. https://doi.org/10.1016/j.swevo.2018.12.001 doi: 10.1016/j.swevo.2018.12.001
    [97] F. Zhao, X. Hu, L.Wang, Z. Li, A memetic discrete differential evolution algorithm for the distributed permutation flow shop scheduling problem, Complex Intell. Syst., 8 (2022), 141–161. https://doi.org/10.1007/s40747-021-00354-5 doi: 10.1007/s40747-021-00354-5
    [98] F. Xiong, K. Xing, Meta-heuristics for the distributed two-stage assembly scheduling problem with bi-criteria of makespan and mean completion time, Int. J. Prod. Res., 52 (2014), 2743–2766. https://doi.org/10.1080/00207543.2014.884290 doi: 10.1080/00207543.2014.884290
    [99] X. Wu, X. Liu, N. Zhao, An improved differential evolution algorithm for solving a distributed assembly flexible job shop scheduling problem, Memet Comput., 11 (2019), 335–355. https://doi.org/10.1007/s12293-018-00278-7 doi: 10.1007/s12293-018-00278-7
    [100] Y. Y. Huang, Q. K. Pan, J. P. Huang, P. N. Suganthan, L. Gao, An improved iterated greedy algorithm for the distributed assembly permutation flowshop scheduling problem, Comput. Ind. Eng., 152 (2021), 107021. https://doi.org/10.1016/j.cie.2020.107021 doi: 10.1016/j.cie.2020.107021
    [101] G. Wang, X. Li, L. Gao, P. Li, Energy-efficient distributed heterogeneous welding flow shop scheduling problem using a modified MOEA/D, Swarm Evol. Comput., 62 (2021), 100858. https://doi.org/10.1016/j.swevo.2021.100858 doi: 10.1016/j.swevo.2021.100858
    [102] G. Wang, X. Li, L. Gao, P. Li, An effective multi-objective whale swarm algorithm for energy-efficient scheduling of distributed welding flow shop, Ann. Oper. Res., 310 (2022), 223–255. https://doi.org/10.1007/s10479-021-03952-1 doi: 10.1007/s10479-021-03952-1
    [103] J. Cai, D. Lei, M. Li, A shuffled frog-leaping algorithm with memeplex quality for bi-objective distributed scheduling in hybrid flow shop, Int. J. Prod. Res., 59 (2020), 1–18. https://doi.org/10.1080/00207543.2020.1780333 doi: 10.1080/00207543.2020.1780333
    [104] J. Cai, R. Zhou, D. Lei, Dynamic shuffled frog-leaping algorithm for distributed hybrid flow shop scheduling with multiprocessor tasks, Appl. Artif. Intell., 90 (2020), 103540–103540. https://doi.org/10.1016/j.engappai.2020.103540 doi: 10.1016/j.engappai.2020.103540
    [105] C. Lu, Q. Liu, B. Zhang, L. Yin, A Pareto-based hybrid iterated greedy algorithm for energy-efficient scheduling of distributed hybrid flowshop, Expert Syst. Appl., 204 (2022), 117555. https://doi.org/10.1016/j.eswa.2022.117555 doi: 10.1016/j.eswa.2022.117555
    [106] H. Qin, T. Li, Y. Teng, K. Wang, Integrated production and distribution scheduling in distributed hybrid flow shops, Memet Comput., 13 (2021), 185–202. https://doi.org/10.1007/s12293-021-00329-6 doi: 10.1007/s12293-021-00329-6
    [107] C. Lu, L. Gao, J. Yi, X. Li, Energy-efficient scheduling of distributed flow shop with heterogeneous factories: A real-world case from automobile industry in China, IEEE Trans. Ind. Inf., 17 (2020), 6687–6696. https://doi.org/10.1109/TⅡ.2020.3043734 doi: 10.1109/TⅡ.2020.3043734
    [108] E. Jiang, L. Wang, J. Wang, Decomposition-based multi-objective optimization for energy-aware distributed hybrid flow shop scheduling with multiprocessor tasks, Tsinghua Sci. Technol., 26 (2021), 646–663. https://doi.org/10.26599/TST.2021.9010007 doi: 10.26599/TST.2021.9010007
    [109] J. Cai, D. Lei, A cooperated shuffled frog-leaping algorithm for distributed energy-efficient hybrid flow shop scheduling with fuzzy processing time, Complex Intell. Syst., 7 (2021), 2235–2253. https://doi.org/10.1007/s40747-021-00400-2 doi: 10.1007/s40747-021-00400-2
    [110] J. Zheng, L. Wang, J. J. Wang, A cooperative coevolution algorithm for multi-objective fuzzy distributed hybrid flow shop, Knowl. Based Syst., 194 (2020), 105536. https://doi.org/10.1016/j.knosys.2020.105536 doi: 10.1016/j.knosys.2020.105536
    [111] J. J. Wang, L. Wang, A knowledge-based cooperative algorithm for energy-efficient scheduling of distributed flow-shop, IEEE Trans. Syst. Man Cybern.: Syst., 50 (2018), 1805–1819. https://doi.org/10.1109/TSMC.2017.2788879 doi: 10.1109/TSMC.2017.2788879
    [112] G. Zhang, K. Xing, Differential evolution metaheuristics for distributed limited-buffer flowshop scheduling with makespan criterion, Comput. Oper. Res., 108 (2019), 33–43. https://doi.org/10.1016/j.cor.2019.04.002 doi: 10.1016/j.cor.2019.04.002
    [113] C. Lu, Y. Huang, L. Meng, L. Gao, B. Zhang, J. Zhou, A Pareto-based collaborative multi-objective optimization algorithm for energy-efficient scheduling of distributed permutation flow-shop with limited buffers, Robot Comput. Integr. Manuf., 74 (2022), 102277. https://doi.org/10.1016/j.rcim.2021.102277 doi: 10.1016/j.rcim.2021.102277
    [114] K. Geng, C. Ye, A memetic algorithm for energy-efficient distributed re-entrant hybrid flow shop scheduling problem, J. Intell. Fuzzy Syst., 41 (2021), 3951–3971. https://doi.org/10.3233/JIFS-202963 doi: 10.3233/JIFS-202963
    [115] J. Dong, C. Ye, Green scheduling of distributed two-stage reentrant hybrid flow shop considering distributed energy resources and energy storage system, Comput. Ind. Eng., 169 (2022), 108146. https://doi.org/10.1016/j.cie.2022.108146 doi: 10.1016/j.cie.2022.108146
    [116] Y. Alaouchiche, Y. Ouazene, F. Yalaoui, Economic and energetic performance evaluation of unreliable production lines: An integrated analytical approach, IEEE Access, 8 (2020), 185330–185345. https://doi.org/10.1109/ACCESS.2020.3029761 doi: 10.1109/ACCESS.2020.3029761
    [117] B. Naderi, A. Azab, Modeling and heuristics for scheduling of distributed job shops, Expert Syst. Appl., 41 (2014), 7754–7763. https://doi.org/10.1016/j.eswa.2014.06.023 doi: 10.1016/j.eswa.2014.06.023
    [118] M. L. R. Varela, G. D. Putnik, M. M. Cruz-Cunha, Web-based technologies integration for distributed manufacturing scheduling in a virtual enterprise, Int. J. Web Portals (IJWP), 4 (2012), 19–34. https://doi.org/10.4018/jwp.2012040102 doi: 10.4018/jwp.2012040102
    [119] H. Z. Jia, J. Y. Fuh, A. Y. Nee, Y. F. Zhang, Web-based multi-functional scheduling system for a distributed manufacturing environment, Concurr. Eng., 10 (2002), 27–39. https://doi.org/10.1177/1063293X02010001054 doi: 10.1177/1063293X02010001054
    [120] H. Z. Jia, A. Y. Nee, J. Y. Fuh, Y. F. Zhang, A modified genetic algorithm for distributed scheduling problems, J. Intell. Manuf., 14 (2003), 351–362. https://doi.org/10.1023/A:1024653810491 doi: 10.1023/A:1024653810491
    [121] H. Z. Jia, J. Y. Fuh, A. Y. Nee, Y. F. Zhang, Integration of genetic algorithm and Gantt chart for job shop scheduling in distributed manufacturing systems, Comput. Ind. Eng., 53 (2007), 313–320. https://doi.org/10.1016/j.cie.2007.06.024 doi: 10.1016/j.cie.2007.06.024
    [122] F. T. Chan, S. H. Chung, L. Y. Chan, G. Finke, M. K. Tiwari, Solving distributed FMS scheduling problems subject to maintenance: Genetic algorithms approach, Robot Comput. Integr. Manuf., 22 (2006), 493–504. https://doi.org/10.1016/j.rcim.2005.11.005 doi: 10.1016/j.rcim.2005.11.005
    [123] I. J. Jeong, S. B. Yim, A job shop distributed scheduling based on Lagrangian relaxation to minimise total completion time, Int. J. Prod. Res., 47 (2009), 6783–6805. https://doi.org/10.1080/00207540701824217 doi: 10.1080/00207540701824217
    [124] L. De Giovanni, F. Pezzella, An improved genetic algorithm for the distributed and flexible job-shop scheduling problem, Eur. J. Oper. Res., 200 (2010), 395–408. https://doi.org/10.1016/j.ejor.2009.01.008 doi: 10.1016/j.ejor.2009.01.008
    [125] P. Lou, S. K. Ong, A. Y. C. Nee, Agent-based distributed scheduling for virtual job shops, Int. J. Prod. Res., 48 (2010), 3889–3910. https://doi.org/10.1080/00207540902927918 doi: 10.1080/00207540902927918
    [126] B. Naderi, A. Azab, An improved model and novel simulated annealing for distributed job shop problems, J. Adv. Manuf. Technol., 81 (2015), 693–703. https://doi.org/10.1007/s00170-015-7080-8 doi: 10.1007/s00170-015-7080-8
    [127] T. K. Liu, Y. P. Chen, J. H. Chou, Solving distributed and flexible job-shop scheduling problems for a real-world fastener manufacturer, IEEE Access, 2 (2014), 1598–1606. https://doi.org/10.1109/ACCESS.2015.2388486 doi: 10.1109/ACCESS.2015.2388486
    [128] I. Chaouch, O. B. Driss, K. Ghedira, A novel dynamic assignment rule for the distributed job shop scheduling problem using a hybrid ant-based algorithm, Appl. Intell., 49 (2019), 1903–1924. https://doi.org/10.1007/s10489-018-1343-7 doi: 10.1007/s10489-018-1343-7
    [129] Q. Luo, Q. Deng, G. Gong, L. Zhang, W. Han, K. Li, An efficient memetic algorithm for distributed flexible job shop scheduling problem with transfers, Expert Syst. Appl., 160 (2020), 113721. https://doi.org/10.1016/j.eswa.2020.113721 doi: 10.1016/j.eswa.2020.113721
    [130] J. Q. Li, P. Duan, J. Cao, X. P. Lin, Y. Y. Han, A hybrid Pareto-based tabu search for the distributed flexible job shop scheduling problem with E/T criteria, IEEE Access, 6 (2018), 58883–58897. https://doi.org/10.1109/ACCESS.2018.2873401 doi: 10.1109/ACCESS.2018.2873401
    [131] F. T. Chan, S. H. Chung, P. L. Y. Chan, An adaptive genetic algorithm with dominated genes for distributed scheduling problems, Expert Syst. Appl., 29 (2005), 364–371. https://doi.org/10.1016/j.eswa.2005.04.009 doi: 10.1016/j.eswa.2005.04.009
    [132] L. Meng, C. Zhang, Y. Ren, B. Zhang, C. Lv, Mixed-integer linear programming and constraint programming formulations for solving distributed flexible job shop scheduling problem, Comput. Ind. Eng., 142 (2020), 106347. https://doi.org/10.1016/j.cie.2020.106347 doi: 10.1016/j.cie.2020.106347
    [133] B. Marzouki, O. B. Driss, K. Ghédira, Solving distributed and flexible job shop scheduling problem using a chemical reaction optimization metaheuristic, Procedia Comput. Sci., 126 (2018), 1424–1433. https://doi.org/10.1016/j.procs.2018.08.114 doi: 10.1016/j.procs.2018.08.114
    [134] M. Zandieh, A. R. Khatami, S. H. A. Rahmati, Flexible job shop scheduling under condition-based maintenance: improved version of imperialist competitive algorithm, Appl. Soft Comput., 58 (2017), 449–464. https://doi.org/10.1016/j.asoc.2017.04.060 doi: 10.1016/j.asoc.2017.04.060
    [135] P. H. Lu, M. C. Wu, H. Tan, Y. H. Peng, C. F. Chen, A genetic algorithm embedded with a concise chromosome representation for distributed and flexible job-shop scheduling problems, J. Intell. Manuf., 29 (2018), 19–34. https://doi.org/10.1007/s10845-015-1083-z doi: 10.1007/s10845-015-1083-z
    [136] M. C. Wu, C. S. Lin, C. H. Lin, C. F. Chen, Effects of different chromosome representations in developing genetic algorithms to solve DFJS scheduling problems, Comput. Oper. Res., 80 (2017), 101–112. https://doi.org/10.1016/j.cor.2016.11.021 doi: 10.1016/j.cor.2016.11.021
    [137] H. C. Chang, T. K. Liu, Optimisation of distributed manufacturing flexible job shop scheduling by using hybrid genetic algorithms, J. Intell. Manuf., 28 (2017), 1973–1986. https://doi.org/10.1007/s10845-015-1084-y doi: 10.1007/s10845-015-1084-y
    [138] W. Xu, Y. Hu, W. Luo, L. Wang, R. Wu, A multi-objective scheduling method for distributed and flexible job shop based on hybrid genetic algorithm and tabu search considering operation outsourcing and carbon emission, Comput. Ind. Eng., 157 (2021), 107318. https://doi.org/10.1016/j.cie.2021.107318 doi: 10.1016/j.cie.2021.107318
    [139] L. Meng, Y. Ren, B. Zhang, J. Q. Li, H. Sang, C. Zhang, MILP modeling and optimization of energy-efficient distributed flexible job shop scheduling problem, IEEE Access, 8 (2020), 191191–191203. https://doi.org/10.1109/ACCESS.2020.3032548 doi: 10.1109/ACCESS.2020.3032548
    [140] S. Zhang, X. Li, B. Zhang, S. Wang, Multi-objective optimisation in flexible assembly job shop scheduling using a distributed ant colony system, Eur. J. Oper. Res., 283 (2020), 441–460. https://doi.org/10.1016/j.ejor.2019.11.016 doi: 10.1016/j.ejor.2019.11.016
    [141] F. Xiong, K. Xing, Meta-heuristics for the distributed two-stage assembly scheduling problem with bi-criteria of makespan and mean completion time, Int. J. Prod. Res., 52 (2014), 2743–2766. https://doi.org/10.1080/00207543.2014.884290 doi: 10.1080/00207543.2014.884290
    [142] S. Yang, Z. Xu, The distributed assembly permutation flowshop scheduling problem with flexible assembly and batch delivery. Int. J. Prod. Res., 59 (2021), 4053-4071. https://doi.org/10.1080/00207543.2020.1757174 doi: 10.1080/00207543.2020.1757174
    [143] Z. Shao, W. Shao, D. Pi, Effective constructive heuristic and metaheuristic for the distributed assembly blocking flow-shop scheduling problem, Appl. Intell., 50 (2020), 4647–4669. https://doi.org/10.1007/s10489-020-01809-x doi: 10.1007/s10489-020-01809-x
    [144] W. Niu, J. Q. Li, A two-stage cooperative evolutionary algorithm for energy-efficient distributed group blocking flow shop with setup carryover in precast systems, Knowl. Based Syst., 257 (2022), 109890. https://doi.org/10.1016/j.knosys.2022.109890 doi: 10.1016/j.knosys.2022.109890
    [145] F. Jolai, H. Asefi, M. Rabiee, P. Ramezani, Bi-objective simulated annealing approaches for no-wait two-stage flexible flow shop scheduling problem, Sci. Iran., 20 (2013), 861–872. https://doi.org/10.1016/j.scient.2012.10.044 doi: 10.1016/j.scient.2012.10.044
    [146] J. Deng, L. Wang, S. Y. Wang, X. L. Zheng, A competitive memetic algorithm for the distributed two-stage assembly flow-shop scheduling problem, Int. J. Prod. Res., 54 (2016), 3561–3577. https://doi.org/10.1080/00207543.2015.1084063 doi: 10.1080/00207543.2015.1084063
    [147] F. Nikzad, J. Rezaeian, I. Mahdavi, I. Rastgar, Scheduling of multi-component products in a two-stage flexible flow shop, Appl. Soft Comput., 32 (2015), 132–143. https://doi.org/10.1016/j.asoc.2015.03.006 doi: 10.1016/j.asoc.2015.03.006
    [148] A. Azadeh, M. Jeihoonian, B. M. Shoja, S. H. Seyedmahmoudi, An integrated neural network-simulation algorithm for performance optimisation of the bi-criteria two-stage assembly flow-shop scheduling problem with stochastic activities, Int. J. Prod. Res., 50 (2012), 7271–7284. https://doi.org/10.1080/00207543.2011.645511 doi: 10.1080/00207543.2011.645511
    [149] F. Zhao, D. Shao, L. Wang, T. Xu, N. Zhu, An effective water wave optimization algorithm with problem-specific knowledge for the distributed assembly blocking flow-shop scheduling problem, Knowl. Based Syst., 243 (2022), 108471. https://doi.org/10.1016/j.knosys.2022.108471 doi: 10.1016/j.knosys.2022.108471
    [150] G. Zhang, K. Xing, Memetic social spider optimization algorithm for scheduling two-stage assembly flowshop in a distributed environment, Comput. Ind. Eng., 125 (2018), 423–433. https://doi.org/10.1016/j.cie.2018.09.007 doi: 10.1016/j.cie.2018.09.007
    [151] D. Lei, B. Su, M. Li, Cooperated teaching-learning-based optimisation for distributed two-stage assembly flow shop scheduling, Int. J. Prod. Res., 59 (2021), 7232–7245. https://doi.org/10.1080/00207543.2020.1836422 doi: 10.1080/00207543.2020.1836422
    [152] N. Shoaardebili, P. Fattahi, Multi-objective meta-heuristics to solve three-stage assembly flow shop scheduling problem with machine availability constraints, Int. J. Prod. Res., 53 (2015), 944–968. https://doi.org/10.1080/00207543.2014.948575 doi: 10.1080/00207543.2014.948575
    [153] Y. Du, J. Q. Li, C. Luo, L. L. Meng, A hybrid estimation of distribution algorithm for distributed flexible job shop scheduling with crane transportations, Swarm Evol. Comput., 62 (2021), 100861. https://doi.org/10.1016/j.swevo.2021.100861 doi: 10.1016/j.swevo.2021.100861
    [154] X. Wu, X. Liu, N. Zhao, An improved differential evolution algorithm for solving a distributed assembly flexible job shop scheduling problem, Memet. Comput., 11 (2019), 335–355. https://doi.org/10.1007/s12293-018-00278-7 doi: 10.1007/s12293-018-00278-7
    [155] G. Zhang, K. Xing, G. Zhang, Z. He, Memetic algorithm with meta-Lamarckian learning and simplex search for distributed flexible assembly permutation flowshop scheduling problem, IEEE Access, 8 (2020), 96115–96128. https://doi.org/10.1109/ACCESS.2020.2996305 doi: 10.1109/ACCESS.2020.2996305
  • This article has been cited by:

    1. Masoud Saade, Samiran Ghosh, Malay Banerjee, Vitaly Volpert, Delay epidemic models determined by latency, infection, and immunity duration, 2024, 370, 00255564, 109155, 10.1016/j.mbs.2024.109155
    2. Ali Moussaoui, Mohammed Meziane, On the date of the epidemic peak, 2024, 21, 1551-0018, 2835, 10.3934/mbe.2024126
    3. Ali Moussaoui, Vitaly Volpert, The impact of immune cell interactions on virus quasi-species formation, 2024, 21, 1551-0018, 7530, 10.3934/mbe.2024331
    4. Masoud Saade, Samiran Ghosh, Malay Banerjee, Vitaly Volpert, Dynamics of delay epidemic model with periodic transmission rate, 2025, 138, 0307904X, 115802, 10.1016/j.apm.2024.115802
    5. V. Volpert, From SIR to delay models in epidemiology, 2025, 52, 15710645, 49, 10.1016/j.plrev.2024.11.018
    6. Muhammad Tashfeen, Fazal Dayan, Muhammad Aziz ur Rehman, Thabet Abdeljawad, Aiman Mukheimer, Boundedness and Positivity Preserving Numerical Analysis of a Fuzzy-Parameterized Delayed Model for Foot and Mouth Disease Dynamics, 2024, 141, 1526-1506, 2527, 10.32604/cmes.2024.056269
  • Reader Comments
  • © 2023 the Author(s), licensee AIMS Press. This is an open access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0)
通讯作者: 陈斌, bchen63@163.com
  • 1. 

    沈阳化工大学材料科学与工程学院 沈阳 110142

  1. 本站搜索
  2. 百度学术搜索
  3. 万方数据库搜索
  4. CNKI搜索

Metrics

Article views(2956) PDF downloads(359) Cited by(5)

Figures and Tables

Figures(13)  /  Tables(4)

Other Articles By Authors

/

DownLoad:  Full-Size Img  PowerPoint
Return
Return

Catalog