<?xml version="1.0" encoding="UTF-8"?><!DOCTYPE article  PUBLIC "-//NLM//DTD Journal Publishing DTD v3.0 20080202//EN" "http://dtd.nlm.nih.gov/publishing/3.0/journalpublishing3.dtd"><article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" dtd-version="3.0" xml:lang="en" article-type="research article"><front><journal-meta><journal-id journal-id-type="publisher-id">WJET</journal-id><journal-title-group><journal-title>World Journal of Engineering and Technology</journal-title></journal-title-group><issn pub-type="epub">2331-4222</issn><publisher><publisher-name>Scientific Research Publishing</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="doi">10.4236/wjet.2023.113042</article-id><article-id pub-id-type="publisher-id">WJET-127325</article-id><article-categories><subj-group subj-group-type="heading"><subject>Articles</subject></subj-group><subj-group subj-group-type="Discipline-v2"><subject>Chemistry&amp;Materials Science</subject><subject> Engineering</subject></subj-group></article-categories><title-group><article-title>
 
 
  Green Drug Supply Chain Investigation by Time-Market Balance and Risk
 
</article-title></title-group><contrib-group><contrib contrib-type="author" xlink:type="simple"><name name-style="western"><surname>Mahmoudreza</surname><given-names>Entezami</given-names></name><xref ref-type="aff" rid="aff1"><sup>1</sup></xref></contrib><contrib contrib-type="author" xlink:type="simple"><name name-style="western"><surname>Hossein</surname><given-names>Havaeji</given-names></name><xref ref-type="aff" rid="aff2"><sup>2</sup></xref><xref ref-type="corresp" rid="cor1"><sup>*</sup></xref></contrib></contrib-group><aff id="aff1"><addr-line>Computer Science and Software Engineering Department, Concordia University, Montreal, Canada</addr-line></aff><aff id="aff2"><addr-line>Mechanical Engineering Department, école de Technologie Supérieure, Montreal, Canada</addr-line></aff><pub-date pub-type="epub"><day>29</day><month>06</month><year>2023</year></pub-date><volume>11</volume><issue>03</issue><fpage>611</fpage><lpage>631</lpage><history><date date-type="received"><day>27,</day>	<month>July</month>	<year>2023</year></date><date date-type="rev-recd"><day>26,</day>	<month>August</month>	<year>2023</year>	</date><date date-type="accepted"><day>29,</day>	<month>August</month>	<year>2023</year></date></history><permissions><copyright-statement>&#169; Copyright  2014 by authors and Scientific Research Publishing Inc. </copyright-statement><copyright-year>2014</copyright-year><license><license-p>This work is licensed under the Creative Commons Attribution International License (CC BY). http://creativecommons.org/licenses/by/4.0/</license-p></license></permissions><abstract><p>
 
 
  The quality of pharmaceutical products plays a crucial role in healthcare systems such as hospitals for better patient services. Drug Supply Chain 
  Management requires approaches to uncertainty and risk consideration. This study is a comprehensive 
  multi-objective mathematical model considering the uncertainties and potential reserves in supply and medicine. The proposed model includes 
  three general objective functions that minimize total production costs, including the costs of transportation, maintenance, breakdown, collection, and disposal of waste. The model also maximizes the quality of potential storage. The results show the proposed method has a high quality to solve the model and leads to the optimization of the results to provide the drug supply chain for the proposed example. We have identified three important risks and uncertainties in addressing drug supply planning: the indefinite duration of the licensing process, the risk of a forced brand change, and indefinite repayment levels that lead to varied demand diversification. The results of comparison with other multi-objective optimization methods in existing articles also show better performance of the proposed model. A significant cost reduction results from implementing our model instead of using the over-storage role to estimate the volume of active drug elements, as seen in today’s industry.
 
</p></abstract><kwd-group><kwd>Market Supply Planning</kwd><kwd> New Product Introduction</kwd><kwd> Two-Stage Variable Planning</kwd><kwd> Regulation Affairs</kwd></kwd-group></article-meta></front><body><sec id="s1"><title>1. Introduction</title><p>Unlike many industries, there are fundamental differences between the Supply Chain Management (SCM) of consumer products and pharmaceuticals. Drugs are manufactured and distributed under strict regulatory requirements. One of the most challenging parts of the product is before it goes to the market, where there is an important balance between minimizing healthcare costs and saving patients’ lives. Therefore, Healthcare SCM requires special attention compared to conventional products. For the past four decades, a great deal of work has been done in Drug SCM (DSCM) by combining different techniques to improve effectiveness, efficiency, and patient satisfaction. DSCM can be defined as the costly and complex steps involved in a fuzzy environment with uncertain demands that include human, material, information, and financial flows. Pharmaceutical SCM (PSCM) includes suppliers, hospital departments, logistics services, and medical services that apply limited resources (time, materials, capital) and coordinates their actions with an integrated logistics process to ensure their collective performance (patient satisfaction). Secondly, PSCM improves their performance as well. DSCM is significant for health services providers, insurance companies, and governments constantly striving to be as effective as possible in providing the services. This is due to the lack of resources, reduced delivery time, increased customer expectations (in quantity and quality), cost growth (demand and investment in new health-related technologies), and reduced delivery time. For this reason, the present study addresses the essential issue of DSCM with uncertainty and the possible storage through the fuzzy method to solve the limitation problem. The present paper is organized as follows. First, the authors provide an introduction and Research Background. Next, we discuss the Methodology and Mathematical model for SC, followed by Results in the third section. Finally, we present the Conclusion.</p>Research Background<p>Supply Chain Decisions (SCDs) are a strategic issue for any company. The issue of equipment placement and customer allocation is the core of a production system. Manufacturing companies need to efficiently locate their production/assembly plants, warehouses, and distribution centers to maintain their maximum profit margins in today’s competitive market and provide the best possible level of service at the lowest cost to maintain their competitive position against other companies. In addition to decisions about the location of equipment in the available space, these points are also important: specifying how such equipment interacts, how to transfer raw materials and finished or unfinished products between the source and destination equipment, and decisions about the location of equipment.</p><p>Also, since the primary and secondary factories are often located in scattered locations around the world; and they are often located in different regions, providing a coordinated program for the various categories of the supply network is of paramount importance to achieve better performance for the entire network through the integration of supply, production and distribution categories [<xref ref-type="bibr" rid="scirp.127325-ref1">1</xref>] . This field of research is generally rich in literature, but despite the specific differences mentioned, little work has been done on PSCs. The most common limiting assumptions used in models in the literature are the supply of unlimited raw materials, the forecast of known demand and prices for new and existing products, and the limited time horizon. On the other hand, decisions are influenced by data uncertainty, which usually stems from the uncertain nature of clinical trials and the demand side. Reference [<xref ref-type="bibr" rid="scirp.127325-ref2">2</xref>] proposes a multi-stage, multi-period, and multi-scenario randomized mixed integer optimization model for several vaccines in which demand was considered an indeterminate parameter, and the method was based on the scenario used to control this type of uncertainty. Also, the results of different expected clinical trials were identified with the probabilities of their occurrence, while the details of processing times, investment costs, and production scale were also considered in the proposed model. The expected net profit value was also used as a target function to evaluate decisions.</p><p>In product portfolio selection, if a company wants to maintain its competitive position in the market, it must constantly introduce new products to the market. Thus, a significant challenge is which products should be included in the R&amp;D portfolio [<xref ref-type="bibr" rid="scirp.127325-ref3">3</xref>] and how to allocate resources [<xref ref-type="bibr" rid="scirp.127325-ref4">4</xref>] to maximize return on investment in a fast and reliable way. Such decisions must be made under significant uncertainties in PSCs (such as demand uncertainties, selling prices, clinical trial results, risk of failure or prolongation of R&amp;D success, the emergence of an alternative product, etc.) [<xref ref-type="bibr" rid="scirp.127325-ref5">5</xref>] [<xref ref-type="bibr" rid="scirp.127325-ref6">6</xref>] [<xref ref-type="bibr" rid="scirp.127325-ref7">7</xref>] . R&amp;D costs related to new product development and product business features, such as production costs, selling prices, and marketing costs, are some important product features that can be considered for decision-making [<xref ref-type="bibr" rid="scirp.127325-ref8">8</xref>] [<xref ref-type="bibr" rid="scirp.127325-ref9">9</xref>] . Also, constraints on capital budgeting, resources, and technical and regulatory constraints are often imposed on this problem. Among the various methods for controlling uncertainty, random programming is the most common method to approach portfolio selection uncertainty. For example, reference [<xref ref-type="bibr" rid="scirp.127325-ref9">9</xref>] developed a continuous decision-making approach to address the problem of developing a new product. From a set of continuation or release options at each stage of the testing process, they considered four outcomes: 1) high success, 2) goal success, 3) low success, and 4) failure, each with probabilities predetermined for clinical trials. Then, a multi-stage random programming method called MILP formulation was developed. The mentioned challenges demonstrate the need for proper management of inventory issues such as order quantities, purchase dates, and inventory levels while considering customer satisfaction without adversely affecting public health, patient safety, or relationships with PSC members [<xref ref-type="bibr" rid="scirp.127325-ref10">10</xref>] [<xref ref-type="bibr" rid="scirp.127325-ref11">11</xref>] . Despite these facts, this field has been out of focus in the past and has recently received more attention from researchers in operational research. Among the inventory policies developed in the inventory management literature, some policies, such as periodic reviews for industries related to public health (due to the risk of scarcity), are not acceptable. Therefore, the usual method adopted for PSC is a continuous review. Due to the special nature of pharmaceutical products (e.g., high prices and shortage costs, sensitive molecular inputs that decompose over time, etc.), compared to other perishable products, they do not follow the common models in the articles.</p><p>In short, these issues place severe constraints on inventory management and other risks imposed on the company. Therefore, inventory management in PSCs requires special models that are created while considering all specific aspects. The summary of the research conducted in the last few years is presented in <xref ref-type="table" rid="table1">Table 1</xref>.</p><table-wrap id="table1" ><label><xref ref-type="table" rid="table1">Table 1</xref></label><caption><title> A summary of the research conducted in the last few years</title></caption><table><tbody><thead><tr><th align="center" valign="middle" >Results</th><th align="center" valign="middle" >Research Methods</th><th align="center" valign="middle" >Year</th><th align="center" valign="middle" >Reference</th></tr></thead><tr><td align="center" valign="middle" >The benefits of vendor-managed inventory in the pharmaceutical industry</td><td align="center" valign="middle" >Random model</td><td align="center" valign="middle" >2010</td><td align="center" valign="middle" >[<xref ref-type="bibr" rid="scirp.127325-ref13">13</xref>]</td></tr><tr><td align="center" valign="middle" >Pharmaceutical supply chain</td><td align="center" valign="middle" >Dimethyl</td><td align="center" valign="middle" >2012</td><td align="center" valign="middle" >[<xref ref-type="bibr" rid="scirp.127325-ref14">14</xref>]</td></tr><tr><td align="center" valign="middle" >Production planning in the pharmaceutical industry</td><td align="center" valign="middle" >Exploratory algorithm</td><td align="center" valign="middle" >2012</td><td align="center" valign="middle" >[<xref ref-type="bibr" rid="scirp.127325-ref15">15</xref>]</td></tr><tr><td align="center" valign="middle" >Dynamic allocation of resources in the pharmaceutical industry with delivery costs and different tax rates to maximize the company’s net profit</td><td align="center" valign="middle" >Linear and Dynamic Planning</td><td align="center" valign="middle" >2012</td><td align="center" valign="middle" >[<xref ref-type="bibr" rid="scirp.127325-ref16">16</xref>]</td></tr><tr><td align="center" valign="middle" >Lost sales due to delays in the market supply</td><td align="center" valign="middle" >Multi-objective fuzzy</td><td align="center" valign="middle" >2012</td><td align="center" valign="middle" >[<xref ref-type="bibr" rid="scirp.127325-ref17">17</xref>]</td></tr><tr><td align="center" valign="middle" >Planning and scheduling in drug supply and supply</td><td align="center" valign="middle" >Ideal planning</td><td align="center" valign="middle" >2012</td><td align="center" valign="middle" >[<xref ref-type="bibr" rid="scirp.127325-ref18">18</xref>]</td></tr><tr><td align="center" valign="middle" >Existing studies on the drug supply chain</td><td align="center" valign="middle" >Review study</td><td align="center" valign="middle" >2012</td><td align="center" valign="middle" >[<xref ref-type="bibr" rid="scirp.127325-ref19">19</xref>]</td></tr><tr><td align="center" valign="middle" >Identify the amount of economic production under the minimum volume restrictions on the production of perishable products such as drugs</td><td align="center" valign="middle" >Mathematical model</td><td align="center" valign="middle" >2013</td><td align="center" valign="middle" >[<xref ref-type="bibr" rid="scirp.127325-ref20">20</xref>]</td></tr><tr><td align="center" valign="middle" >The structural decision for market supply functions in the pharmaceutical industry</td><td align="center" valign="middle" >Grand Theory</td><td align="center" valign="middle" >2015</td><td align="center" valign="middle" >[<xref ref-type="bibr" rid="scirp.127325-ref21">21</xref>]</td></tr><tr><td align="center" valign="middle" >Creating an optimal supplier price strategy</td><td align="center" valign="middle" >Game theory and Nash equilibrium</td><td align="center" valign="middle" >2015</td><td align="center" valign="middle" >[<xref ref-type="bibr" rid="scirp.127325-ref22">22</xref>]</td></tr><tr><td align="center" valign="middle" >The literature on green supply chain management</td><td align="center" valign="middle" >Library review</td><td align="center" valign="middle" >2015</td><td align="center" valign="middle" >[<xref ref-type="bibr" rid="scirp.127325-ref23">23</xref>]</td></tr><tr><td align="center" valign="middle" >Supply Chain Management towards firm performance</td><td align="center" valign="middle" >Fuzzy</td><td align="center" valign="middle" >2017</td><td align="center" valign="middle" >[<xref ref-type="bibr" rid="scirp.127325-ref24">24</xref>]</td></tr><tr><td align="center" valign="middle" >Inventory policy, transportation, and pricing in a two-tier multi-stage supply chain</td><td align="center" valign="middle" >Nonlinear model</td><td align="center" valign="middle" >2017</td><td align="center" valign="middle" >[<xref ref-type="bibr" rid="scirp.127325-ref25">25</xref>]</td></tr><tr><td align="center" valign="middle" >Green supply chain management</td><td align="center" valign="middle" >Fuzzy</td><td align="center" valign="middle" >2019</td><td align="center" valign="middle" >[<xref ref-type="bibr" rid="scirp.127325-ref26">26</xref>]</td></tr><tr><td align="center" valign="middle" >Multi-product and multi-level closed-loop pharmaceutical supply chain with quality concepts in mind</td><td align="center" valign="middle" >NSGA II</td><td align="center" valign="middle" >2020</td><td align="center" valign="middle" >[<xref ref-type="bibr" rid="scirp.127325-ref27">27</xref>]</td></tr><tr><td align="center" valign="middle" >Supply chain management practices</td><td align="center" valign="middle" >Integration</td><td align="center" valign="middle" >2021</td><td align="center" valign="middle" >[<xref ref-type="bibr" rid="scirp.127325-ref28">28</xref>]</td></tr></tbody></table></table-wrap></sec><sec id="s2"><title>2. Research Method and Mathematical Model of SC</title><p>The SC network design and planning refers to determining the optimal network structure (i.e., locations of facilities and allocations) as well as determining how to optimally use the resources of production, distribution, and storage throughout the chain to respond quickly and appropriately to customer orders and requests [<xref ref-type="bibr" rid="scirp.127325-ref12">12</xref>] . This section presents the mathematical model of SC in this article. The proposed model is a multi-objective, multi-stage, multi-period (dynamic) SC with potential reserves and various transportation equipments that will be examined in uncertain conditions. Decisions about opening and closing equipment at each stage and increasing capacity along the planning horizon are considered according to the different incremental demands of drug distribution centers and returned products and the transport time required to transfer products between different stages of the chain. The schematic diagram below shows the overview of the supply chain, which consists of several factories, distribution centers, and other pharmacies. The forward arrows indicate the direct flow of products for delivery to the customer. The dotted arrows point backward to show the reverse flow of products needing return and rotten drugs. The collections, parameters, and variables of the model are shown in Appendix 1 (<xref ref-type="fig" rid="fig1">Figure 1</xref>).</p><sec id="s2_1"><title>2.1. Limitations</title><p>By applying constraints, we first ensure that customer demand is met at all costs. The second limitation is related to the amount of inventory stored in distribution centers (Inv). This constraint states that the input and output of a node must be the same. Thus, the amount of inventory at the end of each period is calculated.</p><p>∑ w ∑ v x w , c , p , v t ≥ D ˜ c , p t , ∀ c , p , t (1)</p><p>∑ m ∑ v x m , w , p , v t + I n v w , p t − 1 = ∑ c ∑ v x w , c , p , v t + I n v w , p t , ∀ w , p , t (2)</p><p>Constraints (3) to (6) are the capacity constraints of the problem. The third limitation states that it is not possible to use the production capacity and possible factory storage beyond the installed capacity until the relevant period. The fourth limitation is the same as the previous one, but it is set for distribution centers, which means that no more than the storage capacity of the products can be transferred from one period to the next. Limit (5) shows the maximum amount of transportation by v equipment in each period between factories and distribution centers. Restriction (6) is similar to the previous case only between distribution centers and sales centers (second stage of the supply chain). Note that how to add capacity options in constraints (3) and (4) is significantly different from constraints (5) and (6). It is assumed that if a capacity option is used in one period to increase the capacity of factories or warehouses, this excess capacity will remain open in all remaining periods and cannot be eliminated. This assumption is made because it does not make sense to shut down equipment that has received excess capacity over time and spend it in vain. Since it is easy to rent excess capacity from any type of transportation equipment for transportation-related restrictions, it is possible to rent excess capacity only in periods when extra capacity is required; and the remaining courses with the capacity of transportation equipment owned by the company can be transferred.</p><p>∑ w ∑ p ∑ v ( a ˜ p ⋅ x m , w , p , v t + a ˜ ′ p ⋅ z m , w , p , v t ) ≤ C a p ˜ m ⋅ δ m t + ∑ o m ∑ t M c a p ˜ o m ⋅ σ m , o m t , &#160; ∀ m , t (3)</p><p>∑ p γ ˜ p ⋅ I n v w , p t ≤ C a p ˜ w ⋅ δ w t + ∑ o w W c a p ˜ o w ⋅ σ w , o w t , ∀ w , t (4)</p><p>∑ w ∑ c ∑ p γ ˜ p ( x m , w , p , v t + z m , w , p , v t + y w , m , p , v t ) ≤ T c a p ˜ 1 v t + ∑ o v V c a p ˜ v , o w ⋅ σ 1 v , o v t , ∀ v , t (5)</p><p>∑ w ∑ c ∑ p γ ˜ p ( x w , c , p , v t + z w , c , p , v t + y c , w , p , v t ) ≤ T c a p ˜ 2 v t + ∑ o v V c a p ˜ v , o w ⋅ σ 2 v , o v t , ∀ v , t (6)</p><p>Restrictions (7) to (11) are associated with the reference products and the flow of these materials in the supply chain. Constraint (7) states that the amount of products returned from sales centers equals the percentage of products transferred to that point. The buyer inspects these products in the same period they are sent to the sales centers, and some of them are referred for repairs if needed. The potential storage of these drugs may be due to the materials used in manufacturing, manufacturing process, or shipping conditions. Constraint (8) is related to the balance of the flow of reference materials from sales centers to distribution centers and from distribution centers to factories. Restriction (9) stipulates the need to send potential reserves after arriving at the factory. Limit (10) shows the balance of the flow of repaired products from the factory to the distribution centers and from the distribution centers to the sales centers. Restriction (11) stipulates that each customer will receive as many products as they referred in the next period.</p><p>∑ w ∑ v y c , w , p , v t ≥ ∑ w ∑ v D e f ˜ p ⋅ x w , c , p , v t , ∀ c , p , t (7)</p><p>∑ m ∑ v y w , m , p , v t = ∑ c ∑ v y c , w , p , v t , ∀ w , p , t (8)</p><p>∑ w ∑ v z m , w , p , v t = ∑ w ∑ v y w , m , p , v t − 1 , ∀ m , p , t (9)</p><p>∑ c ∑ v z w , c , p , v t = ∑ m ∑ v z m , w , p , v t , ∀ w , p , t (10)</p><p>∑ w ∑ v y c , w , p , v t − 1 = ∑ w ∑ v z w , c , p , v t , ∀ c , p , t (11)</p><p>It is assumed that the transport capacity of any equipment is independent of each other between factories and distribution centers and between distribution centers and sales centers. Constraints (12) to (20) are logical constraints of the problem. Restriction (12) requires that returned medicines be returned only to open warehouses. In this constraint, M is a huge number. Restrictions (13) and (14) prohibit potential reserves from changing status (from having to not having and vice versa) more than once. Stored drugs can be returned, and stored drugs cannot be returned on the planning horizon. In constraint (15), we can add capacity options to factories and distribution centers, but we cannot remove them. We also state with limitation (16) that a drug to which capacity options have been added cannot be reduced. Constraint (13) to (17) ensures we can only add capacity options to drugs stored in the relevant period. Constraints (18) to (20) relate to the logical relationships of transport capacity options. Constraint (18) requires that we can use a capacity option in only one stage of the supply chain. Restrictions (9) and (20) need that at each step of the supply chain, we can order only one of the available capacity options for one type of drug, and ordering more than one capacity option is prohibited.</p><p>∑ c ∑ p ∑ v y c , w , p , t , v ≤ δ w t ⋅ M , ∀ w , t (12)</p><p>δ i t ≥ δ i t + 1 ∀ i ∈ M c ∪ W c (13)</p><p>δ i t ≤ δ i t + 1 ∀ i ∈ M o ∪ W o (14)</p><p>σ i , o t ≤ σ i , o t + 1 ∀ i ∈ M ∪ W ,   o (15)</p><p>δ i t ≥ σ i , o t − 1 ∀ i ∈ M ∪ W   ,   o (16)</p><p>σ i , o t ≤ δ i t ∀ i ∈ M ∪ W   ,   o (17)</p><p>σ 1 v , o v t + σ 2 v , o v t ≤ 1 ∀ v , o v , t (18)</p><p>∑ o v σ 1 v , o v t ≤ 1 ∀ v , t (19)</p><p>∑ o v σ 1 v , o v t ≤ 1 ∀ v , t (20)</p></sec><sec id="s2_2"><title>2.2. Objective Functions</title><p>We present three objective functions for a multi-period supply chain in this case. The first objective function is the classical function of minimizing model costs. The second function is to minimize the total transport time and possible storage in the problem. The third objective function is related to transportation costs, which contradicts the second objective function. To reduce service time, we must use more expensive vehicles with higher speeds, which causes an undesirable increase in this objective function. In the following, we will describe the relevant functions in detail. We consider the parameters with the sign Tilda (~) on them to be uncertain. The first line of objective function f<sub>1</sub> deals with the potential storage costs of new drugs and the cost of capacity options for drugs required, both in factories and in distribution centers. The second line deals with operating costs and the operation of capacity options added during their operation. Also, each product type’s cost of production and possible storage is considered. The third line of the model is related to the storage costs of materials in the warehouses of distribution centers.</p><p>min f ˜ 1 = ∑ i ∈ M o ∪ W o ∑ t C O ˜ i ⋅ ( δ i t + 1 − δ i t ) + ∑ i ∈ M c ∪ W c ∑ t C C ˜ i ( δ i t − δ i t + 1 )     + ∑ i ∈ M ∪ W ∑ o ∑ t C A ˜ i , o ⋅ ( σ i , o t + 1 − σ i , o t )     + ∑ i ∈ M ∪ W ∑ t ( C O P ˜ i ⋅ δ i t + ∑ o C A O P ˜ i , o ⋅ σ i , o t )     + ∑ m ∑ w ∑ p ∑ v ∑ t ( C P ˜ p , m ⋅ x m , w , p , v t + C R ˜ p , m ⋅ z m , w , p , v t )     + ∑ p ∑ w ∑ t C S ˜ p , w I n v w , p t (21)</p><p>The second objective function minimizes the total shipping time to increase the level of service. It is necessary to explain that this function is considered independent of the weight of the products and therefore minimizes the total arrival time of all products to the destination. This assumption is made to not depend on the time of arrival of products to their weight, which seems illogical.</p><p>min f ˜ 2 = ∑ w ∑ p ∑ v ∑ t ( ∑ m d i s m , w ⋅ ( x m , w , p , v t + z m , w , p , v t + y w , m , p , v t )     + ∑ c d i s w , c ⋅ ( x w , c , p , v t + z w , c , p , v t + y c , w , p , v t ) ) / S P T ˜ v (22)</p><p>The third objective function is introduced to minimize shipping costs. These costs include the cost of moving products between source and destination (which depends on the weight of the products) and the cost of adding capacity options at each stage of the supply chain.</p><p>min f ˜ 3 = ∑ w ∑ p ∑ v ∑ t γ ˜ p ⋅ C T ˜ v ⋅ ( ∑ m d i s m , w ⋅ ( x m , w , p , v t + z m , w , p , v t + y w , m , p , v t )     + ∑ c d i s w , c ⋅ ( x w , c , p , v t + z w , c , p , v t + y c , w , p , v t ) )     + ∑ v ∑ o v ∑ t ( σ 1 v , o v t + σ 2 v , o v t ) ⋅ C A ˜ v , o v (23)</p></sec></sec><sec id="s3"><title>3. Results</title><p>The proposed model consists of two conflicting objectives: minimizing total costs (including total opening costs, shipping/inventory costs, and inventory maintenance) and minimizing unsatisfied maximum demand in all periods. In detail, the creation of MSs, MDCs, and LDCs is further enhanced by many strategic decisions, for example, the location of MSs, MDCs, and LDCs, as well as some tactical decisions, such as optimal materials on a horizon. Medium-term planning is ongoing and maintaining the inventory of each family of products in each period; moreover, the production capacity of the MSs and the storage capacity of the MDCs should be done.</p><sec id="s3_1"><title>3.1. Definition of the Problem and Mathematical Model</title><p>This study proposes a multi-objective mathematical model for multiple healthcare products and a multi-level closed-loop green supply chain. This model includes suppliers, manufacturers, interconnectors, hospitals, collection, recycling, and disposal centers. Then, at the producers’ request, the raw materials are transferred from the suppliers to the producers. Manufacturers produce pharmaceutical and medical products. For the sensitivity of health products and high quality, we use acceptance sampling for the quality inspection. In this study, the acceptance criteria are c = 0. If there are no defective products (such as drug effects and packaging) for each category, this group will accept and be transferred to a cross-docking center. Otherwise, these people will be taken to a collection center to process. At the request of the hospitals, the shipment was transferred from the outpatient center to the hospitals and stores in the pharmacy. In this study, we hypothesize that if pharmaceutical products are transported to hospitals at the earliest opportunity, the hospitals will penalize manufacturers for deteriorating the nature of pharmaceutical products. Also, hospital medicines and medical waste are separated from other waste materials to reduce the environmental impact. Therefore, these waste materials are transported to collection centers for processing. Collection centers then separate the waste elements, and they can be reused. These elements are transferred to recycling centers. The rest of the elements will be transferred to disposal centers. Recyclable elements, after processing, are shipped to suppliers to produce raw materials. In summary, the proposed model includes three objective functions. The first objective minimizes production costs, the next goal maximizes the quality level of the products, and the third one minimizes the environmental impacts. One of the main issues in the green supply chain is considering the amount of carbon dioxide emissions. This study considers the distance traveled by the vehicle, fuel consumption per kilometer (depending on the vehicle load), and carbon dioxide emissions per trip, which should calculate the total emission of CO<sub>2</sub>.</p><p>Model assumption</p><p>1) All costs are known.</p><p>2) Demand for cross-connections, suppliers, manufacturers, recycling, collection, and disposal centers are equal.</p><p>3) Raw materials are derived from recycled materials, which are less expensive than conventional materials.</p><p>4) Carbon dioxide emissions are negligible for separation, disposal, and inspection activities.</p><p>5) Facility locations are definite.</p><p>6) Hospitals will process their requests within a specified period. Also, there is no drug transfer between hospitals.</p><p>7) Safety rules are provided for all shipments.</p><p>8) When demand in supply is short, hospitals make it up by purchasing from other manufacturers.</p><p>9) Reverse order costs are not considered.</p></sec><sec id="s3_2"><title>3.2. Mathematical Model</title><p>In this paper, we model the Healthcare SC that considers quality and green concepts. The proposed model includes three objective functions. First, we formulate the problem of minimizing the total cost of production, maximizing the level of production quality, and minimizing the environmental impact of products and transportation as a mathematical program (<xref ref-type="table" rid="table2">Table 2</xref>, <xref ref-type="table" rid="table3">Table 3</xref>).</p><table-wrap id="table2" ><label><xref ref-type="table" rid="table2">Table 2</xref></label><caption><title> Cost function changes with increasing MS facility</title></caption><table><tbody><thead><tr><th align="center" valign="middle" >Frequency</th><th align="center" valign="middle" >Goal function</th></tr></thead><tr><td align="center" valign="middle" >1</td><td align="center" valign="middle" >1937.5</td></tr><tr><td align="center" valign="middle" >2</td><td align="center" valign="middle" >2137.5</td></tr><tr><td align="center" valign="middle" >3</td><td align="center" valign="middle" >2337.5</td></tr><tr><td align="center" valign="middle" >4</td><td align="center" valign="middle" >2537.5</td></tr><tr><td align="center" valign="middle" >5</td><td align="center" valign="middle" >2737.5</td></tr><tr><td align="center" valign="middle" >6</td><td align="center" valign="middle" >2937.5</td></tr><tr><td align="center" valign="middle" >7</td><td align="center" valign="middle" >3137.5</td></tr><tr><td align="center" valign="middle" >8</td><td align="center" valign="middle" >3337.5</td></tr><tr><td align="center" valign="middle" >9</td><td align="center" valign="middle" >3537.5</td></tr><tr><td align="center" valign="middle" >10</td><td align="center" valign="middle" >3737.5</td></tr><tr><td align="center" valign="middle" >11</td><td align="center" valign="middle" >3937.5</td></tr><tr><td align="center" valign="middle" >12</td><td align="center" valign="middle" >4137.5</td></tr><tr><td align="center" valign="middle" >13</td><td align="center" valign="middle" >4337.5</td></tr><tr><td align="center" valign="middle" >14</td><td align="center" valign="middle" >4537.5</td></tr><tr><td align="center" valign="middle" >15</td><td align="center" valign="middle" >4737.5</td></tr><tr><td align="center" valign="middle" >16</td><td align="center" valign="middle" >4937.5</td></tr><tr><td align="center" valign="middle" >17</td><td align="center" valign="middle" >5137.5</td></tr><tr><td align="center" valign="middle" >18</td><td align="center" valign="middle" >5337.5</td></tr><tr><td align="center" valign="middle" >19</td><td align="center" valign="middle" >5537.5</td></tr><tr><td align="center" valign="middle" >20</td><td align="center" valign="middle" >5737.5</td></tr></tbody></table></table-wrap><table-wrap id="table3" ><label><xref ref-type="table" rid="table3">Table 3</xref></label><caption><title> Cost function changes with increasing MDC fixed cost</title></caption><table><tbody><thead><tr><th align="center" valign="middle" >Frequency</th><th align="center" valign="middle" >Goal function</th></tr></thead><tr><td align="center" valign="middle" >1</td><td align="center" valign="middle" >1937.5</td></tr><tr><td align="center" valign="middle" >2</td><td align="center" valign="middle" >2037.5</td></tr><tr><td align="center" valign="middle" >3</td><td align="center" valign="middle" >2137.5</td></tr><tr><td align="center" valign="middle" >4</td><td align="center" valign="middle" >2237.5</td></tr><tr><td align="center" valign="middle" >5</td><td align="center" valign="middle" >2337.5</td></tr><tr><td align="center" valign="middle" >6</td><td align="center" valign="middle" >2437.5</td></tr><tr><td align="center" valign="middle" >7</td><td align="center" valign="middle" >2537.5</td></tr><tr><td align="center" valign="middle" >8</td><td align="center" valign="middle" >2637.5</td></tr><tr><td align="center" valign="middle" >9</td><td align="center" valign="middle" >2737.5</td></tr><tr><td align="center" valign="middle" >10</td><td align="center" valign="middle" >2837.5</td></tr><tr><td align="center" valign="middle" >11</td><td align="center" valign="middle" >2937.5</td></tr><tr><td align="center" valign="middle" >12</td><td align="center" valign="middle" >3037.5</td></tr><tr><td align="center" valign="middle" >13</td><td align="center" valign="middle" >3137.5</td></tr><tr><td align="center" valign="middle" >14</td><td align="center" valign="middle" >3237.5</td></tr><tr><td align="center" valign="middle" >15</td><td align="center" valign="middle" >3337.5</td></tr><tr><td align="center" valign="middle" >16</td><td align="center" valign="middle" >3437.5</td></tr><tr><td align="center" valign="middle" >17</td><td align="center" valign="middle" >3537.5</td></tr><tr><td align="center" valign="middle" >18</td><td align="center" valign="middle" >3637.5</td></tr><tr><td align="center" valign="middle" >19</td><td align="center" valign="middle" >3737.5</td></tr><tr><td align="center" valign="middle" >20</td><td align="center" valign="middle" >3837.5</td></tr></tbody></table></table-wrap><p><xref ref-type="fig" rid="fig2">Figure 2</xref> and <xref ref-type="fig" rid="fig3">Figure 3</xref> show the effect of the initial cost of building the facility on the total cost of the chain. As it can be seen, given the strategic importance of the facility, by increasing this initial cost, the total supply chain cost will also increase significantly. Recently, healthcare supply chains have been discussed by various researchers. The quality of green products and concepts plays an essential role in improving healthcare systems and protecting the environment. This study presents a comprehensive multi-objective mathematical model for healthcare’s multi-product and multi-level supply chain. This model includes three objective functions. Firstly, it minimizes overall production costs, including transportation, purchase, burnout, commissioning, recycling, collection, and disposal costs. The latter maximizes the level of production quality. The third minimizes the environmental impact of products and transportation. The innovation of this model examines various aspects of the drug supply chain, including:</p><p>&#183; The comprehensive structure of a closed-loop drug supply chain with reverse flow including suppliers, manufacturers, cross-connections, hospitals, collection, recycling, and waste disposal;</p><p>&#183; Total production costs (transportation, purchase and maintenance, breakdowns, setting up, recycling, collection and disposal of costs);</p><p>&#183; The quality level of production due to the sensitivity of healthcare products;</p><p>&#183; Green Concepts of CO<sub>2</sub> emissions, separation of drugs and medical waste, recycling, and disposal.</p></sec><sec id="s3_3"><title>3.3. Time-Market Balance and Risk Considering Potential Reserves</title><p>Initial balance</p><p>According to customer demand, an initial inventory covering a small part of the demand in the first period is considered to be placed in warehouses one to three. These values are in <xref ref-type="table" rid="table4">Table 4</xref>.</p></sec><sec id="s3_4"><title>3.4. Optimization Problem-Solving Process in the Proposed Problem</title><p>We set the reliability parameter to a constant value of α = 0.95, regardless of which criterion (requirement/possibility/validity) we have used. In this research, we use the fuzzy validity criterion and return from the uncertainty space resulting from fuzzy parameters to the non-fuzzy dependent area on the α parameter. By solving the model directly and with a single goal, we calculate the ideal and anti-ideal values for each goal function according to Tables 4-8 (before solving, we change all the goals to the maximization mode by multiplying by (−1) value).</p><p>In calculating the anti-ideal values for all three cases, due to the size of the model, the number of iterations exceeds the allowable limit of 10,000, and the optimization algorithm is stopped. According to the values, the worst values obtained from solving one-objective problems for the other goals in all three of the above optimizations, the lowest possible value was assigned to the anti-ideal values. Since these values are used only as a starting point for scaling the membership function of the objective function, it is not necessary to calculate them</p><table-wrap id="table4" ><label><xref ref-type="table" rid="table4">Table 4</xref></label><caption><title> Initial inventory values</title></caption><table><tbody><thead><tr><th align="center" valign="middle" >I n v w , p</th><th align="center" valign="middle" >P1</th><th align="center" valign="middle" >P2</th><th align="center" valign="middle" >P3</th><th align="center" valign="middle" >P4</th><th align="center" valign="middle" >P5</th></tr></thead><tr><td align="center" valign="middle" >W1</td><td align="center" valign="middle" >14</td><td align="center" valign="middle" >10</td><td align="center" valign="middle" >65</td><td align="center" valign="middle" >12</td><td align="center" valign="middle" >70</td></tr><tr><td align="center" valign="middle" >W2</td><td align="center" valign="middle" >11</td><td align="center" valign="middle" >9</td><td align="center" valign="middle" >38</td><td align="center" valign="middle" >12</td><td align="center" valign="middle" >90</td></tr><tr><td align="center" valign="middle" >W3</td><td align="center" valign="middle" >14</td><td align="center" valign="middle" >9</td><td align="center" valign="middle" >14</td><td align="center" valign="middle" >10</td><td align="center" valign="middle" >8</td></tr></tbody></table></table-wrap><table-wrap id="table5" ><label><xref ref-type="table" rid="table5">Table 5</xref></label><caption><title> Ideal and anti-ideal goals</title></caption><table><tbody><thead><tr><th align="center" valign="middle" >Goal function</th><th align="center" valign="middle" >* z ˜</th><th align="center" valign="middle" >z ˜</th><th align="center" valign="middle" >D i f = z ˜ − z ˜</th></tr></thead><tr><td align="center" valign="middle" >f<sub>1</sub></td><td align="center" valign="middle" >−6,000,000</td><td align="center" valign="middle" >−3,804,560</td><td align="center" valign="middle" >219,540</td></tr><tr><td align="center" valign="middle" >f<sub>2</sub></td><td align="center" valign="middle" >−135,000</td><td align="center" valign="middle" >−98,479</td><td align="center" valign="middle" >36,521</td></tr><tr><td align="center" valign="middle" >f<sub>3</sub></td><td align="center" valign="middle" >−350,000,000</td><td align="center" valign="middle" >−5,752,450</td><td align="center" valign="middle" >292,475,000</td></tr></tbody></table></table-wrap><table-wrap id="table6" ><label><xref ref-type="table" rid="table6">Table 6</xref></label><caption><title> Fuzzy method</title></caption><table><tbody><thead><tr><th align="center" valign="middle" >i</th><th align="center" valign="middle" >Average</th><th align="center" valign="middle" >μ i</th><th align="center" valign="middle" >− z i</th><th align="center" valign="middle" >U ( i )</th><th align="center" valign="middle" >w = μ a n d</th></tr></thead><tr><td align="center" valign="middle" >1</td><td align="center" valign="middle" ></td><td align="center" valign="middle" >0.889</td><td align="center" valign="middle" >4,048,070</td><td align="center" valign="middle" ></td><td align="center" valign="middle" ></td></tr><tr><td align="center" valign="middle" >2</td><td align="center" valign="middle" >0.901</td><td align="center" valign="middle" >0.925</td><td align="center" valign="middle" >101,218</td><td align="center" valign="middle" >0.904</td><td align="center" valign="middle" >0.895</td></tr><tr><td align="center" valign="middle" >3</td><td align="center" valign="middle" ></td><td align="center" valign="middle" >0.889</td><td align="center" valign="middle" >89,965,200</td><td align="center" valign="middle" ></td><td align="center" valign="middle" ></td></tr></tbody></table></table-wrap><table-wrap id="table7" ><label><xref ref-type="table" rid="table7">Table 7</xref></label><caption><title> Results of the application of the proposed method</title></caption><table><tbody><thead><tr><th align="center" valign="middle" >i</th><th align="center" valign="middle" >1</th><th align="center" valign="middle" >2</th><th align="center" valign="middle" >3</th><th align="center" valign="middle" >4</th><th align="center" valign="middle" >5</th><th align="center" valign="middle" >6</th><th align="center" valign="middle" >7</th><th align="center" valign="middle" >8</th><th align="center" valign="middle" >9</th></tr></thead><tr><td align="center" valign="middle" >m1</td><td align="center" valign="middle" >0.89</td><td align="center" valign="middle" >0.891</td><td align="center" valign="middle" >0.89</td><td align="center" valign="middle" >0.89</td><td align="center" valign="middle" >0.89</td><td align="center" valign="middle" >0.889</td><td align="center" valign="middle" >0.891</td><td align="center" valign="middle" >0.89</td><td align="center" valign="middle" >0.891</td></tr><tr><td align="center" valign="middle" >m2</td><td align="center" valign="middle" >0.923</td><td align="center" valign="middle" >0.917</td><td align="center" valign="middle" >0.918</td><td align="center" valign="middle" >0.921</td><td align="center" valign="middle" >0.92</td><td align="center" valign="middle" >0.935</td><td align="center" valign="middle" >0.917</td><td align="center" valign="middle" >0.925</td><td align="center" valign="middle" >0.917</td></tr><tr><td align="center" valign="middle" >m3</td><td align="center" valign="middle" >0.889</td><td align="center" valign="middle" >0.891</td><td align="center" valign="middle" >0.89</td><td align="center" valign="middle" >0.89</td><td align="center" valign="middle" >0.89</td><td align="center" valign="middle" >0.886</td><td align="center" valign="middle" >0.891</td><td align="center" valign="middle" >0.889</td><td align="center" valign="middle" >0.891</td></tr><tr><td align="center" valign="middle" >average</td><td align="center" valign="middle" >0.901</td><td align="center" valign="middle" >0.900</td><td align="center" valign="middle" >0.899</td><td align="center" valign="middle" >0.900</td><td align="center" valign="middle" >0.900</td><td align="center" valign="middle" >0.903</td><td align="center" valign="middle" >0.900</td><td align="center" valign="middle" >0.901</td><td align="center" valign="middle" >0.900</td></tr><tr><td align="center" valign="middle" >w</td><td align="center" valign="middle" >0.895</td><td align="center" valign="middle" >0.895</td><td align="center" valign="middle" >0.895</td><td align="center" valign="middle" >0.895</td><td align="center" valign="middle" >0.895</td><td align="center" valign="middle" >0.895</td><td align="center" valign="middle" >0.895</td><td align="center" valign="middle" >0.895</td><td align="center" valign="middle" >0.895</td></tr><tr><td align="center" valign="middle" >U</td><td align="center" valign="middle" >0.904</td><td align="center" valign="middle" >0.903</td><td align="center" valign="middle" >0.902</td><td align="center" valign="middle" >0.904</td><td align="center" valign="middle" >0.903</td><td align="center" valign="middle" >0.908</td><td align="center" valign="middle" >0.903</td><td align="center" valign="middle" >0.905</td><td align="center" valign="middle" >0.903</td></tr><tr><td align="center" valign="middle" >−z1</td><td align="center" valign="middle" >4,044,990</td><td align="center" valign="middle" >4,044,590</td><td align="center" valign="middle" >4,045,280</td><td align="center" valign="middle" >4,046,330</td><td align="center" valign="middle" >4,046,260</td><td align="center" valign="middle" >4,048,450</td><td align="center" valign="middle" >4,046,550</td><td align="center" valign="middle" >4,045,630</td><td align="center" valign="middle" >4,046,610</td></tr><tr><td align="center" valign="middle" >−z2</td><td align="center" valign="middle" >101,303</td><td align="center" valign="middle" >101,522</td><td align="center" valign="middle" >101,465</td><td align="center" valign="middle" >101,377</td><td align="center" valign="middle" >101,383</td><td align="center" valign="middle" >100,837</td><td align="center" valign="middle" >101,516</td><td align="center" valign="middle" >101,218</td><td align="center" valign="middle" >101,521</td></tr><tr><td align="center" valign="middle" >−z3</td><td align="center" valign="middle" >89,926,600</td><td align="center" valign="middle" >89,501,700</td><td align="center" valign="middle" >89,593,300</td><td align="center" valign="middle" >89,733,300</td><td align="center" valign="middle" >89,723,900</td><td align="center" valign="middle" >90,745,600</td><td align="center" valign="middle" >85,110,900</td><td align="center" valign="middle" >90,076,200</td><td align="center" valign="middle" >85,903,300</td></tr></tbody></table></table-wrap><table-wrap id="table8" ><label><xref ref-type="table" rid="table8">Table 8</xref></label><caption><title> Results of the application of the method of the studied articles</title></caption><table><tbody><thead><tr><th align="center" valign="middle" >i</th><th align="center" valign="middle" >1</th><th align="center" valign="middle" >2</th><th align="center" valign="middle" >3</th><th align="center" valign="middle" >4</th><th align="center" valign="middle" >5</th><th align="center" valign="middle" >6</th><th align="center" valign="middle" >7</th><th align="center" valign="middle" >8</th><th align="center" valign="middle" >9</th></tr></thead><tr><td align="center" valign="middle" >m1</td><td align="center" valign="middle" >0.947</td><td align="center" valign="middle" >0.772</td><td align="center" valign="middle" >0.82</td><td align="center" valign="middle" >0.854</td><td align="center" valign="middle" >0.826</td><td align="center" valign="middle" >0.946</td><td align="center" valign="middle" >0.54</td><td align="center" valign="middle" >0.92</td><td align="center" valign="middle" >0.911</td></tr><tr><td align="center" valign="middle" >m2</td><td align="center" valign="middle" >0.756</td><td align="center" valign="middle" >0.897</td><td align="center" valign="middle" >0.773</td><td align="center" valign="middle" >0.898</td><td align="center" valign="middle" >0.888</td><td align="center" valign="middle" >0.969</td><td align="center" valign="middle" >0.845</td><td align="center" valign="middle" >0.886</td><td align="center" valign="middle" >0.68</td></tr><tr><td align="center" valign="middle" >m3</td><td align="center" valign="middle" >0.889</td><td align="center" valign="middle" >0.922</td><td align="center" valign="middle" >0.928</td><td align="center" valign="middle" >0.907</td><td align="center" valign="middle" >0.915</td><td align="center" valign="middle" >0.808</td><td align="center" valign="middle" >0.943</td><td align="center" valign="middle" >0.880</td><td align="center" valign="middle" >0.913</td></tr><tr><td align="center" valign="middle" >average</td><td align="center" valign="middle" >0.864</td><td align="center" valign="middle" >0.864</td><td align="center" valign="middle" >0.840</td><td align="center" valign="middle" >0.886</td><td align="center" valign="middle" >0.876</td><td align="center" valign="middle" >0.908</td><td align="center" valign="middle" >0.776</td><td align="center" valign="middle" >0.895</td><td align="center" valign="middle" >0.835</td></tr><tr><td align="center" valign="middle" >w</td><td align="center" valign="middle" >0.810</td><td align="center" valign="middle" >0.818</td><td align="center" valign="middle" >0.807</td><td align="center" valign="middle" >0.870</td><td align="center" valign="middle" >0.851</td><td align="center" valign="middle" >0.858</td><td align="center" valign="middle" >0.658</td><td align="center" valign="middle" >0.888</td><td align="center" valign="middle" >0.757</td></tr><tr><td align="center" valign="middle" >U</td><td align="center" valign="middle" >0.856</td><td align="center" valign="middle" >0.853</td><td align="center" valign="middle" >0.847</td><td align="center" valign="middle" >0.882</td><td align="center" valign="middle" >0.872</td><td align="center" valign="middle" >0.895</td><td align="center" valign="middle" >0.753</td><td align="center" valign="middle" >0.898</td><td align="center" valign="middle" >0.809</td></tr><tr><td align="center" valign="middle" >−z1</td><td align="center" valign="middle" >3,921,520</td><td align="center" valign="middle" >4,305,180</td><td align="center" valign="middle" >4,200,440</td><td align="center" valign="middle" >4,125,490</td><td align="center" valign="middle" >4,187,150</td><td align="center" valign="middle" >3,922,770</td><td align="center" valign="middle" >4,813,670</td><td align="center" valign="middle" >3,980,580</td><td align="center" valign="middle" >4,000,670</td></tr><tr><td align="center" valign="middle" >−z2</td><td align="center" valign="middle" >107,392</td><td align="center" valign="middle" >102,252</td><td align="center" valign="middle" >106,783</td><td align="center" valign="middle" >102,211</td><td align="center" valign="middle" >102,570</td><td align="center" valign="middle" >99,614</td><td align="center" valign="middle" >104,140</td><td align="center" valign="middle" >102,644</td><td align="center" valign="middle" >110,177</td></tr><tr><td align="center" valign="middle" >−z3</td><td align="center" valign="middle" >90,042,400</td><td align="center" valign="middle" >80,310,600</td><td align="center" valign="middle" >78,499,400</td><td align="center" valign="middle" >84,865,800</td><td align="center" valign="middle" >82,400,800</td><td align="center" valign="middle" >113,625,000</td><td align="center" valign="middle" >74,173,600</td><td align="center" valign="middle" >92,676,000</td><td align="center" valign="middle" >83,055,600</td></tr></tbody></table></table-wrap><p>accurately. Suppose the membership function’s value is negative in any optimization problems. In that case, the value is less than the assigned anti-ideal, and the entire calculation must be repeated. Therefore, the careful selection of these values is important. By having the ideal and anti-ideal values of each objective function, we can optimize the model with the criterion of “fuzzy” and the balance factor γ equal to 0.5. The obtained values are as follows:</p><p>With the above values in hand, we can solve the proposed model for the problem. For the results of computations not to depend on the opinion of a particular decision maker, we have to define an auxiliary utility function to extract the best options based on it. We consider the decision-maker function as the weighted sum of the mean, minimum, and maximum objectives and use it as a scale for comparison. To be more precise, we have the following equation:</p><p>U = ( min ( μ i ) + Average ( μ i ) + max ( μ i ) ) / 3</p><p>We solved the program for the same weight vectors to compare this method with the presented methods. In fact, in the proposed method, we have set the value of the compatible space expansion coefficient to zero and the previous method to 100%. The answers to the presented method and the previous method can be seen according to the following tables:</p><p>As it can be seen, in all the non-dominant responses generated by our proposed method, which can be seen in <xref ref-type="table" rid="table9">Table 9</xref>, the value of the parameter “w” is minimum; in addition to generating more non-dominant responses, different values are obtained for the desirability function of each response. For this reason, we choose the answer leading to the maximum value of this function as the best answer, which is answer number 6 with the value of 0.908. It is observed that the value of this utility function is also higher than the value obtained for the previous proposed method: 0.905. According to the results, it can be seen that all the answers generated in our proposed method have the condition that the criterion “fuzzy” equals the predetermined value of 0.895. For a more explicit comparison, the best answer obtained from our proposed method (based on the utility function U) with other optimization methods can be seen in the table below. Note that LPi indicates single-objective optimization to optimize the i<sup>th</sup> objective function of the problem without regard to other objectives. Our proposed method performs better than all other methods due to the utility function “u”, the average degree of satisfaction of the goals, and the factor “w” which equals the “Werner Method”. <xref ref-type="table" rid="table9">Table 9</xref> shows the comparison of the proposed method with other proposed methods.</p><p><xref ref-type="fig" rid="fig4">Figure 4</xref> shows the scatter of the obtained answers according to the three studied objective functions. We can observe the expected increasing trend in the value of the first and third objective functions by decreasing the value of the second objective function. The second objective function is related to the total transport time of products.</p><table-wrap id="table9" ><label><xref ref-type="table" rid="table9">Table 9</xref></label><caption><title> Compare the proposed method with other proposed methods</title></caption><table><tbody><thead><tr><th align="center" valign="middle" ></th><th align="center" valign="middle" >Wang et al. paper</th><th align="center" valign="middle" >Pedro et al. paper</th><th align="center" valign="middle" >Close et al. paper</th><th align="center" valign="middle" >Kim et al. paper</th><th align="center" valign="middle" >Proposed Method</th></tr></thead><tr><td align="center" valign="middle" >m1</td><td align="center" valign="middle" >0.889</td><td align="center" valign="middle" >0.889</td><td align="center" valign="middle" >0.891</td><td align="center" valign="middle" >0.250</td><td align="center" valign="middle" >0.039</td></tr><tr><td align="center" valign="middle" >m2</td><td align="center" valign="middle" >0.935</td><td align="center" valign="middle" >0.925</td><td align="center" valign="middle" >0.891</td><td align="center" valign="middle" >0.161</td><td align="center" valign="middle" >0.136</td></tr><tr><td align="center" valign="middle" >m3</td><td align="center" valign="middle" >0.886</td><td align="center" valign="middle" >0.889</td><td align="center" valign="middle" >0.891</td><td align="center" valign="middle" >1.000</td><td align="center" valign="middle" >1.000</td></tr><tr><td align="center" valign="middle" >Average</td><td align="center" valign="middle" >0.903</td><td align="center" valign="middle" >0.901</td><td align="center" valign="middle" >0.891</td><td align="center" valign="middle" >0.470</td><td align="center" valign="middle" >0.392</td></tr><tr><td align="center" valign="middle" >w</td><td align="center" valign="middle" >0.895</td><td align="center" valign="middle" >0.895</td><td align="center" valign="middle" >0.891</td><td align="center" valign="middle" >0.316</td><td align="center" valign="middle" >0.215</td></tr><tr><td align="center" valign="middle" >U</td><td align="center" valign="middle" >0.908</td><td align="center" valign="middle" >0.905</td><td align="center" valign="middle" >0.891</td><td align="center" valign="middle" >0.544</td><td align="center" valign="middle" >0.477</td></tr></tbody></table></table-wrap><p>Three factories and three warehouses are open at the beginning of the first period. Because customers are in fixed locations each period, we do not include them in the figure. The reciprocating flows of the material are not shown in the figure to prevent it from being messy. A significant change in SC status occurs in the second period. Two factories and one warehouse are opened, and one warehouse is closed. The overall structure of the potential storage of drug equipment over time is consistent with the definitive single-objective model. In mathematical modeling, this can be used as a criterion for the validity of the designed model.</p></sec></sec><sec id="s4"><title>4. Conclusions</title><p>We have identified three important risks and uncertainties in addressing drug supply planning: the indefinite duration of the licensing process, the risk of a forced brand change, and indefinite repayment levels that lead to varied demand diversification. We created the two-step random MILP model to market the design. Important supply preparation decisions are the formulation required, the sheets’ volumes, and the packaging’s storage capacity, which must be planned in advance. All possible release dates are based on the other expected variables as they depend on the outcome of the licensing process. Unexpected additional decisions include packaging volumes and the list of laminated goods. Since uncertainties arise due to the unspecified date of licensing at unspecified points on time, other expected restrictions are used to force pre-licensing decisions to be the same. An extensive numerical experiment was performed in the case study that reflects the industry’s reality. In the numerical experiment proving the applicability of our modeling approach, our numerical analysis could have led to the following managerial insights:</p><p>&#183; Risk packaging results from limited capacity. The focus should be on larger markets to reduce market time.</p><p>&#183; The inevitable market supply delays must be transferred to low-interest markets.</p><p>&#183; Our modeling approach operates from a rigorous (severe) risk packaging process due to a better evaluation of cost and other opportunities in reducing time to a better market.</p><p>&#183; Packaging material suppliers should be selected case-by-case based on efficiency rather than cost.</p><p>&#183; A significant cost reduction results from implementing our model instead of using the over-storage role to estimate the volume of active drug elements, as seen in today’s industry.</p><p>&#183; Excessive stockpiling of active drug elements before market launch carries a high risk of relative decision (larger packaging volumes), resulting in a high disposal cost.</p><p>&#183; Finally, since the chemical industry is the backbone of the pharmaceutical industry and also seeks rich literature in this field, compared to the young area of the pharmaceutical industry, many ideas can be inspired by old ideas to advance the younger generation.</p></sec><sec id="s5"><title>Conflicts of Interest</title><p>The authors declare no conflicts of interest regarding the publication of this paper.</p></sec><sec id="s6"><title>Cite this paper</title><p>Entezami, M. and Havaeji, H. (2023) Green Drug Supply Chain Investigation by Time-Market Balance and Risk. World Journal of Engineering and Technology, 11, 611-631. https://doi.org/10.4236/wjet.2023.113042</p></sec><sec id="s7"><title>Appendix 1</title>Collections<p>T Planning horizon</p><p>M Factory Complex</p><p>Mc A set of factories that may close (Mc ⸦ M)</p><p>Mo A set of factories that may open (Mo ⸦ M)</p><p>W Collection of distribution centers</p><p>Wc A set of distribution centers that may be closed (Wc ⸦ W)</p><p>Wo A set of distribution centers that may open (Wo ⸦ W)</p><p>C Collection of drug distribution centers</p><p>V A set of transport equipment</p><p>O A set of capacity options</p><p>Om Collection Center Capacity Options (Om ⸦ O)</p><p>Ow Set of Capacity Options for Distribution Centers (Ow ⸦ O)</p><p>Ov Capacity Options for Transport Equipment (Ov ⸦ O)</p><p>P Collection of produced products</p><p>R Set of raw materials</p>Parameters<p>D c , p t Customer “C” demand in the “T” period for “P” product</p><p>α p Capacity consumption rate to produce “P” product of factory capacity</p><p>α ′ p The capacity consumption rate for “P” product repair of factory capacity</p><p>C a p m Initial production capacity of the “M” factory</p><p>C a p w Initial storage capacity of “W” distribution center</p><p>M c a p o m Production capacity of the “om” option for installation in factories</p><p>W c a p o w Storage capacity of the “ow” option for installation in distribution centers</p><p>V c a p o v Hold capacity “ov” option for installation on distribution centers</p><p>γ p “P” product weight</p><p>D e f p Percentage of potential storage in p-type products</p><p>T c a p 1 v t Maximum displacement capacity by type V equipment in t period between factories and distribution centers</p><p>T c a p 2 v t Maximum displacement capacity by type V equipment in t period between distribution centers and shopping centers</p><p>C O i Cost of opening equipment i ( i ∈ W o ∪ M o )</p><p>C C i Cost of closing equipment i ( i ∈ W c ∪ M c )</p><p>C A i , o Cost of installing option o on equipment i</p><p>C O P i Fixed cost of equipment operation i</p><p>C A O P i , o Fixed operating cost of option o on equipment i</p><p>C P p , m The production cost of the “P” product in the “M” factory</p><p>C R p , m The repair cost of the “P” product in the “M” factory</p><p>C S p , w Warehouse cost of “P” product at the end of each period in the “W” warehouse</p><p>C T v The cost of moving each volume unit of the product per unit distance by equipping “v”</p><p>S P T v Transmission speed by equipping “v”</p>Variables<p>x w , c , p , v t The amount of product p moved between warehouse w and shopping center c by equipping v in period t</p><p>x m , w , p , v t The amount of product p produced and transferred between factory m and warehouse w by equipment v in period t</p><p>z m , w , p , v t Product value p probable storage and displacement between factory m and warehouse w by equipping v in period t</p><p>z w , c , p , v t The amount of product p that is potentially stored and moved between warehouse w and customer c by preparing v in period t</p><p>y c , w , p , v t The amount of product p requires potential storage and relocation between pharmacy c and warehouse w by preparing v in period t</p><p>y w , m , p , v t Product value p requires possible storage and displacement between warehouse w and factory m by preparing v in period t</p><p>δ m t f factory m is open in period t, the value is one; otherwise, it is zero</p><p>δ w t If the warehouse w is available in period t, it takes the value of one; otherwise, the value of zero</p><p>σ m , o t If option “o” is installed on factory m in period t, the value will be one; otherwise, it will be zero</p><p>σ w , o t If option “o” is installed on the warehouse w in period t, the value will be one; otherwise, zero</p><p>σ 1 v , o v t If “ov” is installed on equipment v between factories and distribution centers in period t, it takes one value</p><p>σ 2 v , o v t If “ov” is installed on the equipment v between distribution centers and customers in period t, it takes one value</p></sec></body><back><ref-list><title>References</title><ref id="scirp.127325-ref1"><label>1</label><mixed-citation publication-type="other" xlink:type="simple">Shah, N. (2004) Pharmaceutical Supply Chains: Key Issues and Strategies for Optimisation. Computers &amp; Chemical Engineering, 28, 929-941.  
https://doi.org/10.1016/j.compchemeng.2003.09.022</mixed-citation></ref><ref id="scirp.127325-ref2"><label>2</label><mixed-citation publication-type="other" xlink:type="simple">Tsang, K.H., Samsatli, N.J. and Shah, N. (2007) Capacity Investment Planning for Multiple Vaccines under Uncertainty: Financial Risk Analysis. Food and Bioproducts Processing, 85, 129-140. https://doi.org/10.1205/fbp06002</mixed-citation></ref><ref id="scirp.127325-ref3"><label>3</label><mixed-citation publication-type="other" xlink:type="simple">Blau, G.E., Pekny, J.F., Varma, V.A. and Bunch, P.R. (2004) Managing a Portfolio of Interdependent New Product Candidates in the Pharmaceutical Industry. Journal of Product Innovation Management, 21, 227-245.  
https://doi.org/10.1111/j.0737-6782.2004.00075.x</mixed-citation></ref><ref id="scirp.127325-ref4"><label>4</label><mixed-citation publication-type="other" xlink:type="simple">Varma, V.A., Pekny, J.F., Blau, G.E. and Reklaitis, G.V. (2008) A Framework for Addressing Stochastic and Combinatorial Aspects of Scheduling and Resource Allocation in Pharmaceutical R&amp;D Pipelines. Computers &amp; Chemical Engineering, 32, 1000-1015. https://doi.org/10.1016/j.compchemeng.2007.05.006</mixed-citation></ref><ref id="scirp.127325-ref5"><label>5</label><mixed-citation publication-type="other" xlink:type="simple">Gatica, G., Papageorgiou, L. and Shah, N. (2003) Capacity Planning under Uncertainty for the Pharmaceutical Industry. Chemical Engineering Research and Design, 81, 665-678. https://doi.org/10.1205/026387603322150516</mixed-citation></ref><ref id="scirp.127325-ref6"><label>6</label><mixed-citation publication-type="other" xlink:type="simple">Saur-Amaral, I. and Borges Gouveia, J.J. (2007) Uncertainty in Drug Development: Insights from a Portuguese Firm. International Journal of Technology Intelligence and Planning, 3, 355-375. https://doi.org/10.1504/IJTIP.2007.016306</mixed-citation></ref><ref id="scirp.127325-ref7"><label>7</label><mixed-citation publication-type="other" xlink:type="simple">Antonijevic, Z. (2014) Optimization of Pharmaceutical R&amp;D Programs and Portfolios. Springer International Publishing, Cham.</mixed-citation></ref><ref id="scirp.127325-ref8"><label>8</label><mixed-citation publication-type="other" xlink:type="simple">Papageorgiou, L.G., Rotstein, G.E. and Shah, N. (2001) Strategic Supply Chain Optimization for the Pharmaceutical Industries. Industrial &amp; Engineering Chemistry Research, 40, 275-286. https://doi.org/10.1021/ie990870t</mixed-citation></ref><ref id="scirp.127325-ref9"><label>9</label><mixed-citation publication-type="other" xlink:type="simple">Rogers, M.J., Gupta, A. and Maranas, C.D. (2002) Real Options Based Analysis of Optimal Pharmaceutical Research and Development Portfolios. Industrial &amp; Engineering Chemistry Research, 41, 6607-6620. https://doi.org/10.1021/ie020385p</mixed-citation></ref><ref id="scirp.127325-ref10"><label>10</label><mixed-citation publication-type="other" xlink:type="simple">Uthayakumar, R. and Priyan, S. (2013) Pharmaceutical Supply Chain and Inventory Management Strategies: Optimization for a Pharmaceutical Company and a Hospital. Operations Research for Health Care, 2, 52-64.  
https://doi.org/10.1016/j.orhc.2013.08.001</mixed-citation></ref><ref id="scirp.127325-ref11"><label>11</label><mixed-citation publication-type="other" xlink:type="simple">Vila-Parrish, A.R., Ivy, J.S., King, R.E. and Abel, S.R. (2012) Patient-Based Pharmaceutical Inventory Management: A Two-Stage Inventory and Production Model for Perishable Products with Markovian Demand. Health System, 1, 69-83.  
https://doi.org/10.1057/hs.2012.2</mixed-citation></ref><ref id="scirp.127325-ref12"><label>12</label><mixed-citation publication-type="other" xlink:type="simple">Papageorgiou, L.G. (2009) Supply Chain Optimisation for the Process Industries: Advances and Opportunities. Computers &amp; Chemical Engineering, 33, 1931-1938.  
https://doi.org/10.1016/j.compchemeng.2009.06.014</mixed-citation></ref><ref id="scirp.127325-ref13"><label>13</label><mixed-citation publication-type="other" xlink:type="simple">Kannan, G., Sasikumar, P. and Devika, K. (2010) A Genetic Algorithm Approach for Solving A Closed Loop Supply Chain Model: A Case of Battery Recycling. Applied Mathematical Modelling, 34, 655-670.  
https://doi.org/10.1016/j.apm.2009.06.021</mixed-citation></ref><ref id="scirp.127325-ref14"><label>14</label><mixed-citation publication-type="other" xlink:type="simple">Kelle, P., Woosley, J. and Schneider, H. (2012) Pharmaceutical Supply Chain Specifics and Inventory Solutions for a Hospital Case. Operations Research for Health Care, 1, 54-63. https://doi.org/10.1016/j.orhc.2012.07.001</mixed-citation></ref><ref id="scirp.127325-ref15"><label>15</label><mixed-citation publication-type="other" xlink:type="simple">Laínez, J.M., Schaefer, E. and Reklaitis, G.V. (2012) Challenges and Opportunities in Enterprise-Wide Optimization in the Pharmaceutical Industry. Computers &amp; Chemical Engineering, 47, 19-28.  
https://doi.org/10.1016/j.compchemeng.2012.07.002</mixed-citation></ref><ref id="scirp.127325-ref16"><label>16</label><mixed-citation publication-type="other" xlink:type="simple">Susarla, N. and Karimi, I.A. (2012) Integrated Supply Chain Planning for Multinational Pharmaceutical Enterprises. Computers &amp; Chemical Engineering, 42, 168- 177. https://doi.org/10.1016/j.compchemeng.2012.03.002</mixed-citation></ref><ref id="scirp.127325-ref17"><label>17</label><mixed-citation publication-type="other" xlink:type="simple">Ozer, O. and Uncu, O. (2013) Competing on Time: An Integrated Framework to Optimize Dynamic Time-to-Market and Production Decisions. Production and Operations Management, 22, 473-488.  
https://doi.org/10.1111/j.1937-5956.2012.01413.x</mixed-citation></ref><ref id="scirp.127325-ref18"><label>18</label><mixed-citation publication-type="other" xlink:type="simple">Masoumi, A.H., Yu, M. and Nagurney, A. (2012) A Supply Chain Generalized Network Oligopoly Model for Pharmaceuticals under Brand Differentiation and Perishability. Transportation Research Part E: Logistics and Transportation Review, 48, 762-780. https://doi.org/10.1016/j.tre.2012.01.001</mixed-citation></ref><ref id="scirp.127325-ref19"><label>19</label><mixed-citation publication-type="other" xlink:type="simple">Narayana, S.A., Pati, R.K. and Vrat, P. (2012) Research on Management Issues in the Pharmaceutical Industry: A Literature Review. International Journal of Pharmaceutical and Healthcare Marketing, 6, 351-375.  
https://doi.org/10.1108/17506121211283235</mixed-citation></ref><ref id="scirp.127325-ref20"><label>20</label><mixed-citation publication-type="other" xlink:type="simple">Chen, D.Q., Preston, D.S. and Xia, W. (2013) Enhancing Hospital Supply Chain Performance: A Relational View and Empirical Test. Journal of Operations Management, 31, 391-408. https://doi.org/10.1016/j.jom.2013.07.012</mixed-citation></ref><ref id="scirp.127325-ref21"><label>21</label><mixed-citation publication-type="other" xlink:type="simple">Hansen, K.R.N. and Grunow, M. (2015) Planning Operations before Market Launch for Balancing Time-To Market and Risks in Pharmaceutical Supply Chains. International Journal of Production Economics, 161, 129-139.  
https://doi.org/10.1016/j.ijpe.2014.10.010</mixed-citation></ref><ref id="scirp.127325-ref22"><label>22</label><mixed-citation publication-type="other" xlink:type="simple">Ho, W., Zheng, T., Yildiz, H. and Talluri, S. (2015) Supply Chain Risk Management: a Literature Review. International Journal of Production Research, 53, 5031-5069.  
https://doi.org/10.1080/00207543.2015.1030467</mixed-citation></ref><ref id="scirp.127325-ref23"><label>23</label><mixed-citation publication-type="other" xlink:type="simple">Gurtu, A., Searcy, C. and Jaber, M.Y. (2015) An Analysis of Keywords Used in the Literature on Green Supply Chain Management. Management Research Review, 38, 166-194. https://doi.org/10.1108/MRR-06-2013-0157</mixed-citation></ref><ref id="scirp.127325-ref24"><label>24</label><mixed-citation publication-type="other" xlink:type="simple">Aziz, F., Mahadi, N., Zakaria, W.N.W. and Mahadi, N. (2017) The Impact of Open Innovation and Supply Chain Management towards Firm Performance. International Journal of Academic Research in Business and Social Sciences, 7, 338-344.  
https://doi.org/10.6007/IJARBSS/v7-i11/3465</mixed-citation></ref><ref id="scirp.127325-ref25"><label>25</label><mixed-citation publication-type="other" xlink:type="simple">Dehghanbaghi, N. and Sajadieh, M. (2017) Joint Optimization of Production, Transportation and Pricing Policies of Complementary Products in a Supply Chain. Computers &amp; Industrial Engineering, 107, 150-157.  
https://doi.org/10.1016/j.cie.2017.03.016</mixed-citation></ref><ref id="scirp.127325-ref26"><label>26</label><mixed-citation publication-type="other" xlink:type="simple">Zainudin, M.Z., Habidin, N.F. and Yusof, M.B. (2019) Green Supply Chain Management and Environmental Performance for KPJ Healthcare Specialist Hospital in Selangor. In: Emerging Trends and Challenges in Management: II Strategy, Practices and Performance Measurements, Kaizentrenovation Sdn Bhd, Tanjung Malim, 109-118.</mixed-citation></ref><ref id="scirp.127325-ref27"><label>27</label><mixed-citation publication-type="other" xlink:type="simple">Maass, E.C. (2020) Supply Chain Modeling: Modeling and Optimizing on Time Delivery and Cost through Supply Chains.</mixed-citation></ref><ref id="scirp.127325-ref28"><label>28</label><mixed-citation publication-type="other" xlink:type="simple">Tukamuhabwa, B., Mutebi, H. and Kyomuhendo, R. (2021) Competitive Advantage in SMEs: Effect of Supply Chain Management Practices, Logistics Capabilities and Logistics Integration in a Developing Country. Journal of Business and Socio-Economic Development. https://doi.org/10.1108/JBSED-04-2021-0051%</mixed-citation></ref></ref-list></back></article>