Aggregate constrained inventory systems with independent multi-product demand: control practices and theoretical limitations

In practice, inventory managers are often confronted with a need to consider one or more aggregate constraints. These aggregate constraints result from available workspace, workforce, maximum investment or target service level. We consider independent multi-item inventory problems with aggregate constraints and one of the following characteristics: deterministic leadtime demand, newsvendor, basestock policy, rQ policy and sS policy. We analyze some recent relevant references and investigate the considered versions of the problem, the proposed model formulations and the algorithmic approaches. Finally we highlight the limitations from a practical viewpoint for these models and point out some possible direction for future improvements

Constructive solution methodologies to the capacitated newsvendor problem and surrogate extension

The newsvendor problem is a single-period stochastic model used to determine the order quantity of perishable product that maximizes/minimizes the profit/cost of the vendor under uncertain demand. The goal is to fmd an initial order quantity that can offset the impact of backlog or shortage caused by mismatch between the procurement amount and uncertain demand. If there are multiple products and substitution between them is feasible, overstocking and understocking can be further reduced and hence, the vendor\u27s overall profit is improved compared to the standard problem. When there are one or more resource constraints, such as budget, volume or weight, it becomes a constrained newsvendor problem. In the past few decades, many researchers have proposed solution methods to solve the newsvendor problem. The literature is first reviewed where the performance of each of existing model is examined and its contribution is reported. To add to these works, it is complemented through developing constructive solution methods and extending the existing published works by introducing the product substitution models which so far has not received sufficient attention despite its importance to supply chain management decisions. To illustrate this dissertation provides an easy-to-use approach that utilizes the known network flow problem or knapsack problem. Then, a polynomial in fashion algorithm is developed to solve it. Extensive numerical experiments are conducted to compare the performance of the proposed method and some existing ones. Results show that the proposed approach though approximates, yet, it simplifies the solution steps without sacrificing accuracy. Further, this dissertation addresses the important arena of product substitute models. These models deal with two perishable products, a primary product and a surrogate one. The primary product yields higher profit than the surrogate. If the demand of the primary exceeds the available quantity and there is excess amount of the surrogate, this excess quantity can be utilized to fulfill the shortage. The objective is to find the optimal lot sizes of both products, that minimize the total cost (alternatively, maximize the profit). Simulation is utilized to validate the developed model. Since the analytical solutions are difficult to obtain, Mathematical software is employed to find the optimal results. Numerical experiments are also conducted to analyze the behavior of the optimal results versus the governing parameters. The results show the contribution of surrogate approach to the overall performance of the policy. From a practical perspective, this dissertation introduces the applications of the proposed models and methods in different industries such as inventory management, grocery retailing, fashion sector and hotel reservation

A Novel Method for Optimal Solution of Fuzzy Chance Constraint Single-Period Inventory Model

A method is proposed for solving single-period inventory fuzzy probabilistic model (SPIFPM) with fuzzy demand and fuzzy storage space under a chance constraint. Our objective is to maximize the total profit for both overstock and understock situations, where the demand D~j for each product j in the objective function is considered as a fuzzy random variable (FRV) and with the available storage space area W~, which is also a FRV under normal distribution and exponential distribution. Initially we used the weighted sum method to consider both overstock and understock situations. Then the fuzziness of the model is removed by ranking function method and the randomness of the model is removed by chance constrained programming problem, which is a deterministic nonlinear programming problem (NLPP) model. Finally this NLPP is solved by using LINGO software. To validate and to demonstrate the results of the proposed model, numerical examples are given

Wood-based construction project supplier selection under uncertain starting date

There is a growing interest in supply management systems in today's competitive business environment. Importance of implementing supply management systems especially in home construction industry is due to the fact that several risks arising from different sources can adversely affect the project financially or its timely completion. Some risks of construction projects are out of managers' control while other risks such as supply related ones can usually be controlled and directed by effective managerial tactics. In this paper, we address the supplier selection problem (SSP) in wood-based construction industry (housing projects) in the presence of project commencement uncertainties. Based on the suppliers' (vendors') reaction towards these uncertainties in the delivery time, we explore two cases: (a) supplier selection with buyer penalty for a delay (SSPD) where the price of product increases with the delay; (b) supplier selection with quantity reduction for a buyer delay (SSQRD). Three heuristic-based supplier selection approaches are proposed and tested on randomly generated data sets. The proposed approaches show promising result

The Distribution-Free Newsboy Problem with Multiple Discounts and Upgrades

Most papers on the newsboy problem assume that excess inventory is either sold after discount or discarded. In the real world, overstocks are handled with multiple discounts, upgrades, or a combination of these measures. For example, a seller may offer a series of progressively increasing discounts for units that remain on the shelf, or the seller may use incrementally applied innovations aimed at stimulating greater product sophistication. Moreover, the normal distribution does not provide better protection than other distributions with the same mean and variance. In this paper, we find the differences between normal distribution approaches and distribution-free approaches in four scenarios with mean and variance of demand as the only available data to decision-makers. First, we solve the newsboy problem by considering multiple discounts. Second, we formulate and solve the newsboy problem by considering multiple upgrades. Third, we formulate and solve a mixed newsboy problem characterized with multiple discounts and upgrades. Finally, we extend the model to solve a multiproduct newsboy problem with a storage or a budget constraint and develop an algorithm to find the solutions of the models. Concavity of the models is proved analytically. Extensive computational experiments are presented to verify the robustness of the distribution-free approach. The results show that the distribution-free approach is robust