全文获取类型
收费全文 | 791篇 |
免费 | 185篇 |
国内免费 | 14篇 |
出版年
2022年 | 6篇 |
2021年 | 7篇 |
2020年 | 13篇 |
2019年 | 29篇 |
2018年 | 28篇 |
2017年 | 53篇 |
2016年 | 50篇 |
2015年 | 32篇 |
2014年 | 47篇 |
2013年 | 157篇 |
2012年 | 64篇 |
2011年 | 63篇 |
2010年 | 36篇 |
2009年 | 32篇 |
2008年 | 38篇 |
2007年 | 55篇 |
2006年 | 50篇 |
2005年 | 44篇 |
2004年 | 42篇 |
2003年 | 30篇 |
2002年 | 19篇 |
2001年 | 28篇 |
2000年 | 23篇 |
1999年 | 14篇 |
1998年 | 3篇 |
1997年 | 4篇 |
1996年 | 2篇 |
1995年 | 4篇 |
1993年 | 3篇 |
1992年 | 3篇 |
1991年 | 4篇 |
1990年 | 5篇 |
1989年 | 2篇 |
排序方式: 共有990条查询结果,搜索用时 31 毫秒
171.
172.
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. 相似文献
173.
While there has been significant previous literature on inventory transshipment, most research has focused on the dealers' demand filling decision (when to fill transshipment requests from other dealers), ignoring the requesting decision (when to send transshipment requests to other dealers). In this paper we develop optimal inventory transshipment policies that incorporate both types of decisions. We consider a decentralized system in which the dealers are independent of the manufacturer and of each other. We first study a network consisting of a very large number of dealers. We prove that the optimal inventory and transshipment decisions for an individual dealer are controlled by threshold rationing and requesting levels. Then, in order to study the impact of transshipment among independent dealers in a smaller dealer network, we consider a decentralized two‐dealer network and use a game theoretic approach to characterize the equilibrium inventory strategies of the individual dealers. An extensive numerical study highlights the impact of the requesting decision on the dealers' equilibrium behavior in a decentralized setting. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006 相似文献
174.
We study optimal age‐replacement policies for machines in series with non‐instantaneous repair times by formulating two nonlinear programs: one that minimizes total cost‐rate subject to a steady‐state throughput requirement and another that maximizes steady‐state throughput subject to a cost‐rate budget constraint. Under reasonable assumptions, the single‐machine cost‐optimal and throughput‐optimal solutions are unique and orderable, and the multi‐machine optimal solutions have appealing structure. Furthermore, we establish equivalence between the two formulations and provide an illustrative numerical example. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006 相似文献
175.
反舰导弹是当今舰艇及编队面临的主要威胁。为评估反舰导弹攻防能力,以目前世界上防御能力最强的美国航母战斗群为背景,研究采用分层火力配置的航母舰队防御体系对付反舰导弹的有效性。首先分析反舰导弹飞行高度、雷达散射截面及综合效应对防御系统中雷达探测能力的影响,之后应用简化公式,对各类典型舰载对空防御武器的最大拦截距离、拦截次数和拦截效率进行量化分析,对防御反舰导弹能力做出评估。 相似文献
176.
Ji Hwan Cha 《海军后勤学研究》2006,53(3):226-234
Burn‐in procedure is a manufacturing technique that is intended to eliminate early failures of system or product. Burning‐in a component or system means to subject it to a period of use prior to being used in field. Generally, burn‐in is considered expensive and so the length of burn‐in is typically limited. Thus, burn‐in is most often accomplished in an accelerated environment in order to shorten the burn‐in process. A new failure rate model for an accelerated burn‐in procedure, which incorporates the accelerated ageing process induced by the accelerated environmental stress, is proposed. Under a more general assumption on the shape of failure rate function of products, which includes the traditional bathtub‐shaped failure rate function as a special case, upper bounds for optimal burn‐in time will be derived. A numerical example will also be given for illustration. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006 相似文献
177.
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 相似文献
178.
The (standard) randomization method is an attractive alternative for the transient analysis of continuous time Markov models. The main advantages of the method are numerical stability, well‐controlled computation error, and ability to specify the computation error in advance. However, the fact that the method can be computationally very expensive limits its applicability. In this paper, we develop a new method called split regenerative randomization, which, having the same good properties as standard randomization, can be significantly more efficient. The method covers reliability‐like models with a particular but quite general structure and requires the selection of a subset of states and a regenerative state satisfying some conditions. For a class of continuous time Markov models, model class C2, including typical failure/repair reliability‐like models with exponential failure and repair time distributions and deferred repair, natural selections are available for both the subset of states and the regenerative state and, for those natural selections, theoretical results are available assessing the efficiency of the method in terms of “visible” model characteristics. Those results can be used to anticipate when the method can be expected to be competitive. We illustrate the application of the method using a large class C2 model and show that for models in that class the method can indeed be significantly more efficient than previously available randomization‐based methods. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006 相似文献
179.
利用ADAMS软件中的参数化分析工具,采用设计变量和局部模型重建的方法,实现了特种斜盘发动机斜盘倾角、后球心分布圆半径和导槽形式的参数化,建立了特种斜盘发动机参数化虚拟样机,并进而从设计研究、试验研究和初步优化分析等三个方面,对特种斜盘发动机进行了较为详细和全面的参数化分析. 相似文献
180.
用有限时间热力学的方法分析具有热阻、热漏、内不可逆性的定常流联合卡诺型热机循环.导出了在傅立叶导热定律下联合循环功率、效率和生态学指标的性能,并进行优化;得到功率、效率和生态学指标之间的优化关系,并由数值计算分析了功率、效率和循环熵产率之间的关系.所得的结果表明,最大生态学指标下的效率十分接近于联合循环可以达到的最大效率;相应的熵产率也要低于以输出功率为优化目标时的熵产率. 相似文献