Loading [MathJax]/jax/output/SVG/jax.js
Review Special Issues

Scheduling in cloud manufacturing systems: Recent systematic literature review

  • Cloud Manufacturing (CMFg) is a novel production paradigm that benefits from Cloud Computing in order to develop manufacturing systems linked by the cloud. These systems, based on virtual platforms, allow direct linkage between customers and suppliers of manufacturing services, regardless of geographical distance. In this way, CMfg can expand both markets for producers, and suppliers for customers. However, these linkages imply a new challenge for production planning and decision-making process, especially in Scheduling. In this paper, a systematic literature review of articles addressing scheduling in Cloud Manufacturing environments is carried out. The review takes as its starting point a seminal study published in 2019, in which all problem features are described in detail. We pay special attention to the optimization methods and problem-solving strategies that have been suggested in CMfg scheduling. From the review carried out, we can assert that CMfg is a topic of growing interest within the scientific community. We also conclude that the methods based on bio-inspired metaheuristics are by far the most widely used (they represent more than 50% of the articles found). On the other hand, we suggest some lines for future research to further consolidate this field. In particular, we want to highlight the multi-objective approach, since due to the nature of the problem and the production paradigm, the optimization objectives involved are generally in conflict. In addition, decentralized approaches such as those based on game theory are promising lines for future research.

    Citation: Agustín Halty, Rodrigo Sánchez, Valentín Vázquez, Víctor Viana, Pedro Piñeyro, Daniel Alejandro Rossit. Scheduling in cloud manufacturing systems: Recent systematic literature review[J]. Mathematical Biosciences and Engineering, 2020, 17(6): 7378-7397. doi: 10.3934/mbe.2020377

    Related Papers:

    [1] Minlong Lin, Ke Tang . Selective further learning of hybrid ensemble for class imbalanced increment learning. Big Data and Information Analytics, 2017, 2(1): 1-21. doi: 10.3934/bdia.2017005
    [2] Subrata Dasgupta . Disentangling data, information and knowledge. Big Data and Information Analytics, 2016, 1(4): 377-390. doi: 10.3934/bdia.2016016
    [3] Qinglei Zhang, Wenying Feng . Detecting Coalition Attacks in Online Advertising: A hybrid data mining approach. Big Data and Information Analytics, 2016, 1(2): 227-245. doi: 10.3934/bdia.2016006
    [4] Tieliang Gong, Qian Zhao, Deyu Meng, Zongben Xu . Why Curriculum Learning & Self-paced Learning Work in Big/Noisy Data: A Theoretical Perspective. Big Data and Information Analytics, 2016, 1(1): 111-127. doi: 10.3934/bdia.2016.1.111
    [5] Xin Yun, Myung Hwan Chun . The impact of personalized recommendation on purchase intention under the background of big data. Big Data and Information Analytics, 2024, 8(0): 80-108. doi: 10.3934/bdia.2024005
    [6] Pankaj Sharma, David Baglee, Jaime Campos, Erkki Jantunen . Big data collection and analysis for manufacturing organisations. Big Data and Information Analytics, 2017, 2(2): 127-139. doi: 10.3934/bdia.2017002
    [7] Zhen Mei . Manifold Data Mining Helps Businesses Grow More Effectively. Big Data and Information Analytics, 2016, 1(2): 275-276. doi: 10.3934/bdia.2016009
    [8] Ricky Fok, Agnieszka Lasek, Jiye Li, Aijun An . Modeling daily guest count prediction. Big Data and Information Analytics, 2016, 1(4): 299-308. doi: 10.3934/bdia.2016012
    [9] M Supriya, AJ Deepa . Machine learning approach on healthcare big data: a review. Big Data and Information Analytics, 2020, 5(1): 58-75. doi: 10.3934/bdia.2020005
    [10] Sunmoo Yoon, Maria Patrao, Debbie Schauer, Jose Gutierrez . Prediction Models for Burden of Caregivers Applying Data Mining Techniques. Big Data and Information Analytics, 2017, 2(3): 209-217. doi: 10.3934/bdia.2017014
  • Cloud Manufacturing (CMFg) is a novel production paradigm that benefits from Cloud Computing in order to develop manufacturing systems linked by the cloud. These systems, based on virtual platforms, allow direct linkage between customers and suppliers of manufacturing services, regardless of geographical distance. In this way, CMfg can expand both markets for producers, and suppliers for customers. However, these linkages imply a new challenge for production planning and decision-making process, especially in Scheduling. In this paper, a systematic literature review of articles addressing scheduling in Cloud Manufacturing environments is carried out. The review takes as its starting point a seminal study published in 2019, in which all problem features are described in detail. We pay special attention to the optimization methods and problem-solving strategies that have been suggested in CMfg scheduling. From the review carried out, we can assert that CMfg is a topic of growing interest within the scientific community. We also conclude that the methods based on bio-inspired metaheuristics are by far the most widely used (they represent more than 50% of the articles found). On the other hand, we suggest some lines for future research to further consolidate this field. In particular, we want to highlight the multi-objective approach, since due to the nature of the problem and the production paradigm, the optimization objectives involved are generally in conflict. In addition, decentralized approaches such as those based on game theory are promising lines for future research.


    For a continuous risk outcome 0<y<1, a model with a random effect has potentially a wide application in portfolio risk management, especially, for stress testing [1,2,7,16,19], capital allocation, conditional expected shortfall estimation [3,11,17].

    Given fixed effects x=(x1,x2,,xk), two widely used regression models to estimate the expected value E(y|x) are: the fraction response model [10] and Beta regression model [4,6,8]. There are cases, however, where tail behaviours or severity levels of the risk outcome are relevant. In those cases, a regression model may no longer fit in for the requirements. In addition, a fraction response model of the form E(y|x)=Φ(a0+a1x1++akxk) may not be adequate when data exhibits significant heteroscedasticity, where Φ is a map from R1 to the open interval (0,1).

    In this paper, we assume that the risk outcome y is driven by a model:

    y=Φ(a0+a1x1++akxk+bs), (1.1)

    where s is a random continuous variable following a known distribution, independent of fixed effects (x1,x2,,xk). Parameters a0,a1,,ak are constant, while parameter b can be chosen to be dependent on (x1,x2,,xk) when required, for example, for addressing data heteroscedasticity.

    Given random effect model (1.1), the expected value E(y|x) can be deduced accordingly. It is given by the integral ΩΦ(a0+a1x1++akxk+bs)f(s)ds over the domain Ω of s, where f is the probability density of s. Given the routine QUAD implemented in SAS and Python, this integral can be evaluated as quickly as other function calls. Relative error tolerance for QUAD is 1.49e-8 in Python and is 1e-7 in SAS. But one can rescale the default tolerance to a desired level when necessary. This leads to an alternative regression tool to the fraction response model and Beta regression model.

    We introduce a family of interval distributions based on variable transformations. Probability densities for these distributions are provided (Proposition 2.1). Parameters of model (1.1) can then be estimated by maximum likelihood approaches assuming an interval distribution. In some cases, these parameters get an analytical solution without the needs for a model fitting (Proposition 4.1). We call a model with a random effect, where parameters are estimated by maximum likelihood assuming an interval distribution, an interval distribution model.

    In its simplest form, the interval distribution model y=Φ(a+bs), where a and b, are constant, can be used to model the loss rate as a random distribution for a homogeneous portfolio. Let yα and sα denote the α -quantiles for y and s at level α, 0<α<1. Then yα=Φ(a+bsα). The conditional expected shortfall for loss rate y, at level α, can then be estimated as the integral 11α[sα,+)Φ(a+bs)f(s)ds, where f is the density of s. Meanwhile, a stress testing loss estimate, derived from a model on a specific scenario, can be compared in loss rate to severity yα(=Φ(a+bsα)), to position its level of severity. A loss estimate may not have reached the desired, for example, 99% level yet, if it is far below y0.99, and far below the maximum historical loss rate. In which case, further recalibrations for the model may be required.

    The paper is organized as follows: in section 2, we introduce a family of interval distributions. A measure for tail fatness is defined. In section 3, we show examples of interval distributions and investigate their tail behaviours. We propose in section 4 an algorithm for estimating the parameters in model (1.1).

    Interval distributions introduced in this section are defined for a risk outcome over a finite open interval (c0,c1), where c0< c1 are finite numbers. These interval distributions can potentially be used for modeling a risk outcome over an arbitrary finite interval, including interval (0, 1), by maximum likelihood approaches.

    Let D=(d0,d1), d0<d1, be an open interval, where d0 can be finite or and d1 can be finite or +.

    Let

    Φ:D(c0,c1) (2.1)

    be a transformation with continuous and positive derivatives Φ(x)=ϕ(x). A special example is (c0,c1)=(0,1), and Φ:D(0,1) is the cumulative distribution function (CDF) of a random variable with a continuous and positive density.

    Given a continuous random variable s, let f and F be respectively its density and CDF. For constants a and b>0, let

    y=Φ(a+bs), (2.2)

    where we assume that the range of variable (a+bs) is in the domain D of Φ. Let g(y,a,b) and G(y,a,b) denote respectively the density and CDF of y in (2.2).

    Proposition 2.1. Given Φ1(y), functions g(y,a,b) and G(y,a,b) are given as:

    g(y,a,b)=U1/(bU2) (2.3)
    G(y,a,b)=F[Φ1(y)ab]. (2.4)

    where

    U1=f{[Φ1(y)a]/b},U2=ϕ[Φ1(y)] (2.5)

    Proof. A proof for the case when (c0,c1)=(0,1) can be found in [18]. The proof here is similar. Since G(y,a,b) is the CDF of y, it follows:

    G(y,a,b)=P[Φ(a+bs)y]
    =P{s[Φ1(y)a]/b}
    =F{[Φ1(y)a]/b}.

    By chain rule and the relationship Φ[Φ1(y)]=y, the derivative of Φ1(y) with respect to y is

    Φ1(y)y=1ϕ[Φ1(y)]. (2.6)

    Taking the derivative of G(y,a,b) with respect to y, we have

    G(y,a,b)y=f{[Φ1(y)a]/b}bϕ[Φ1(y)]=U1bU2.

    One can explore into these interval distributions for their shapes, including skewness and modality. For stress testing purposes, we are more interested in tail risk behaviours for these distributions.

    Recall that, for a variable X over (− ,+), we say that the distribution of X has a fat right tail if there is a positive exponent α>0, called tailed index, such that P(X>x)xα. The relation refers to the asymptotic equivalence of functions, meaning that their ratio tends to a positive constant. Note that, when the density is a continuous function, it tends to 0 when x+. Hence, by L’Hospital’s rule, the existence of tailed index is equivalent to saying that the density decays like a power law, whenever the density is a continuous function.

    For a risk outcome over a finite interval (c0,c1), c0,<c1, however, its density can be + when approaching boundaries c0 and c1. Let y0 be the largest lower bound for all values of y under (2.2), and y1 the smallest upper bound. We assume y0=c0 and y1=c1.

    We say that an interval distribution has a fat right tail if the limit limyy1  g(y,a,b)=+, and a fat left tail if limyy+0  g(y,a,b)=+, where yy+0 and yy1 denote respectively y approaching y0 from the right-hand-side, and y1 from the left-hand-side. For simplicity, we write yy0 for yy+0, and yy1 for yy1.

    Given α>0, we say that an interval distribution has a fat right tail with tailed index α if limyy1  g(y,a,b)(y1y)β=+ whenever 0<β<α, and limyy1  g(y,a,b)(y1y)β=0 for β>α. Similarly, an interval distribution has a fat left tail with tailed index α if limyy0  g(y,a,b)(yy0)β=+ whenever 0<β<α, and limyy0  g(y,a,b)(yy0)β=0 for β>α. Here the status at β=α is left open. There are examples (Remark 3.4), where an interval distribution has a fat right tail with tailed index α, but the limit limyy1  g(y,a,b)(y1y)α can either be + or 0. Under this definition, a tailed index of an interval distribution with a continuous density is always larger than 0 and less or equal to 1, if it exists.

    Recall that, for a Beta distribution with parameters α>0 and β>0, its density is given by f(x)=xα1(1x)β1B(α,β), where B(α,β) is the Beta function . Under the above definition, Beta distribution has a fat right tail with tailed index (1β) when 0<β<1, and a fat left tail with tailed index (1α) when 0<α<1.

    Next, because the derivative of Φ is assumed to be continuous and positive, it is strictly monotonic. Hence Φ1(y) is defined. Let

    z=Φ1(y) (2.7)

    Then limyy0z exists (can be ), and the same for limyy1z (can be +). Let limyy0  z=z0, and limyy1  z=z1. Rewrite g(y,a,b) as g(Φ(z),a,b) by (2.7). Let [g(Φ(z),a,b)]1β/z denote the derivative of [g(Φ(z),a,b)]1/β with respect to z.

    Lemma 2.2. Given β>0, the following statements hold:

    (ⅰ) limyy0  g(y,a,b)(yy0)β=limzz0  g(Φ(z),a,b)(Φ(z)y0)β and limyy1  g(y,a,b)(y1y)β=limzz1  g(Φ(z),a,b)(y1Φ(z))β.

    (ⅱ) If limyy0  g(y,a,b)=+ and limzz0{[g(Φ(z),a,b)]1β/z}/ϕ(z) is 0 (resp. +), then limyy0  g(y,a,b)(yy0)β=+ (resp. 0).

    (ⅲ) If limyy1  g(y,a,b)=+ and limzz1{[g(Φ(z),a,b)]1β/z}/ϕ(z)) is 0 (resp. +), then limyy1  g(y,a,b)(y1y)β=+ (resp. 0).

    Proof. The first statement follows from the relationship y=Φ(z). For statements (ⅱ) and (ⅲ), we show only (ⅲ). The proof for (ⅱ) is similar. Notice that

    [g(y,a,b)(y1y)β]1/β=[g(y,a,b)]1/βy1y=[g(Φ(z),a,b)]1/βy1Φ(z). (2.8)

    By L’Hospital’s rule and taking the derivatives of the numerator and the denominator of (2.8) with respect to z, we have limyy1[g(y,a,b)(y1y)β]1/β=0 (resp. +) if limzz0{[g(Φ(z),a,b)]1/β/z}/ϕ(z) is 0 (resp. +). Hence limyy1  g(y,a,b)(y1y)β=+ (resp. 0).

    For tail convexity, we say that the right tail of an interval distribution is convex if g(y,a,b) is convex for y1є<y<y1 for sufficiently small є>0. Similarly, the left tail is convex if g(y,a,b) is convex for y0<y<y0+є for sufficiently small є>0. One sufficient condition for convexity for the right (resp. left) tail is gyy(y,a,b)0 when y is sufficiently close to y1 (resp. y0).

    Again, write g(y,a,b)=g(Φ(z),a,b). Let

    h(z,a,b)=log[g(Φ(z),a,b)], (2.9)

    where log(x) denotes the natural logarithmic function. Then

    g(y,a,b)=exp[h(z,a,b)]. (2.10)

    By (2.9), (2.10), using (2.6) and the relationship z=Φ1(y), we have

    gy=[hz(z)/ϕ(z)]exp[h(Φ1(y),a,b)],gyy=[hzz(z)ϕ2(z)hz(z)ϕz(z)ϕ3(z)+hz(z)hz(z)ϕ2(z)]exp[h(Φ1(y),a,b)]. (2.11)

    The following lemma is useful for checking tail convexity, it follows from (2.11).

    Lemma 2.3. Suppose ϕ(z)>0, and derivatives hz(z),hz(z), and ϕz(z), with respect to z, all exist. If hzz(z)0 and hz(z)ϕz(z)0, then gyy(y,a,b)0.

    In this section, we focus on the case where (c0,c1)=(0,1), and Φ:D(0,1) in (2.2) is the CDF of a continuous distribution . This includes, for example, the CDFs for standard normal and standard logistic distributions.

    One can explore into a wide list of densities with different choices for Φ and s under (2.2). We consider here only the following four interval distributions:

    A. sN(0,1) and Φ is the CDF for the standard normal distribution.

    B. s follows the standard logistic distribution and Φ is the CDF for the standard normal distribution.

    C. s follows the standard logistic distribution and Φ is its CDF.

    D.D. sN(0,1) and Φ is the CDF for standard logistic distribution.

    Densities for cases A, B, C, and D are given respectively in (3.3) (section 3.1), (A.1), (A.3), and (A5) (Appendix A). Tail behaviour study is summarized in Propositions 3.3, 3.5, and Remark 3.6. Sketches of density plots are provided in Appendix B for distributions A, B, and C.

    Using the notations of section 2, we have ϕ=f and Φ=F. We claim that y=Φ(a+bs) under (2.2) follows the Vasicek distribution [13,14].

    By (2.5), we have

    log(U1U2)=z2+2aza2+b2z22b2 (3.1)
    =(1b2)(za1b2)2+b21b2a22b2. (3.2)

    Therefore, we have

    g(y,a,b)=1bexp{(1b2)(za1b2)2+b21b2a22b2}. (3.3)

    Again, using the notations of section 2, we have y0=0 and y1=1. With z=Φ1(y), we have limy0  z= and limy1  z=+. Recall that a variable 0<y<1 follows a Vasicek distribution [13,14] if its density has the form:

    g(y,p,ρ)=1ρρexp{12ρ[1ρΦ1(y)Φ1(p)]2+12[Φ1(y)]2} (3.4)

    where p is the mean of y , and ρ is a parameter called asset correlation.

    Proposition 3.1. Density (3.3) is equivalent to (3.4) under the relationships:

    a=Φ1(p)1ρ  and  b=ρ1ρ. (3.5)

    Proof. A similar proof can be found in [19]. By (3.4), we have

    g(y,p,ρ)=1ρρexp{1ρ2ρ[Φ1(y)Φ1(p)/1ρ]2+12[Φ1(y)]2}
    =1bexp{12[Φ1(y)ab]2}exp{12[Φ1(y)]2}
    =U1/(bU2)=g(y,a,b).

    The following relationships are implied by (3.5):

    ρ=b21+b2, (3.6)
    a=Φ1(p)1+b2. (3.7)

    Remark 3.2. The mode of g(y,p,ρ) in (3.4) is given in [14] as Φ(1ρ12ρΦ1(p)). We claim this is the same as Φ(a1b2). By (3.6), 12ρ=1b21+b2 and 1ρ=11+b2. Therefore, we have

    1ρ12ρΦ1(p)=1+b21b2Φ1(p)=a1b2.

    This means Φ(1ρ12ρΦ1(p))=Φ(a1b2).

    Proposition 3.3. The following statements hold for g(y,a,b) given in (3.3):

    (ⅰ) g(y,a,b) is unimodal if 0<b<1 with mode given by Φ(a1b2), and is in U-shape if b>1.

    (ⅱ) If b>1,then  g(y,a,b) has a fat left tail and a fat right tail with tailed index (11/b2).

    (ⅲ) If b>1, both tails of g(y,a,b) are convex , and is globally convex if in addition a=0.

    Proof. For statement (ⅰ), we have (1b2)<0 when 0<b<1. Therefore by (3.2) function log(U1U2) reaches its unique maximum at z=a1b2, resulting in a value for the mode at Φ(a1b2). If b>1, then (1b2)>0, thus by (3.2), g(y,a,b) is first decreasing and then increasing when y varying from 0 to 1. This means (y,a,b) is in U-shape.

    Consider statement (ⅱ). First by (3.3), if b>1, then limy1  g(y,a,b)=+ and limy0  g(y,a,b)=+. Thus g(y,a,b) has a fat right and a fat left tail. Next for tailed index, we use Lemma 2.2 (ⅱ) and (ⅲ). By (3.1),

    [g(Φ(z),a,b)]1/β=b1/βexp((b21)z2+2aza22βb2) (3.8)

    By taking the derivative of (3.8) with respect to z and noting that ϕ(z)=12πexp(z22), we have

    {[g(Φ(z),a,b)]1β/z}/ϕ(z)=2πb1β(b21)z+aβb2exp((b21)z2+2aza22βb2+z22). (3.9)

    Thus limz+{[g(Φ(z),a,b)]1β/z}/ϕ(z) is 0 if b21βb2>1, and is + if b21βb2<1. Hence by Lemma 2.2 (ⅲ), g(y,a,b) has a fat right tail with tailed index (11/b2). Similarly, for the left tail, we have by (3.9)

    {[g(Φ(z),a,b)]1β/z}/ϕ(z)=2πb1β(b21)z+aβb2exp((b21)z2+2aza22βb2+z22). (3.10)

    Thus limz{[g(Φ(z),a,b)]1β/z}/ϕ(z) is 0 if b21βb2>1, and is + if b21βb2<1. Hence g(y,a,b) has a fat left tail with tailed index (11/b2) by Lemma 2.2 (ⅱ).

    For statement (ⅲ), we use Lemma 2.3. By (2.9) and using (3.2), we have

    h(z,a,b)=log(U1bU2)=(1b2)(za1b2)2+b21b2a22b2log(b).

    When b>1, it is not difficult to check out that hzz(z)0 and hz(z)ϕz(z)0 when z± or when a=0.

    Remark 3.4. Assume β=(11/b2) and b>1. By (3.9), we see

    limz+{[g(Φ(z),a,b)]1β/z}/ϕ(z)

    is + for a=0, and is 0 for a>0. Hence for this β, the limit limy1  g(y,a,b)(1y)β can be either 0 or +, depending on the value of a.

    For these distributions, we again focus on their tail behaviours. A proof for the next proposition can be found in Appendix A.

    Proposition 3.5. The following statements hold:

    (a) Density g(y,a,b) has a fat left tail and a fat right tail for case B for all b>0, and for case C if b>1. For case D, it does not have a fat right tail nor a fat left tail for any b>0.

    (b) The tailed index of g(y,a,b) for both right and left tails is 1 for case B for all b>0, and is (11b) for case C for B for b>1.

    Remark 3.6. Among distributions A, B, C, and Beta distribution, distribution B gets the highest tailed index of 1, independent of the choices of b>0.

    In this section, we assume that Φ in (2.2) is a function from R1 to (0,1) with positive continuous derivatives. We focus on parameter estimation algorithms for model (1.1).

    First, we consider a simple case, where risk outcome y is driven by a model:

    y=Φ(v+bs), (4.1)

    where b>0 is a constant, v=a0+a1x1++akxk, and sN(0,1), independent of fixed effects x=(x1,x2,,xk). The function Φ does not have to be the standard normal CDF. But when Φ is the standard normal CDF, the expected value E(y|x) can be evaluated by the formula ES[Φ(a+bs)]=Φ(a1+b2) [12].

    Given a sample {(x1i,x2i,,xki,yi)}ni=1, where (x1i,x2i,,xki,yi) denotes the ith data point of the sample, let zi=Φ1(yi). and vi=a0+a1x1i++akxki. By (2.3), the log-likelihood function for model (4.1) is:

    LL=ni=1{logf(zivib)logϕ(zi)logb} (4.2)

    where f is the density of s. The part of ni=1logϕ(zi) is constant, which can be dropped off from the maximization.

    Recall that the least squares estimators of a0,a1,,ak, as a row vector, that minimize the sum squares

    SS=ni=1(zivi)2 (4.3)

    has a closed form solution given by the transpose of (XTX)1XTZ [5,9] whenever the design matrix X has a rank of k, where

    X=1x11xk11x12xk21x1nxkn,Z=z1z2zn.

    The next proposition shows there exists an analytical solution for the parameters of model (4.1).

    Proposition 4.1. Given a sample {(x1i,x2i,,xki,yi)}ni=1, assume that the design matrix has a rank of k. If sN(0,1), then the maximum likelihood estimates of parameters (a0,a1,,a), as a row vector, and parameter b are respectively given by the transpose of (XTX)1XTZ, and b2=1nni=1(zivi)2. In absence of fixed effects {x1,x2,,xk}, parameters a0 and b2 degenerate respectively to the sample mean and variance of z1, z2,,zn.

    Proof. Dropping off the constant term from (4.2) and noting f(z)=12πexp(z22), we have

    LL=12b2ni=1(zivi)2nlogb, (4.4)

    Hence the maximum likelihood estimates (a0,a1,,ak) are the same as least squares estimators of (4.3), which are given by the transpose of (XTX)1XTZ. By taking the derivative of (4.4) with respect to b and setting it to zero, we have b2=1nni=1(zivi)2.

    Next, we consider the general case of model (1.1), where the risk outcome y is driven by a model:

    y=Φ[v+ws], (4.5)

    where parameter w is formulated as w=exp(u), and u=b0+b1x1++bkxk. We focus on the following two cases:

    (a) sN(0,1),

    (b) s is standard logistic.

    Given a sample {(x1i,x2i,,xki,yi)}ni=1, let wi=exp(b0+b1x1i++bkxki) and ui=b0+b1x1i++bkxki. The log-likelihood functions for model (4.5), dropping off the constant part log(U2), for cases (a) and (b) are given respectively by (4.6) and (4.7):

    LL=ni=112[(zivi)2/w2iui], (4.6)
    LL=ni=1{(zivi)/wi2log[1+exp[(zivi)/wi]ui}, (4.7)

    Recall that a function is log-concave if its logarithm is concave. If a function is concave, a local maximum is a global maximum, and the function is unimodal. This property is useful for searching maximum likelihood estimates.

    Proposition 4.2. The functions (4.6) and (4.7) are concave as a function of (a0,a1,,ak). As a function of (b0,b1,,bk), (4.6) is concave.

    Proof. It is well-known that, if f(x) is log-concave, then so is f(Az+b), where Az+b : RmR1 is any affine transformation from the m-dimensional Euclidean space to the 1-dimensional Euclidean space. For (4.6), the function f(x)=(zv)2exp(2u) is concave as a function of v, thus function (4.6) is concave as a function of (a0,a1,,ak). Similarly, this function f(x) is concave as a function of u, so (4.6) is concave as a function of (b0,b1,,bk).

    For (4.7), the linear part (zivi)exp(ui), as a function of (a0,a1,,ak), in (4.7) is ignored. For the second part in (4.7), we know log{1+exp[(zv)/exp(u)]}, as a function of v, is the logarithm of the CDF of a logistic distribution. It is well-known that the CDF for a logistic distribution is log-concave. Thus (4.7) is concave with respect to (a0,a1,,ak).

    In general, parameters (a0,a1,,ak) and (b0,b1,,bk) in model (4.5) can be estimated by the algorithm below.

    Algorithm 4.3. Follow the steps below to estimate parameters of model (4.5):

    (a) Given (b0,b1,,bk), estimate (a0,a1,,ak) by maximizing the log-likelihood function;

    (b) Given (a0,a1,,ak), estimate (b0,b1,,bk) by maximizing the log-likelihood function;

    (c) Iterate (a) and (b) until a convergence is reached.

    With the interval distributions introduced in this paper, models with a random effect can be fitted for a continuous risk outcome by maximum likelihood approaches assuming an interval distribution. These models provide an alternative regression tool to the Beta regression model and fraction response model, and a tool for tail risk assessment as well.

    Authors are very grateful to the third reviewer for many constructive comments. The first author is grateful to Biao Wu for many valuable conversations. Thanks also go to Clovis Sukam for his critical reading for the manuscript.

    We would like to thank you for following the instructions above very closely in advance. It will definitely save us lot of time and expedite the process of your paper's publication.

    The views expressed in this article are not necessarily those of Royal Bank of Canada and Scotiabank or any of their affiliates. Please direct any comments to Bill Huajian Yang at h_y02@yahoo.ca.



    [1] L. Atzori, A. Iera, G. Morabito, The internet of things: A survey, Comp. Netw., 54 (2010), 2787-2805. doi: 10.1016/j.comnet.2010.05.010
    [2] P. Mell, T. Grance, The nist definition of cloud computing, 2011.
    [3] P. Wang, R. X. Gao, Z. Fan, Cloud computing for cloud manufacturing: Benefits and limitations, J. Manufac. Sci. Eng., 137 (2015), 1-9.
    [4] B. Li, L. Zhang, S. Wang, F. Tao, J. W. Cao, X. D. Jiang, et al., Cloud manufacturing: A new service-oriented networked manufacturing model, Compu. Inte. Manufac. Sys., 16 (2010), 1-7.
    [5] X. Xu, From cloud computing to cloud manufacturing, Compu. Inte. Manufac. Sys., 28 (2012), 75-86. doi: 10.1016/j.rcim.2011.07.002
    [6] Y. Yang, Y. D. Cai, Q. Lu, Y. Zhang, S. Koric, C. Shao, High-performance computing based big data analytics for smart manufacturing, In: ASME 2018 13th International Manufacturing Science and Engineering Conference. American Society of Mechanical Engineers Digital Collection, (2018).
    [7] L. Wang, X. V. Wang, Cloud-based cyber-physical systems in manufacturing, 1st edition, SpringerVerlag, 2018.
    [8] Y. Liu, L. Wang, X. Wang, X. Xu, P. Jiang, Cloud manufacturing: key issues and future perspectives, Int. J. Compu. Inte. Manufac., 32 (2019), 858-874. doi: 10.1080/0951192X.2019.1639217
    [9] Y. Liu, L. Wang, X. V. Wang, Cloud manufacturing: Latest advancements and future trends, Proc. Manufac., 25 (2018), 62-73. doi: 10.1016/j.promfg.2018.06.058
    [10] D. Wu, D. W. Rosen, L. Wang, D. Schaefer, Cloud-based design and manufacturing: A new paradigm in digital manufacturing and design innovation, Compu. Aided Des., 59 (2015), 1-14. doi: 10.1016/j.cad.2014.07.006
    [11] Y. Liu, L. Wang, X. V. Wang, X. Xu, L. Zhang, Scheduling in cloud manufacturing: State-of-theart and research challenges, Cinter. J. Prod. Res., 57 (2019), 4854-4879. doi: 10.1080/00207543.2018.1449978
    [12] L. Monostori, Cyber-physical production systems: Roots, expectations and r & d challenges, Proc. CIRP, 17 (2019), 9-13.
    [13] D. A. Rossit, F. Tohmé, M. Frutos, Industry 4.0: Smart scheduling, Int. J. Prod. Res., 57 (2019), 3802-3813. doi: 10.1080/00207543.2018.1504248
    [14] J. Lee, B. Bagheri, H. Kao, A cyber-physical systems architecture for industry 4.0-based manufacturing systems, Manufac. Let., 3 (2018), 18-23.
    [15] J.Wang, L. Zhang, L. Duan, R. X. Gao, A new paradigm of cloud-based predictive maintenance for intelligent manufacturing, J. Intel. Manufac., 28 (2019), 1125-1137.
    [16] Y. Zhang, Y. Cheng, X. V. Wang, R. Y. Zhong, Y. Zhang, F. Tao, Data-driven smart production line and its common factors, Int. J. Adv. Manufac. Tech., 103 (2019), 1211-1223. doi: 10.1007/s00170-019-03469-9
    [17] D. A. Rossit, F. Tohmé, M. Frutos, Production planning and scheduling in cyber-physical produc-tion systems: A review, Int. J. Compu. Inte. Manufac., 32 (2019), 385-395. doi: 10.1080/0951192X.2019.1605199
    [18] J. Wang, K. Wang, Y. Wang, Z. Huang, R. Xue, Deep boltzmann machine based condition prediction for smart manufacturing, J. Amb. Intel. Hum. Compu., 10 (2019), 851-861. doi: 10.1007/s12652-018-0794-3
    [19] J. K. Lenstra, A. R. Kan, P. Brucker, Complexity of machine scheduling problems, An. Dis. Math., 1 (1977), 343-362. doi: 10.1016/S0167-5060(08)70743-X
    [20] M. Pinedo, Scheduling, 5th edition, Springer-Verlag, 2016.
    [21] A. Dolgui, D. Ivanov, S. P Sethi, B. Sokolov, Scheduling in production, supply chain and industry 4.0 systems by optimal control: Fundamentals, state-of-the-art and applications, Int. J. Prod. Res., 57 (2019), 411-432. doi: 10.1080/00207543.2018.1442948
    [22] D. A. Rossit, F. Tohmé, M. Frutos, A data-driven scheduling approach to smart manufacturing, J. Indus. Infor. Int., 15 (2019), 69-79.
    [23] D. A. Rossit, F. Tohmé., Scheduling research contributions to smart manufacturing, Manufac. Let., 15 (2018), 111-114. doi: 10.1016/j.mfglet.2017.12.005
    [24] H. Akbaripour, M. Houshmand, T. VanWoensel, N. Mutlu, Cloud manufacturing service selection optimization and scheduling with transportation considerations: Mixed-integer programming models, Int. J. Adv. Manufac. Tech., 95 (2018), 43-70. doi: 10.1007/s00170-017-1167-3
    [25] Y. Liu, L. Zhang, L. Wang, Y. Xiao, X. Xu, M. Wang, A framework for scheduling in cloud manufacturing with deep reinforcement learning, in 2019 IEEE 17th International Conference on Industrial Informatics (INDIN), 1 (2019), 1775-1780.
    [26] S. Lin, Y. Laili, Y. Luo, Integrated optimization of supplier selection and service scheduling in cloud manufacturing environment, in 2018 4th International Conference on Universal Village, (2018), 1-6.
    [27] H. Zhu, M. Li, Y. Tang, Y. Sun, A deep-reinforcement-learning-based optimization approach for real-time scheduling in cloud manufacturing, IEEE Access, 8 (2020), 9987-9997. doi: 10.1109/ACCESS.2020.2964955
    [28] M. Petticrew, H. Roberts, Systematic reviews in the social sciences: A practical guide, John Wiley & Sons, (2008).
    [29] R. B. Briner, D. Denyer, Systematic review and evidence synthesis as a practice and scholarship too, Handb. Evid. Manag. Comp. Class. Res., (2012), 112-129.
    [30] D. Denyer, D. Tranfield, Producing a systematic review, (2009).
    [31] J. Delaram, O. F. Valila, A mathematical model for task scheduling in cloud manufacturing systems focusing on global logistics, Proc. Manufact., 17 (2018), 387-394. doi: 10.1016/j.promfg.2018.10.061
    [32] T. Suma, R. Murugesan, Study on multi-task oriented service composition and optimization problem of customer order scheduling problem using fuzzy min-max algorithm, Int. J. Mecha. Eng. Tech., 10 (2019), 219-231.
    [33] B. Vahedi-Nouri, R. Tavakkoli-Moghaddam, M. Rohaninejad, A multi-objective scheduling model for a cloud manufacturing system with pricing, equity, and order rejection, IFAC-Paper, 52 (2019), 2177-2182. doi: 10.1016/j.ifacol.2019.11.528
    [34] L. Zhang, C. Yu, T. N. Wong, Cloud-based frameworks for the integrated process planning and scheduling, Int. J. Compu. Inte. Manufac., 32 (2019), 1192-1206. doi: 10.1080/0951192X.2019.1690682
    [35] D. Wang, Y. Yu, Y. Yin, T. C. E. Cheng, Multi-agent scheduling problems under multitasking, Int. J. Produc. Res., (2020), 1-31.
    [36] Y. Liu, L. Wang, Y. Wang, X. V. Wang, L. Zhang, Multi-agent-based scheduling in cloud manufacturing with dynamic task arrivals, Proc. CIRP, 72 (2018), 953-960. doi: 10.1016/j.procir.2018.03.138
    [37] J. Xiao, W. Zhang, S. Zhang, X. Zhuang, Game theory-based multi-task scheduling in cloud manufacturing using an extended biogeography-based optimization algorithm, Concur. Eng., 27 (2019), 314-330. doi: 10.1177/1063293X19882744
    [38] J. Chen, G. Q Huang, J. Wang, C. Yang, A cooperative approach to service booking and scheduling in cloud manufacturing, Eur. J. Oper. Res., 273(3) (2019), 861-873.
    [39] Z. Liu, Z. Wang, C. Yang, Multi-objective resource optimization scheduling based on iterative double auction in cloud manufacturing, Adv. Manufac., 7(4) (2019), 374-388.
    [40] T. Bai, S. Liu, L. Zhang, A manufacturing task scheduling method based on public goods game on cloud manufacturing model, in 2018 4th International Conference on Universal Village (UV), (2018), 1-6.
    [41] Z. Liu, Z.Wang, A novel truthful and fair resource bidding mechanism for cloud manufacturing, IEEE Access, 8 (2019), 28888-28901.
    [42] L. Zhou, L. Zhang, Y. Laili, C. Zhao, Y. Xiao, Multi-task scheduling of distributed 3d printing services in cloud manufacturing, Int. J. Adv. Manufac. Tech., 96 (2018), 3003-3017. doi: 10.1007/s00170-017-1543-z
    [43] A. Simeone, A. Caggiano, B. N. Deng, Y. Zeng, L. Boun, Resource efficiency optimization engine in smart production networks via intelligent cloud manufacturing platforms, Proc. CIRP, 78 (2018), 19-24. doi: 10.1016/j.procir.2018.10.003
    [44] P. Helo, D. Phuong, Y. Hao, Cloud manufacturing-scheduling as a service for sheet metal manufacturing, Comp. Oper. Res., 110 (2019), 208-219. doi: 10.1016/j.cor.2018.06.002
    [45] T. Suma, R. Murugesan, Artificial immune algorithm for subtask industrial robot scheduling in cloud manufacturing, In J. Phys. Conf. Ser, 1000 (2018), 1-8.
    [46] L. Zhou, L. Zhang, C. Zhao, Y. Laili, L. Xu, Diverse task scheduling for individualized requirements in cloud manufacturing, Enter. Infor. Sys., 12 (2018), 300-318. doi: 10.1080/17517575.2017.1364428
    [47] M. Yuan, X. Cai, Z. Zhou, C. Sun, W. Gu, J. Huang, Dynamic service resources scheduling method in cloud manufacturing environment, Int. J. Produc. Res., 11 (2019), 1-18.
    [48] W. He, G. Jia, H. Zong, J. Kong, Multi-objective service selection and scheduling with linguistic preference in cloud manufacturing, Sustainability, 11 (2019), 2619. doi: 10.3390/su11092619
    [49] E. Jafarnejad-Ghomi, A. M. Rahmani, N. N. Qader, Service load balancing, scheduling, and logistics optimization in cloud manufacturing by using genetic algorithm, Concu. Compu. Prac. Exper., 31 (2019), 5329.
    [50] Y. Hu, F. Zhu, L. Zhang, Y. Lui, Z. Wang, Scheduling of manufacturers based on chaos optimization algorithm in cloud manufacturing, Robo. Comp. Inte. Manufac., 58 (2019), 13-20. doi: 10.1016/j.rcim.2019.01.010
    [51] F. Zhang, J. Hui, B. Zhu, Y. Guo, An improved firefly algorithm for collaborative manufacturing chain optimization problem, in Proceedings of the Institution of Mechanical Engineers, Part B: Journal of Engineering Manufacture, 233 (2019), 1711-1722.
    [52] W. Zhang, J. Ding, Y. Wang, S. Zhang, Z. Xiong, Multi-perspective collaborative scheduling using extended genetic algorithm with interval-valued intuitionistic fuzzy entropy weight method, J. Manufac. Sys., 53 (2019), 249-260. doi: 10.1016/j.jmsy.2019.10.002
    [53] A. Elgendy, J. Yan, M. Zhang, Integrated strategies to an improved genetic algorithm for allocating and scheduling multi-task in cloud manufacturing environment, Proc. Manufac., 39 (2019), 1872- 1879. doi: 10.1016/j.promfg.2020.01.251
    [54] Y. Du, J. L.Wang, L. Lei, Multi-objective scheduling of cloud manufacturing resources through the integration of cat swarm optimization and firefly algorithm, Adv. Prod. Eng. Manag., 14 (2019).
    [55] H. Zhang, C. Ma, S. Zhang, S. Liu, Research on the fjss problem with discrete equipment capability in cloud manufacturing environment, Int. J. Inter. Manufac. Ser., 6 (2019), 123-138.
    [56] F. Li, L. Zhang, T. W. Liao, Y. Liu, Multi-objective optimisation of multi-task scheduling in cloud manufacturing, Int. J. Prod. Res., 57 (2019), 3847-3863. doi: 10.1080/00207543.2018.1538579
    [57] E. Jafarnejad-Ghomi, A. M. Rahmani, N. N. Qader, Service load balancing, task scheduling and transportation optimisation in cloud manufacturing by applying queuing system, Enter. Infor. Sys., 13 (2019), 865-894. doi: 10.1080/17517575.2019.1599448
    [58] Y. Li, G. Luo, Solving flexible job shop scheduling problem in cloud manufacturing environment based on improved genetic algorithm, in IOP Conference Series: Materials Science and Engineering, 612 (2019).
    [59] Y. Shi, L. Luo, H. Guang, Research on scheduling of cloud manufacturing resources based on bat algorithm and cellular automata, in 2019 IEEE International Conference on Smart Manufacturing, Industrial & Logistics Engineering (SMILE), (2019), 174-177.
    [60] Y. Laili, S. Lin, D. Tang, Multi-phase integrated scheduling of hybrid tasks in cloud manufacturing environment, Rob. Compu.Inte. Manufac., 61 (2020).
    [61] M. M. Fazeli, Y. Farjami, M. Nickray, An ensemble optimisation approach to service composition in cloud manufacturing, Int. J. Comp. Int. Manufac., 32 (2019), 83-91. doi: 10.1080/0951192X.2018.1550679
    [62] J. Ding, Y. Wang, S. Zhang, W. Zhang, Z. Xiong, Robust and stable multi-task manufacturing scheduling with uncertainties using a two-stage extended genetic algorithm, Enter. Infor. Systems, 13 (2019), 1442-1470. doi: 10.1080/17517575.2019.1656290
    [63] F. Li, W. Liao, W. Cai, L. Zhang, Multi-task scheduling in consideration of fuzzy uncertainty of multiple criteria in service-oriented manufacturing, IEEE Trans. Fuz. Sys., (2020).
    [64] S. Chen, S. Fang, R. Tang, A reinforcement learning based approach for multi-projects scheduling in cloud manufacturing, Int. J. Prod. Res., 57 (2019), 3080-3098. doi: 10.1080/00207543.2018.1535205
    [65] T. Dong, F. Xue, C. Xiao, J. Li, Task scheduling based on deep reinforcement learning in a cloud manufacturing environment, Concur. Comp. Prac. Exper., 32 (2020), e5654.
    [66] C. Morariu, O. Morariu, S. Raileanu, T. Borangiu, Machine learning for predictive scheduling and resource allocation in large scale manufacturing systems, Compu. Indus., 120 (2020), e5654.
    [67] L. Zhou, L. Zhang, L. Ren, Simulation model of dynamic service scheduling in cloud manufacturing, in IECON 2018-44th Annual Conference of the IEEE Industrial Electronics Society, (2018), 4199-4204.
    [68] L. Zhou, L. Zhang, B. R. Sarker, Y. Laili, L. Ren, An event-triggered dynamic scheduling method for randomly arriving tasks in cloud manufacturing, Int. J. Compu. Inte. Manufac., 31 (2018), 318- 333. doi: 10.1080/0951192X.2017.1413252
    [69] W. He, G. Jia, H. Zong, T. Huang, Multi-objective cloud manufacturing service selection and scheduling with different objective priorities, Sustainability, 11 (2019).
    [70] Y. Wang, P. Zheng, X. Xu, H. Yang, J. Zou, Production planning for cloud-based additive manufacturing-a computer vision-based approach, Robo. Compu. Inte. Manufac., 58 (2019), 145-157. doi: 10.1016/j.rcim.2019.03.003
    [71] L. Zhou, L. Zhang, Y. Fang, Logistics service scheduling with manufacturing provider selection in cloud manufacturing, Robo. Compu. Inte. Manufac., 65 (2020).
    [72] J.Wang, Y. Ma, L. Zhang, R. X. Gao, D.Wu, Deep learning for smart manufacturing: Methods and applications, J. Manufac. Sys., 48 (2018), 144-156. doi: 10.1016/j.jmsy.2018.01.003
    [73] K. Deb, Multi-objective optimization using evolutionary algorithms, John Wiley & Sons (2001).
    [74] G. E. Vieira, J. W. Herrmann, E. Lin, Rescheduling manufacturing systems: A framework of strategies, policies, and methods, J. Schedu., 6 (2003), 39-62. doi: 10.1023/A:1022235519958
    [75] F. Bonomi, R. Milito, J. Zhu, S. Addepalli, Fog computing and its role in the internet of things, in Proceedings of the first edition of the MCC workshop on Mobile cloud computing, (2012), 13-16.
    [76] S. Yi, C. Li, Q. Li, A survey of fog computing: concepts, applications and issues, in Proceedings of the 2015 workshop on mobile big data, (2015), 37-42.
    [77] F. Al-Haidari, M. Sqalli, K. Salah, Impact of cpu utilization thresholds and scaling size on autoscaling cloud resources, in 2013 IEEE 5th International Conference on Cloud Computing Technology and Science, 2 (2013), 256-261.
    [78] K. Salah, J. M. A. Calero, S. Zeadally, S. Al-Mulla, M. Alzaabi, Using cloud computing to implement a security overlay network, IEEE Secu. Pri., 11 (2012), 44-53.
    [79] C. Xu, G. Zhu, Intelligent manufacturing lie group machine learning: Real-time and efficient inspection system based on fog computing, J. Intel. Manufac., 11 (2020), 1-13.
    [80] K. Salah, A queueing model to achieve proper elasticity for cloud cluster jobs, in 2013 IEEE Sixth International Conference on Cloud Computing, (2013), 755-761.
    [81] S. El-Kafhali, K. Salah, Efficient and dynamic scaling of fog nodes for iot devices, J. Supercomp., 73 (2017), 5261-5284. doi: 10.1007/s11227-017-2083-x
  • Reader Comments
  • © 2020 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(9532) PDF downloads(358) Cited by(23)

Figures and Tables

Figures(3)

/

DownLoad:  Full-Size Img  PowerPoint
Return
Return

Catalog