首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到5条相似文献,搜索用时 0 毫秒
1.
In this paper we present a geometric programming approach for determining the inventory policy for multiple items having varying order cost, which is a continuous function of the order quantity, and a limit on the total average inventory of all items. Our model is a generalization of that of Gupta and Gupta for unrestricted single-item order quantity model with varying order cost and assumes the same order cost function. This cost function relates well to real-life situations since it increases as the order quantity increases and, at the same time, it is easy to handle when deducing previous work as special cases of our model since it is easily reducible to a constant. An example is solved to illustrate the method.  相似文献   

2.

A multi-item inventory model with constant demand and infinite replenishment is developed under the restrictions on storage area, total average shortage cost and total average inventory investment cost. These restrictions may be precise or imprecise. Here, it is assumed that inventory costs are directly proportional to the respective quantities, and unit purchase/production cost is inversely related to the demand. Restricted shortages are allowed but fully backlogged. First, the problem is formulated in crisp environment taking the deterministic and precise inventory parameters. It is solved by both geometric programming (GP) and gradient-based non-linear programming (NLP) methods. Later, the problem is formulated with fuzzy goals on constraints and objectives where impreciseness is introduced through linear membership functions. It is solved using the fuzzy geometric programming (FGP) method. The inventory models are illustrated with numerical values and compared with the crisp results. A sensitivity analysis on the optimum order quantity and average cost is also presented due to the variation in the tolerance of total average inventory investment cost and total average shortage cost following Dutta et al., 1993, Fuzzy Sets and Systems, 55, 133-142.  相似文献   

3.

In this paper, we present an economic order quantity (EOQ) with both demand-dependent unit cost and restrictions. An analytical solution of the EQO is derived using a recent and simple method, which isthe geometric programming approach. The EOQ inventory model with demand-dependent unit cost without any restriction and the classical EOQ inventory model are obtained.  相似文献   

4.

In this paper our main objective is to investigate a deterministic inventory production lot-size model with a permissible delay in payment under a restriction. We analyse our deterministic inventory model under a restriction which will be assumed as the average inventory level. In fact we use in our analysis two approaches: the geometric programming approach; and the Lagrange method. Then a comparison between these two approaches is performed, which is our aim. Finally we deduce some previously published works of other researchers as special cases.  相似文献   

5.

This paper addresses the problem of aggregate production planning (APP) for a multinational lingerie company in Hong Kong. The multi-site production planning problem considers the production loading plans among manufacturing factories subject to certain restrictions, such as production import/export quotas imposed by regulatory requirements of different nations, the use of manufacturing factories/locations with regard to customers' preferences, as well as production capacity, workforce level, storage space and resource conditions of the factories. In this paper, a multi-objective model is developed to solve the production planning problems, in which the profit is maximized but production penalties resulting from going over/under quotas and the change in workforce level are minimized. To enhance the practical implications of the proposed model, different managerial production loading plans are evaluated according to changes in future policy and situation. Numerical results demonstrate the robustness and effectiveness of the developed model.  相似文献   

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

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