The Finite Horizon Trended Inventory Replenishment Problem With Shortages

A new type of replenishment policy is suggested for an inventory item having a finite shortage cost and linear trend in demand over a finite time horizon. The optimal solution of the suggested replenishment policy has a lower total cost as compared with the optimal solution for the traditional replenishment policies.     

The Trended Inventory Lot Sizing Problem with Shortages Under a New Replenishment Policy

In the past few years, considerable attention has been given to the inventory lot sizing problem with trended demand over a fixed horizon. The traditional replenishment policy is to avoid shortages in the last cycle. Each of the remaining cycles starts with a replenishment and inventory is held for a certain period which is followed by a period of shortages. A new replenishment policy is to start each cycle with shortages and after a period of shortages a replenishment should be made. In this paper, we show that this new type of replenishment policy is superior to the traditional one. We further propose four heuristic procedures that follow the new replenishment policy. These are the constant demand approximation method, the equal cycle length heuristic, the extended Silver approach, and the extended least cost solution procedure. We also examine the cost and computation time performances of these heuristic procedures through an empirical study. The number of test problems solved to optimality, average and maximum cost deviation from optimum were used as measures of cost performance. The results of the 10 000 test problems reveal that the extended least cost approach is most cost effective.     

A Note on a Replenishment Policy for an Inventory Model with Linear Trend in Demand and Shortages

The present paper deals with an alternative approach for finding the optimal number of replenishments and optimal replenishment times for a finite-horizon inventory problem with linearly increasing demand allowing shortages which are fully backlogged. The method is developed by assuming that successive replenishment cycle lengths are in arithmetic progression. The corresponding results in the absence of shortage are also derived and finally some numerical examples are presented and compared with the existing methods to test the accuracy and effectiveness of the method. A sensitivity analysis has also been presented to study the effect of changes in the system parameters on the optimal cost.     

Two New Heuristic Procedures for the Joint Replenishment Problem

In this paper, we develop two new efficient heuristic procedures for the joint replenishment problem. Each of the two heuristic procedures generates iteratively a near-optimal replenishment policy starting with ordering frequencies that are derived from the solution to a relaxed version of the joint replenishment problem. Both heuristic procedures are illustrated with an example problem involving five jointly ordered items. Seven more illustrative problems, taken from the joint replenishment problem literature, are also solved to assess the cost performance of the two heuristic procedures. They both provide the global optimal replenishment policies for all the illustrative problems.     

A Comment on ‘Inventory Replenishment Policy for Linearly Increasing Demand Considering Shortages — An Optimal Solution’ by T. M. Murdeshwar

Journal of the Operational Research Society -     

A Note on the Joint Replenishment Problem under Constant Demand

This note considers the joint replenishment inventory problem for N items under constant demand. The frequently-used cyclic strategy (T; k₁, …, k _N ) is investigated: a family replenishment is made every T time units and item i is included in each k _i th replenishment. Goyal proposed a solution to find the global optimum within the class of cyclic strategies. However, we will show that the algorithm of Goyal does not always lead to the optimal cyclic strategy. A simple correction is suggested.     

Heuristic Scheduling of Ship Replenishment at Sea

This paper describes the structure of a heuristic algorithm, or rule-base, which schedules naval replenishment. The work provided a scheduling module for a model simulating the replenishment of a moving task-group of warships. The rules were derived from a knowledge-acquisition exercise with replenishment experts, and included experience from experimentation. This paper is intended to stimulate discussion with others investigating decision-support systems for vehicle-scheduling under complex constraints.     

A Heuristic for Replenishment of Deteriorating Items with a Linear Trend in Demand

Journal of the Operational Research Society - The classical no-shortage inventory policy is examined for the case of deteriorating items having a deterministic demand pattern with a linear...     

A Short Note on a Simple Search Heuristic for the Diskspacking Problem

This paper presents a short note on a simple heuristic to find a feasible arrangement of a given set of different disks in a given circular area. By restarting with good initial solutions and escaping from the local minima early, a heuristic that simulates a system of elastic solids can solve such a disks packing problem more quickly. A number of computational results show the effectiveness of these improvements.     

On a Heuristic Inventory-replenishment Rule for Items with a Linearly Increasing Demand Incorporating Shortages

A heuristic decision rule is derived for the replenishment of items with a linearly increasing demand rate over a finite planning horizon during which shortages are allowed. When compared with the exact decision rule, the heuristic is found to incur negligible cost penalty for the numerical example which is given to illustrate the use of the heuristic.     

Inventory Replenishment Policy for Linearly Increasing Demand Considering Shortages-An Optimal Solution

An optimal solution for inventory replenishment policy for an item having a deterministic demand pattern with linear increasing trend is developed considering shortages. Numerical examples are given to illustrate the results.     

时值与增加量折扣并允许短缺的变质性物品的EOQ模型(英)

本文在考虑资金时值和增加量折扣的情形下，讨论了允许短缺的变质性物品在有限计划期内的经济批量问题，提供了寻求最优计货次数以及各次订货的最优批量和最优时刻的一个简单的一维方法，并出示了一个数字例子来说明本模型及其求解过程．     

A New Optimal Algorithm for the Joint Replenishment Problem

In this paper, we propose a new optimal algorithm for the Joint Replenishment Problem. The proposed algorithm can be used to determine the optimal strict-cyclic policy, as well as the optimal among all cyclic policies for the joint replenishment problem. Computational experiments on randomly generated problems reveal that the proposed algorithm performs better than existing optimal algorithms for the problem.     

A Heuristic for the Prime Number Theorem

Conclusion  Might there be a chance of proving in a simple way thatx/π(x) is asymptotic to an increasing function, thus getting another proof of PNT? This is probably wishful thinking. However, there is a natural candidate for the increasing function. LetL(x) be the upper convex hull of the full graph ofxπ(x) (precise definition to follow). The piecewise linear functionL(x) is increasing becausex/π(x) → ∞ asx → ∞. Moreover, using PNT, we can give a proof thatL(x) is indeed asymptotic tox/π(x). But the point of our work in this article is that for someone who wishes to understand why the growth of primes is governed by natural logarithms, a reasonable approach is to convince oneself via computation that the convex hull just mentioned satisfies the hypothesis of our theorem, and then use the relatively simple proof to show that this hypothesis rigorously implies the prime number theorem.