全文获取类型
收费全文 | 541篇 |
免费 | 192篇 |
国内免费 | 41篇 |
专业分类
774篇 |
出版年
2024年 | 2篇 |
2023年 | 6篇 |
2022年 | 7篇 |
2021年 | 9篇 |
2020年 | 11篇 |
2019年 | 14篇 |
2018年 | 7篇 |
2017年 | 23篇 |
2016年 | 30篇 |
2015年 | 24篇 |
2014年 | 37篇 |
2013年 | 40篇 |
2012年 | 42篇 |
2011年 | 62篇 |
2010年 | 43篇 |
2009年 | 49篇 |
2008年 | 29篇 |
2007年 | 48篇 |
2006年 | 34篇 |
2005年 | 37篇 |
2004年 | 40篇 |
2003年 | 18篇 |
2002年 | 23篇 |
2001年 | 24篇 |
2000年 | 20篇 |
1999年 | 22篇 |
1998年 | 14篇 |
1997年 | 11篇 |
1996年 | 4篇 |
1995年 | 5篇 |
1994年 | 8篇 |
1993年 | 10篇 |
1992年 | 6篇 |
1991年 | 6篇 |
1990年 | 4篇 |
1989年 | 2篇 |
1988年 | 3篇 |
排序方式: 共有774条查询结果,搜索用时 15 毫秒
541.
We consider a parallel‐machine scheduling problem with jobs that require setups. The duration of a setup does not depend only on the job just completed but on a number of preceding jobs. These setup times are referred to as history‐dependent. Such a scheduling problem is often encountered in the food processing industry as well as in other process industries. In our model, we consider two types of setup times—a regular setup time and a major setup time that becomes necessary after several “hard‐to‐clean” jobs have been processed on the same machine. We consider multiple objectives, including facility utilization, flexibility, number of major setups, and tardiness. We solve several special cases assuming predetermined job sequences and propose strongly polynomial time algorithms to determine the optimal timing of the major setups for given job sequences. We also extend our analysis to develop pseudopolynomial time algorithms for cases with additional objectives, including the total weighted completion time, the total weighted tardiness, and the weighted number of tardy jobs. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012 相似文献
542.
543.
544.
545.
UKF在MEMS陀螺随机噪声补偿的应用 总被引:1,自引:0,他引:1
论述了MEMS陀螺静态随机噪声与动态随机噪声的特点;系统分析了无迹卡尔曼滤波(UKF)的特点,将UKF用于MEMS陀螺随机噪声估计;针对MEMS陀螺静态噪声与动态噪声补偿用同一方法处理达不到一定性能的难题,提出了一种由阈值决策静态和动态滤波的工程方法;指出将时间序列用于建立随机噪声的数学模型的缺陷,指出欧美等使用的MEMS陀螺随机噪声补偿的优点与缺点. 相似文献
546.
547.
为提高常规导弹连续波次作战效能,对常规导弹连续波次作战运输规划问题进行研究。以Floyd算法为基础,首先生成了作战机动区域的交通网络最短路径、距离矩阵;其次将常规导弹连续波次作战运输过程分解为不同阶段,以运输过程中的整体暴露时间最短为目标,构建了初始规划方案0-1整数规划模型;然后考虑道路通行量及地域容量限制,对初始规划方案中存在的地域容量超过限制及单行道路中会车、超车情况进行逐步循环优化,以得到最佳运输规划方案;最后选择了一个作战案例想定,通过Matlab编程对案例进行了求解,得到了针对此案例的最佳运输规划方案,验证了模型的正确性和算法的有效性。 相似文献
548.
We consider a dynamic pricing model in which the instantaneous rate of the demand arrival process is dependent on not only the current price charged by the concerned firm, but also the present state of the world. While reflecting the current economic condition, the state evolves in a Markovian fashion. This model represents the real‐life situation in which the sales season is relatively long compared to the fast pace at which the outside environment changes. We establish the value of being better informed on the state of the world. When reasonable monotonicity conditions are met, we show that better present economic conditions will lead to higher prices. Our computational study is partially calibrated with real data. It demonstrates that the benefit of heeding varying economic conditions is on par with the value of embracing randomness in the demand process. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 66:73–89,2019 相似文献
549.
We study an (R, s, S) inventory control policy with stochastic demand, lost sales, zero lead‐time and a target service level to be satisfied. The system is modeled as a discrete time Markov chain for which we present a novel approach to derive exact closed‐form solutions for the limiting distribution of the on‐hand inventory level at the end of a review period, given the reorder level (s) and order‐up‐to level (S). We then establish a relationship between the limiting distributions for adjacent values of the reorder point that is used in an efficient recursive algorithm to determine the optimal parameter values of the (R, s, S) replenishment policy. The algorithm is easy to implement and entails less effort than solving the steady‐state equations for the corresponding Markov model. Point‐of‐use hospital inventory systems share the essential characteristics of the inventory system we model, and a case study using real data from such a system shows that with our approach, optimal policies with significant savings in inventory management effort are easily obtained for a large family of items. 相似文献
550.
A new connection between the distribution of component failure times of a coherent system and (adaptive) progressively Type‐II censored order statistics is established. Utilizing this property, we develop inferential procedures when the data is given by all component failures until system failure in two scenarios: In the case of complete information, we assume that the failed component is also observed whereas in the case of incomplete information, we have only information about the failure times but not about the components which have failed. In the first setting, we show that inferential methods for adaptive progressively Type‐II censored data can directly be applied to the problem. For incomplete information, we face the problem that the corresponding censoring plan is not observed and that the available inferential procedures depend on the knowledge of the used censoring plan. To get estimates for distributional parameters, we propose maximum likelihood estimators which can be obtained by solving the likelihood equations directly or via an Expectation‐Maximization‐algorithm type procedure. For an exponential distribution, we discuss also a linear estimator to estimate the mean. Moreover, we establish exact distributions for some estimators in the exponential case which can be used, for example, to construct exact confidence intervals. The results are illustrated by a five component bridge system. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 512–530, 2015 相似文献