首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到10条相似文献,搜索用时 140 毫秒
1.
In this paper a heuristic model is presented for determining the ordering schedule when an inventoried item is subject to deterioration and demand changes linearly over time. While the optimizing model developed by researchers fixes the ordering interval and varies the ordering size, the heuristic permits variation in both replenishment-cycle length and the size of the order. As a result, the heuristic produces a better solution than optimizing models in the study presented here.  相似文献   

2.
A new model for maximal coverage exploiting GIS capabilities   总被引:1,自引:0,他引:1  
The representation of demand is a key issue which can significantly affect results in several demand covering models. In this paper we concentrate on the well known Maximal Coverage Location Problem and demonstrate that alternative representations of the demand space may lead to largely fluctuating as well as misleading results which seriously overestimate the real coverage achieved by a specified number of servers. We introduce a new model based on the notion of complementary partial coverage and exploit the capabilities of Geographic Information Systems in order to better represent demand. Results of an empirical study indicate that the proposed model is less susceptible to fluctuations for alternative representations of the demand space and that it provides coverage of a larger proportion of demand than traditional models.  相似文献   

3.
Quick response policy with Bayesian information updates   总被引:9,自引:0,他引:9  
In this paper we investigate the quick response (QR) policy with different Bayesian models. Under QR policy, a retailer can collect market information from the sales of a pre-seasonal product whose demand is closely related to a seasonal product’s demand. This information is then used to update the distribution for the seasonal product’s demand by a Bayesian approach. We study two information update models: one with the revision of an unknown mean, and the other with the revision of both an unknown mean and an unknown variance. The impacts of the information updates under both models are compared and discussed. We also identify the features of the pre-seasonal product which can bring more significant profit improvement. We conclude that an effective QR policy depends on a precise information update model as well as a selection of an appropriate pre-seasonal product as the observation target.  相似文献   

4.
In supply chain management, one of the most critical problems which require a lot of effort to deal with is how to quantify and alleviate the impact of bullwhip effect – the phenomenon in which information on demand is distorted while moving upstream. Although it is well established that demand forecast, lead time, order batching, shortage gaming and price fluctuation are the main sources that lead to the bullwhip effect, the problem of quantifying bullwhip effect still remain unsolved in many situations due to the complex nature of the problem. In this research, a measure of bullwhip effect will be developed for a simple two-stage supply chain that includes only one retailer and one supplier in the environment where the retailer employs base stock policy for their inventory and demand forecast is performed through the first-order autoregressive model, AR(1). The effect of autoregressive coefficient and lead time on this measure will then be investigated.  相似文献   

5.
In the article we discuss the question of reducing the Arrow-Debreu model [1, 2] to a problem of mathematical programming; we also study conditions under which the problem is convex. The interest to the question is aroused by the circumstance that the equilibrium problems turn rather difficult for numeric solution. Two approaches are used most frequently. One is based on the monotonicity property (formulated somehow) of the excessive demand [2–5]. If this property is satisfied, then the corresponding differential system, which has the sought equilibrium at the rest point, appears stable. The other approach consists in constructing the so-called heuristic methods (see, for instance, [6]) which have more or less reasonable grounds but in general do not guarantee that a solution is obtainable.The research was supported by the Russian Foundation for Fundamental Research (Grant 93-012-842).Translated fromSibirskiî Matematicheskiî Zhurnal, Vol. 35, No. 5, pp. 990–999, September–October, 1994.  相似文献   

6.
A class of single server vacation queues which have single arrivals and non-batch service is considered in discrete time. It is shown that provided the interarrival, service, vacation, and server operational times can be cast with Markov-based representation then this class of vacation model can be studied as a matrix–geometric or a matrix-product problem – both in the matrix–analytic family – thereby allowing us to use well established results from Neuts (1981). Most importantly it is shown that using discrete time approach to study some vacation models is more appropriate and makes the models much more algorithmically tractable. An example is a vacation model in which the server visits the queue for a limited duration. The paper focuses mainly on single arrival and single unit service systems which result in quasi-birth-and-death processes. The results presented in this paper are applicable to all this class of vacation queues provided the interarrival, service, vacation, and operational times can be represented by a finite state Markov chain.An erratum to this article can be found at  相似文献   

7.
Owing to its theoretical as well as practical significance, the facility layout problem with unequal-area departments has been studied for several decades, with a wide range of heuristic and a few exact solution procedures developed by numerous researchers. In one of the exact procedures, the facility layout problem is formulated as a mixed-integer programming (MIP) model in which binary (0/1) variables are used to prevent departments from overlapping with one another. Obtaining an optimal solution to the MIP model is difficult, and currently only problems with a limited number of departments can be solved to optimality. Motivated by this situation, we developed a heuristic procedure which uses a “graph pair” to determine and manipulate the relative location of the departments in the layout. The graph-pair representation technique essentially eliminates the binary variables in the MIP model, which allows the heuristic to solve a large number of linear programming models to construct and improve the layout in a comparatively short period of time. The search procedure to improve the layout is driven by a simulated annealing algorithm. The effectiveness of the proposed graph-pair heuristic is demonstrated by comparing the results with those reported in recent papers. Possible extensions to the graph-pair representation technique are discussed at the end of the paper.  相似文献   

8.
Mixed integer programming models and computational strategies developed for treatment planning optimization in brachytherapy are described. The problem involves the designation of optimal placement of radioactive sources (seeds) inside a tumor site. Two MIP models are described. The resulting MIP instances are difficult to solve, due in large part to dense constraint matrices with large disparities in the magnitudes of the nonzero entries. A matrix reduction and approximation scheme is presented as a computational strategy for dealing with the dense matrices. Penalty-based primal heuristic and branching strategies to assist in the solution process are also described. Numerical results are presented for 20 MIP instances associated with prostate cancer cases. Compared to currently used computer-aided planning methods, plans derived via the MIP approach use fewer seeds (20–30 fewer) and needles, and provide better coverage and conformity – measures commonly used to assess the quality of treatment plans. Good treatment plans are returned in 15 CPU minutes, suggesting that incorporation of this MIP-based optimization module into a real-time comprehensive treatment planning system is feasible.  相似文献   

9.
Two new models for duopolistic competitive discrete location planning with sequential acting and variable delivered prices are introduced. If locations and prices are assumed to be set once and for all by the players, the resulting bilevel program is nonlinear. Under the assumption that further price adjustments are possible, i.e., that a Nash equilibrium in prices is reached, the model can be simplified to a linear discrete bilevel formulation. It is shown that in either situation players should not share any locations or markets if they strive for profit-maximization.For the situation with price adjustments, a heuristic solution procedure is suggested. In addition, the bilevel models are shown to serve as a basis from which different well-known location models – as, for example, the p-median problem, the preemptive location problem and the maximum covering problem – can be derived as special cases.  相似文献   

10.
A two-warehouse inventory model for deteriorating items with time-dependent demand has been developed. Compared with previous models, the model involves a free form time-dependent demand and a finite replenishment rate within a finite planning horizon. Rather than the heuristic approach of equal production cycle times adopted by Lee and Ma, an approach which permits variation in production cycle times is adopted to determine the number of production cycles and the times for replenishment during a finite planning horizon. Numerical examples are provided to illustrate the application of the model and the results indicate that the performance of the proposed approach is superior to that of the heuristic approach of Lee and Ma.  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号