Sharif Digital Repository

An aggregate production–distribution (P-D) planning generates an aggregate plan for regular time, overtime, outsourcing, hiring, and firing that takes into account distributing, inventory holding, backordering, and machine capacity for a definite planning horizon. A large number of P-D problems require decisions to be made in the presence of uncertainty. Previous research on this topic mainly utilized either stochastic programming or fuzzy programming to cope with the uncertainty. This may lead into huge challenges for supply chain managers that use non-robust P-D planning in uncertain environments. Moreover, there has been little discussion about robust optimization approach in aggregate... 

A multi-product economic production quantity model with several real-world technical and physical constraints is developed in this paper. The cost function includes ordering, holding, backordering, lost sale, and the cost caused by unused space in the warehouse. The goal is to minimize the total inventory cost, where shortages are allowed and partially backordered with fixed and linear costs. The aim is to determine the length of the inventory cycle, the length of positive inventory period, and the backordering rates of the products during the shortage period in order to minimize the total inventory costs while satisfying all constraints. Due to complexity and non-linearity of the proposed... 

Blood transfusion services are vital components of healthcare systems all over the world. In this paper, a generalized network optimization model is developed for a complex blood supply chain in accordance with Iranian blood transfusion organization (IBTO) structure. This structure consist of four types facilities. Blood collection centers, blood collection and processing centers, mobile teams and blood transfusion center have various duties in IBTO structure. The major contribution is to develop a novel hybrid approach based on stochastic programming, ε-constraint and robust optimization (HSERO) to simultaneously model two types of uncertainties by including stochastic scenarios for total... 

In this study, a single-period two-level inventory control problem is modeled in which the demand is a random variable and shortage is assumed as lost sales. The aim is to maximize the expected profit and the service level at the end of the season, simultaneously. The setting investigated in this research is unique in the sense that both all-units and incremental discount policies are considered under a budget constraint. The developed NP-hard bi-objective optimization problem cannot be solved using an exact method within a reasonable computational time. Thus, a meta-heuristic algorithm, namely multi-objective invasive weeds optimization algorithm (MOIWO) is developed to solve the proposed... 

This paper provides a developed mathematical model to derive the optimal integrated lot sizing in a multi-level supply chain with imperfect quality products. The developed mathematical model has a bi-objective function, with conflicting goals, minimizing the chain inventory costs and maximizing the chain total profit aided to find optimum policy for integrated lot sizing. We further actualize the problem by assuming multiple stochastic constraints. The mathematical formulation of the problem is stochastic, nonlinear, and large. In this regard, the interior point algorithm that is developed as more effective algorithm with less iteration is used for solving the recent convex nonlinear model.... 

This paper proposes a multi-item economic order quantity model with imperfect items in supply deliveries. The inspection process to classify the items is not perfect and involves two types of error: Type-I and Type-II. To cope with the uncertainty involved in real-world applications and to bring the problem closer to reality, operational constraints are assumed stochastic. The aim is to determine the optimal order and back order sizes of the items in order to achieve maximum total profit. As the proposed mathematical model is a constrained nonlinear programming, three different solution methods including an exact method named the interior-point and two novel meta-heuristics named grey wolf... 

One of the basic requirements of the companies to survive in real-world competitive environments is to make their supply chains as efficient as possible. Due to recent governmental regulations, environmental issues, and the development of the concept of social responsibility, the closed-loop supply chain management has been focused by many researchers. A closed-loop supply chain includes both forward and reverse supply chain networks with the purpose of combining environmental considerations with the traditional supply chain network designs through the collection of used products and activities related to their reuse. In this paper, a bi-objective, multi-period, multi-product, closed-loop... 

A novel bi-objective multi-server location-allocation (LA) model is developed in this paper, in which the facilities are modeled as an M/M/m queuing system. Further, capacity and budget limitations are provided to make the LA problem more realistic. The two objective functions include (1) minimizing aggregate waiting times and (2) minimizing the maximum idle time of all facilities. Since the proposed model is NP-hard, a meta-heuristic algorithm called multi-objective harmony search algorithm (MOHA) is developed to solve it. In this algorithm, a new presentation scheme that satisfies most of the model constraints is proposed. Since there is no benchmark available in the literature to validate... 

This paper studies a remanufacturing facility with several types of incoming nonconforming products and different independent remanufacturing workstations. The workstations have limited capacities so that an outsourcing strategy can be practiced. Each workstation is modeled with an M/M/1/k queuing system considering k as a decision variable. Additionally, a binary decision variable is taken into account to determine the contracting strategy along with some decision variables for the prices of remanufactured products. Thus, a bi-objective mixed-integer nonlinear programming is built to obtain optimal values of the decision variables. The first objective attempts to maximize the total profit... 

The Newsboy problem has always been an important issue in inventory management. The multi-product newsboy problem with random yield and budget constraint named as the Gardener Problem is one of the novels and popular extensions of the newsboy problem. Different from the existing studies, this paper presents a multi-product gardener problem with reservation policy. Moreover, a discount rate is offered to those customers who are willing to make reservations. In addition to the demand from the original customers, extra demand is included in the model due to the motivation received by the discount rate. A solution algorithm namely the multi-product gardener problem with reservation policy... 

In this research, a bi-objective optimisation model for the joint replenishment problem (JRP) of a supply chain comprised of a single supplier and multiple retailers is developed, in which the retailers are assumed to be members of a unique distribution company. The mathematical model minimises the supplier's as well as the retailers' cost subject to some constraints. The constraints are the required storage spaces for any retailer, for any product, and for all the products. The benefit of using the JRP policy is shown based on minimising total cost of supplier and retailers. Since the developed model of the problem is NP-hard, the multi-objective meta-heuristic optimisation algorithm of... 

In this research, a bi-objective optimisation model for the joint replenishment problem (JRP) of a supply chain comprised of a single supplier and multiple retailers is developed, in which the retailers are assumed to be members of a unique distribution company. The mathematical model minimises the supplier's as well as the retailers' cost subject to some constraints. The constraints are the required storage spaces for any retailer, for any product, and for all the products. The benefit of using the JRP policy is shown based on minimising total cost of supplier and retailers. Since the developed model of the problem is NP-hard, the multi-objective meta-heuristic optimisation algorithm of...