共查询到20条相似文献,搜索用时 109 毫秒
1.
2.
当前的化工制造中,有很多工厂使用柔性制造设备,并采用批生产模式来组织生产.由于对设备进行准备和清理的成本比较大,加工的排序一般采用多批次加工同一种产品的活动(campaign)模式.在实际的生产中,由于需要保证产品质量和减少库存,应该考虑限制活动的最大长度.本文针对活动长度有限制的多工序批量加工问题进行研究,利用状态-任务-网络概念和层级模型方法,提出了修正的活动计划模型.该模型是基于混合整数线性规划模型,并且以供应网络内总生产成本和物流成本最小化作为目标函数.最后用一个算例来说明所构建模型的有效性. 相似文献
3.
单机排序问题1|rj,prmp|∑ωj(1-e^-acj)的动态在线调度 总被引:1,自引:0,他引:1
本首先一般化了可中断的概念,并建立了相应的中断一安装重复模型,然后研究了单机排序问题1|rj,prmp|∑ωj(1-e^-acj)在中断-重复和中断-安装重复模型下的动态在线排序问题,给出了只考虑当前可用信息而不是考虑全部任务信息的在线调度规则。 相似文献
4.
对所有平行级别上的同等类型的决策单元(DMUs)在绩效表现上的排序一直是管理决策领域研究的重要课题之一。基于数据包络分析的超效率理论和SBM模型,探讨考虑非期望因素的DMUs排序问题。首先构建新的考虑非期望因素的超效率SBM模型,此模型不仅能对有效DMUs排序,而且能够转化成线性规划问题求解,具有有界性、单调性等良好性质。然后将新模型与Tone的SBM模型结合提出了考虑非期望因素的SBM综合排序法,同时给出了相对应的多项式时间算法。该方法以SBM模型作为第一阶段完成非有效DMUs排序,以新模型作为第二阶段完成有效DMUs排序,两阶段综合即完成所有DMUs排序。研究结果表明,综合排序法能够完成对考虑非期望因素的DMUs的排序,为绩效评价的管理实践提供了重要的理论依据。选取中国2010年的30个省份为实证研究对象,应用所提出的综合效率排序法对其环境效率进行排序。分析结果与中国的现实情况的相吻合,表明该排序方法是合理的,能够完成对这些地区的环境效率进行排序,可以为决策者评价环境的绩效表现提供有效的决策支持。 相似文献
5.
《数学的实践与认识》2020,(4)
用模糊DEA/AR交叉效率方法,解决制造模式的评价与排序问题.首先,构建了四种不同的DEA/AR交叉效率模型—任意型、对抗型、友好型和博弈型.然后,应用熵权法确定每一种交叉效率模型的最终交叉效率值,目的是用保证域来避免传统模型的权重偏差,从而实现了决策单元的相对有效评价和精确排序.同时,引入奇异指数的概念来衡量最终交叉效率的合理性及可靠性.最后,通过实例验证本文模型和方法的可行性及有效性:与采用简单DEA效率模型进行评价比较,我们的方法会使得效率更加精准、排序更加合理. 相似文献
6.
7.
主要工作是通过Copealand重排序方法构建动态评价模型,研究动态评价中的一致性排序问题,并通过实证研究验证模型的有效性.首先,利用基尼系数赋权法建立评价模型,确定静态评价结果和排名;然后,通过Copealand法确定出一个综合不同年份排序的一致性排序;最后,根据评价对象不同年份排名的发展趋势对一致性排序进行修正,得到最终的排序.主要特色一是通过Copealand法集合不同年份的排序确定最终的一致性排序,避免了通过引入时间权向量确定动态权重时人为主观因素太强的问题,解决了动态综合评价中的一致性排序问题;二是通过对一致性排序的修正,保证了最终的排序能够体现不同年份的发展趋势. 相似文献
8.
Bernardo方法是一种多属性群决策方法。针对Bernardo方法,本文结合模糊不确定性理论,提出“模糊Bernardo”方法;利用模糊变量表示决策者对多方案排序的模糊目标值,给出其Bernardo方法的模糊混合0-1规划模型和模糊机会约束混合0-1规划模型。该方法为群决策提供了一种多方案排序问题的实用且有效的理论依据和计算方法。最后通过实例对此方法予以验证。 相似文献
9.
本文对数据包络分析中的有效单元排序方法进行了研究, 从一个新 的角度,定义最优有效和最劣无效, 提出了一种带有参数的有效单元排序模型.本文还给出并证明了此模型的一些性质, 并与其他排序模型进行了比较, 证明了本文模型的优越性. 最后用一个实例, 检验了此模型的可行性. 相似文献
10.
针对多粒度语言判断矩阵的群决策问题提出基于相对熵的最优化模型的排序方法.在多粒度语言偏好信息的导出函数基础上定义了语言判断矩阵对应的导出模糊互补判断矩阵,并给出其排序向量的计算式;同时采用语言判断矩阵的一致性指标来确定专家重要性程度的权向量;在相对熵的意义下构建了群决策排序向量的最优化模型,探讨了模型的求解方法.实例分析表明该模型是可行和有效的. 相似文献
11.
Pierangelo Miglioli 《Archive for Mathematical Logic》1992,31(6):415-432
Summary Infinitely many intermediate propositional logics with the disjunction property are defined, each logic being characterized both in terms of a finite axiomatization and in terms of a Kripke semantics with the finite model property. The completeness theorems are used to prove that any two logics are constructively incompatible. As a consequence, one deduces that there are infinitely many maximal intermediate propositional logics with the disjunction property. 相似文献
12.
13.
We introduce the concept of a connected logic (over S4) and show that each connected logic with the finite model property is the logic of a subalgebra of the closure algebra of all subsets of the real line R, thus generalizing the McKinsey-Tarski theorem. As a consequence, we obtain that each intermediate logic with the finite model property is the logic of a subalgebra of the Heyting algebra of all open subsets of R. 相似文献
14.
We consider the problem of optimal harvesting of a renewable resource whose dynamics are governed by logistic growth and whose payoff is proportional to the harvest. We consider both the case of a finite and an infinite time horizon and analyse the structure of the optimal solutions and their dependence on the parameters of the model. We show that the optimal policy can only have one of three structures: (1) maximal harvesting effort until the resource is depleted, (2) zero harvesting during an initial time interval followed by a subsequent switch to maximal harvesting effort, or (3) a singular solution, which corresponds to an intermediate level of harvesting, accompanied by the most rapid approach path. All three scenarios emerge, with minor variations, with finite and infinite time horizons, depending on the particular combination of parameters of the system. We characterize the conditions under which the singular solution is optimal and present suggestions for designing an optimal and sustainable harvesting strategy. Recommendations for Resource Managers :
- We have rigorously explored a standard optimal harvesting model and its steady states.
- We show that three different types of solutions may emerge: (i) maximal harvesting eventually leading to a complete depletion of the stock; (ii) maximal harvesting with a potential period of idleness leading to a positive stock; (iii) an initial phase of either no or full harvesting followed by a period of intermediate harvesting intensity leading to a positive stock (singular solution).
- With some modifications, similar results hold for a finite planning horizon.
- Which of these three scenarios emerges in the finite horizon case depends not only on the parameter values but also on the length of the planning horizon.
15.
R. Callies 《PAMM》2003,3(1):559-562
A multi‐model approach is presented which allows the efficient and stable coupling between high precision algorithms for DAE boundary value problems arising from constrained optimal control problems and model data obtained with rather low accuracy from finite element solutions of PDEs. A model hierarchy with increasing approximation accuracy serves as an intermediate layer. Numerical efficiency is demonstrated for an example from flight mechanics. 相似文献
16.
Roger A. Sauer 《PAMM》2009,9(1):157-158
A three-dimensional multiscale model is presented which describes the adhesion and deformation of a gecko seta. The setae are micrometer fine hairs, covering the surface of the gecko toes, which enable the gecko to adhere to inclined and overhanging surfaces. The seta modeling is approached on three different length scales: At the top level, on the order of several micrometers, a finite element rod model is chosen to capture the branched microstructure of the gecko seta. At the intermediate level, on the order of several nanometers, a second finite element model is used to capture the detailed behavior of the seta tips, the so-called spatulae. At the third level, on the order of Ångstroms, the adhesion forces between spatulae and substrate are modeled on the molecular level. The model allows for a detailed, yet efficient simulation of the mechanical seta behavior. A numerical relaxation technique is introduced to handle the jump-off-contact instability that can occur in pull-off computations. (© 2009 Wiley-VCH Verlag GmbH & Co. KGaA, Weinheim) 相似文献
17.
Fluid flow in naturally fractured porous media can always be regarded as an unbounded domain problem and be better solved by finite/infinite elements. In this paper, a three-dimensional two-direction mapped infinite element is generated and combined with conventional finite elements and one direction infinite element to simulate poroelasticity. Therefore, the entire semi-infinite domain can be included in the numerical analysis. Both single- and dual-porosity porous media are considered. For the purpose of validation, we compare the results of finite/infinite elements with those of finite elements under two extreme boundary conditions. The comparison indicated that mapped infinite element is an appropriate approach to model fluid flow in porous media and provides an intermediate solution. 相似文献
18.
Marcus Kracht 《Mathematical Logic Quarterly》1993,39(1):301-322
A logic Λ bounds a property P if all proper extensions of Λ have P while Λ itself does not. We construct logics bounding finite axiomatizability and logics bounding finite model property in the lattice of intermediate logics and in the lattice of normal extensions of K4.3. MSC: 03B45, 03B55. 相似文献
19.
20.
Zhimin Zhang. 《Mathematics of Computation》1998,67(222):541-552
Finite element derivative superconvergent points for the Poisson equation under local rectangular mesh (in the two dimensional case) and local brick mesh (in the three dimensional situation) are investigated. All superconvergent points for the finite element space of any order that is contained in the tensor-product space and contains the intermediate family can be predicted. In case of the serendipity family, the results are given for finite element spaces of order below 7. Any finite element space that contains the complete polynomial space will have at least all superconvergent points of the related serendipity family.