期刊文献+
共找到3篇文章
< 1 >
每页显示 20 50 100
考虑特性分类批处理负荷可调节能力的数据中心微网灵活性设备分布鲁棒容量配置方法
1
作者 崔杨 程禹烽 +2 位作者 赵钰婷 李佳宇 李崇钢 《电力自动化设备》 EI CSCD 北大核心 2024年第7期180-188,共9页
微网灵活性设备主要用于平抑源荷两侧的波动,其容量配置方法应考虑源荷不确定性的影响,而含数据中心微网的灵活性设备容量配置方法还应进一步考虑数据中心负荷的可调节特性。考虑数据中心批处理负荷的可调节能力和源荷不确定性因素,提... 微网灵活性设备主要用于平抑源荷两侧的波动,其容量配置方法应考虑源荷不确定性的影响,而含数据中心微网的灵活性设备容量配置方法还应进一步考虑数据中心负荷的可调节特性。考虑数据中心批处理负荷的可调节能力和源荷不确定性因素,提出一种灵活性设备容量配置方法。根据负荷特性的不同,将批处理负荷划分为2类以更加准确地量化其可调节能力,一类为带宽时序可变限时可平移负荷,另一类为带宽时序不变可中断平移负荷,对这2类批处理负荷进行详细分析并给出一般性的建模方法;构建数据驱动下的min-max-min两阶段分布鲁棒优化容量配置模型,利用1-范数和∞-范数约束场景概率分布模糊集,采用列和约束生成算法对该模型进行化简求解。对某省数据中心微网进行算例分析,验证了所提方法的有效性。 展开更多
关键词 数据中心 批处理负荷 特性分类 可调节能力 容量配置 分布鲁棒优化
下载PDF
Material Flow Optimization for Make-to-Stock Production System
2
作者 ZHANG Bi-xi, ZHAO Wei, LIAO Zhao-hui, WANG Jun (Economic Management Faculty, Guangdong University of Technology, Gua ngzhou 510090, China) 《厦门大学学报(自然科学版)》 CAS CSCD 北大核心 2002年第S1期232-233,共2页
Under the condition of the market competition becom in g more and more drastic, the demands of market take on some new features such as individuation, diversification, small batch, unstableness and quick delivery et c... Under the condition of the market competition becom in g more and more drastic, the demands of market take on some new features such as individuation, diversification, small batch, unstableness and quick delivery et c. The Make-to-Stock mode is usually adopted by many enterprises to improve th e balance and stableness of production process. In such enterprises, order batch , production batch and sales batch are the important factors, which affect the s atisfaction of clients, efficiency and benefit of the enterprise. It takes purch ase, production and sales into account respectively when optimizing product batc h in traditional way. However, it ignored the influences of relations between ea ch links of whole system. It is assumed that the consumption and market demand a re continuous process whereas the factual demands are batched when economic batc h is determined. So there exist some deviations between the economic batch deter mined by traditional way and that by integral optimization. Through the integral analysis of Logistics in the production system, we know that from materials are purchased, then manufactured, finally sold, the material changed in appearance and value, it still exist in different links of production system. The amount of materials occupied varies just in different status, from stock status to produc tion status, then to waiting-be-sold status, there is not any substantial chan ge in quantity until they are sold. So we must comprehensively analyze the relat ions among each link based on integral production system, to optimize the materi al batch and cut short production cycle in order to optimize the whole system. In this paper, the production system is taken as a global entity, and in which m aterials variation law and their relations of each link are analyzed; To optimiz e the whole materials flow, a new model of multi-product systems’ economic orde r batch, economic production batch and optimal sale lot multi-product syste ms’ is developed which based on the limit of capitals and stock area. 展开更多
关键词 discrete production system economic order quanti ty economic production quantity distribution batch size
下载PDF
Adjoining Batch Markov Arrival Processes of a Markov Chain 被引量:1
3
作者 Xiao-yun MO Xu-yan XIANG Xiang-qun YANG 《Acta Mathematicae Applicatae Sinica》 SCIE CSCD 2018年第1期1-10,共10页
A batch Markov arrival process(BMAP) X^*=(N, J) is a 2-dimensional Markov process with two components, one is the counting process N and the other one is the phase process J. It is proved that the phase process i... A batch Markov arrival process(BMAP) X^*=(N, J) is a 2-dimensional Markov process with two components, one is the counting process N and the other one is the phase process J. It is proved that the phase process is a time-homogeneous Markov chain with a finite state-space, or for short, Markov chain. In this paper,a new and inverse problem is proposed firstly: given a Markov chain J, can we deploy a process N such that the 2-dimensional process X^*=(N, J) is a BMAP? The process X^*=(N, J) is said to be an adjoining BMAP for the Markov chain J. For a given Markov chain the adjoining processes exist and they are not unique. Two kinds of adjoining BMAPs have been constructed. One is the BMAPs with fixed constant batches, the other one is the BMAPs with independent and identically distributed(i.i.d) random batches. The method we used in this paper is not the usual matrix-analytic method of studying BMAP, it is a path-analytic method. We constructed directly sample paths of adjoining BMAPs. The expressions of characteristic(D_k, k = 0, 1, 2· · ·)and transition probabilities of the adjoining BMAP are obtained by the density matrix Q of the given Markov chain J. Moreover, we obtained two frontal Theorems. We present these expressions in the first time. 展开更多
关键词 Markov chain batch Markov arrival process (BMAP) adjoining BMAP fixed constant batch independent identically distributed (i.i.d) random batch
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部