• 沒有找到結果。

An Optimal Algorithm for solving the Dynamic Lot-Sizing Model with Learning and Forgetting in Setups and Production

N/A
N/A
Protected

Academic year: 2022

Share "An Optimal Algorithm for solving the Dynamic Lot-Sizing Model with Learning and Forgetting in Setups and Production"

Copied!
1
0
0

加載中.... (立即查看全文)

全文

(1)

題名: An Optimal Algorithm for solving the Dynamic Lot-Sizing Model with Learning and Forgetting in Setups and Production

作者: Chiu, H. N.;H. M. Chen

貢獻者: 亞洲大學經營管理學系

關鍵詞: Learning and forgetting effects;Dynamic lot-sizing model;FIFO inventory costing method

日期: 2005

上傳時間: 2010-06-10T03:52:10Z 出版者: Asia University

摘要: This paper studies the problem of incorporating both learning and forgetting in setups and production into the dynamic lot-sizing model to obtain an optimal production policy, including the optimal number of production runs and the optimal production quantities during the finite period planning horizon. Since the unit production cost is variable due to the effects of learning and forgetting, the first-in-first-out (FIFO)

inventory costing method is used in our model. After deriving the relevant cost functions, we develop the multi-dimensional forward dynamic programming (MDFDP) algorithm based on two important properties that can be proved to be able to reduce the computational complexity. A numerical example is illustrated and solved using our refined MDFDP algorithm. The results from our computational

experiment show that the optimal number of production runs decreases with the increase of the learning or forgetting rates, while the optimal total cost increases with the increase of one of the above four rates.

Production learning has the greatest influence on the optimal total cost among the four parameters. The interactive effects of five demand patterns and nine relationships generated by the four rates on the optimal number of production runs and the optimal total cost are also examined.

參考文獻

相關文件

✓ Express the solution of the original problem in terms of optimal solutions for subproblems. Construct an optimal solution from

✓ Express the solution of the original problem in terms of optimal solutions for subproblems.. Construct an optimal solution from

Therefore, in this research, we propose an influent learning model to improve learning efficiency of learners in virtual classroom.. In this model, teacher prepares

In this paper, by using Takagi and Sugeno (T-S) fuzzy dynamic model, the H 1 output feedback control design problems for nonlinear stochastic systems with state- dependent noise,

We will design a simple and effective iterative algorithm to implement “The parallel Tower of Hanoi problem”, and prove its moving is an optimal

The aim of this study is to develop and investigate the integration of the dynamic geometry software GeoGebra (GGB) into eleventh grade students’.. learning of geometric concepts

The aim of this study is to investigate students in learning in inequalities with one unknown, as well as to collect corresponding strategies and errors in problem solving..

Marar (2000), “On the Value of Optimal Myopic Solutions for Dynamic Routing and Scheduling Problems in The Presence of User Noncompliance,” Transportation Science, Vol..