Analytical models for supplier selection and order quantity allocation

In the literature, decision models and techniques for supplier selection do not often consider inventory management of the items being purchased as part of the analysis. In this article, two mixed integer nonlinear programming models are proposed to select the best set of suppliers and determine the proper allocation of order quantities while minimizing the annual ordering, inventory holding, and purchasing costs under suppliers’ capacity and quality constraints. The first model allows independent order quantities for each supplier while the second model restricts all order quantities to be of equal size, as it would be required in a multi-stage (supply chain) inventory model. Illustrative examples are used to highlight the advantages of the proposed models over a previous model introduced in the literature.     

Optimal ordering and pricing policy with supplier quantity discounts and price-dependent stochastic demand

We study a joint ordering and pricing problem for a retailer whose supplier provides all-unit quantity discount for the product. Both generalized disjunctive programming model and mixed integer nonlinear programming model are presented to formulate the problem. Some properties of the problem are analysed, based on which a solution algorithm is developed. Two numerical examples are presented to illustrate the problem, which are solved by our solution algorithm. Managerial analysis indicates that supplier quantity discount has much influence on the ordering and pricing policy of the retailer and more profit can be obtained when the supplier provides quantity discount.     

Cooperation and game-theoretic cost allocation in stochastic inventory models with continuous review

We study cooperation strategies for companies that continuously review their inventories and face Poisson demand. Our main goal is to analyze stable cost allocations of the joint costs. These are such that any group of companies has lower costs than the individual companies. If such allocations exist they provide an incentive for the companies to cooperate.     

The stochastic EOQ model with random sales price

The article deals with a stochastic economic order quantity (EOQ) model over a finite time horizon where uniform demand over the replenishment period is price dependent. The selling price is assumed to be a random variable that follows a probability density function. As demand is probabilistic, stock out situation may occur. Based on the partial backlogging and lost sale cases during stock out period, the author develops the criterion for the optimal solution for the replenishment size such that the integrated expected profit is maximized. Moreover, the article suggests a new function regarding price dependent demand. Finally, numerical examples and its sensitivity analysis of key parameters are given to illustrate the proposed model.     

A serial inventory system with supplier selection and order quantity allocation

Given the prevalence of both supplier selection and inventory control problems in supply chain management, this article addresses these problems simultaneously by developing a mathematical model for a serial system. This model determines an optimal inventory policy that coordinates the transfer of items between consecutive stages of the system while properly allocating orders to selected suppliers in stage 1. In addition, a lower bound on the minimum total cost per time unit is obtained and a 98% effective power-of-two (POT) inventory policy is derived for the system under consideration. This POT algorithm is advantageous since it is simple to compute and yields near optimal solutions.     

Revenue management approach to stochastic capacity allocation problem

To formulate stochastic capacity allocation problems in a manufacturing system, the concept and techniques of revenue management is applied in this research. It is assumed the production capacity is stochastic and hence its exact size cannot be forecasted in advance, at the time of planning. There are two classes of “frequent” and “occasional” customers demanding this capacity. The price rate as well as the penalty for order cancellation caused by overbooking is different for each class. The model is developed mathematically and we propose an analytical solution method. The properties of the optimal solution as well as the behavior of objective function are also analyzed. The objective function is not concave, in general. However, we prove it is a unimodal function and by taking advantage of this property, the optimal solution is determined.     

Supplier selection and order allocation problem using a two-phase fuzzy multi-objective linear programming

The aim of this paper is to solve a supplier selection problem under multi-price level and multi-product using interactive two-phase fuzzy multi-objective linear programming (FMOLP) model. The proposed model attempts to simultaneously minimize total purchasing and ordering costs, a number of defective units, and late delivered units ordered from suppliers. The piecewise linear membership functions are applied to represent the decision maker’s fuzzy goals for the supplier selection and order allocation problem, and can be resulted in more flexibility via an interactive decision-making process. To demonstrate effectiveness of the proposed model, results of applying the proposed model are shown by a numerical example. The analytical results show that the proposed approach is effective in uncertain environments and provide a reliable decision tool for integrated multi-objective supplier selection problems.     

Joint optimization of price and order quantity with shortages for a two-warehouse system

In developing the best strategy for real-world applications, the vendor must have some knowledge of the buyers’ behavior such as response to shortages and price increases. Using this knowledge, he can develop a policy that will ensure the largest net profit. Considering the fact, a two-warehousing inventory model has been developed where the demand is price-sensitive under the bulk release rule. Stockouts are allowed and are fully backlogged. Moreover, the transportation cost is taken to be dependent on the transported units. The model jointly optimizes the selling price and the order quantity by maximizing the system profit. Results have been validated with the help of a numerical example.      

An approximation algorithm for a facility location problem with stochastic demands and inventories

We propose a 2-approximation algorithm for a facility location problem with stochastic demands. At open facilities, inventory is kept such that arriving requests find a zero inventory with (at most) some pre-specified probability. Costs incurred are expected transportation costs, facility operating costs and inventory costs.     

An efficient computational method for a stochastic dynamic lot-sizing problem under service-level constraints

We provide an efficient computational approach to solve the mixed integer programming (MIP) model developed by Tarim and Kingsman [8] for solving a stochastic lot-sizing problem with service level constraints under the static-dynamic uncertainty strategy. The effectiveness of the proposed method hinges on three novelties: (i) the proposed relaxation is computationally efficient and provides an optimal solution most of the time, (ii) if the relaxation produces an infeasible solution, then this solution yields a tight lower bound for the optimal cost, and (iii) it can be modified easily to obtain a feasible solution, which yields an upper bound. In case of infeasibility, the relaxation approach is implemented at each node of the search tree in a branch-and-bound procedure to efficiently search for an optimal solution. Extensive numerical tests show that our method dominates the MIP solution approach and can handle real-life size problems in trivial time.     

A deterministic,multi-item inventory model with supplier selection and imperfect quality

This paper considers the scenario of supply chain with multiple products and multiple suppliers, all of which have limited capacity. We assume that received items from suppliers are not of perfect quality. Items of imperfect quality, not necessarily defective, could be used in another inventory situation. Imperfect items are sold as a single batch, prior to receiving the next shipment, at a discounted price. The demand over a finite planning horizon is known, and an optimal procurement strategy for this multi-period horizon is to be determined. Each of products can be sourced from a set of approved suppliers, a supplier-dependent transaction cost applies for each period in which an order is placed on a supplier. A product-dependent holding cost per period applies for each product in the inventory that is carried across a period in the planning horizon. Also a maximum storage space for the buyer in each period is considered. The decision maker, the buyer, needs to decide what products to order, in what quantities, with which suppliers, and in which periods. Finally, a genetic algorithm (GA) is used to solve the model.     

Integrated analytical hierarch process and mathematical programming to supplier selection problem with quantity discount

In this article an integration of analytical hierarchy process and non-linear integer and multi-objective programming under some constraints such as quantity discounts, capacity, and budget is applied to determine the best suppliers and to place the optimal order quantities among them. This integration-based multi-criteria decision making methodology takes into account both qualitative and quantitative factors in supplier selection. While the analytical hierarchy process matches item characteristics with supplier characteristics, non-linear integer programming model analytically determines the best suppliers and the optimal order quantities among the determined suppliers. The objectives of the mathematical models constructed are maximizing the total value of purchase (TVP), minimizing the total cost of purchase (TCP) or maximizing TVP and minimizing TCP simultaneously. In addition, several “what if” scenarios are facilitated and the quality of the resulting models is evaluated on real-life data.     

An a posteriori decision support methodology for solving the multi-criteria supplier selection problem

This research presents a novel, state-of-the-art methodology for solving a multi-criteria supplier selection problem considering risk and sustainability. It combines multi-objective optimization with the analytic network process to take into account sustainability requirements of a supplier portfolio configuration. To integrate ‘risk’ into the supplier selection problem, we develop a multi-objective optimization model based on the investment portfolio theory introduced by Markowitz. The proposed model is a non-standard portfolio selection problem with four objectives: (1) minimizing the purchasing costs, (2) selecting the supplier portfolio with the highest logistics service, (3) minimizing the supply risk, and (4) ordering as much as possible from those suppliers with outstanding sustainability performance. The optimization model, which has three linear and one quadratic objective function, is solved by an algorithm that analytically computes a set of efficient solutions and provides graphical decision support through a visualization of the complete and exactly-computed Pareto front (a posteriori approach). The possibility of computing all Pareto-optimal supplier portfolios is beneficial for decision makers as they can compare all optimal solutions at once, identify the trade-offs between the criteria, and study how the different objectives of supplier portfolio configuration may be balanced to finally choose the composition that satisfies the purchasing company's strategy best. The approach has been applied to a real-world supplier portfolio configuration case to demonstrate its applicability and to analyze how the consideration of sustainability requirements may affect the traditional supplier selection and purchasing goals in a real-life setting.     

Evaluation of stock allocation policies in a divergent inventory system with shipment consolidation

In this paper we consider a one-warehouse N-retailer inventory system characterized by access to real-time point-of-sale data, and a time based dispatching and shipment consolidation policy at the warehouse. More precisely, inventory is reviewed continuously, while a consolidated shipment (for example, a truck) to all retailers is dispatched from the warehouse at regular time intervals. The focus is on investigating the cost benefits of using state-dependent myopic allocation policies instead of a simple FCFS (First-Come-First-Serve) rule to allocate shipped goods to the retailers. The analysis aims to shed some light on when, if ever, FCFS is a reasonable policy to use in this type of system? The FCFS allocations of items to retailers are determined by the sequence in which retailer orders (or equivalently customer demands) arrive to the warehouse. Applying the myopic policy enables the warehouse to postpone the allocation decision to the moment of shipment (from the warehouse) or the moments of delivery (to the different retailers), and to base it on the inventory information available at those times. The myopic allocation method we study is often used in the literature on periodic review systems.     

Solving the multi-objective nurse scheduling problem with a weighted cost function

The primary objective of the nurse scheduling problem is to ensure there are sufficient nurses on each shift. There are also a number of secondary objectives designed to make the schedule more pleasant. Neighbourhood search implementations use a weighted cost function with the weights dependent on the importance of each objective. Setting the weights on binding constraints so they are satisfied but still allow the search to find good solutions is difficult. This paper compares two methods for overcoming this problem, SAWing and Noising with simulated annealing and demonstrates that Noising produces better schedules.     

Multi-item single source ordering problem with transportation cost: A Lagrangian decomposition approach

As a part of supply chain management literature and practice, it has been recognized that there can be significant gains in integrating inventory and transportation decisions. The problem we tackle here is a common one both in retail and production sectors where several items have to be ordered from a single supplier. We assume that there is a finite planning horizon to make the ordering decisions for the items, and in this finite horizon the retailer or the producer knows the demand of each item in each period. In addition to the inventory holding cost, an item-base fixed cost associated with each item included in the order, and a piecewise linear transportation cost are incurred. We suggest a Lagrangean decomposition based solution procedure for the problem and carry out numerical experiments to analyze the value of integrating inventory and transportation decisions under different scenarios.     

Optimal policy for a dynamic,non-stationary,stochastic inventory problem with capacity commitment

This paper studies a single-product, dynamic, non-stationary, stochastic inventory problem with capacity commitment, in which a buyer purchases a fixed capacity from a supplier at the beginning of a planning horizon and the buyer’s total cumulative order quantity over the planning horizon is constrained with the capacity. The objective of the buyer is to choose the capacity at the beginning of the planning horizon and the order quantity in each period to minimize the expected total cost over the planning horizon. We characterize the structure of the minimum sum of the expected ordering, storage and shortage costs in a period and thereafter and the optimal ordering policy for a given capacity. Based on the structure, we identify conditions under which a myopic ordering policy is optimal and derive an equation for the optimal capacity commitment. We then use the optimal capacity and the myopic ordering policy to evaluate the effect of the various parameters on the minimum expected total cost over the planning horizon.     

Credit financing in a two-warehouse environment for deteriorating items with price-sensitive demand and fully backlogged shortages

In the current global market, organizations use many promotional tools in order to increase their sales. One such tool is permissible delay in payments, i.e., the buyer does not have to pay for the goods purchased immediately rather can defer the payment for a prescribed period given by the supplier. This phenomenon motivates the retailer/buyer to order a large inventory lot so as to take full benefit of credit period. But the well decorated showroom (OW) with modern facilities has a limited storage capacity. Thus the retailer has to hire a rented warehouse to store the excess units. In this scenario, retailer usually adopts two types of dispatch policy: FIFO & LIFO, depending upon the situation, e.g., nature of items/deteriorating items, location of warehouse. Further in order to survive in the market, the retailer dynamically adjusts the prices of the goods to boost the demand and enhance the revenues.In the light of these facts, this paper develops an inventory model for deteriorating items with price-sensitive demand under permissible delay in payment in a two warehouse environment. Shortages are allowed and fully backlogged. The objective of this study is to find the optimal inventory and pricing policies so as to maximize the total average profit. Further, the different trade credit scenario has been exhibited with the help of a numerical example. A comprehensive sensitivity analysis has also been carried out to advocate the implication of FIFO and LIFO dispatch policy.     

Coordinating a decentralized supply chain with customer returns and price-dependent stochastic demand using a buyback policy

We investigate a decentralized supply chain that consists of a manufacturer and a retailer where the retailer simultaneously determines the retail price and order quantity while experiencing customer returns and price dependent stochastic demand. We propose an agreement between the manufacturer and the retailer that includes two buyback prices, one for unsold inventory and a second for customer returns, and show that this type of easy-to-implement agreement can achieve perfect supply chain coordination and be a win-win for both manufacturer and retailer when a complementary profit-sharing agreement is included.     

Stochastic joint replenishment problem under a fill rate constraint with controllable lead times and shared cost allocation

In a family of items under coordinated inventory replenishments, some products may be replenished at the same time, which in turn implies that some lead time components and costs may be shared among them. This paper investigates this aspect in the context of the joint replenishment problem under the class of cyclic policies, assuming random demands and controllable lead times, and imposing a fill rate constraint for each item.