Research article Special Issues

A sustainable smart production model for partial outsourcing and reworking


  • Received: 29 June 2022 Revised: 27 December 2022 Accepted: 05 January 2023 Published: 23 February 2023
  • Smart production plays a significant role to maintain good business terms among supply chain players in different situations. Adjustment in production uptime is possible because of the smart production system. The management may need to reduce production uptime to deliver products ontime. But, a decrement in production uptime reduces the projected production quantity. Then, the management uses a limited investment for pursuing possible alternatives to maintain production schedules and the quality of products. This present study develops a mathematical model for a smart production system with partial outsourcing and reworking. The market demand for the product is price dependent. The study aims to maximize the total profit of the production system. Even in a smart production system, defective production rate may be less but unavoidable. Those defective products are repairable. The model is solved by classical optimization. Results show that the application of a variable production rate of the smart production for variable market demand has a higher profit than a traditional production (52.65%) and constant demand (12.45%).

    Citation: Raj Kumar Bachar, Shaktipada Bhuniya, Ali AlArjani, Santanu Kumar Ghosh, Biswajit Sarkar. A sustainable smart production model for partial outsourcing and reworking[J]. Mathematical Biosciences and Engineering, 2023, 20(5): 7981-8009. doi: 10.3934/mbe.2023346

    Related Papers:

    [1] Abel Cabrera Martínez, Iztok Peterin, Ismael G. Yero . Roman domination in direct product graphs and rooted product graphs. AIMS Mathematics, 2021, 6(10): 11084-11096. doi: 10.3934/math.2021643
    [2] Fu-Tao Hu, Xing Wei Wang, Ning Li . Characterization of trees with Roman bondage number 1. AIMS Mathematics, 2020, 5(6): 6183-6188. doi: 10.3934/math.2020397
    [3] Rangel Hernández-Ortiz, Luis Pedro Montejano, Juan Alberto Rodríguez-Velázquez . Weak Roman domination in rooted product graphs. AIMS Mathematics, 2021, 6(4): 3641-3653. doi: 10.3934/math.2021217
    [4] Mingyu Zhang, Junxia Zhang . On Roman balanced domination of graphs. AIMS Mathematics, 2024, 9(12): 36001-36011. doi: 10.3934/math.20241707
    [5] Jian Yang, Yuefen Chen, Zhiqiang Li . Some sufficient conditions for a tree to have its weak Roman domination number be equal to its domination number plus 1. AIMS Mathematics, 2023, 8(8): 17702-17718. doi: 10.3934/math.2023904
    [6] Saeed Kosari, Yongsheng Rao, Zehui Shao, Jafar Amjadi, Rana Khoeilar . Complexity of signed total $k$-Roman domination problem in graphs. AIMS Mathematics, 2021, 6(1): 952-961. doi: 10.3934/math.2021057
    [7] Zhibin Du, Ayu Ameliatul Shahilah Ahmad Jamri, Roslan Hasni, Doost Ali Mojdeh . Maximal first Zagreb index of trees with given Roman domination number. AIMS Mathematics, 2022, 7(7): 11801-11812. doi: 10.3934/math.2022658
    [8] Bana Al Subaiei, Ahlam AlMulhim, Abolape Deborah Akwu . Vertex-edge perfect Roman domination number. AIMS Mathematics, 2023, 8(9): 21472-21483. doi: 10.3934/math.20231094
    [9] Chang-Xu Zhang, Fu-Tao Hu, Shu-Cheng Yang . On the (total) Roman domination in Latin square graphs. AIMS Mathematics, 2024, 9(1): 594-606. doi: 10.3934/math.2024031
    [10] Abel Cabrera-Martínez, Andrea Conchado Peiró . On the $ \{2\} $-domination number of graphs. AIMS Mathematics, 2022, 7(6): 10731-10743. doi: 10.3934/math.2022599
  • Smart production plays a significant role to maintain good business terms among supply chain players in different situations. Adjustment in production uptime is possible because of the smart production system. The management may need to reduce production uptime to deliver products ontime. But, a decrement in production uptime reduces the projected production quantity. Then, the management uses a limited investment for pursuing possible alternatives to maintain production schedules and the quality of products. This present study develops a mathematical model for a smart production system with partial outsourcing and reworking. The market demand for the product is price dependent. The study aims to maximize the total profit of the production system. Even in a smart production system, defective production rate may be less but unavoidable. Those defective products are repairable. The model is solved by classical optimization. Results show that the application of a variable production rate of the smart production for variable market demand has a higher profit than a traditional production (52.65%) and constant demand (12.45%).



    In this paper, we shall only consider graphs without multiple edges or loops. Let G=(V(G),E(G)) be a graph, vV(G), the neighborhood of v in G is denoted by N(v). That is to say N(v)={u|uvE(G),uV(G)}. The degree of a vertex v is denoted by d(v), i.e. d(v)=|N(v)|. A graph is trivial if it has a single vertex. The maximum degree and the minimum degree of a graph G are denoted by Δ(G) and δ(G), respectively. Denote by Kn the complete graph on n vertices.

    A subset D of the vertex set of a graph G is a dominating set if every vertex not in D has at least one neighbor in D. The domination number γ(G) is the minimum cardinality of a dominating set of G. A dominating set D of G with |D|=γ(G) is called a γ-set of G.

    Roman domination of graphs is an interesting variety of domination, which was proposed by Cockayne et al. [6]. A Roman dominating function (RDF) of a graph G is a function f:V(G){0,1,2} such that every vertex u for which f(u)=0 is adjacent to at least one vertex v for which f(v)=2. The weight w(f) of a Roman dominating function f is the value w(f)=uV(G)f(u). The minimum weight of an RDF on a graph G is called the Roman domination number γR(G) of G. An RDF f of G with w(f)=γR(G) is called a γR-function of G. The problems on domination and Roman domination of graphs have been investigated widely, for example, see list of references [8,9,10,13] and [3,7,12], respectively.

    In 2016, Chellali et al. [5] introduced a variant of Roman dominating functions, called Roman {2}-dominating functions. A Roman {2}-dominating function (R{2}DF) of G is a function f:V{0,1,2} such that uN(v)f(u)2 for every vertex vV with f(v)=0. The weight of a Roman {2}-dominating function f is the sum vVf(v). The Roman {2}-domination number γ{R2}(G) is the minimum weight of an R{2}DF of G. Note that if f is an R{2}DF of G and v is a vertex with f(v)=0, then either there is a vertex uN(v) with f(u)=2, or at least two vertices x,yN(v) with f(x)=f(y)=1. Hence, an R{2}DF of G is also an RDF of G, which is also mentioned by Chellali et al [5]. Moreover, they showed that the decision problem for Roman {2}-domination is NP-complete, even for bipartite graphs.

    In fact, a Roman {2}-dominating function is essentially the same as a weak {2}-dominating function, which was introduced by Brešar et al. [1] and studied in literatures [2,11,14,15].

    For a mapping f:V(G){0,1,2}, let (V0,V1,V2) be the ordered partition of V(G) induced by f such that Vi={x:f(x)=i} for i=0,1,2. Note that there exists a 1-1 correspondence between the function f and the partition (V0,V1,V2) of V(G), so we will write f=(V0,V1,V2).

    Chellali et al. [4] obtained the following lower bound of Roman domination number.

    Lemma 1. (Chellali et al. [4]) Let G be a nontrivial connected graph with maximum degree Δ. Then γR(G)Δ+1Δγ(G).

    In this paper, we generalize this result on nontrivial connected graph G with maximum degree Δ and minimum degree δ. We prove that γR(G)Δ+2δΔ+δγ(G). As a corollary, we obtain that 32γ(G)γR(G)2γ(G) for any nontrivial regular graph G. Moreover, we prove that γR(G)2γ{R2}(G)1 for every graph G and there exists a graph Ik such that γ{R2}(Ik)=k and γR(Ik)=2k1 for any integer k2.

    Lemma 2. (Cockayne et al. [6]) Let f=(V0,V1,V2) be a γR-function of an isolate-free graph G with |V1| as small as possible. Then

    (i) No edge of G joins V1 and V2;

    (ii) V1 is independent, namely no edge of G joins two vertices in V1;

    (iii) Each vertex of V0 is adjacent to at most one vertex of V1.

    Theorem 3. Let G be a nontrivial connected graph with maximum degree Δ(G)=Δ and minimum degree δ(G)=δ. Then

    γR(G)Δ+2δΔ+δγ(G). (2.1)

    Moreover, if the equality holds, then

    γ(G)=n(Δ+δ)Δδ+Δ+δandγR(G)=n(Δ+2δ)Δδ+Δ+δ.

    Proof. Let f=(V0,V1,V2) be a γR-function of G with V1 as small as possible. By Lemma 2, we know that N(v)V0 for any vV1 and N(v1)N(v2)= for any v1,v2V1. So we have

    |V1||V0|δ (2.2)

    Since G is nontrivial, it follows that V2. Note that every vertex in V2 is adjacent to at most Δ vertices in V0; we have

    |V0|Δ|V2| (2.3)

    By Formulae (2.2) and (2.3), we have

    |V1|Δδ|V2| (2.4)

    By the definition of an RDF, every vertex in V0 has at least one neighbor in V2. So V1V2 is a dominating set of G. Together with Formula (2.4), we can obtain that

    γ(G)|V1|+|V2|Δδ|V2|+|V2|=Δ+δδ|V2|.

    Note that f is a γR-function of G; we have

    γR(G)=|V1|+2|V2|=(|V1|+|V2|)+|V2|γ(G)+δΔ+δγ(G)=Δ+2δΔ+δγ(G).

    Moreover, if the equality in Formula (2.1) holds, then by previous argument we obtain that |V1|=|V0|δ, |V0|=Δ|V2|, and V1V2 is a γ-set of G. Then we have

    n=|V0|+|V1|+|V2|=|V0|+|V0|δ+|V0|Δ=Δδ+Δ+δΔδ|V0|.

    Hence, we have

    |V0|=nΔδΔδ+Δ+δ,|V1|=nΔΔδ+Δ+δ, and |V2|=nδΔδ+Δ+δ.

    So

    γR(G)=|V1|+2|V2|=n(Δ+2δ)Δδ+Δ+δ and γ(G)=|V1|+|V2|=n(Δ+δ)Δδ+Δ+δ

    since V1V2 is a γ-set of G. This completes the proof.

    Now we show that the lower bound in Theorem 3 can be attained by constructing an infinite family of graphs. For any integers k2, δ2 and Δ=kδ, we construct a graph Hk from K1,Δ by adding k news vertices such that each new vertex is adjacent to δ vertices of K1,Δ with degree 1 and no two new vertices has common neighbors. Then add some edges between the neighbors of each new vertex u such that δ(Hk)=δ and the induced subetaaph of N(u) in Hk is not complete. The resulting graph Hk is a connected graph with maximum degree Δ(G)=Δ and maximum degree δ(G)=δ. It can be checked that γ(Hk)=k+1 and γR(Hk)=k+2=Δ+2δΔ+δγ(G).

    For example, if k=2, δ=3 and Δ=kδ=6, then the graph H2 constructed by the above method is shown in Figure 1, where u1 and u2 are new vertices.

    Figure 1.  An example to illustrate the construction of Hk.

    Furthermore, by Theorem 3, we can obtain a lower bound of the Roman domination number on regular graphs.

    Corollary 4. Let G be an r-regular graph, where r1. Then

    γR(G)32γ(G) (2.5)

    Moreover, if the equality holds, then

    γ(G)=2nr+2andγR(G)=3nr+2.

    Proof. Since G is r-regular, we have Δ(G)=δ(G)=r. By Theorem 3 we can obtain that this corollary is true.

    For any integer n2, denote by G2n the (2n2)-regular graph with 2n vertices, namely G2n is the graph obtained from K2n by deleting a perfect matching. It can be checked that γ(G2n)=2 and γR(G2n)=3=32γ(G) for any n2. Hence, the bound in Corollary 4 is attained.

    Note that γR(G)2γ(G) for any graph G; we can conclude the following result.

    Corollary 5. Let G be an r-regular graph, where r1. Then

    32γ(G)γR(G)2γ(G).

    Chellali et al. [5] obtain the following bounds for the Roman {2}-domination number of a graph G.

    Lemma 6. (Chellali et al. [5]) For every graph G, γ(G)γ{R2}(G)γR(G)2γ(G).

    Lemma 7. (Chellali et al. [5]) If G is a connected graph of order n and maximum degree Δ(G)=Δ, then

    γ{R2}(G)2nΔ+2.

    Theorem 8. For every graph G, γR(G)2γ{R2}(G)1. Moreover, for any integer k2, there exists a graph Ik such that γ{R2}(Ik)=k and γR(Ik)=2k1.

    Proof. Let f=(V0,V1,V2) be an γ{R2}-function of G. Then γ{R2}(G)=|V1|+2|V2| and γR(G)2|V1|+2|V2| since V1V2 is a dominating set of G. If |V2|1, then γR(G)2|V1|+2|V2|=2γ{R2}(G)2|V2|2γ{R2}(G)2. If |V2|=0, then every vertex in V0 is adjacent to at least two vertices in V1. So for any vertex uV1, f=(V0,{u},V1{u}) is an RDF of G. Then we have γR(G)1+2|V1{u}|=2|V1|1=2γ{R2}(G)1.

    For any integer k2, let Ik be the graph obtained from Kk by replacing every edge of Kk with two paths of length 2. Then Δ(Ik)=2(k1) and δ(Ik)=2. We first prove that γ{R2}(Ik)=k. Since V(Ik)=|V(Kk)|+2|E(Kk)|=k+2k(k1)2=k2, by Lemma 7 we can obtain γ{R2}(Ik)2|V(Ik)|Δ(Ik)+2=2k22(k1)+2=k. On the other hand, let f(x)=1 for each xV(Ik) with d(x)=2(k1) and f(y)=0 for each yV(Ik) with d(y)=2. It can be seen that f is an R{2}DF of Ik and w(f)=k. Hence, γ{R2}(Ik)=k.

    We now prove that γR(Ik)=2k1. Let g={V1,V2,V3} be a γR-function of Ik such that |V1| is minimum. For each 4-cycle C=v1v2v3v4v1 of Ik with d(v1)=d(v3)=2(k1) and d(v2)=d(v4)=2, we have wg(C)=g(v1)+g(v2)+g(v3)+g(v4)2. If wg(C)=2, then by Lemma 2(iii) we have g(vi){0,2} for any i{1,2,3,4}. Hence, one of v1 and v3 has value 2 and g(v2)=g(v4)=0. If wg(C)=3, then by Lemma 2(i) we have {g(v1),g(v3)}={1,2} or {g(v2),g(v4)}={1,2}. When {g(v2),g(v4)}={1,2}, let {g(v1),g(v2)}={1,2}, g(v2)=g(v4)=0 and g(x)=g(x) for any xV(Ik){v1,v2,v3,v4}. Then g is also a γR-function of Ik. If wg(C)=4, then exchange the values on C such that v1,v3 have value 2 and v2,v4 have value 0. So we obtain that Ik has a γR-function h such that h(y)=0 for any yV(Ik) with degree 2. Note that any two vertices of Ik with degree 2(k1) belongs to a 4-cycle considered above; we can obtain that there is exactly one vertex z of Ik with degree 2(k1) such that h(z)=1. Hence, γR(Ik)=w(h)=2k1.

    Note that the graph Ik constructed in Theorem 8 satisfies that γ(Ik)=k=γ{R2}(Ik). By Theorem 8, it suffices to prove that γ(Ik)=k. Let A={v:vV(Ik),d(v)=2(k1)} and B=V(Ik)A. We will prove that Ik has a γ-set containing no vertex of B. Let D be a γ-set of Ik. If D contains a vertex uB. Since the degree of u is 2, let u1 and u2 be two neighbors of u in Ik. Then d(u1)=d(u2)=2(k1) and, by the construction of Ik, u1 and u2 have two common neighbors u,u with degree 2. Hence, at least one of u,u1, and u2 belongs to D. Let D=(D{u,u}){u1,u2}. Then D is also a γ-set of Ik. Hence, we can obtain a γ-set of Ik containing no vertex of B by performing the above operation for each vertex vDB. So A is a γ-set of Ik and γ(Ik)=|A|=k.

    By Lemma 6 and Theorem 8, we can obtain the following corollary.

    Corollary 9. For every graph G, γ{R2}(G)γR(G)2γ{R2}(G)1.

    Theorem 10. For every graph G, γR(G)γ(G)+γ{R2}(G)1.

    Proof. By Lemma 6 we can obtain that γR(G)2γ(G)γ(G)+γ{R2}(G). If the equality holds, then γR(G)=2γ(G) and γ(G)=γ{R2}(G). So γR(G)=2γ{R2}(G), which contradicts Theorem 8. Hence, we have γR(G)γ(G)+γ{R2}(G)1.

    In this paper, we prove that γR(G)Δ+2δΔ+δγ(G) for any nontrivial connected graph G with maximum degree Δ and minimum degree δ, which improves a result obtained by Chellali et al. [4]. As a corollary, we obtain that 32γ(G)γR(G)2γ(G) for any nontrivial regular graph G. Moreover, we prove that γR(G)2γ{R2}(G)1 for every graph G and the bound is achieved. Although the bounds in Theorem 3 and Theorem 8 are achieved, characterizing the graphs that satisfy the equalities remain a challenge for further work.

    The author thanks anonymous referees sincerely for their helpful suggestions to improve this work. This work was supported by the National Natural Science Foundation of China (No.61802158) and Natural Science Foundation of Gansu Province (20JR10RA605).

    The author declares that they have no conflict of interest.



    [1] Y. S. Chiu, C. J. Liu, M. H. Hwang, Optimal batch size considering partial outsourcing plan and rework, Jordan J. Mech. Ind. Eng., 11 (2017), 195–200.
    [2] M. Khouja, A. Mehrez, Economic production lot size model with variable production rate and imperfect quality, J. Oper. Res. Soc., 45 (1994), 1405–1417. https://doi.org/10.1057/jors.1994.217 doi: 10.1057/jors.1994.217
    [3] S. Eiamkanchanalai, A. Banerjee, Production lot sizing with variable production rate and explicit idle capacity cost, Int. J. Prod. Econ., 59 (1999), 251–259. https://doi.org/10.1016/S0925-5273(98)00102-9 doi: 10.1016/S0925-5273(98)00102-9
    [4] B. C. Giri, T. Dohi, Computational aspects of an extended EMQ model with variable production rate, Comput. Oper. Res., 32 (2005), 3143–3161. https://doi.org/10.1016/j.cor.2004.05.004 doi: 10.1016/j.cor.2004.05.004
    [5] C. H. Glock, Batch sizing with controllable production rates, Int. J. Prod. Econ., 48 (2010), 5925–5942. https://doi.org/10.1080/00207540903170906 doi: 10.1080/00207540903170906
    [6] T. Kim, C. H. Glock, Production planning for a two-stage production system with multiple parallel machines and variable production rates, Int. J. Prod. Econ., 196 (2018), 284–292. https://doi.org/10.1016/j.ijpe.2017.11.018 doi: 10.1016/j.ijpe.2017.11.018
    [7] B. Mridha, G. V. Ramana, S. Pareek, B. Sarkar, An efficient sustainable smart approach to biofuel production with emphasizing the environmental and energy aspects, Fuel, 336 (2023), 126896. https://doi.org/10.1016/j.fuel.2022.126896 doi: 10.1016/j.fuel.2022.126896
    [8] A. I. Malik, B. Sarkar, I. Q. Iqbal, M. Ullah, I. Khan, M. B. Ramzan, Coordination supply chain management in flexible production system and service level constraint: A Nash bargaining model, Comp. Indust. Eng., 177 (2023), 109002. https://doi.org/10.1016/j.cie doi: 10.1016/j.cie
    [9] N. Saxena, B. Sarkar, How does the retailing industry decide the best replenishment strategy by utilizing technological support through blockchain?, J. Retail. Consum. Ser., 71 (2023), 103151. https://doi.org/10.1016/j.jretconser.2022.103151 doi: 10.1016/j.jretconser.2022.103151
    [10] W. Shih, Optimal inventory policies when stockouts result from defective products, Int. J. Prod. Res., 18 (1980), 677–686. https://doi.org/10.1080/00207548008919699 doi: 10.1080/00207548008919699
    [11] M. J. Rosenblatt, H. L. Lee, Economic production cycles with imperfect production processes, IIE Trans., 18 (1986), 48–55. https://doi.org/10.1080/07408178608975329 doi: 10.1080/07408178608975329
    [12] T. Boone, R. Ganeshan, Y. Guo, J. K. Ord, The impact of imperfect processes on production run times, Decis. Sci., 31 (2000), 773–787. https://doi.org/10.1111/j.1540-5915.2000.tb00942.x doi: 10.1111/j.1540-5915.2000.tb00942.x
    [13] S. S. Sana, S. K. Goyal, K. Chaudhuri, An imperfect production process in a volume flexible inventory model, Int. J. Prod. Econ., 105 (2007), 548–559. https://doi.org/10.1016/j.ijpe.2006.05.005 doi: 10.1016/j.ijpe.2006.05.005
    [14] T. Chakraborty, B. C. Giri, Lot sizing in a deteriorating production system under inspections, imperfect maintenance and reworks, Oper. Res., 14 (2014), 29–50. https://doi.org/10.1007/s12351-013-0134-5 doi: 10.1007/s12351-013-0134-5
    [15] P. Jawla, S. Singh, Multi-item economic production quantity model for imperfect items with multiple production setups and rework under the effect of preservation technology and learning environment, Int. J. Ind. Eng. Comput., 7 (2016), 703–716. https://doi.org/10.5267/j.ijiec.2016.2.003 doi: 10.5267/j.ijiec.2016.2.003
    [16] B. Sarkar, B. Ganguly, S. Pareek, L. E. Cárdenas-Barrón, A three-echelon green supply chain management for biodegradable products with three transportation modes, Comp. Indust. Eng., 174 (2022), 108727. https://doi.org/10.1016/j.cie.2022.108727 doi: 10.1016/j.cie.2022.108727
    [17] B. Marchi, S. Zanoni, M. Y. Jaber, Economic production quantity model with learning in production, quality, reliability and energy efficiency, Comput. Ind. Eng., 129 (2019), 502–511. https://doi.org/10.1016/j.cie.2019.02.009 doi: 10.1016/j.cie.2019.02.009
    [18] B. Marchi, S. Zanoni, L. E. Zavanella, M. Y. Jaber, Supply chain models with greenhouse gases emissions, energy usage, imperfect process under different coordination decisions, Int. J. Prod. Econ., 211 (2019), 145–153. https://doi.org/10.1016/j.ijpe.2019.01.017 doi: 10.1016/j.ijpe.2019.01.017
    [19] E. Bazan, M. Y. Jaber, S. Zanoni, A review of mathematical inventory models for reverse logistics and the future of its modeling: An environmental perspective, Appl. Math. Modell., 40 (2016), 4151–4178. https://doi.org/10.1016/j.apm.2015.11.027 doi: 10.1016/j.apm.2015.11.027
    [20] S. D. Flapper, R. H. Teunter, Logistic planning of rework with deteriorating work-in-process, Int. J. Prod. Econ., 88 (2004), 51–59. https://doi.org/10.1016/S0925-5273(03)00130-0 doi: 10.1016/S0925-5273(03)00130-0
    [21] P. Biswas, B. R. Sarker, Optimal batch quantity models for a lean production system with in-cycle rework and scrap, Int. J. Prod. Res., 46 (2008), 6585–6610. https://doi.org/10.1080/00207540802230330 doi: 10.1080/00207540802230330
    [22] A. A. Taleizadeh, H. M. Wee, S. J. Sadjadi, Multi-product production quantity model with repair failure and partial backordering, Comput. Ind. Eng., 59 (2010), 45–54. https://doi.org/10.1016/j.cie.2010.02.015 doi: 10.1016/j.cie.2010.02.015
    [23] A. Khanna, A. Kishore, C. Jaggi, Strategic production modeling for defective items with imperfect inspection process, rework, and sales return under two-level trade credit, Int. J. Ind. Eng. Comput., 8 (2017), 85–118. https://doi.org/10.5267/j.ijiec.2016.7.001 doi: 10.5267/j.ijiec.2016.7.001
    [24] R. K. Bachar, S. Bhuniya, S. K. Ghosh, B. Sarkar, Controllable energy consumption in a sustainable smart manufacturing model considering superior service, flexible demand, and partial outsourcing, Mathematics, 10 (2022), 4517. https://doi.org/10.3390/math10234517 doi: 10.3390/math10234517
    [25] S. V. S. Padiyar, V. Vandana, N. Bhagat, S. R. Singh, B. Sarkar, Joint replenishment strategy for deteriorating multi-item through multi-echelon supply chain model with imperfect production under imprecise and inflationary environment, RAIRO-Oper. Res., 56 (2022), 3071–3096. https://doi.org/10.1051/ro/2022071 doi: 10.1051/ro/2022071
    [26] B. C. Das, B. Das, S. K. Mondal, An integrated production-inventory model with defective item dependent stochastic credit period, Comp. Indust. Eng., 110 (2017), 255–263. https://doi.org/10.1016/j.cie.2017.05.025 doi: 10.1016/j.cie.2017.05.025
    [27] A. Coman, B. Ronen, Production outsourcing: a linear programming model for the theory-of-constraints, Int. J. Prod. Res., 38 (2000), 1631–1639. https://doi.org/10.1080/002075400188762 doi: 10.1080/002075400188762
    [28] S. R. Singh, M. Sarkar, B. Sarkar, Effect of learning and forgetting on inventory model under carbon emission and agile manufacturing, Mathematics, 11 (2023), 368. https://doi.org/10.3390/math11020368 doi: 10.3390/math11020368
    [29] G. J. Hahn, T. Sens, C. Decouttere, N. J. Vandaele, A multi-criteria approach to robust outsourcing decision-making in stochastic manufacturing systems, Comput. Ind. Eng., 98 (2016), 275–288. https://doi.org/10.1016/j.cie.2016.05.032 doi: 10.1016/j.cie.2016.05.032
    [30] S. W. Chiu, Y. Y. Li, V. Chiu, Y. S. Chiu, Satisfy product demand with a quality assured hybrid EMQ-based replenishment system, J. Eng. Res., 7 (2019), 225–237.
    [31] S. Bahrami, R. Ghasemi, A new secure and searchable data outsourcing leveraging a Bucket-Chain index tree. J. Inform. Secur. App., 67 (2022), 103206. https://doi.org/10.1016/j.jisa.2022.103206 doi: 10.1016/j.jisa.2022.103206
    [32] S. Kar, K. Basu, B. Sarkar, Advertisement policy for dual-channel within emissions-controlled flexible production system, J. Retail. Consum. Serv., 71 (2023), 103077. https://doi.org/10.1016/j.jretconser.2022.103077 doi: 10.1016/j.jretconser.2022.103077
    [33] R. K. Bachar, S. Bhuniya, S. K. Ghosh, B. Sarkar, Sustainable green production model considering variable demand, partial outsourcing, and rework, AIMS Environ. Sci., 9 (2022), 325–353. https://doi.org/10.3934/environsci.2022022 doi: 10.3934/environsci.2022022
    [34] P. L. Abad, C. K. Jaggi, A joint approach for setting unit price and the length of the credit period for a seller when end demand is price sensitive, Int. J. Prod. Econ., 83 (2003), 115–122. https://doi.org/10.1016/S0925-5273(02)00142-1 doi: 10.1016/S0925-5273(02)00142-1
    [35] B. Pal, S. S. Sana, K. Chaudhuri, Two‐echelon manufacturer–retailer supply chain strategies with price, quality, and promotional effort sensitive demand, Int. Tran. Oper. Res., 22 (2015), 1071–1095. https://doi.org/10.1111/itor.12131 doi: 10.1111/itor.12131
    [36] A. Bhunia, A. Shaikh, A deterministic inventory model for deteriorating items with selling price dependent demand and three-parameter Weibull distributed deterioration, Int. J. Ind. Eng. Comput., 5 (2014), 497–510. https://doi.org/10.5267/j.ijiec.2014.2.002 doi: 10.5267/j.ijiec.2014.2.002
    [37] H. K. Alfares, A. M. Ghaithan, Inventory and pricing model with price-dependent demand, time-varying holding cost, and quantity discounts, Comput. Ind. Eng., 94 (2016), 170–177. https://doi.org/10.1016/j.cie.2016.02.009 doi: 10.1016/j.cie.2016.02.009
    [38] B. Sarkar, B. K. Dey, M. Sarkar, S. J. Kim, A smart production system with an autonomation technology and dual channel retailing, Comput. Ind. Eng., 173 (2022), 108607. https://doi.org/10.1016/j.cie.2022.108607 doi: 10.1016/j.cie.2022.108607
    [39] S. Bhuniya, B. Sarkar, S. Pareek, Multi-product production system with the reduced failure rate and the optimum energy consumption under variable demand, Mathematics, 7 (2019), 465. https://doi.org/10.3390/math7050465 doi: 10.3390/math7050465
    [40] H. Hosseini-Nasab, S. Nasrollahi, M. B. Fakhrzad, M. Honarvar, Transportation cost reduction using cross-docks linking, J. Eng. Res., 11 (2023), 100015. https://doi.org/10.1016/j.jer.2023.100015 doi: 10.1016/j.jer.2023.100015
    [41] U. Chaudhari, A. Bhadoriya, M. Y. Jani, B. Sarkar, A generalized payment policy for deteriorating items when demand depends on price, stock, and advertisement under carbon tax regulations, Mathemat. Comp. Simul., 207 (2023), 556–574. https://doi.org/10.1016/j.matcom.2022.12.015 doi: 10.1016/j.matcom.2022.12.015
    [42] S. K. Hota, S. K. Ghosh, B. Sarkar, A solution to the transportation hazard problem in a supply chain with an unreliable manufacturer, AIMS Environ. Sci., 9 (2022), 354–380. https://doi.org/10.3934/environsci.2022023 doi: 10.3934/environsci.2022023
  • This article has been cited by:

    1. Chang-Xu Zhang, Fu-Tao Hu, Shu-Cheng Yang, On the (total) Roman domination in Latin square graphs, 2024, 9, 2473-6988, 594, 10.3934/math.2024031
    2. Sakander Hayat, Raman Sundareswaran, Marayanagaraj Shanmugapriya, Asad Khan, Venkatasubramanian Swaminathan, Mohamed Hussian Jabarullah, Mohammed J. F. Alenazi, Characterizations of Minimal Dominating Sets in γ-Endowed and Symmetric γ-Endowed Graphs with Applications to Structure-Property Modeling, 2024, 16, 2073-8994, 663, 10.3390/sym16060663
    3. Tatjana Zec, On the Roman domination problem of some Johnson graphs, 2023, 37, 0354-5180, 2067, 10.2298/FIL2307067Z
    4. Jian Yang, Yuefen Chen, Zhiqiang Li, Some sufficient conditions for a tree to have its weak Roman domination number be equal to its domination number plus 1, 2023, 8, 2473-6988, 17702, 10.3934/math.2023904
  • 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(1841) PDF downloads(79) Cited by(4)

Figures and Tables

Figures(6)  /  Tables(2)

/

DownLoad:  Full-Size Img  PowerPoint
Return
Return

Catalog