Loading [MathJax]/jax/output/SVG/jax.js
Research article

Single machine Pareto scheduling with positional deadlines and agreeable release and processing times


  • This paper studies the problem of scheduling n jobs on a single machine to minimize total completion time and maximum cost, simultaneously. Each job is associated with a positional deadline that indicates the largest ordinal number of this job in any feasible schedule. The jobs have agreeable release and processing times, meaning that jobs with larger release times also have larger processing times. The agreeability assumption is reasonable since both the single-criterion problems (without positional deadline constraints) of minimizing total completion time and maximum lateness on a single machine with arbitrary release and processing times are strongly NP-hard. An O(n3)-time Pareto optimal algorithm is presented. The previously known algorithms only solve two special cases of the agreeability assumption: either the case of equal release times in O(n4) time, or the case of equal processing times (without positional deadline constraints) in O(n3) time.

    Citation: Shuguang Li, Yong Sun, Muhammad Ijaz Khan. Single machine Pareto scheduling with positional deadlines and agreeable release and processing times[J]. Electronic Research Archive, 2023, 31(5): 3050-3063. doi: 10.3934/era.2023154

    Related Papers:

    [1] Raimund Bürger, Gerardo Chowell, Leidy Yissedt Lara-Díıaz . Comparative analysis of phenomenological growth models applied to epidemic outbreaks. Mathematical Biosciences and Engineering, 2019, 16(5): 4250-4273. doi: 10.3934/mbe.2019212
    [2] Juan Pablo Aparicio, Carlos Castillo-Chávez . Mathematical modelling of tuberculosis epidemics. Mathematical Biosciences and Engineering, 2009, 6(2): 209-237. doi: 10.3934/mbe.2009.6.209
    [3] Huiping Zang, Shengqiang Liu, Yi Lin . Evaluations of heterogeneous epidemic models with exponential and non-exponential distributions for latent period: the Case of COVID-19. Mathematical Biosciences and Engineering, 2023, 20(7): 12579-12598. doi: 10.3934/mbe.2023560
    [4] Takeshi Miyama, Sung-mok Jung, Katsuma Hayashi, Asami Anzai, Ryo Kinoshita, Tetsuro Kobayashi, Natalie M. Linton, Ayako Suzuki, Yichi Yang, Baoyin Yuan, Taishi Kayano, Andrei R. Akhmetzhanov, Hiroshi Nishiura . Phenomenological and mechanistic models for predicting early transmission data of COVID-19. Mathematical Biosciences and Engineering, 2022, 19(2): 2043-2055. doi: 10.3934/mbe.2022096
    [5] Jinlong Lv, Songbai Guo, Jing-An Cui, Jianjun Paul Tian . Asymptomatic transmission shifts epidemic dynamics. Mathematical Biosciences and Engineering, 2021, 18(1): 92-111. doi: 10.3934/mbe.2021005
    [6] Yicang Zhou, Zhien Ma . Global stability of a class of discrete age-structured SIS models with immigration. Mathematical Biosciences and Engineering, 2009, 6(2): 409-425. doi: 10.3934/mbe.2009.6.409
    [7] Yukihiko Nakata, Ryosuke Omori . The change of susceptibility following infection can induce failure to predict outbreak potential by R0. Mathematical Biosciences and Engineering, 2019, 16(2): 813-830. doi: 10.3934/mbe.2019038
    [8] Cheng-Cheng Zhu, Jiang Zhu, Xiao-Lan Liu . Influence of spatial heterogeneous environment on long-term dynamics of a reaction-diffusion SVIR epidemic model with relaps. Mathematical Biosciences and Engineering, 2019, 16(5): 5897-5922. doi: 10.3934/mbe.2019295
    [9] Qinghua Liu, Siyu Yuan, Xinsheng Wang . A SEIARQ model combine with Logistic to predict COVID-19 within small-world networks. Mathematical Biosciences and Engineering, 2023, 20(2): 4006-4017. doi: 10.3934/mbe.2023187
    [10] Salihu S. Musa, Shi Zhao, Winnie Mkandawire, Andrés Colubri, Daihai He . An epidemiological modeling investigation of the long-term changing dynamics of the plague epidemics in Hong Kong. Mathematical Biosciences and Engineering, 2024, 21(10): 7435-7453. doi: 10.3934/mbe.2024327
  • This paper studies the problem of scheduling n jobs on a single machine to minimize total completion time and maximum cost, simultaneously. Each job is associated with a positional deadline that indicates the largest ordinal number of this job in any feasible schedule. The jobs have agreeable release and processing times, meaning that jobs with larger release times also have larger processing times. The agreeability assumption is reasonable since both the single-criterion problems (without positional deadline constraints) of minimizing total completion time and maximum lateness on a single machine with arbitrary release and processing times are strongly NP-hard. An O(n3)-time Pareto optimal algorithm is presented. The previously known algorithms only solve two special cases of the agreeability assumption: either the case of equal release times in O(n4) time, or the case of equal processing times (without positional deadline constraints) in O(n3) time.



    The theme of fractional calculus (FC) has appeared as a broad and interesting research point due to its broad applications in science and engineering. FC is now greatly evolved and embraces a wide scope of interesting findings. To obtain detailed information on applications and recent results about this topic, we refer to [1,2,3,4,5] and the references therein.

    Some researchers in the field of FC have realized that innovation for new FDs with many non-singular or singular kernels is very necessary to address the need for more realistic modeling problems in different fields of engineering and science. For instance, we refer to works of Caputo and Fabrizio [6], Losada and Nieto [7] and Atangana-Baleanu [8]. The class of FDs and fractional integrals (FIs) concerning functions is a considerable branch of FC. This class of operators with analytic kernels is a new evolution proposed in [1,9,10]. Every one of these operators is appropriate broader to cover various kinds of FC and catch diversified behaviors in fractional models. Joining the previous ideas yields another, significantly wide, which is a class of function-dependent-kernel fractional derivatives. This covers both of the two preceding aforesaid classes see [11,12].

    In another context, the Langevin equations (LEs) were formulated by Paul Langevin in 1908 to describe the development of physical phenomena in fluctuating environments [13]. After that, diverse generalizations of the Langevin equation have been deliberated by many scholars we mention here some works [14,15,16]. Recently, many researchers have investigated sufficient conditions of the qualitative properties of solutions for the nonlinear fractional LEs involving various types of fractional derivatives (FDs) and by using different types of methods such as standard fixed point theorems (FPTs), Leray-Schauder theory, variational methods, etc., e.g. [17,18,19,20,21,22,23,24]. Some recent results on the qualitative properties of solutions for fractional LEs with the generalized Caputo FDs can be found in [25,26,27,28,29,30], e.g., Ahmad et al. [25] established the existence results for a nonlinear LE involving a generalized Liouville-Caputo-type

    {ρcDα1a+(ρcDα2a++λ)z(ς)=F(ς,z(ς)),ς[a,T], λR,z(a)=0,z(η)=0, z(T)=μ ρIδa+z(ξ), a<η<ξ<T. (1.1)

    Seemab et al. [26] investigated the existence and UHR stability results for a nonlinear implicit LE involving a ϑ -Caputo FD

    {cDα1,ϑa+(cDα2,ϑa++λ)z(ς)=F(ς,z(ς),cDα1,ϑa+z(ς)),ς(a,T), λ>0,z(a)=0,z(η)=0, z(T)=μ Iδ;ϑa+z(ξ), 0a<η<ξ<T<. (1.2)

    The Hyers-Ulam (U-H) stability and existence for various types of generalized FDEs are established in the papers [31,32,33,34,35,36,37,38,39,40,41,42,43].

    Motivated by the above works and inspired by novel developments in ϑ -FC, in the reported research, we investigate the existence, uniqueness, and U-H-type stability of the solutions for the nonlinear fractional Langevin differential equation (for short FLDE) described by

    {Dα2;ϑa+(Dα1;ϑa++λ)z(ς)=F(ς,z(ς)),ςJ=[a,b],z(a)=0,z(a)=0,z(a)=0,Dα1;ϑa+z(a)=Iδ;ϑa+z(ξ),Dα1;ϑa+z(b)+κz(b)=0, (1.3)

    where Dε;ϑa+ denote the ϑ-Caputo FD of order ε{α1,α2} such that α1(2,3], α2(1,2], ξ(a,b), δ>0, Iα1;ϑa+ is the ϑ-fractional integral of the Riemann-Liouville (RL) type, F:J×RR is a continuous function, and λ,κ R, ξ(a,b).

    The considered problem in this work is more general, in other words, when we take certain values of function ϑ, the problem (1.3) is reduced to many problems in the frame of classical fractional operators. Also, the gained results here are novel contributes and an extension of the evolution of FDEs that involving a generalized Caputo operator, especially, the study of stability analysis of Ulam-Hyers type of fractional Langevin equations is a qualitative addition to this work. Besides, analysis of the results was restricted to a minimum of assumptions.

    Here is a brief outline of the paper. Section 2 provides the definitions and preliminary results required to prove our main findings. In Section 3, we establish the existence, uniqueness, and stability in the sense of Ulam for the system (1.3). In Section 5, we give some related examples to light the gained results.

    We start this part by giving some basic definitions and results required for fractional analysis.

    Consider the space of real and continuous functions U=C(J,R) space with the norm

    z=sup{|z(ς)|:ςJ}.

    Let ϑC1=C1(J,R) be an increasing differentiable function such that ϑ(ς)0, for all ςJ.

    Now, we start by defining ϑ-fractionals operators as follows:

    Definition 2.1. [1] The ϑ-RL fractional integral of order α1>0 for an integrable function ω:JR is given by

    Iα1;ϑa+ω(ς)=1Γ(α1)ςaϑ(s)(ϑ(ς)ϑ(s))α11ω(s)ds. (2.1)

    Definition 2.2. [1] Let α1(n1,n), nN, ω:JR is an integrable function, and ϑCn(J,R), the ϑ-RL FD of a function ω of order α1 is given by

    Dα1;ϑa+ω(ς)=(Dςϑ(ς))n Inα1;ϑa+ω(ς),

    where n=[α1]+1 and Dς=ddt.

    Definition 2.3. [9] For α1(n1,n), and ω,ϑCn(J,R), the ϑ-Caputo FD of a function ω of order α1 is given by

     cDα1;ϑa+ω(ς)= Inα1;ϑa+ω[n]ϑ(ς),

    where n=[α1]+1 for α1N, n=α1 for α1N, and ω[n]ϑ(ς)=(Dςϑ(ς))nω(ς).

    From the above definition, we can express ϑ-Caputo FD by formula

     cDα1;ϑa+ω(ς)={ςaϑ(s)(ϑ(ς)ϑ(s))nα11Γ(nα1)ω[n]ϑ(s)ds,ifα1N,ω[n]ϑ(ς),ifα1N. (2.2)

    Also, the ϑ-Caputo FD of order α1 of ω is defined as

    cDα1;ϑa+ω(ς)=Dα1;ϑa+[ω(ς)n1k=0ω[k]ϑ(a)k!(ϑ(ς)ϑ(a))k].

    For more details see [9,Theorem 3].

    Lemma 2.4. [1] For α1,α2>0, and ωC(J,R), we have

    Iα1;ϑa+Iα2;ϑa+ω(ς)=Iα1+α2;ϑa+ω(ς),a.e.ςJ.

    Lemma 2.5. [44] Let α1>0.

    If ωC(J,R), then

    cDα1;ϑa+Iα1;ϑa+ω(ς)=ω(ς),ςJ,

    and if ωCn1(J,R), then

    Iα1;ϑa+cDα1;ϑa+ω(ς)=ω(ς)n1k=0ω[k]ϑ(a)k![ϑ(ς)ϑ(a)]k,ςJ.

    for all ςJ. Moreover, if mN be an integer and ωCn+m(J,R) a function. Then, the following holds:

    (1ϑ(ς)ddt)mDα1;ϕa+ω(ς)= cDa+m;ϕa+ω(ς)+m1k=0(ϑ(ς)ϑ(a))k+n^α1mΓ(k+nα1m+1)ω[k+n]ϑ(a) (2.3)

    Observe that from Eq (2.3), if ω[k]ϑ(a)=0, for all k=n,n+1,,n+m1 we can get the following relation

    z[m]ϑDa,ϑa+z(ς)= cDα1+m;ϑa+z(ς),ςJ

    Lemma 2.6. [1,9] For ς>a,α10, α2>0, we have

    Iα1;ϑa+(ϑ(ς)ϑ(a))α21=Γ(α2)Γ(α2+α1)(ϑ(ς)ϑ(a))α2+α11,

    cDα1;ϑa+(ϑ(ς)ϑ(a))α21=Γ(α2)Γ(α2α1)(ϑ(ς)ϑ(a))α2α11,

    cDα1;ϑa+(ϑ(ς)ϑ(a))k=0,k{0,,n1},nN.

    Theorem 2.7. (Banach's FPT [45]). Let (R,d) be a nonempty complete metric space with a contraction mapping G:RR i.e., d(Gz,Gϰ)Ld(z,ϰ) for all z,ϰR, where L(0,1) is a constant. Then G possesses a unique fixed point.

    Theorem 2.8. (Kransnoselskii's FPT [46]). Let E be a Banach space. Let S is a nonempty convex, closed and bounded subset of E and let A1,A2 be mapping from S to E such that:

    (i) A1z+A2ϰS whenever z,ϰS

    (ii) A1 is continuous and compact;

    (iii) A2 is a contraction.

    Then there exists zS such that z=A1z+A2z.

    This portion interests in the existence, uniqueness, and Ulam stability of solutions to the suggested problem (1.3).

    The next auxiliary lemma, which attentions the linear term of a problem (1.3), plays a central role in the afterward findings.

    Lemma 3.1. Let α1(2,3], α2(1,2]. Then the linear BVP

    {Dα2;ϑa+(Dα1;ϑ+λ)z(ς)=σ(ς),ςJ=[a,b],z(a)=0,z(a)=0,z(a)=0,Dα1;ϑa+z(a)=Iδ;ϑa+z(γ),Dα1;ϑa+z(b)+κz(b)=0, (3.1)

    has a unique solution defined by

    z(ς)=Iα1+α2;ϑa+σ(ς)λIα1;ϑa+z(ς)+μ(ς)Iδ;ϑa+σ(ξ)+ν(ς){λ(κλ)Iα1;ϑa+z(b)(κλ)Iα1+α2;ϑa+σ(b)Iα2;ϑa+σ(b)ϖIδ;ϑa+z(ξ)}, (3.2)

    where

    μ(ς)=(ϑ(ς)ϑ(a))α1Γ(α1+1), (3.3)

    and

    ν(ς)=(ϑ(ς)ϑ(a))α1+1(ϑ(b)ϑ(a))Γ(α1+2)+(κλ), (3.4)

    with

    ϖ=(1+(κλ)Γ(α1+1)), (3.5)

    Proof. Applying the RL operator Iα2;ϑa+ to (3.1) it follows from Lemma 2.5 that

    (Dα1a++λ)z(ς)=c0+c1(ϑ(ς)ϑ(a))+Iα2;ϑa+σ(ς),ς(a,b]. (3.6)

    Again, we apply the RL operator Iα1;ϑa+ and use the results of Lemma 2.5 to get

    z(ς)=Iα1+α2;ϑa+σ(ς)λIα1a+z(ς)+c0(ϑ(ς)ϑ(a))α1+1Γ(α1+2)+c1(ϑ(ς)ϑ(a))α1Γ(α1+1)+c2(ϑ(ς)ϑ(a))2+c3(ϑ(ς)ϑ(a))+c4, (3.7)

    where c0,c1,c2,c3,c4R. By utilizing the boundary conditions in (3.1) and (3.7), we obtain c2=0,c3=0,c4=0.

    Hence,

    z(ς)=Iα1+α2;ϑa+σ(ς)λIα1a+z(ς)+c0(ϑ(ς)ϑ(a))α1+1Γ(α1+2)+c1(ϑ(ς)ϑ(a))α1Γ(α1+1), (3.8)

    Now, by using the conditions Dα1;ϑa+z(a)=Iδ;ϑa+z(γ) and Dα1;ϑa+z(b)+κz(b)=0, we get

    c1=Iδ;ϑa+z(ξ), (3.9)
    c0=((ϑ(ς)ϑ(a))α1+1(ϑ(b)ϑ(a))Γ(α1+2)+(κλ))×{λ(κλ)Iα1;ϑa+z(b)(κλ)Iα1+α2;ϑa+σ(b)Iα2;ϑa+σ(b)(1+(κλ)Γ(α1+1))Iδ;ϑa+z(ξ)}. (3.10)

    Substituting c0 and c1 in (3.8), we finish with (3.2).

    The reverse direction can be shown easily with the help of results in Lemmas 2.5 and 2.6, i.e. Eq (3.2) solves problem (3.1). This ends the proof.

    Now, we shall need to the following lemma:

    Lemma 3.2. The functions μ and ν are continuous functions on J and satisfy the following properties:

    (1) μ=max0ςb|μ(ς)|,

    (2) ν=max0<ς<b|ν(ς)|,

    where μ and ν are defined by Lemma 3.1.

    Here, we give the following hypotheses:

    (H1) The function F:J×RR is continuous.

    (H2) There exists a constant L>0 such that

    |F(ς,z)F(ς,ϰ)|L|zϰ|,ςJ,z,ϰR.

    (H3) There exist positive functions h(ς)C(J,R+) with bounds h such that

    |F(ς,z(ς))|h(ς), for all (ς,z)J×R.

    For simplicity, we denote

    M:=supς[a,b]|F(ς,0)|.
    Δ:={(L(ϑ(b)ϑ(a))α1+α2Γ(α1+α2+1)(1+ν|κλ|)+|λ|(1+ν|κλ|)(ϑ(b)ϑ(a))α1Γ(α1+1))+(Lν(ϑ(b)ϑ(a))α2Γ(α2+1)+(μ+ν|ϖ|)(ϑ(ξ)ϑ(a))δΓ(δ+1))}, (3.11)
    Gχϑ(ς,s)=ϑ(s)(ϑ(ς)ϑ(s))χ1Γ(χ),χ>0. (3.12)

    As a result of Lemma 3.1, we have the subsequent lemma:

    Lemma 3.3. Suppose that F:J×RR is continuous. A function z(ς) solves (1.3) if and only if it is a fixed-point of the operator G:UU defined by

    Gz(ς)=ςaGα1+α2ϑ(ς,s)F(s,z(s))ds+λςaGα1ϑ(ς,s)z(s)ds+μ(ς)ξaGδϑ(ξ,s)F(s,z(s))ds+ν(ς){λ(κλ)baGα1ϑ(b,s)z(s)ds(κλ)baGα1+α2ϑ(b,s)F(s,z(s))dsbaGα2ϑ(b,s)F(s,z(s))dsϖξaGδϑ(ξ,s)z(s)ds}. (3.13)

    Now, we are willing to give our first result which based on Theorem 2.7.

    Theorem 3.4. Suppose that (H1) and (H2) hold. If Δ<1, where Δ is given by (3.11), then there exists a unique solution for (1.3) on the interval J.

    Proof. Thanks to Lemma 3.1, we consider the operator G:UU defined by (3.13). Thus, G is well defined as F is a continuous. Then the fixed point of G coincides with the solution of FLDE (1.3). Next, the Theorem 2.7 will be used to prove that G has a fixed point. For this end, we show that G is a contraction.

    Let BR={zU:zR}, where R>MΛ11LΛ1Λ2. Since

    |F(s,z(s)|=|F(s,z(s))F(s,0)+F(s,0)||F(s,z(s))F(s,0)|+|F(s,0)|(L|z(s)|+|F(s,0)|)LR+M

    we obtain

    |Gz(ς)|=ςaGα1+α2ϑ(ς,s)|F(s,z(s))|ds+|λ|ςaGα1ϑ(ς,s)|z(s)|ds+μξaGδϑ(ξ,s)|z(s)|ds+ν(ς){|λ(κλ)|baGα1ϑ(b,s)|z(s)|ds+(κλ)baGα1+α2ϑ(b,s)|F(s,z(s))|ds+baGα2ϑ(b,s)|F(s,z(s))|ds+ϖξaGδϑ(ξ,s)|z(s)|ds}LR+M{ςaGα1+α2ϑ(ς,s)|F(s,z(s))|ds+ν(ς){|κλ|baGα1+α2ϑ(b,s)|F(s,z(s))|ds+νbaGα2ϑ(b,s)|F(s,z(s))|ds}+R{|λ|ςaGα1ϑ(ς,s)|z(s)|ds+μξaGδϑ(ξ,s)|z(s)|ds+ν(ς){|λ(κλ)|baGα1ϑ(b,s)|z(s)|ds+ϖξaGδϑ(ξ,s)|z(s)|ds}}LR+M{(ϑ(b)ϑ(a))α1+α2Γ(α1+α2+1)(1+ν|κλ|)+ν(ϑ(b)ϑ(a))α2Γ(α2+1)}+R{|λ|(1+ν|κλ|)(ϑ(b)ϑ(a))α1Γ(α1+1)+(μ+ν|ϖ|)(ϑ(ξ)ϑ(a))δΓ(δ+1)}(LR+M)Λ1+Λ2RR. (3.14)

    which implies that GzR, i.e.,

    GBRBR.

    Now, let z,ϰU. Then, for every ςJ, using (H2), we can get

    |Gϰ(ς)Gz(ς)|ςaGα1+α2ϑ(ς,s)|F(s,ϰ(s))F(s,z(s))|ds+|λ|ςaGα1ϑ(ς,s)|ϰ(s)z(s)|ds+μξaGδϑ(ξ,s)|ϰ(s)z(s)|ds+ν(ς){|λ(κλ)|baGα1ϑ(b,s)|ϰ(s)z(s)|ds+|κλ|baGα1+α2ϑ(b,s)|F(s,ϰ(s))F(s,z(s))|ds+baGα2ϑ(b,s)|F(s,ϰ(s))F(s,z(s))|ds+ϖξaGδϑ(ξ,s)|ϰ(s)z(s)|ds}ςaLGa+α2ϑ(ς,s)|ϰ(s)z(s)|ds+|λ|ςaGα1ϑ(ς,s)|ϰ(s)z(s)|ds+μξaGδϑ(ξ,s)|ϰ(s)z(s)|ds+ν(ς){|λ(κλ)|baGα1ϑ(b,s)|ϰ(s)z(s)|ds+(κλ)baGα1+α2ϑ(b,s)L|ϰ(s)z(s)|ds+baGα2ϑ(b,s)L|ϰ(s)z(s)|ds+ϖξaGδϑ(ξ,s)|ϰ(s)z(s)|ds}=ςa(LGα1+α2ϑ(ς,s)+|λ|Gα1ϑ(ς,s))|ϰ(s)z(s)|ds+(μ+ν|ϖ|)ξaGδϑ(ξ,s)|ϰ(s)z(s)|ds+νba(|κλ|(λGα1ϑ(b,s)+LGα1+α2ϑ(ς,s))+LGα2ϑ(b,s))|ϰ(s)z(s)|dsϰz{ςa(LGα1+α2ϑ(ς,s)+|λ|Gα1ϑ(ς,s))ds+(μ+ν|ϖ|)ξaGδϑ(ξ,s)ds+νba(|κλ|(λGα1ϑ(b,s)+LGα1+α2ϑ(ς,s))+LGα2ϑ(b,s))ds} (3.15)

    Also note that

    ςaGχϑ(ς,s)ds(ϑ(b)ϑ(a))χΓ(χ+1),χ>0.

    Using the above arguments, we get

    GϰGz{(L(ϑ(b)ϑ(a))α1+α2Γ(α1+α2+1)(1+ν|κλ|)+|λ|(1+ν|κλ|)(ϑ(b)ϑ(a))α1Γ(α1+1))+(Lν(ϑ(b)ϑ(a))α2Γ(α2+1)+(μ+ν|ϖ|)(ϑ(ξ)ϑ(a))δΓ(δ+1))}ϰz=Δϰz.

    As Δ<1, we derive that G is a contraction. Hence, by Theorem 2.7, G has a unique fixed point which is a unique solution of FLDE (1.3). This ends the proof.

    Now, we apply the Theorem 2.8 to obtain the existence result.

    Theorem 3.5. Let us assume (H1)–(H3) hold. Then FLDE (1.3) has at least one solution on J if Λ3<1, where it is supposed that

    Λ3:={(L(ϑ(b)ϑ(a))α1+α2Γ(α1+α2+1)(ν|κλ|)+|λ|(ν|κλ|)(ϑ(b)ϑ(a))α1Γ(α1+1))+(Lν(ϑ(b)ϑ(a))α2Γ(α2+1)+(μ+ν|ϖ|)(ϑ(ξ)ϑ(a))δΓ(δ+1))}.

    Proof. By the assumption (H3), we can fix

    ρλ1h(1λ2),

    where Bρ={zU:zρ}. Let us split the operator G:UU defined by (3.13) as G=G1+G2, where G1 and G2 are given by

    G1z(ς)=ςaGα1+α2ϑ(ς,s)F(s,z(s))ds+λςaGα1ϑ(ς,s)z(s)ds, (3.16)

    and

    G2z(ς)=μ(ς)ξaGδϑ(ξ,s)F(s,z(s))ds+ν(ς){λ(κλ)baGα1ϑ(b,s)z(s)ds(κλ)baGα1+α2ϑ(b,s)F(s,z(s))dsbaGα2ϑ(b,s)F(s,z(s))dsϖξaGδϑ(ξ,s)z(s)ds}. (3.17)

    The proof will be split into numerous steps:

    Step 1: G1(z)+G2(z)Bρ.

    G1z+G2z1=supςJ|G1z(ς)+G2z1(ς)|ςaGα1+α2ϑ(ς,s)|F(s,z(s))|ds+|λ|ςaGα1ϑ(ς,s)|z(s)|ds+μξaGδϑ(ξ,s)|z(s)|ds+ν(ς){|λ(κλ)|baGα1ϑ(b,s)|z(s)|ds+|κλ|baGα1+α2ϑ(b,s)|F(s,z(s))|ds+baGα2ϑ(b,s)|F(s,z(s))|ds+ϖξaGδϑ(ξ,s)|z(s)|ds} (3.18)
    h{ςaGα1+α2ϑ(ς,s)|F(s,z(s))|ds+ν(ς){|κλ|baGα1+α2ϑ(b,s)|F(s,z(s))|ds+νbaGα2ϑ(b,s)|F(s,z(s))|ds}+ρ{|λ|ςaGα1ϑ(ς,s)|z(s)|ds+μξaGδϑ(ξ,s)|z(s)|ds+ν(ς){|λ(κλ)|baGα1ϑ(b,s)|z(s)|ds+ϖξaGδϑ(ξ,s)|z(s)|ds}}h{(ϑ(b)ϑ(a))α1+α2Γ(α1+α2+1)(1+ν|κλ|)+ν(ϑ(b)ϑ(a))α2Γ(α2+1)}+ρ{|λ|(1+ν|κλ|)(ϑ(b)ϑ(a))α1Γ(α1+1)+(μ+ν|ϖ|)(ϑ(ξ)ϑ(a))δΓ(δ+1)}hΛ1+Λ2ρρ. (3.19)

    Hence

    G1(z)+G2(z1)ρ,

    which shows that G1z+G2z1Bρ.

    Step 2: G2 is a contraction map on Bρ.

    Due to the contractility of G as in Theorem 3.4, then G2 is a contraction map too.

    Step 3: G1 is completely continuous on Bρ.

    From the continuity of F(,z()), it follows that G1 is continuous.

    Since

    G1z=supςJ|G1z(ς)|ςaGα1+α2ϑ(ς,s)|F(s,z(s))|ds+|λ|ςaGα1ϑ(ς,s)|z(s)|dsh(ϑ(b)ϑ(a))α1+α2Γ(α1+α2+1)+|λ|(ϑ(b)ϑ(a))α1Γ(α1+1)ρ:=N, zBρ,

    we get G1zN which emphasize that G1 uniformly bounded on Bρ.

    Finally, we prove the compactness of G1.

    For zBρ and ςJ, we can estimate the operator derivative as follows:

    |(G1z)(1)ϑ(ς)|ςaGα1+α21ϑ(ς,s)|F(s,z(s))|ds+|λ|ςaGα11ϑ(ς,s)|z(s)|dsh(ϑ(b)ϑ(a))α1+α2Γ(α1+α2+1)+|λ|(ϑ(b)ϑ(a))α1Γ(α1+1)ρ:=,

    where we used the fact

    Dkϑ Iα1,ϑa+=Iα1k,ϑa+,  ω(k)ϑ(ς)=(1ϑ(ς)ddς)kω(ς) for k=0,1,...,n1.

    Hence, for each ς1,ς2J with a<ς1<ς2<b and for zBρ, we get

    |(G1z)(ς2)(G1z)(ς1)|=ς2ς1|(G1z)(s)|ds(ς2ς1),

    which as (ς2ς1) tends to zero independent of z. So, G1 is equicontinuous. In light of the foregoing arguments along with Arzela–Ascoli theorem, we derive that G1 is compact on Bρ. Thus, the hypotheses of Theorem 2.8 holds, so there exists at least one solution of (1.3) on J.

    In the current section, we are interested in studying Ulam-Hyers (U-H) and the generalized Ulam-Hyers stability types of the problem (1.3).

    Let ε>0. We consider the next inequality:

    |Dα2;ϑa+(Da;ϑa+λ)˜z(ς)F(ς,˜z(ς))|ε,ςJ. (4.1)

    Definition 4.1. FLDE (1.3) is stable in the frame of U-H type if there exists cFR+ such that for every ε>0 and for each solution ˜zU of the inequality (4.1) there exists a solution zU of (1.3) with

    |˜z(ς)z(ς)|εcF,ςJ.

    Definition 4.2. FLDE (1.3) has the generalized U-H stability if there exists CF: C(R+,R+) along with CF(0)=0 such that for every ε>0 and for each solution ˜zU of the inequality (4.1), a solution zC(J,R) of (1.3) exists uniquely for which

    |˜z(ς)z(ς)|CF(ε),ςJ.

    Remark 4.3. A function ˜zU is a solution of the inequality (4.1) if and only if there exists a function ϱU (which depends on solution ˜z) such that

    1.|ϱ(ς)|ε,ςJ.

    2.Dα2;ϑa+(Da,ϑa+λ)˜z(ς)=F(ς,˜z(ς))+ϱ(ς),ςJ.

    Theorem 4.4. Let Δ<1, (H1) and (H2) hold. Then the FLDE (1.3) is U-H stable on J and consequently generalized U-H stable.

    Proof. For ε>0 and ˜zC(J,R) be a function which fulfills the inequality (4.1). Let zU the unique solution of

    {Dα2;ϑa+(Dα1;ϑ+λ)z(ς)=F(ς,z(ς)),ςJ=[a,b],z(a)=0,z(a)=0,z(a)=0,Dα1;ϑa+z(a)=Iδ;ϑa+z(γ),Dα1;ϑa+z(b)+κz(b)=0. (4.2)

    By Lemma 3.1, we have

    z(ς)=ςaGα1+α2ϑ(ς,s)F(s,z(s))ds+λςaGα1ϑ(ς,s)z(s)ds+μ(ς)ξaGδϑ(ξ,s)F(s,z(s))ds+ν(ς){λ(κλ)baGα1ϑ(b,s)z(s)ds(κλ)baGα1+α2ϑ(b,s)F(s,z(s))dsbaGα2ϑ(b,s)F(s,z(s))dsϖξaGδϑ(ξ,s)z(s)ds}. (4.3)

    Since we have assumed that ˜z is a solution of (4.1), hence by Remark 4.3

    {Dα2;ϑa+(Dα1;ϑa++λ)˜z(ς)=F(ς,˜z(ς))+ϱ(ς),ςJ=[0,b],z(a)=0,z(a)=0,z(a)=0,Dα1;ϑa+z(a)=Iδ;ϑa+z(γ),Dα1;ϑa+z(b)+κz(b)=0. (4.4)

    Again by Lemma 3.1, we have

    ˜z(ς)=ςaGα1+α2ϑ(ς,s)F(s,˜z(s))ds+λςaGα1ϑ(ς,s)˜z(s)ds+μ(ς)ξaGδϑ(ξ,s)F(s,˜z(s))ds+ν(ς){λ(κλ)baGα1ϑ(b,s)˜z(s)ds(κλ)baGα1+α2ϑ(b,s)F(s,˜z(s))dsbaGα2ϑ(b,s)F(s,˜z(s))dsϖξaGδϑ(ξ,s)˜z(s)ds}+ςaGα1+α2ϑ(ς,s)ϱ(s)ds+μ(ς)ξaGδϑ(ξ,s)ϱ(s)ds+ν(ς){(λκ)baGα1+α2ϑ(b,s)ϱ(s)dsbaGα2ϑ(b,s)ϱ(s)ds}. (4.5)

    On the other hand, for any ςJ

    |˜z(ς)z(ς)|ςaGα1+α2ϑ(ς,s)|ϱ(s)|ds+ν|κλ|baGα1+α2ϑ(b,s)|ϱ(s)|ds+νbaGα2ϑ(b,s)|ϱ(s)|ds+ςaGα1+α2ϑ(ς,s)|F(s,ϰ(s))F(s,z(s))|ds+|λ|ςaGα1ϑ(ς,s)|ϰ(s)z(s)|ds+μξaGδϑ(ξ,s)|ϰ(s)z(s)|ds+ν(ς){|λ(κλ)|baGα1ϑ(b,s)|ϰ(s)z(s)|ds+(κλ)baGα1+α2ϑ(b,s)|F(s,ϰ(s))F(s,z(s))|ds+baGα2ϑ(b,s)|F(s,ϰ(s))F(s,z(s))|ds+ϖξaGδϑ(ξ,s)|ϰ(s)z(s)|ds}.

    Using part (i) of Remark 4.3 and (H2), we get

    |˜z(ς)z(ς)|((ϑ(b)ϑ(a))α1+α2Γ(α1+α2+1)[ν|κλ|+1]+ν(ϑ(b)ϑ(a))α2Γ(α2+1))ε+Δ˜zz,

    where Δ is defined by (3.11). In consequence, it follows that

    ˜zz((ϑ(b)ϑ(a))α1+α2Γ(α1+α2+1)[ν|κλ|+1](1Δ)+ν(1Δ)(ϑ(b)ϑ(a))α2Γ(α2+1))ε.

    If we let cF=((ϑ(b)ϑ(a))α1+α2Γ(α1+α2+1)[ν(κλ)+1](1Δ)+ν(1Δ)(ϑ(b)ϑ(a))α2Γ(α2+1)), then, the U-H stability condition is satisfied. More generally, for CF(ε)=((ϑ(b)ϑ(a))α1+α2Γ(α1+α2+1)[ν|κλ|+1](1Δ)+ν(1Δ)(ϑ(b)ϑ(a))α2Γ(α2+1))ε; CF(0)=0 the generalized U-H stability condition is also fulfilled.

    This section is intended to illustrate the reported results with relevant examples.

    Example 5.1. We formulate the system of FLDE in the frame of Caputo type:

    { cD1.20+( cD2.50++0.4)z(ς)=1eς+9(1+|z(ς)|1+|z(ς)|),ς[0,1],z(0)=0,z(0)=0,z(0)=0,D1.2;ς0+z(0)=I0.5;ϑ0+z(0.1),D1.2;ς0+z(1)+0.5z(1)=0. (5.1)

    In this case we take

    α1=2.5,α2=1.2,λ=0.4,κ=0.5,δ=0.5,ξ=0.1,a=0,b=1,ϑ(ς)=ςandF(ς,z)=1eς+9(1+|z(ς)|1+|z(ς)|).

    Obviously, the hypothesis (H1) of the Theorem 3.4 is fulfilled. On the opposite hand, for each ς[0,1],z,ϰR we have

    |F(ς,z)F(ς,ϰ)|110|zϰ|.

    Hence, (H2) holds with L=0.1. Thus, we find that Δ=0.7635<1. Since all the assumptions in Theorem 3.4 hold, the FLDE (5.1) has a unique solution on [0,1]. Moreover, Theorem 4.4 ensures that the FLDE (1.3) is U-H stable and generalized U-H stable.

    Example 5.2. We formulate the system of FLDE in the frame of Hadamard type:

    { HD1.5;lnς1+( HD2.7;lnς1++0.18)z(ς)=1(ς+1)2(1+sinz(ς)),ς[1,e],z(1)=0,z(1)=0,z(1)=0, HD1.5;lnς1+z(1)= HI0.9;lnς1+z(2), HD1.5;lnς1+z(e)+0.2z(e)=0. (5.2)

    Here

    F(ς,z(ς))=15(ς+1)2(1+sinz(ς)). (5.3)

    Obviously, the assumption (H1) of the Theorem 3.4 holds. On the other hand, for any ς[1,e],z,ϰR we get

    |F(ς,z)F(ς,ϰ)|110|zϰ|.

    Consequently, (H2) holds with L=0.1. Besides, by computation directly we find that Δ=0.8731<1.

    To illustrate Theorem 3.5, it is clear that the function f satisfies (H1) and (H3) with h=0.1. In addition, Λ30.7823<1. It follows from theorem 3.5 that the FLDE (5.2) has a unique solution on [1,e].

    Example 5.3. We formulate the system of FLDE in the frame of ϑ-Caputo type:

    { cD1.9;ϑ0+( cD2.9;ϑ0++0.25)z(ς)=eς4(eς+1)(1+arctanz(ς)),ς[0,1],z(0)=0,z(0)=0,z(0)=0,Dα1;ϑ0+z(0)=I5.4;ϑa+z(0.3),Dα1;ϑ0+z(1)+0.1z(1)=0. (5.4)

    Take

    α1=1.9,α2=2.5,λ=0.25,δ=5.4,κ=0.1,ξ=0.3,a0=0,b0=1,ϑ(ς)=eς
    F(ς,z)=eς4(eς+1)(1+arctanz(ς)). (5.5)

    For any ς[0,1],z,ϰR we obtain

    |F(ς,z)F(ς,ϰ)|18|zϰ|.

    Hence, (H2) holds with L=0.125. Moreover, by computation directly we find that Δ=0.7133<1. It follows from Theorem 3.4 that FLDE (5.4) has a unique solution on [0,1].

    To illustrate Theorem 3.5, it is clear that the function F(ς,z) given by (5.5) satisfies the hypotheses (H1)–(H3) with h=0.125. and Λ30.3247<1. It follows from Theorem 3.5 that the FLDE (5.2) has a unique solution on [0,1].

    In this reported article, we have considered a class of nonlinear Langevin equations involving two different fractional orders in the frame of Caputo function-dependent-kernel fractional derivatives with antiperiodic boundary conditions. The existence and uniqueness results are established for the suggested problem. Our perspective is based on properties of ϑ-Caputo's derivatives and applying of Krasnoselskii's and Banach's fixed point theorems. Moreover, we discuss the Ulam-Hyers stability criteria for the at-hand problem. Some related examples illustrating the effectiveness of the theoretical results are presented. The results obtained are recent and provide extensions to some known results in the literature. Furthermore, they cover many fractional Langevin equations that contain classical fractional operators.

    This research was funded by the Deanship of Scientific Research at Princess Nourah bint Abdulrahman University, Saudi Arabia through the Fast-track Research Funding Program.

    The authors declare that there is no conflict of interests regarding the publication of this paper.



    [1] H. Hoogeveen, Multicriteria scheduling, Eur. J. Oper. Res., 167 (2005), 592–623. https://doi.org/10.1016/j.ejor.2004.07.011 doi: 10.1016/j.ejor.2004.07.011
    [2] P. Brucker, Scheduling Algorithms, fifth Edition, Springer, 2007. https://doi.org/10.1007/978-3-540-69516-5
    [3] V. T'kindt, J. C. Billaut, Multicriteria Scheduling: Theory, Models and Algorithms, Springer Verlag, Berlin, 2006.
    [4] J. K. Lenstra, A. R. Kan, P. Brucker, Complexity of machine scheduling problems, in Annals of Discrete Mathematics, Elsevier, (1977), 343–362. https://doi.org/10.1016/S0167-5060(08)70743-X
    [5] J. K. Lenstra, A. R. Kan, Complexity of scheduling under precedence constraints, Oper. Res., 26 (1978), 22–35. https://doi.org/10.1287/opre.26.1.22 doi: 10.1287/opre.26.1.22
    [6] Y. Gao, J. Yuan, Pareto minimizing total completion time and maximum cost with positional due indices, J. Oper. Res. Soc. China, 3 (2015), 381–387.
    [7] Z. Liu, S. Li, Pareto optimal algorithms for minimizing total (weighted) completion time and maximum cost on a single machine, Math. Biosci. Eng., 19 (2022), 7337–7348. https://doi.org/10.3934/mbe.2022346 doi: 10.3934/mbe.2022346
    [8] P. Perez-Gonzalez, J. M. Framinan, A common framework and taxonomy for multicriteria scheduling problems with interfering and competing jobs: Multi-agent scheduling problems, Eur. J. Oper. Res., 235 (2014), 1–16. https://doi.org/10.1016/j.ejor.2013.09.017 doi: 10.1016/j.ejor.2013.09.017
    [9] A. Herzel, S. Ruzika, C. Thielen, Approximation methods for multiobjective optimization problems: A survey, INFORMS J. Comput., 33 (2021), 1284–1299. https://doi.org/10.1287/ijoc.2020.1028 doi: 10.1287/ijoc.2020.1028
    [10] L. N. V. Wassenhove, L. F. Gelders, Solving a bicriterion scheduling problem, Eur. J. Oper. Res., 4 (1980), 42–48. https://doi.org/10.1016/0377-2217(80)90038-7 doi: 10.1016/0377-2217(80)90038-7
    [11] T. C. John, Tradeoff solutions in single machine production scheduling for minimizing flow time and maximum penalty, Comput. Oper. Res., 16 (1989), 471–479. https://doi.org/10.1016/0305-0548(89)90034-8 doi: 10.1016/0305-0548(89)90034-8
    [12] J. Hoogeveen, S. L. van de Velde, Minimizing total completion time and maximum cost simultaneously is solvable in polynomial time, Oper. Res. Lett., 17 (1995), 205–208. https://doi.org/10.1016/0167-6377(95)00023-D doi: 10.1016/0167-6377(95)00023-D
    [13] G. Steiner, P. Stephenson, Pareto optima for total weighted completion time and maximum lateness on a single machine, Discrete Appl. Math., 155 (2007), 2341–2354. https://doi.org/10.1016/j.dam.2007.06.012 doi: 10.1016/j.dam.2007.06.012
    [14] Y. Gao, J. Yuan, A note on pareto minimizing total completion time and maximum cost, Oper. Res. Lett., 43 (2015), 80–82. https://doi.org/10.1016/j.orl.2014.12.001 doi: 10.1016/j.orl.2014.12.001
    [15] C. He, H. Lin, X. Wang, Single machine bicriteria scheduling with equal-length jobs to minimize total weighted completion time and maximum cost, 4OR-Q. J. Oper. Res., 12 (2014), 87–93. https://doi.org/10.1007/s10288-013-0244-1 doi: 10.1007/s10288-013-0244-1
    [16] Q. Zhao, L. Lu, J. Yuan, Rescheduling with new orders and general maximum allowable time disruptions, 4OR-Q. J. Oper. Res., 14 (2016), 261–280. https://doi.org/10.1007/s10288-016-0308-0 doi: 10.1007/s10288-016-0308-0
    [17] Q. Zhao, J. Yuan, Rescheduling to minimize the maximum lateness under the sequence disruptions of original jobs, Asia Pac. J. Oper. Res., 34 (2017), 1750024. https://doi.org/10.1142/S0217595917500245 doi: 10.1142/S0217595917500245
    [18] Y. Gao, J. Yuan, Bi-criteria pareto-scheduling on a single machine with due indices and precedence constraints, Discrete Optim., 25 (2017), 105–119. https://doi.org/10.1016/j.disopt.2017.02.004 doi: 10.1016/j.disopt.2017.02.004
    [19] R. Chen, J. Yuan, Single-machine scheduling of proportional-linearly deteriorating jobs with positional due indices, 4OR-Q. J. Oper. Res., 18 (2020), 177–196. https://doi.org/10.1007/s10288-019-00410-4 doi: 10.1007/s10288-019-00410-4
    [20] R. Chen, J. Yuan, L. Lu, Single-machine scheduling with positional due indices and positional deadlines, Discrete Optim., 34 (2019), 100549. https://doi.org/10.1016/j.disopt.2019.06.002 doi: 10.1016/j.disopt.2019.06.002
    [21] R. Chen, J. Yuan, Z. Geng, Nd-agent scheduling of linear-deteriorating tasks with positional due indices to minimize total completion time and maximum cost, Appl. Math. Comput., 365 (2020), 124697. https://doi.org/10.1016/j.amc.2019.124697 doi: 10.1016/j.amc.2019.124697
    [22] Y. Gao, J. Yuan, C. Ng, T. Cheng, A note on competing-agent pareto-scheduling, Optim. Lett., 15 (2021), 249–262. https://doi.org/10.1007/s11590-020-01576-1 doi: 10.1007/s11590-020-01576-1
    [23] C. He, C. Xu, H. Lin, Serial-batching scheduling with two agents to minimize makespan and maximum cost, J. Sched., 23 (2020), 609–617. https://doi.org/10.1007/s10951-020-00656-5 doi: 10.1007/s10951-020-00656-5
    [24] Z. Geng, J. Liu, Single machine batch scheduling with two non-disjoint agents and splitable jobs, J. Comb. Optim., 40 (2020), 774–795. https://doi.org/10.1007/s10878-020-00626-9 doi: 10.1007/s10878-020-00626-9
    [25] Y. Gao, J. Yuan, C. Ng, T. Cheng, Pareto-scheduling with family jobs or nd-agent on a parallel-batch machine to minimize the makespan and maximum cost, 4OR-Q. J. Oper. Res., 20 (2022), 273–287. https://doi.org/10.1007/s10288-021-00480-3 doi: 10.1007/s10288-021-00480-3
    [26] S. Li, Z. Geng, Bicriteria scheduling on an unbounded parallel-batch machine for minimizing makespan and maximum cost, Inf. Process. Lett., 180 (2023), 106343. https://doi.org/10.1016/j.ipl.2022.106343 doi: 10.1016/j.ipl.2022.106343
    [27] W. E. Smith, Various optimizers for single-stage production, Nav. Res. Log., 3 (1956), 59–66. https://doi.org/10.1002/nav.3800030106 doi: 10.1002/nav.3800030106
  • This article has been cited by:

    1. Hashem Althagafi, Ahmed Ghezal, Solving a system of nonlinear difference equations with bilinear dynamics, 2024, 9, 2473-6988, 34067, 10.3934/math.20241624
  • 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(1477) PDF downloads(49) Cited by(3)

Other Articles By Authors

/

DownLoad:  Full-Size Img  PowerPoint
Return
Return

Catalog