An efficient optimal solution method for the joint replenishment problem
نویسندگان
چکیده
منابع مشابه
An Eecient Optimal Solution Method for the Joint Replenishment Problem
During the last two decades, many heuristic procedures for the joint replenishment problem have appeared in the literature. The only available optimal solution procedure was based on an enumera-tive approach and was computationally prohibitive. In this paper we present an alternative optimal approach based on global optimisation theory. By applying Lipschitz optimisation one can nd a solution w...
متن کاملAn efficient optimal solution method for the joint replenishment problem with minimum order quantities
We study the joint replenishment problem (JRP) for M items under deterministic demand, with a minimum order quantity constraint for each item in the replenishment order. We first study an iterative procedure that proves to be not efficient in this case. Further, we derive bounds on the basic cycle time and propose an efficient global optimisation procedure to solve the JRP with constraints. Mor...
متن کاملAn efficient algorithm for a generalized joint replenishment problem
In most multi-item inventory systems, the ordering costs consist of a major cost and a minor cost for each item included. Applying for every individual item a cyclic inventory policy, where the cycle length is a multiple of some basic cycle time, reduces the major ordering costs. An e cient algorithm to determine the optimal policy of this type is discussed in this paper. It is shown that this ...
متن کاملAn Optimization Framework for Combining the Petroleum Replenishment Problem with the Optimal Bidding in Combinatorial Auctions
We address in this paper a periodic petroleum station replenishment problem (PPSRP) that aims to plan the delivery of petroleum products to a set of geographically dispatched stations. It is assumed that each station is characterized by its weekly demand and by its frequency of service. The main objective of the delivery process is to minimize the total travelled distance by the vailable trucks...
متن کاملThe Joint Replenishment Problem with Time-Varying Costs and Demands: Efficient, Asymptotic and ε-Optimal Solutions
We address the Joint Replenishment Problem (JRP) where, in the presence of joint setup costs, dynamic lot sizing schedules need to be determined for m items over a planning horizon of N periods, with general time-varying cost and demand parameters. We develop a new, so-called, partitioning heuristic for this problem, which partitions the complete horizon of N periods into several relatively sma...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Operational Research
سال: 1997
ISSN: 0377-2217
DOI: 10.1016/s0377-2217(96)00072-0