全文获取类型
收费全文 | 752篇 |
免费 | 239篇 |
国内免费 | 35篇 |
出版年
2024年 | 3篇 |
2023年 | 6篇 |
2022年 | 3篇 |
2021年 | 13篇 |
2020年 | 15篇 |
2019年 | 23篇 |
2018年 | 13篇 |
2017年 | 35篇 |
2016年 | 44篇 |
2015年 | 30篇 |
2014年 | 49篇 |
2013年 | 97篇 |
2012年 | 47篇 |
2011年 | 73篇 |
2010年 | 47篇 |
2009年 | 57篇 |
2008年 | 41篇 |
2007年 | 69篇 |
2006年 | 52篇 |
2005年 | 44篇 |
2004年 | 49篇 |
2003年 | 25篇 |
2002年 | 31篇 |
2001年 | 32篇 |
2000年 | 32篇 |
1999年 | 24篇 |
1998年 | 19篇 |
1997年 | 10篇 |
1996年 | 3篇 |
1995年 | 5篇 |
1994年 | 8篇 |
1993年 | 9篇 |
1992年 | 7篇 |
1991年 | 4篇 |
1990年 | 4篇 |
1989年 | 2篇 |
1988年 | 1篇 |
排序方式: 共有1026条查询结果,搜索用时 15 毫秒
151.
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 相似文献
152.
This paper examines scheduling problems in which the setup phase of each operation needs to be attended by a single server, common for all jobs and different from the processing machines. The objective in each situation is to minimize the makespan. For the processing system consisting of two parallel dedicated machines we prove that the problem of finding an optimal schedule is N P‐hard in the strong sense even if all setup times are equal or if all processing times are equal. For the case of m parallel dedicated machines, a simple greedy algorithm is shown to create a schedule with the makespan that is at most twice the optimum value. For the two machine case, an improved heuristic guarantees a tight worst‐case ratio of 3/2. We also describe several polynomially solvable cases of the later problem. The two‐machine flow shop and the open shop problems with a single server are also shown to be N P‐hard in the strong sense. However, we reduce the two‐machine flow shop no‐wait problem with a single server to the Gilmore—Gomory traveling salesman problem and solve it in polynomial time. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 304–328, 2000 相似文献
153.
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 相似文献
154.
离散变结构系统的组合控制策略研究 总被引:4,自引:2,他引:2
对离散变结构控制系统的趋近律方法进行研究,提出了4种组合控制策略,它们可以明显改善系统的动态性能,并给出应用例子加以验证. 相似文献
155.
建筑消防设计中疏散时间的确定方法 总被引:1,自引:0,他引:1
郭艳丽 《中国人民武装警察部队学院学报》2000,16(5):9-11
本文针对建筑消防设计中疏散时间计算这一关键问题 ,利用疏散行为指数确定生活不能自理的人的疏散能力 ,进而确定其疏散时间 ,为建筑消防安全设计和防火管理工作提供理论依据。文中介绍的方法、计算公式及步骤简捷 ,具有一定的实用价值。 相似文献
156.
In this paper we consider the discrete time/resource trade-off problem in project networks. Given a project network consisting of nodes (activities) and arcs (technological precedence relations), in which the duration of the activities is a discrete, nonincreasing function of the amount of a single renewable resource committed to it, the discrete time/resource trade-off problem minimizes the project makespan subject to precedence constraints and a single renewable resource constraint. For each activity, a work content is specified such that all execution modes (duration/resource requirement pairs) for performing the activity are allowed as long as the product of the duration and the resource requirement is at least as large as the specified work content. We present a tabu search procedure which is based on a decomposition of the problem into a mode assignment phase and a resource-constrained project scheduling phase with fixed mode assignments. Extensive computational experience, including a comparison with other local search methods, is reported. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 553–578, 1998 相似文献
157.
We consider a single-machine scheduling model in which the job processing times are controllable variables with linear costs. The objective is to minimize the sum of the cost incurred in compressing job processing times and the cost associated with the number of late jobs. The problem is shown to be NP-hard even when the due dates of all jobs are identical. We present a dynamic programming solution algorithm and a fully polynomial approximation scheme for the problem. Several efficient heuristics are proposed for solving the problem. Computational experiments demonstrate that the heuristics are capable of producing near-optimal solutions quickly. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 67–82, 1998 相似文献
158.
牛云 《国防科技大学学报》1990,12(2):55-57
本文利用椭圆弹道长轴方向有一常量的性质,计算了被动段弹道的射程和飞行时间。 相似文献
159.
单站无源定位跟踪技术中,可观测性分析是一个关键问题,但是由于TOA测量方程的非线性程度太高,直接通过计算Jacobin矩阵得到的可观测矩阵形式非常复杂,很难得出明确的分析结果。采用新的思路推导了一种TOA测量方程的线性化方程,分析了测量TOA和DOA单站无源定位的可观测条件。最后给出了计算机仿真结果。 相似文献
160.