• 沒有找到結果。

A Heuristic (R, T) Periodic Review Perishable Inventory Model with Lead Times

N/A
N/A
Info
下載
Protected

Academic year: 2022

Share "A Heuristic (R, T) Periodic Review Perishable Inventory Model with Lead Times"

Copied!
1
0
0

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

立即下載 ( 1 頁 )

全文

(1)

題名: A Heuristic (R, T) Periodic Review Perishable Inventory Model with Lead Times

作者: Chiu, H. N.

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

關鍵詞: Perishable inventory;Heuristic model;Outdating;Periodic review;Simulation

日期: 1995

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

摘要: This paper deals with the problem of determining a best order-up-to- level and review interval policy for a fixed-life perishable product under the assumption that the lead time is positive. After the analysis of the behavioral pattern of the perishability process, a simple yet good approximation to the expected outdating is developed. Two extended bounds on the expected outdating and the total expected costs of holding inventory, ordering, backlogging unsatisfied demand, and disposing of perished inventory are derived to construct a heuristic (R, T) model. Validation tests for both unrestricted and restricted cases are performed to assess the effectiveness of the approximate outdating. The performance of the heuristic model is tested empirically by comparing it with results from a simulation. Computational studies reveal that the approximate outdating and the heuristic model are accurate. The general results of a comparison between the heuristic model and no outdating model are also provided in this paper.

參考文獻

立即下載 ( DOC - 1 頁 - 35.00 KB )

相關文件

Slides credited from Hsu-Chun Hsiao

 “Greedy”: always makes the choice that looks best at the moment in the hope that this choice will lead to a globally optimal solution.  When to

+ Catering for Learner

Step 1: With reference to the purpose and the rhetorical structure of the review genre (Stage 3), design a graphic organiser for the major sections and sub-sections of your

Applied Learning (Vocational English) –English Communication (QF Level 3)2021/23 Cohort

• following up the recommendation of offering vocational English as a new Applied Learning (ApL) course, as proposed by the Task Force on Review of School Curriculum with a view

We start with a historical review of the establishment of a large sample foundation for CAT

This paper presents (i) a review of item selection algorithms from Robbins–Monro to Fred Lord; (ii) the establishment of a large sample foundation for Fred Lord’s maximum

4 Bounded level sets

3.1(c) again which leads to a contradiction to the level sets assumption. 3.10]) which indicates that the condition A on F may be the weakest assumption to guarantee bounded level

Algorithm Design and Analysis Greedy Algorithms (2)

• “Greedy”: always makes the choice that looks best at the moment in the hope that this choice will lead to a globally optimal solution. • When to

Algorithm Design and Analysis Greedy Algorithm (1)

• makes a locally optimal choice in the hope that this choice will lead to a globally optimal solution.. • not always yield optimal solution; may end up at

9.1

One model for the growth of a population is based on the assumption that the population grows at a rate proportional to the size of the population.. That is a reasonable