發(fā)布時(shí)間：2018-08-02 20:47

【摘要】：本文考慮一個(gè)單一產(chǎn)品倉(cāng)儲(chǔ)能力決策和庫(kù)存決策的動(dòng)態(tài)批量集成優(yōu)化問(wèn)題.在這個(gè)模型中,長(zhǎng)度為T(mén)個(gè)周期的計(jì)劃期被劃分成連續(xù)的若干段,每段初需制定該段的倉(cāng)儲(chǔ)能力決策,同一段中各期的期末庫(kù)存水平均受限于該段倉(cāng)儲(chǔ)能力.假設(shè)每段倉(cāng)儲(chǔ)能力費(fèi)用為倉(cāng)儲(chǔ)能力的非減函數(shù),各期的產(chǎn)品訂貨費(fèi)用為固定費(fèi)用,庫(kù)存保管費(fèi)用是一個(gè)期末庫(kù)存量的線性函數(shù).利用分解技術(shù)和幾何技術(shù),本文開(kāi)發(fā)一個(gè)計(jì)算復(fù)雜度為O(T~3)的動(dòng)態(tài)規(guī)劃算法.計(jì)算測(cè)試顯示,該算法與求解混合整數(shù)規(guī)劃(MIP)的商業(yè)軟件相比,在計(jì)算時(shí)間上具有明顯的優(yōu)勢(shì).
[Abstract]:In this paper, a dynamic batch integration optimization problem for single product warehousing capacity decision and inventory decision is considered. In this model, the planning period with T cycle length is divided into several successive segments, and the storage capacity decision of each segment should be made at the beginning of each section, and the end inventory level of each period in the same section is limited by the storage capacity of this section. The cost of storage capacity is assumed to be a non-minus function of storage capacity, the cost of ordering goods in each period is a fixed cost, and the cost of keeping inventory is a linear function of the inventory at the end of the period. In this paper, a dynamic programming algorithm with computational complexity of O (T3) is developed by using decomposition and geometry techniques. The computational tests show that the algorithm has obvious advantages in computing time compared with commercial software for solving mixed integer programming (MIP).
【作者單位】： 暨南大學(xué)管理學(xué)院;
【基金】：暨南大學(xué)企業(yè)發(fā)展研究所提供部分資助~~
【分類(lèi)號(hào)】：F273;O221.3

【相似文獻(xiàn)】

中國(guó)期刊全文數(shù)據(jù)庫(kù) 前2條

1 林昶;黃慶;卜祥智;;第三方倉(cāng)儲(chǔ)能力配置與分配的收益優(yōu)化[J];西南交通大學(xué)學(xué)報(bào);2007年03期

2 林昶;帥斌;卜祥智;黃慶;;基于需求更新的第三方倉(cāng)儲(chǔ)能力分配優(yōu)化[J];系統(tǒng)工程;2007年03期

，

本文編號(hào)：2160683