全文获取类型
收费全文 | 549篇 |
免费 | 85篇 |
国内免费 | 50篇 |
出版年
2024年 | 1篇 |
2023年 | 4篇 |
2022年 | 6篇 |
2021年 | 5篇 |
2020年 | 11篇 |
2019年 | 7篇 |
2018年 | 8篇 |
2017年 | 26篇 |
2016年 | 42篇 |
2015年 | 20篇 |
2014年 | 38篇 |
2013年 | 32篇 |
2012年 | 44篇 |
2011年 | 42篇 |
2010年 | 32篇 |
2009年 | 55篇 |
2008年 | 30篇 |
2007年 | 34篇 |
2006年 | 42篇 |
2005年 | 43篇 |
2004年 | 37篇 |
2003年 | 15篇 |
2002年 | 9篇 |
2001年 | 14篇 |
2000年 | 14篇 |
1999年 | 12篇 |
1998年 | 8篇 |
1997年 | 7篇 |
1996年 | 5篇 |
1995年 | 10篇 |
1994年 | 5篇 |
1993年 | 5篇 |
1992年 | 7篇 |
1991年 | 6篇 |
1990年 | 8篇 |
排序方式: 共有684条查询结果,搜索用时 15 毫秒
1.
In this paper, a condition-based maintenance model for a multi-unit production system is proposed and analyzed using Markov renewal theory. The units of the system are subject to gradual deterioration, and the gradual deterioration process of each unit is described by a three-state continuous time homogeneous Markov chain with two working states and a failure state. The production rate of the system is influenced by the deterioration process and the demand is constant. The states of the units are observable through regular inspections and the decision to perform maintenance depends on the number of units in each state. The objective is to obtain the steady-state characteristics and the formula for the long-run average cost for the controlled system. The optimal policy is obtained using a dynamic programming algorithm. The result is validated using a semi-Markov decision process formulation and the policy iteration algorithm. Moreover, an analytical expression is obtained for the calculation of the mean time to initiate maintenance using the first passage time theory. 相似文献
2.
分析了建筑消防设施现状及完好率低的原因,提出改变消防管理模式,建立塔式管理的建议,并从严把消防产品质量关、加强施工队伍管理、发挥消防中介机构作用、强化消防设施维护保养、提高技防水平等方面给出了提高建筑消防设施完好率的措施。 相似文献
3.
传统的最大覆盖选址模型没有考虑对服务半径外的需求点的满足和服务时间的响应,而在舰船维修器材保障中,不论需求点到保障点的距离是否大于服务半径,都应对其进行保障服务,且在保障过程中要满足保障时间控制在不影响舰船正常维修任务时间内。针对此问题,运用广义最大覆盖选址模型和时间满意度函数,构建基于时间满意的广义最大覆盖选址模型,并运用一种混合算法———基于遗传模拟退火算法的BP算法对模型进行求解。最后,运用该算法对实例进行了分析计算,计算结果验证了该算法的有效性。 相似文献
4.
5.
As a complex system with multiple components usually deteriorates with age, preventive maintenance (PM) is often performed to keep the system functioning in a good state to prolong its effective age. In this study, a nonhomogeneous Poisson process with a power law failure intensity is used to describe the deterioration of a repairable system, and the optimal nonperiodic PM schedule can be determined to minimize the expected total cost per unit time. However, since the determination of such optimal PM policies may involve numerous uncertainties, which typically make the analyses difficult to perform because of the scarcity of data, a Bayesian decision model, which utilizes all available information effectively, is also proposed for determining the optimal PM strategies. A numerical example with a real failure data set is used to illustrate the effectiveness of the proposed approach. The results show that the optimal schedules derived by Bayesian approach are relatively more conservative than that for non‐Bayesian approach because of the uncertainty of the intensity function, and if the intensity function are updated using the collected data set, which indicates more severe deterioration than the prior belief, replacing the entire system instead of frequent PM activities before serious deterioration is suggested. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010 相似文献
6.
前景理论(Prospect Theory,PT)描述了个体在不确定条件下的决策规律,较好地刻画了决策者的风险偏好。分析表明,PT在作战决策建模中具有一定的适用性和可行性。提出了一种基于PT的计算机生成兵力(Computer Generated Forces,CGF)Agent决策建模方法,给出了CGF Agent的建模框架,对CGF Agent决策过程中方案选择的具体步骤和算法进行了详细阐述。实验表明,所提出的方法在一定程度上提高了CGF Agent决策行为的真实性,证明了所提出方法的有效性。 相似文献
7.
分析了面向任务保障性工程理论指导下的舰船随舰备件配置问题,就最大、最小两种维修策略下随舰备件配置问题进行了研究,给出了面向任务的随舰备件需求分析仿真模型框架,结合算倒,研究了最大维修策略与最小维修策略的适用时机:在任务确定且任务结构函数明确条件下,应采用最小维修策略;否则采用最大维修策略. 相似文献
8.
9.
We seek dynamic server assignment policies in finite‐capacity queueing systems with flexible and collaborative servers, which involve an assembly and/or a disassembly operation. The objective is to maximize the steady‐state throughput. We completely characterize the optimal policy for a Markovian system with two servers, two feeder stations, and instantaneous assembly and disassembly operations. This optimal policy allocates one server per station unless one of the stations is blocked, in which case both servers work at the unblocked station. For Markovian systems with three stations and instantaneous assembly and/or disassembly operations, we consider similar policies that move a server away from his/her “primary” station only when that station is blocked or starving. We determine the optimal assignment of each server whose primary station is blocked or starving in systems with three stations and zero buffers, by formulating the problem as a Markov decision process. Using this optimal assignment, we develop heuristic policies for systems with three or more stations and positive buffers, and show by means of a numerical study that these policies provide near‐optimal throughput. Furthermore, our numerical study shows that these policies developed for assembly‐type systems also work well in tandem systems. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008 相似文献
10.
MADM中不同属性的规范化研究 总被引:3,自引:0,他引:3
不同属性值的规范化是多属性决策问题中的重要过程.提出了一种属性值作为点到优区间和劣区间的距离的定义,依据该定义得到了属性值规范化新方法,并通过实例证明了新规范化方法的有效性. 相似文献