RATIONING DISCRETIONARY ECONOMIC RESOURCES: A MULTIOBJECTIVE APPROACH

Prior research involving capital rationing has focused on capital budgeting issues: given a limited resource pool, which major long-lived fixed assets should be acquired? However, capital rationing can be extended to include not only new fixed-asset purchases but also expenditures for any other discretionary activity such as advertising, research and development, or maintenance. In this broader situation, measuring the contributions of certain discretionary activities to a single objective (e.g., maximize profits) or to multiple objectives often is hindered by a lack of reliable revenue estimates. This problem severely hampers the usefulness of traditional mathematical programming approaches to capital rationing. In this paper, we modify the usual multiobjective capital rationing procedures by treating each discretionary activity as an objective in itself. In this manner, we can mitigate the difficulties associated with revenue measurement problems and allow a decision maker systematically to explore the various trade-offs between competing discretionary investments.     

Experimental Results Indicating Lattice‐Dependent Policies May Be Optimal for General Assemble‐To‐Order Systems

We consider an assemble‐to‐order (ATO) system with multiple products, multiple components which may be demanded in different quantities by different products, possible batch ordering of components, random lead times, and lost sales. We model the system as an infinite‐horizon Markov decision process under the average cost criterion. A control policy specifies when a batch of components should be produced, and whether an arriving demand for each product should be satisfied. Previous work has shown that a lattice‐dependent base‐stock and lattice‐dependent rationing (LBLR) policy is an optimal stationary policy for a special case of the ATO model presented here (the generalized M‐system). In this study, we conduct numerical experiments to evaluate the use of an LBLR policy for our general ATO model as a heuristic, comparing it to two other heuristics from the literature: a state‐dependent base‐stock and state‐dependent rationing (SBSR) policy, and a fixed base‐stock and fixed rationing (FBFR) policy. Remarkably, LBLR yields the globally optimal cost in each of more than 22,500 instances of the general problem, outperforming SBSR and FBFR with respect to both objective value (by up to 2.6% and 4.8%, respectively) and computation time (by up to three orders and one order of magnitude, respectively) in 350 of these instances (those on which we compare the heuristics). LBLR and SBSR perform significantly better than FBFR when replenishment batch sizes imperfectly match the component requirements of the most valuable or most highly demanded product. In addition, LBLR substantially outperforms SBSR if it is crucial to hold a significant amount of inventory that must be rationed.     

Inventory Rationing for Multiple Class Demand under Continuous Review

We consider how a firm should ration inventory to multiple classes in a stochastic demand environment with partial, class‐dependent backlogging where the firm incurs a fixed setup cost when ordering from its supplier. We present an infinite‐horizon, average cost criterion Markov decision problem formulation for the case with zero lead times. We provide an algorithm that determines the optimal rationing policy, and show how to find the optimal base‐stock reorder policy. Numerical studies indicate that the optimal policy is similar to that given by the equivalent deterministic problem and relies on tracking both the current inventory and the rate that backorder costs are accumulating. Our study of the case of non‐zero lead time shows that a heuristic combining the optimal, zero lead time policy with an allocation policy based on a single‐period profit management problem is effective.     

多类顾客环境下报童模型中库存分配策略研究

考虑一个报童模型中多类顾客的库存分配问题,将顾客按照他们愿意支付价格的高低划分为不同级别。零售商在销售期初决定产品订货量,并在销售期内决定接受或者拒绝不同顾客的需求,以最大化销售期内的期望总利润。将销售期分成大量足够小的时间单位,通过建立一个反向Bellman动态规划方程,以优化每个时间单位内的库存分配策略,并得到了零售商最优的期初订货量。通过与没有库存分配策略下零售商的期望利润进行比较,算例分析得出库存分配策略可以大幅提高零售商的利润。这主要是因为通过库存分配可以使得零售商从高端顾客中获取更多利润,同时能够减小期初的订货量,以节约采购成本和库存持有成本。     

Inventory Rationing in a Make‐to‐Stock System with Batch Production and Lost Sales

We address an inventory rationing problem in a lost sales make‐to‐stock (MTS) production system with batch ordering and multiple demand classes. Each production order contains a single batch of a fixed lot size and the processing time of each batch is random. Assuming that there is at most one order outstanding at any point in time, we first address the case with the general production time distribution. We show that the optimal order policy is characterized by a reorder point and the optimal rationing policy is characterized by time‐dependent rationing levels. We then approximate the production time distribution with a phase‐type distribution and show that the optimal policy can be characterized by a reorder point and state‐dependent rationing levels. Using the Erlang production time distribution, we generalize the model to a tandem MTS system in which there may be multiple outstanding orders. We introduce a state‐transformation approach to perform the structural analysis and show that both the reorder point and rationing levels are state dependent. We show the monotonicity of the optimal reorder point and rationing levels for the outstanding orders, and generate new theoretical and managerial insights from the research findings.     

Joint Stocking and Product Offer Decisions Under the Multinomial Logit Model

This article studies a joint stocking and product offer problem. We have access to a number of products to satisfy the demand over a finite selling horizon. Given that customers choose among the set of offered products according to the multinomial logit model, we need to decide which sets of products to offer over the selling horizon and how many units of each product to stock so as to maximize the expected profit. We formulate the problem as a nonlinear program, where the decision variables correspond to the stocking quantity for each product and the duration of time that each set of products is offered. This nonlinear program is intractable due to its large number of decision variables and its nonseparable and nonconcave objective function. We use the structure of the multinomial logit model to formulate an equivalent nonlinear program, where the number of decision variables is manageable and the objective function is separable. Exploiting separability, we solve the equivalent nonlinear program through a dynamic program with a two dimensional and continuous state variable. As the solution of the dynamic program requires discretizing the state variable, we study other approximate solution methods. Our equivalent nonlinear program and approximate solution methods yield insights for good offer sets.     

Pricing and Capacity Rationing with Customer Disappointment Aversion

Customers are averse to disappointment that arises when economic outcomes fall short of expectations. In this study, we study a two‐period model in which the firm may create rationing in either period. In the anticipation of possible disappointment due to stock‐outs, strategic customers decide when to purchase and the firm determines the prices and rationing levels in each period. We explore the impact of disappointment aversion on customers' strategic purchasing behavior and the firm's pricing and rationing decisions. Without disappointment aversion, it is optimal for the firm to adopt a uniform pricing policy without rationing. However, when strategic customers are averse to disappointment, a firm may be able to increase profits with an appropriate level of rationing. We analyze both the mark‐up and mark‐down policies. We show that, in a mark‐down scenario, the firm always benefits from disappointment aversion behavior by using an appropriate level of rationing in a low‐price period. However, in a mark‐up scenario, whether it is beneficial for the firm to induce disappointment aversion behavior depends on how customers frame payoffs in different periods when forming utilities. Particularly, when customers compartmentalize payoffs in different periods to form utilities, the firm should not induce disappointment aversion behavior.     

An application of mathematical programming to soybean processing

In this paper, a mathematical programming methodology is applied to a production planning problem involving a soybean processing plant which can purchase its raw materials from multiple origins and must ship its finished products to multiple destinations. A time horizon production planning model is developed, with the objective of maximizing the net income produced by this plant. This model is tested for a five origin, three destination, processing network, over a thirteen month time horizon. Test results, in terms of a production plan and associated purchasing-allocation decisions, are presented and discussed.     

INVENTORY RATIONING AND SHIPMENT FLEXIBILITY ALTERNATIVES FOR DIRECT MARKET FIRMS

This paper investigates inventory‐rationing policies of interest to firms operating in a direct market channel. We model a single product with two demand classes, where one class requests a lower order fulfillment lead time but pays a higher price. Demand for each class follows a Poisson process. Inventory is fed by a production system with exponentially distributed build times. We study rationing policies in which the firm either blocks or backlogs orders for the lower priority customers when inventory drops below a certain level. We compare the performance of these rationing policies with a pure first‐come, first‐serve policy under various scenarios for customer response to delay: lost sales, backlog, and a combination of lost sales and backlog.     

Hierarchical production planning for multi-product lines in the beverage industry¶

Multi-commodity production and distribution scheduling is one of the most complex and crucial problems facing many manufacturing companies. For a major European manufacturer specialising in bottling juices and drinks, we have designed and developed a hierarchical decomposition approach to the solution of the multi-commodity production planning problem. In this paper we focus our attention on the coarsest decomposition level, called multi-commodity aggregate production planning (MCAP). It concerns the choice of the best feasible production plan for a set of products (commodities) over an extended time horizon so as to meet forecast aggregate demands throughout the horizon. At this level, the problem constraints include hard constraints (such as production lines having a maximum capacity and products having short life-times), and soft constraints (budgetary concerns.) The objective is to determine the production plan that covers each period's demands as best as possible, while minimizing all relevant costs. Our method for solving MCAP produces optimal plans in negligible times in commodity PC workstations.     

Single-machine scheduling with deteriorating jobs and aging effects under an optional maintenance activity consideration

This article studies a single-machine scheduling with deteriorating jobs and aging effects under an optional maintenance activity. We assume that after maintenance activity, the machine will revert to its initial condition and the aging effects will start anew. Moreover, due to the restriction of budget of maintenance, the limitation of the maintenance frequency on the machine is assumed to be known in advance. The optional maintenance activity of this study means that the starting time of the maintenance activity is unknown in advance. It can be scheduled immediately after the processing of any job that has been completed. Therefore, the planner must to make decision on whether or when to schedule the maintenance activity during the scheduling horizon to optimal the performance measures. The objective is to minimize the makespan. We first show that the addressed problem is NP-hard in the strong sense. Then a fully polynomial-time approximation scheme (FPTAS) for the proposed problem is presented.     

Exact and heuristic approaches for the automated design of medical trainees rotation schedules

This article addresses the problem of designing rotation schedules for the training of medical students in a healthcare institution in Colombia. Rotations are carried out along the course of a six months time period during which students rotate through different services both during one or multiple fortnightly periods. The hospital receives trainees from different universities that present heterogeneous requirements, and must accomplish different rotations constraints even in those cases when they come from the same university. Two different approaches are proposed to tackle the problem. First, a mathematical programming model is considered. Secondly, a metaheuristic approach based on Variable Neighborhood Search is adapted to solve the problem in an efficient manner. In both cases the objective function is proposed to be either a linear or a quadratic function that seeks a stable allocation of personnel to the services all along the considered time horizon. The proposed techniques are implemented as a part of a basic spreadsheet that helps personnel in charge generate, validate and fix the proposed plans as needed. The effectiveness of the methodology is tested through ex-post analysis, comparing it against schedules generated by the personnel in charge at the hospital, and over simulated data. The results indicate that the applied metaheuristic is competitive against specialized optimization software and facilitates the work of optimization for the health professionals in charge, reducing the planning tasks from several days to minutes.     

Joint supplier selection and scheduling of customer orders under disruption risks: Single vs. dual sourcing

This paper presents a stochastic mixed integer programming approach to integrated supplier selection and customer order scheduling in the presence of supply chain disruption risks, for a single or dual sourcing strategy. The suppliers are assumed to be located in two different geographical regions: in the producer's region (domestic suppliers) and outside the producer's region (foreign suppliers). The supplies are subject to independent random local disruptions that are uniquely associated with a particular supplier and to random semi-global (regional) disruptions that may result in disruption of all suppliers in the same geographical region simultaneously. The domestic suppliers are relatively reliable but more expensive, while the foreign suppliers offer competitive prices, however material flows from these suppliers are more exposed to unexpected disruptions. Given a set of customer orders for products, the decision maker needs to decide which single supplier or which two different suppliers, one from each region, to select for purchasing parts required to complete the customer orders and how to schedule the orders over the planning horizon, to mitigate the impact of disruption risks. The problem objective is either to minimize total cost or to maximize customer service level. The obtained combinatorial stochastic optimization problem will be formulated as a mixed integer program with conditional value-at-risk as a risk measure. The risk-neutral and risk-averse solutions that optimize, respectively average and worst-case performance of a supply chain are compared for a single and dual sourcing strategy and for the two different objective functions. Numerical examples and computational results are presented and some managerial insights on the choice between the two sourcing strategies are reported.     

The use of demand information in selecting production plans and schedules

The strategic problem of selecting a production plan for a given planning horizon is usually treated as independent of the tactical problem of scheduling the production plan. This paper approaches both selecting the production plan and scheduling it as one problem. The problem is formulated as a zero-one integer program. The formulation accommodates many real-life considerations. The integer program is solved using a branch and bound procedure which provides the optimal production plan and schedule as well as the importance indices of the orders, a concept which is introduced and used in this study to rank the available orders within the planning horizon according to their importance to the firm. The integer program and the search procedure can be used as a decision supporting tool to respond to any changes in the demand information, capacity of the firm, or its operating strategy, and it guarantees the selection of feasible production plan(s) and optimal schedules.     

新鲜产品跨季销售中的动态库存管理策略研究

新鲜产品在跨季销售过程中不可避免地发生变质，给分销商带来较大的风险。本文基于一个两阶段决策模型来帮助分销商动态管理库存，在考虑产品质量随机变化的情形下更好地匹配供给与需求。具体来说，在采摘季节确定采购的总数量；在销售季节结合产品新鲜度的演变以及剩余库存水平的变化动态地决策每周期的销售量，以实现期望利润的最大化。我们采用动态规划模型分析销售期的库存管理决策，刻画了利润函数和最优决策的结构性质，并考察了库存量、新鲜度水平和价格等参数对最优库存决策的影响。数值实验结果表明，当产品变质风险大、需求不确定性低时，动态库存管理策略相比静态策略的利润改进效果更为显著。     

A multi-stage stochastic supply network design problem with financial decisions and risk management

In this paper, a multi-period supply chain network design problem is addressed. Several aspects of practical relevance are considered such as those related with the financial decisions that must be accounted for by a company managing a supply chain. The decisions to be made comprise the location of the facilities, the flow of commodities and the investments to make in alternative activities to those directly related with the supply chain design. Uncertainty is assumed for demand and interest rates, which is described by a set of scenarios. Therefore, for the entire planning horizon, a tree of scenarios is built. A target is set for the return on investment and the risk of falling below it is measured and accounted for. The service level is also measured and included in the objective function. The problem is formulated as a multi-stage stochastic mixed-integer linear programming problem. The goal is to maximize the total financial benefit. An alternative formulation which is based upon the paths in the scenario tree is also proposed. A methodology for measuring the value of the stochastic solution in this problem is discussed. Computational tests using randomly generated data are presented showing that the stochastic approach is worth considering in these types of problems.     

越库转运问题的自适应遗传算法研究

探讨一种固定运输模式下的越库转运问题--采用运输量不可拆分的单次运送方式以最小费用通过选择固定的运输路径将货物经过越库转运到目的地,其货物将可能在越库中停留甚至无法运到目的地,这将会导致库存成本和惩罚成本.文中证明了此类越库转运问题是强NP难题,因此本文针对该问题的特殊结构,提出一种采用了邻域搜索技术的自适应遗传算法(...     

Master Production Scheduling Under Rolling Planning Horizons with Fixed Order Intervals

Fixed interval scheduling is studied in the context of a rolling horizon framework that is developed by building on previous work in the master scheduling area. The rolling horizon framework includes a stationary scheduling model which uses the “time fencing’concept by partitioning the planning horizon into three sections. The lengths of these sections and the frequency at which the stationary problem is updated and resolved are discussed as parameters of the rolling horizon model. Two different interpretations of the freeze interval parameter are examined, enabling confirmation and clarification of results presented in an earlier study. Details are given for three methods of calculating safety stocks as a function of rolling horizon parameters, including a method which results in optimal safety stock levels. A comparison of the safety stock methods shows that the constant safety stock method can result in inventories that are significantly above optimal under certain conditions, whereas the constant service level method consistently yields nearly optimal results.     

FREQUENCY OF REPLANNING IN A ROLLING HORIZON MASTER PRODUCTION SCHEDULE FOR A PROCESS INDUSTRY ENVIRONMENT: A CASE STUDY

This study addresses the problem of replanning frequency for a rolling horizon master production schedule (MPS) in a process industry environment under demand certainty. The major contribution of this paper is the demonstration of how the appropriate replanning frequency for a MPS can be determined under the conditions of minimum batch-size production restrictions in a rolling planning horizon setting. In addition, the problem environment for this study is an actual MPS operation that includes features such as multiple production lines, multiple products, capacity constraints, minimum inventory requirements, and multiple goals. Actual data from a paint company are used to determine the appropriate replanning frequency for a rolling horizon MPS. Results indicate that a 2-month replanning frequency was the best at this firm because of the significant cost savings it provided when compared to actual company performance and the other replanning intervals.     

Optimal market timing strategies under transaction costs

In this paper, we consider optimal market timing strategies under transaction costs. We assume that the asset's return follows an auto-regressive model and use long-term investment growth as the objective of a market timing strategy which entails the shifting of funds between a risky asset and a riskless asset. We give the optimal trading strategy for a finite investment horizon, and analyze its limiting behavior. For a finite horizon, the optimal decision in each step depends on two threshold values. If the return today is between the two values, nothing needs to be done, otherwise funds will be shifted from one asset to another, depending on which threshold value is being exceeded. When investment horizon tends to infinity, the optimal strategy converges to a stationary policy, which is shown to be closely related to a well-known technical trading rule, called Momentum Index trading rule. An integral equation of the two threshold values is given. Numerical results for the limiting stationary strategy are presented. The results confirm the obvious guess that the no-transaction region increases as the transaction cost increase. Finally, the limiting stationary strategy is applied to data in the Hang Seng Index Futures market in Hong Kong. The out-of-sample performance of the limiting stationary strategy is found to be better than the simple strategy used in literature, which is based on an 1-step ahead forecast of return.