全文获取类型
收费全文 | 295篇 |
免费 | 219篇 |
国内免费 | 17篇 |
出版年
2023年 | 4篇 |
2022年 | 2篇 |
2021年 | 6篇 |
2020年 | 9篇 |
2019年 | 3篇 |
2018年 | 6篇 |
2017年 | 17篇 |
2016年 | 18篇 |
2015年 | 20篇 |
2014年 | 21篇 |
2013年 | 32篇 |
2012年 | 26篇 |
2011年 | 24篇 |
2010年 | 12篇 |
2009年 | 17篇 |
2008年 | 14篇 |
2007年 | 13篇 |
2006年 | 22篇 |
2005年 | 31篇 |
2004年 | 17篇 |
2003年 | 7篇 |
2002年 | 13篇 |
2001年 | 11篇 |
2000年 | 17篇 |
1999年 | 10篇 |
1998年 | 14篇 |
1997年 | 1篇 |
1995年 | 62篇 |
1994年 | 80篇 |
1991年 | 1篇 |
1990年 | 1篇 |
排序方式: 共有531条查询结果,搜索用时 1 毫秒
81.
故障检查间隔期的简化计算方法 总被引:3,自引:0,他引:3
建立了定期故障检查策略下系统的可用度模型,在满足系统可用度要求的条件下,可以使用该模型确定故障检查工作的间隔期。为了简化故障检查间隔期的计算,给出了故障时间服从指数分布时,故障检查间隔期的上、下限计算公式及应用示例。 相似文献
82.
总结分析了现阶段流行的实时磁盘调度算法,针对磁盘的存储特性,在对任务请求的磁盘访问时间精确预估的基础上,提出了一种新的调度算法-DSJIT(diskjustintime).该算法通过对请求文件在磁盘上分布的预分析得出处理请求所需时间的一个精确预估值,然后根据此预估值再对任务队列进行调度调整,它在保证应用程序对磁盘工作实时要求的同时,尽可能地提高磁盘的吞吐量.最后通过模拟试验,验证了算法的有效性. 相似文献
83.
84.
This article considers batch scheduling with centralized and decentralized decisions. The context of our study is concurrent open shop scheduling where the jobs are to be processed on a set of independent dedicated machines, which process designated operations of the jobs in batches. The batching policy across the machines can be centralized or decentralized. We study such scheduling problems with the objectives of minimizing the maximum lateness, weighted number of tardy jobs, and total weighted completion time, when the job sequence is determined in advance. We present polynomial time dynamic programming algorithms for some cases of these problems and pseudo‐polynomial time algorithms for some problems that are NP‐hard in the ordinary sense. © 2010 Wiley Periodicals, Inc. Naval Research Logistics 58: 17–27, 2011 相似文献
85.
We study a stochastic outpatient appointment scheduling problem (SOASP) in which we need to design a schedule and an adaptive rescheduling (i.e., resequencing or declining) policy for a set of patients. Each patient has a known type and associated probability distributions of random service duration and random arrival time. Finding a provably optimal solution to this problem requires solving a multistage stochastic mixed‐integer program (MSMIP) with a schedule optimization problem solved at each stage, determining the optimal rescheduling policy over the various random service durations and arrival times. In recognition that this MSMIP is intractable, we first consider a two‐stage model (TSM) that relaxes the nonanticipativity constraints of MSMIP and so yields a lower bound. Second, we derive a set of valid inequalities to strengthen and improve the solvability of the TSM formulation. Third, we obtain an upper bound for the MSMIP by solving the TSM under the feasible (and easily implementable) appointment order (AO) policy, which requires that patients are served in the order of their scheduled appointments, independent of their actual arrival times. Fourth, we propose a Monte Carlo approach to evaluate the relative gap between the MSMIP upper and lower bounds. Finally, in a series of numerical experiments, we show that these two bounds are very close in a wide range of SOASP instances, demonstrating the near‐optimality of the AO policy. We also identify parameter settings that result in a large gap in between these two bounds. Accordingly, we propose an alternative policy based on neighbor‐swapping. We demonstrate that this alternative policy leads to a much tighter upper bound and significantly shrinks the gap. 相似文献
86.
This paper studies a new steady‐state simulation output analysis method called replicated batch means in which a small number of replications are conducted and the observations in these replications are grouped into batches. This paper also introduces and compares methods for selecting the initial state of each replication. More specifically, we show that confidence intervals constructed by the replicated batch means method are valid for large batch sizes and derive expressions for the expected values and variances of the steady‐state mean and variance estimators for stationary processes and large sample sizes. We then use these expressions, analytical examples, and numerical experiments to compare the replicated batch means method with the standard batch means and multiple replications methods. The numerical results, which are obtained from an AR(1) process and a small, nearly‐decomposable Markov chain, show that the multiple replications method often gives confidence intervals with poorer coverage than the standard and replicated batch means methods and that the replicated batch means method, implemented with good choices of initialization method and number of replications, provides confidence interval coverages that range from being comparable with to being noticeably better than coverages obtained by the standard batch means method. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006 相似文献
87.
李文伟 《兵团教育学院学报》2006,16(1):27-29
农膜的应用对农业发展做出了不可估量的贡献,但是,长期过量使用化肥、农药和塑料农膜将导致土壤板结,地力下降,水体污染和负营养化,破坏自然生态系统的结构和功能。如何合理使用塑料农膜,确保农业生产可持续发展,是摆在每一位环境保护工作者面前的重要课题。 相似文献
88.
Marco Slikker 《海军后勤学研究》2006,53(4):235-242
We study sequencing situations with a fixed initial order and linear cost functions. Cost savings can be obtained by rearranging jobs. Next to finding an optimal order, an additional issue is formed by the division of these savings. Cooperative game theory studies this issue. A common assumption states that cooperation between players is restricted to groups that are connected according to the initial order. The value of disconnected groups is defined additively over their connected components. In this paper we allow players in disconnected coalitions to switch places as long as they do not hurt the players not in the coalition under consideration. The resulting games are called relaxed sequencing games. Although they have been studied before, no general results on stable profit divisions have been derived so far. In this paper we prove that relaxed sequencing games have a nonempty core, i.e., they all have stable profit divisions. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006 相似文献
89.
We consider the problem of scheduling orders on identical machines in parallel. Each order consists of one or more individual jobs. A job that belongs to an order can be processed by any one of the machines. Multiple machines can process the jobs of an order concurrently. No setup is required if a machine switches over from one job to another. Each order is released at time zero and has a positive weight. Preemptions are not allowed. The completion time of an order is the time at which all jobs of that order have been completed. The objective is to minimize the total weighted completion time of the orders. The problem is NP‐hard for any fixed number (≥2) of machines. Because of this, we focus our attention on two classes of heuristics, which we refer to as sequential two‐phase heuristics and dynamic two‐phase heuristics. We perform a worst case analysis as well as an empirical analysis of nine heuristics. Our analyses enable us to rank these heuristics according to their effectiveness, taking solution quality as well as running time into account. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006 相似文献
90.
Consider a project during the life cycle of which there are cash payouts and in‐flows. To better meet his financial commitments, the project owner would like to meet all deadlines without running out of cash. We show that the cash availability objective is similar to the total weighted flowtime used to measure work‐in‐progress performance in the scheduling and inventory control literatures. In this article we provide several specialized solution methods for the problem of minimizing total weighted flowtime in an arbitrary acyclic project network, subject to activity release times and due dates, where the activity weights may be positive or negative and represent cash in‐ and out‐flows. We describe the structure of an optimal solution and provide several efficient algorithms and their complexity based on mincost and maxflow formulations. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006 相似文献