Sharif Digital Repository

In this paper we consider a newsvendor problem in which the suppliers offer quantity discounts. We assume that the initial inventory at the beginning of the period is a random variable. This assumption, among other applications, may apply to the case where the decision about the order quantity must be made at a time long before the start of the period and the available inventory may decrease due to several factors, such as deterioration, consumption, etc. up to the start of the period. In this paper, we obtain the optimal order quantity that maximizes the total profit for this model  

In this paper we develop a stochastic programming approach to solve a multi-period multi-product multi-site aggregate production planning problem in a green supply chain for a medium-term planning horizon under the assumption of demand uncertainty. The proposed model has the following features: (i) the majority of supply chain cost parameters are considered; (ii) quantity discounts to encourage the producer to order more from the suppliers in one period, instead of splitting the order into periodical small quantities, are considered; (iii) the interrelationship between lead time and transportation cost is considered, as well as that between lead time and greenhouse gas emission level; (iv)... 

We study contracts between a single retailer and multiple suppliers of two substitutable products, where suppliers have fixed capacities and present the retailer cost contracts for their supplies. After observing the contracts, the retailer decides how much capacity to purchase from each supplier, to maximize profits from the purchased capacity from the suppliers plus his possessed inventory (endowment). This is modeled as a noncooperative, nonzero-sum game, where suppliers, or principals, move simultaneously as leaders and the retailer, the common agent, is the sole follower. We are interested in the form of the contracts in equilibrium, their effect on the total supply chain profit, and... 

We propose an efficient optimal algorithm for determining the lot sizes for purchase component in Material Requirement Planning (MRP) environments with deterministic time-phased demand and zero lead time. In this model, backlog is not permitted, the unit purchasing price is based on the all-units discount system with single price break point and resale of the excess units is acceptable at the ordering time. The problem is divided into the sub-plans with specific properties by the dynamic programming (DP) method already presented. By modifying the main structure of the DP method, we present a branch-and-bound algorithm to obtain the optimal ordering policy for each sub-plans. Furthermore, we... 

A novel combination of a multimode project scheduling problem with material ordering, in which material procurements are exposed to the total quantity discount policy is investigated in this paper. The study aims at finding an optimal Pareto frontier for a triple objective model derived for the problem. While the first objective minimizes the makespan of the project, the second objective maximizes the robustness of the project schedule and finally the third objective minimizes the total costs pertaining to renewable and nonrenewable resources involved in a project. Four well-known multi-objective evolutionary algorithms including non-dominated sorting genetic algorithm II (NSGAII), strength... 

An optimal algorithm based on branch-and-bound approach is presented in this paper to determine lot sizes for a single item in material requirement planning environments with deterministic time-phased demand and constant ordering cost with zero lead time, where all-units discounts are available from vendors and backlog is not permitted. On the basis of the proven properties of optimal order policy, a tree-search procedure is presented to construct the sequence of optimal orders. Some useful fathom rules have been proven, which make the algorithm very efficient. To compare the performance of this algorithm with the other existing optimal algorithms, an experimental design with various... 

This paper presents an optimal algorithm based on Branch and Bound approach for determining lot sizes for purchased component in Material Requirement Planning (MRP) environments with deterministic time-phased demand and constant ordering cost with zero lead time. Backlog is not permitted and the unit purchasing price depends on the quantity of an order and resale of the excess is possible at the ordering time. We assume an all-units discount system with single price break point. Based on proven properties of an optimal order policy, a tree search procedure is designed to construct the sequences of orders and resales amount in optimal order policy. Some useful fathom rules have been proven to... 

In this study, a bi-objective multi-state redundancy allocation problem of series-parallel systems consisting of some serial subsystems, each with non-repairable components in parallel, is investigated. Furthermore, due to uncertainty involved, both the performance rates and the availabilities of components are considered fuzzy. In addition, two strategies of all-unit and incremental-quantity discounts are used to purchase the components and that the fuzzy universal generating function (FUGF) is employed to evaluate the system availability. The aim is to find the optimal redundancy so as within limited budget and system weight the maximum system availability is obtained while the total cost... 

In this study, a bi-objective multi-state redundancy allocation problem of series-parallel systems consisting of some serial subsystems, each with non-repairable components in parallel, is investigated. Furthermore, due to uncertainty involved, both the performance rates and the availabilities of components are considered fuzzy. In addition, two strategies of all-unit and incremental-quantity discounts are used to purchase the components and that the fuzzy universal generating function (FUGF) is employed to evaluate the system availability. The aim is to find the optimal redundancy so as within limited budget and system weight the maximum system availability is obtained while the total cost... 

In this paper, a mathematical formulation is first derived for a homogenous fuzzy series–parallel redundancy allocation problem, where both the system and its subsystems can only take two states of complete perfect and complete failure. Identical redundant components are included in order to achieve desirable system reliability. The components of each subsystem characterized by their cost, weight, and reliability, are purchased from the market under all-unit discount and incremental quantity discount strategies. The goal is to find the optimum combination of the number of components for each subsystem that maximizes the system reliability under total fuzzy cost and weight constraints. An...