Gotowa bibliografia na temat „Production-Inventory Planning Problem”

A company have to do inventory control for available guarantying of material, component or item at the time to fulfill production schedule, and available guarantying of product become to consumer and take care of inventory at minimum condition. As object of research is CV. Cita Nasional located in Salatiga. Problems that exist in the CV. Cita Nasional often experience shortages of raw materials caused by internal and external factors. The approach taken to solve this problem by making a production plan using the Newsboy Problem because milk products including perishable product and raw material inventory planning (MRP). From the calculation results obtained the company must produce optimal demand every Monday to Sunday. While the raw material inventory plan using Economic Order Quantity (EOQ) method. Company decreased cost for fresh milk amounting to Rp.35.526.780 and decreased raw material expense cost for whey powder amounting to Rp. 22.573.650.

Multi-item, multi-period production systems are prevalent in traditional production and distribution settings. A dynamic lot size production scheduling model (DLSPM) for multi-Production/inventory item multi-period production system with parallel machines is proposed in this paper. A mathematical framework that extends the DLSPM to multi-Production/inventory item-multi-period production planning constrained by storage space was built. The criteria of DLSPM explore optimal production schedule with the constraints of inventory, backlogs, production and demand to minimize the total inventory costs over finite planning horizon. Demand analogous to a typical production environment considered includes dynamic deterministic and fuzzy demand. The model was tested with both deterministic and fuzzy demand spread over ten years, for five equal planning periods, with a two Production/inventory item and two parallel machine test bed. From the various demand types, several iterations (sub problems) were generated and optimality condition was then verified. To capture the imprecision that is often inherent in the estimated future demand, demand was specified by fuzzy numbers and modeled using the triangular membership function distribution. Centre of gravity defuzzification scheme was used within finite intervals to obtain defuzzified demand. Tora Operations Research software was used to run the model using a test problem. Computational results vindicate the robustness and flexibility of the approach based on the quality of the solutions obtained.

Dynamic lot sizing problem for systems with bounded inventory and remanufacturing was addressed. The demand and return amounts are deterministic over the finite planning horizon. Demands can be satisfied by manufactured new items, but also by remanufactured returned items. In production planning, there can be situations where the ability to meet customer demands is constrained by inventory capacity rather than production capacity. Two different limited inventory capacities are considered; there is either bounded serviceables inventory or bounded returns inventory. For the two inventory case, we present exact, polynomial time dynamic programming algorithm based on the idea of Teunter R, et al. (2006).

This paper studies a multi-stage multi-product production and inventory planning problem with random yield derived from the cold rolling process in the steel industry. The cold rolling process has multiple stages, and intermediate inventory buffers are kept between stages to ensure continuous operation. Switching products during the cold rolling process is typically very costly. Backorder costs are incurred for unsatisfied demand while inventory holding costs are incurred for excess inventory. The process also experiences random yield. The objective of the production and inventory planning problem is to minimize the total cost including the switching costs, inventory holding costs, and backorder costs. We propose a stochastic formulation with a nonlinear objective function. Two lower bounds are proposed, which are based on full information relaxation and Jensen’s inequality, respectively. Then, we develop two heuristics from the proposed lower bounds. In addition, we propose a two-stage procedure motivated by newsvendor logic. To verify the performance of the proposed bounds and heuristics, computational tests are conducted on synthetic instances. The results show the efficiency of the proposed bounds and heuristics.