全文获取类型
收费全文 | 211篇 |
免费 | 90篇 |
国内免费 | 4篇 |
出版年
2022年 | 1篇 |
2021年 | 7篇 |
2020年 | 14篇 |
2019年 | 12篇 |
2018年 | 4篇 |
2017年 | 8篇 |
2016年 | 14篇 |
2015年 | 12篇 |
2014年 | 15篇 |
2013年 | 6篇 |
2012年 | 16篇 |
2011年 | 26篇 |
2010年 | 9篇 |
2009年 | 14篇 |
2008年 | 13篇 |
2007年 | 14篇 |
2006年 | 18篇 |
2005年 | 17篇 |
2004年 | 13篇 |
2003年 | 7篇 |
2002年 | 10篇 |
2001年 | 13篇 |
2000年 | 7篇 |
1999年 | 8篇 |
1998年 | 12篇 |
1997年 | 4篇 |
1996年 | 2篇 |
1995年 | 1篇 |
1994年 | 3篇 |
1993年 | 3篇 |
1992年 | 1篇 |
1990年 | 1篇 |
排序方式: 共有305条查询结果,搜索用时 421 毫秒
181.
在太赫兹频段,研究金属目标表面粗糙度对雷达散射截面(Radar Cross Section,RCS)的调制作用,对粗糙金属目标的RCS缩比测量具有重要意义.通过研究太赫兹粗糙金属目标镜面RCS随粗糙度的变化规律,结合相干、非相干散射理论,在基尔霍夫近似法的基础上,提出一种特定参数区间粗糙金属目标镜面RCS的预估方法,并... 相似文献
182.
Capacity planning decisions affect a significant portion of future revenue. In equipment intensive industries, these decisions usually need to be made in the presence of both highly volatile demand and long capacity installation lead times. For a multiple product case, we present a continuous‐time capacity planning model that addresses problems of realistic size and complexity found in current practice. Each product requires specific operations that can be performed by one or more tool groups. We consider a number of capacity allocation policies. We allow tool retirements in addition to purchases because the stochastic demand forecast for each product can be decreasing. We present a cluster‐based heuristic algorithm that can incorporate both variance reduction techniques from the simulation literature and the principles of a generalized maximum flow algorithm from the network optimization literature. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2006 相似文献
183.
We examine the problem of adaptively scheduling perfect observations and preventive replacements for a multi‐state, Markovian deterioration system with silent failures such that total expected discounted cost is minimized. We model this problem as a partially observed Markov decision process and show that the structural properties of the optimal policy hold for certain non‐extreme sample paths. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007 相似文献
184.
Ward Whitt 《海军后勤学研究》2007,54(5):476-484
One traditional application of queueing models is to help set staffing requirements in service systems, but the way to do so is not entirely straightforward, largely because demand in service systems typically varies greatly by the time of day. This article discusses ways—old and new—to cope with that time‐varying demand. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007 相似文献
185.
186.
Wieslaw
Kubiak Yanling Feng Guo Li Suresh P. Sethi Chelliah Sriskandarajah 《海军后勤学研究》2020,67(4):272-288
Job shop scheduling with a bank of machines in parallel is important from both theoretical and practical points of view. Herein we focus on the scheduling problem of minimizing the makespan in a flexible two-center job shop. The first center consists of one machine and the second has k parallel machines. An easy-to-perform approximate algorithm for minimizing the makespan with one-unit-time operations in the first center and k-unit-time operations in the second center is proposed. The algorithm has the absolute worst-case error bound of k − 1 , and thus for k = 1 it is optimal. Importantly, it runs in linear time and its error bound is independent of the number of jobs to be processed. Moreover, the algorithm can be modified to give an optimal schedule for k = 2 . 相似文献
187.
188.
In this article, we develop a stochastic approximation algorithm to find good bid price policies for the joint capacity allocation and overbooking problem over an airline network. Our approach is based on visualizing the total expected profit as a function of the bid prices and searching for a good set of bid prices by using the stochastic gradients of the total expected profit function. We show that the total expected profit function that we use is differentiable with respect to the bid prices and derive a simple expression that can be used to compute its stochastic gradients. We show that the iterates of our stochastic approximation algorithm converge to a stationary point of the total expected profit function with probability 1. Our computational experiments indicate that the bid prices computed by our approach perform significantly better than those computed by standard benchmark strategies and the performance of our approach is relatively insensitive to the frequency with which we recompute the bid prices over the planning horizon. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011 相似文献
189.
In this article, we study reliability properties of m‐consecutive‐k‐out‐of‐n: F systems with exchangeable components. We deduce exact formulae and recurrence relations for the signature of the system. Closed form expressions for the survival function and the lifetime distribution as a mixture of the distribution of order statistics are established as well. These representations facilitate the computation of several reliability characteristics of the system for a given exchangeable joint distribution or survival function. Finally, we provide signature‐based stochastic ordering results for the system's lifetime and investigate the IFR preservation property under the formulation of m‐consecutive‐k‐out‐of‐n: F systems. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011 相似文献
190.
We discuss suitable conditions such that the lifetime of a series or of a parallel system formed by two components having nonindependent lifetimes may be stochastically improved by replacing the lifetimes of each of the components by an independent mixture of the individual components' lifetimes. We also characterize the classes of bivariate distributions where this phenomenon arises through a new weak dependence notion. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011 相似文献