全文获取类型
收费全文 | 515篇 |
免费 | 145篇 |
国内免费 | 32篇 |
出版年
2024年 | 2篇 |
2023年 | 1篇 |
2022年 | 5篇 |
2021年 | 4篇 |
2020年 | 10篇 |
2019年 | 15篇 |
2018年 | 10篇 |
2017年 | 33篇 |
2016年 | 32篇 |
2015年 | 28篇 |
2014年 | 32篇 |
2013年 | 80篇 |
2012年 | 34篇 |
2011年 | 48篇 |
2010年 | 34篇 |
2009年 | 46篇 |
2008年 | 36篇 |
2007年 | 45篇 |
2006年 | 40篇 |
2005年 | 26篇 |
2004年 | 32篇 |
2003年 | 18篇 |
2002年 | 18篇 |
2001年 | 17篇 |
2000年 | 14篇 |
1999年 | 6篇 |
1998年 | 5篇 |
1997年 | 3篇 |
1996年 | 3篇 |
1995年 | 3篇 |
1994年 | 4篇 |
1993年 | 1篇 |
1992年 | 2篇 |
1991年 | 2篇 |
1990年 | 2篇 |
1975年 | 1篇 |
排序方式: 共有692条查询结果,搜索用时 15 毫秒
61.
Pirja Heiskanen 《海军后勤学研究》2001,48(3):210-225
In this paper a constraint proposal method is developed for computing Pareto‐optimal solutions in multiparty negotiations over continuous issues. Constraint proposal methods have been previously studied in a case where the decision set is unconstrained. Here we extend the method to situations with a constrained decision set. In the method the computation of the Pareto‐optimal solutions is decentralized so that the DMs do not have to know each others' value functions. During the procedure they have to indicate their optimal solutions on different sets of linear constraints. When the optimal solutions coincide, the common optimum is a candidate for a Pareto‐optimal point. The constraint proposal method can be used to generate either one Pareto‐optimal solution dominating the status quo solution or several Pareto‐optimal solutions. In latter case a distributive negotiation among the efficient points can be carried out afterwards. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 210–225, 2001 相似文献
62.
We introduce a formulation and an exact solution method for a nonpreemptive resource constrained project scheduling problem in which the duration/cost of an activity is determined by the mode selection and the duration reduction (crashing) within the mode. This problem is a natural combination of the time/cost tradeoff problem and the resource constrained project scheduling problem. It involves the determination, for each activity, of its resource requirements, the extent of crashing, and its start time so that the total project cost is minimized. We present a branch and bound procedure and report computational results with a set of 160 problems. Computational results demonstrate the effectiveness of our procedure. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 107–127, 2001 相似文献
63.
Allocation of scarce common components to finished product orders is central to the performance of assembly systems. Analysis of these systems is complex, however, when the product master schedule is subject to uncertainty. In this paper, we analyze the cost—service performance of a component inventory system with correlated finished product demands, where component allocation is based on a fair shares method. Such issuing policies are used commonly in practice. We quantify the impact of component stocking policies on finished product delays due to component shortages and on product order completion rates. These results are used to determine optimal base stock levels for components, subject to constraints on finished product service (order completion rates). Our methodology can help managers of assembly systems to (1) understand the impact of their inventory management decisions on customer service, (2) achieve cost reductions by optimizing their inventory investments, and (3) evaluate supplier performance and negotiate contracts by quantifying the effect of delivery lead times on costs and customer service. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48:409–429, 2001 相似文献
64.
Fangruo Chen 《海军后勤学研究》2000,47(5):422-439
Consider a distribution system with a central warehouse and multiple retailers. Customer demand arrives at each of the retailers continuously at a constant rate. The retailers replenish their inventories from the warehouse which in turn orders from an outside supplier with unlimited stock. There are economies of scale in replenishing the inventories at both the warehouse and the retail level. Stockouts at the retailers are backlogged. The system incurs holding and backorder costs. The objective is to minimize the long‐run average total cost in the system. This paper studies the cost effectiveness of (R, Q) policies in the above system. Under an (R, Q) policy, each facility orders a fixed quantity Q from its supplier every time its inventory position reaches a reorder point R. It is shown that (R, Q) policies are at least 76% effective. Numerical examples are provided to further illustrate the cost effectiveness of (R, Q) policies. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 422–439, 2000 相似文献
65.
The opportunistic maintenance of a k‐out‐of‐n:G system with imperfect preventive maintenance (PM) is studied in this paper, where partial failure is allowed. In many applications, the optimal maintenance actions for one component often depend on the states of the other components and system reliability requirements. Two new (τ, T) opportunistic maintenance models with the consideration of reliability requirements are proposed. In these two models, only minimal repairs are performed on failed components before time τ and the corrective maintenance (CM) of all failed components are combined with PM of all functioning but deteriorated components after τ; if the system survives to time T without perfect maintenance, it will be subject to PM at time T. Considering maintenance time, asymptotic system cost rate and availability are derived. The results obtained generalize and unify some previous research in this area. Application to aircraft engine maintenance is presented. © 2000 John Wiley & Sons;, Inc. Naval Research Logistics 47: 223–239, 2000 相似文献
66.
In this paper, two different kinds of (N, T)‐policies for an M/M/m queueing system are studied. The system operates only intermittently and is shut down when no customers are present any more. A fixed setup cost of K > 0 is incurred each time the system is reopened. Also, a holding cost of h > 0 per unit time is incurred for each customer present. The two (N, T)‐policies studied for this queueing system with cost structures are as follows: (1) The system is reactivated as soon as N customers are present or the waiting time of the leading customer reaches a predefined time T, and (2) the system is reactivated as soon as N customers are present or the time units after the end of the last busy period reaches a predefined time T. The equations satisfied by the optimal policy (N*, T*) for minimizing the long‐run average cost per unit time in both cases are obtained. Particularly, we obtain the explicit optimal joint policy (N*, T*) and optimal objective value for the case of a single server, the explicit optimal policy N* and optimal objective value for the case of multiple servers when only predefined customers number N is measured, and the explicit optimal policy T* and optimal objective value for the case of multiple servers when only predefined time units T is measured, respectively. These results partly extend (1) the classic N or T policy to a more practical (N, T)‐policy and (2) the conclusions obtained for single server system to a system consisting of m (m ≥ 1) servers. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 240–258, 2000 相似文献
67.
In this short note we study a two‐machine flowshop scheduling problem with the additional no‐idle feasibility constraint and the total completion time criterion function. We show that one of the few papers which deal with this special problem contains incorrect claims and suggest a way how these claims can be rectified. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47:353–358, 2000 相似文献
68.
论述了“病态信息”概念的形成过程及初步定义 ,讨论了病态信息的危害 ,阐述了病态信息研究的目的意义 ,阐明了国内外相关研究的基本情况、主要观点及其对病态信息的控制产生的影响 ,提出了病态信息控制的理论与方法的框架体系结构 ,最后综述病态信息研究的主要进展情况、主要应用情况及发展前景。 相似文献
69.
C4ISR联合仿真演练系统体系框架研究 总被引:1,自引:0,他引:1
构造联合战役条件下C4ISR综合性能仿真系统是目前C4ISR领域中最重要的应用之一.以网络中心战为背景,以C4ISR体系对抗为中心,构建了联合战役条件下的C4ISR联合仿真演练系统概念框架.基于导调评估层、实装层、代理层及仿真成员层四层架构了系统体系框架,并对各层的含义、主要作用及相互关系进行了剖析.同时借鉴开发与运行过程(FEDEP)概念,从制定仿真想定、联邦开发、生成脚本、集成及测试联邦、联邦运行、系统评估六个步骤论述了系统开发和运行的一般过程.最后结合实际开发及应用对该框架的实用性及后续工作进行了分析. 相似文献
70.
基于粗集的神经网络在目标类型识别中的研究 总被引:1,自引:0,他引:1
为克服传统的目标类型识别方法的不足,提出将粗集和神经网络紧耦合建立新的识别模型,即经过识别信息预处理、样本数据粗集方法简化、神经网络学习训练及待识信息网络识别等步骤,充分融合了粗集强大的规则提取能力和神经网络优良的分类能力。实验表明,该模型减少了识别的主观因素,简化了神经网络结构,提高了运算速度。 相似文献