全文获取类型
收费全文 | 739篇 |
免费 | 291篇 |
国内免费 | 55篇 |
出版年
2024年 | 4篇 |
2023年 | 6篇 |
2022年 | 6篇 |
2021年 | 23篇 |
2020年 | 16篇 |
2019年 | 21篇 |
2018年 | 10篇 |
2017年 | 41篇 |
2016年 | 46篇 |
2015年 | 28篇 |
2014年 | 61篇 |
2013年 | 66篇 |
2012年 | 52篇 |
2011年 | 74篇 |
2010年 | 45篇 |
2009年 | 64篇 |
2008年 | 52篇 |
2007年 | 70篇 |
2006年 | 49篇 |
2005年 | 51篇 |
2004年 | 46篇 |
2003年 | 31篇 |
2002年 | 33篇 |
2001年 | 27篇 |
2000年 | 22篇 |
1999年 | 30篇 |
1998年 | 24篇 |
1997年 | 15篇 |
1996年 | 5篇 |
1995年 | 6篇 |
1994年 | 10篇 |
1993年 | 12篇 |
1992年 | 7篇 |
1991年 | 8篇 |
1990年 | 20篇 |
1989年 | 3篇 |
1988年 | 1篇 |
排序方式: 共有1085条查询结果,搜索用时 15 毫秒
91.
设计了一种适用于某微小型固体火箭发动机的点火器 ,对某微小型固体火箭发动机的点火特性进行了大量试验研究 ,引入了初始点火压强的概念 ,找出了影响点火延迟时间散布的主要规律 ,确定了能满足微小型固体火箭发动机点火性能的点火方案 相似文献
92.
给出某地炮营通信系统信息传输的CSMA/CD(Carrier Sense Multiple Acces/Collision Detection)排队论模型,提出了信道争用和碰撞的问题,用单机和网络仿真分析了载波监听条件下通信失效的概率,给出信道争用和碰撞的几个性能指标,并利用软件的方法,提供了减少碰撞的方案 相似文献
93.
正弦波型直流无刷电动机位置伺服系统的变结构控制 总被引:1,自引:0,他引:1
在分析正弦波型直流无刷电动机数学模型的基础上,采用比例等速变速控制策略(PCV)设计控制器,应用于正弦波型直流无刷电动机位置伺服系统.仿真结果表明:与传统PI控制器比较,PCV控制策略可以明显改善系统的品质,并增强系统的鲁棒性. 相似文献
94.
95.
紧固件拆装作业时间是影响机械产品维修性的主要因素之一,占机械产品维修作业时间的70%~80%。因此,探讨紧固件拆装作业时间的预计方法,对研究、设计机械产品的维修性,将是十分必要的。通过分析紧固件拆装作业过程,探索出了影响拆装作业时间的诸因素,并对所有的影响因素进行分析、权衡和回归,建立紧固件拆装作业时间的预计模型。将此模型在某型履带式车辆上进行了实际验证,证明了模型的正确性及通用性。 相似文献
96.
This study investigates the statistical process control application for monitoring queue length data in M/G/1 systems. Specifically, we studied the average run length (ARL) characteristics of two different control charts for detecting changes in system utilization. First, the nL chart monitors the sums of successive queue length samples by subgrouping individual observations with sample size n. Next is the individual chart with a warning zone whose control scheme is specified by two pairs of parameters, (upper control limit, du) and (lower control limit, dl), as proposed by Bhat and Rao (Oper Res 20 (1972) 955–966). We will present approaches to calculate ARL for the two types of control charts using the Markov chain formulation and also investigate the effects of parameters of the control charts to provide useful design guidelines for better performance. Extensive numerical results are included for illustration. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011 相似文献
97.
The problem of minimum makespan on an m machine jobshop with unit execution time (UET) jobs (m ≥ 3) is known to be strongly NP‐hard even with no setup times. We focus in this article on the two‐machine case. We assume UET jobs and consider batching with batch availability and machine‐dependent setup times. We introduce an efficient \begin{align*}(O(\sqrt{n}))\end{align*} algorithm, where n is the number of jobs. We then introduce a heuristic for the multimachine case and demonstrate its efficiency for two interesting instances. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011 相似文献
98.
We study a stochastic inventory model of a firm that periodically orders a product from a make‐to‐order manufacturer. Orders can be shipped by a combination of two freight modes that differ in lead‐times and costs, although orders are not allowed to cross. Placing an order as well as each use of each freight mode has a fixed and a quantity proportional cost. The decision of how to allocate units between the two freight modes utilizes information about demand during the completion of manufacturing. We derive the optimal freight mode allocation policy, and show that the optimal policy for placing orders is not an (s,S) policy in general. We provide tight bounds for the optimal policy that can be calculated by solving single period problems. Our analysis enables insights into the structure of the optimal policy specifying the conditions under which it simplifies to an (s,S) policy. We characterize the best (s,S) policy for our model, and through extensive numerical investigation show that its performance is comparable with the optimal policy in most cases. Our numerical study also sheds light on the benefits of the dual freight model over the single freight models. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011 相似文献
99.
We study a pull‐type, flexible, multi‐product, and multi‐stage production/inventory system with decentralized two‐card kanban control policies. Each stage involves a processor and two buffers with finite target levels. Production stages, arranged in series, can process several product types one at a time. Transportation of semi‐finished parts from one stage to another is performed in fixed lot sizes. The exact analysis is mathematically intractable even for smaller systems. We present a robust approximation algorithm to model two‐card kanban systems with batch transfers under arbitrary complexity. The algorithm uses phase‐type modeling to find effective processing times and busy period analysis to identify delays among product types in resource contention. Our algorithm reduces the effort required for estimating performance measures by a considerable margin and resolves the state–space explosion problem of analytical approaches. Using this analytical tool, we present new findings for a better understanding of some tactical and operational issues. We show that flow of material in small procurement sizes smoothes flow of information within the system, but also necessitates more frequent shipments between stages, raising the risk of late delivery. Balancing the risk of information delays vis‐à‐vis shipment delays is critical for the success of two‐card kanban systems. Although product variety causes time wasted in setup operations, it also facilitates relatively short production cycles enabling processors to switch from one product type to another more rapidly. The latter point is crucial especially in high‐demand environments. Increasing production line size prevents quick response to customer demand, but it may improve system performance if the vendor lead‐time is long or subject to high variation. Finally, variability in transportation and processing times causes the most damage if it arises at stages closer to the customer. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007 相似文献
100.
In many practical multiserver queueing systems, servers not only serve randomly arriving customers but also work on the secondary jobs with infinite backlog during their idle time. In this paper, we propose a c‐server model with a two‐threshold policy, denoted by (e d), to evaluate the performance of this class of systems. With such a policy, when the number of idle servers has reached d (<c), then e (<d) idle agents will process secondary jobs. These e servers keep working on the secondary jobs until they find waiting customers exist in the system at a secondary job completion instant. Using the matrix analytic method, we obtain the stationary performance measures for evaluating different (e, d) policies. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007. 相似文献