全文获取类型
收费全文 | 646篇 |
免费 | 189篇 |
国内免费 | 28篇 |
出版年
2023年 | 3篇 |
2022年 | 2篇 |
2021年 | 6篇 |
2020年 | 16篇 |
2019年 | 15篇 |
2018年 | 7篇 |
2017年 | 40篇 |
2016年 | 37篇 |
2015年 | 34篇 |
2014年 | 44篇 |
2013年 | 89篇 |
2012年 | 40篇 |
2011年 | 37篇 |
2010年 | 38篇 |
2009年 | 48篇 |
2008年 | 47篇 |
2007年 | 56篇 |
2006年 | 48篇 |
2005年 | 37篇 |
2004年 | 38篇 |
2003年 | 27篇 |
2002年 | 22篇 |
2001年 | 26篇 |
2000年 | 22篇 |
1999年 | 10篇 |
1998年 | 11篇 |
1997年 | 10篇 |
1996年 | 7篇 |
1995年 | 4篇 |
1994年 | 3篇 |
1993年 | 7篇 |
1992年 | 9篇 |
1991年 | 6篇 |
1990年 | 10篇 |
1989年 | 4篇 |
1988年 | 3篇 |
排序方式: 共有863条查询结果,搜索用时 15 毫秒
41.
We consider the problem of scheduling a set of n jobs on a single batch machine, where several jobs can be processed simultaneously. Each job j has a processing time pj and a size sj. All jobs are available for processing at time 0. The batch machine has a capacity D. Several jobs can be batched together and processed simultaneously, provided that the total size of the jobs in the batch does not exceed D. The processing time of a batch is the largest processing time among all jobs in the batch. There is a single vehicle available for delivery of the finished products to the customer, and the vehicle has capacity K. We assume that K = rD, where and r is an integer. The travel time of the vehicle is T; that is, T is the time from the manufacturer to the customer. Our goal is to find a schedule of the jobs and a delivery plan so that the service span is minimized, where the service span is the time that the last job is delivered to the customer. We show that if the jobs have identical sizes, then we can find a schedule and delivery plan in time such that the service span is minimum. If the jobs have identical processing times, then we can find a schedule and delivery plan in time such that the service span is asymptotically at most 11/9 times the optimal service span. When the jobs have arbitrary processing times and arbitrary sizes, then we can find a schedule and delivery plan in time such that the service span is asymptotically at most twice the optimal service span. We also derive upper bounds of the absolute worst‐case ratios in both cases. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 470–482, 2015 相似文献
42.
Model parameter estimation and residual life prediction for a partially observable failing system
下载免费PDF全文
![点击此处可从《海军后勤学研究》网站下载免费的PDF全文](/ch/ext_images/free.gif)
We consider a partially observable degrading system subject to condition monitoring and random failure. The system's condition is categorized into one of three states: a healthy state, a warning state, and a failure state. Only the failure state is observable. While the system is operational, vector data that is stochastically related to the system state is obtained through condition monitoring at regular sampling epochs. The state process evolution follows a hidden semi‐Markov model (HSMM) and Erlang distribution is used for modeling the system's sojourn time in each of its operational states. The Expectation‐maximization (EM) algorithm is applied to estimate the state and observation parameters of the HSMM. Explicit formulas for several important quantities for the system residual life estimation such as the conditional reliability function and the mean residual life are derived in terms of the posterior probability that the system is in the warning state. Numerical examples are presented to demonstrate the applicability of the estimation procedure and failure prediction method. A comparison results with hidden Markov modeling are provided to illustrate the effectiveness of the proposed model. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 190–205, 2015 相似文献
43.
两栖登陆作战在战术上是最复杂、最危险的作战行动,登陆部队需要面对抗登陆方坚固的海岸防御背水抢滩作战,其危险性和困难可想而知。"工欲善其事,必先利其器",在兵器上的优势成为克服不利地理条件,形成火力优势的关键。类"标枪"反装甲导弹装备是两栖登陆作战中单兵反装甲作战的主要武器,仿真技术是类"标枪"反装甲导弹武器系统优化设计和性能研究的必要手段。介绍了单项仿真与综合仿真相结合的仿真方法,给出了类"标枪"反装甲导弹的弹道模型,利用Matlab编程语言进行了仿真验证,对改善导弹的弹道性能具有明显的实用价值。 相似文献
44.
45.
针对小推力轨道优化设计问题,提出一种基于运动合成的新方法。给出基于运动合成的小推力轨道机动表达方式,将小推力轨道运动分解成相对独立的三项:单独考虑日心引力的二体轨道运动,单独考虑小推力的运动,以及小推力的存在引起的日心引力摄动作用下的运动。分别给出各项运动的解析表达式,通过合成叠加得到小推力轨道的近似解析解。在此基础上,将小推力轨道优化问题转化成非线性规划问题,并利用序列二次规划方法求解。以小行星1989ML、火星和金星交会任务为例分别进行仿真实验,结果表明,所设计轨道满足任务约束,验证了该方法具有可用性和高效性。 相似文献
46.
47.
48.
In scheduling problems with two competing agents, each one of the agents has his own set of jobs to be processed and his own objective function, and both share a common processor. In the single‐machine problem studied in this article, the goal is to find a joint schedule that minimizes the total deviation of the job completion times of the first agent from a common due‐date, subject to an upper bound on the maximum deviation of job completion times of the second agent. The problem is shown to be NP‐hard even for a nonrestrictive due‐date, and a pseudopolynomial dynamic program is introduced and tested numerically. For the case of a restrictive due‐date (a sufficiently small due‐date that may restrict the number of early jobs), a faster pseudopolynomial dynamic program is presented. We also study the multiagent case, which is proved to be strongly NP‐hard. A simple heuristic for this case is introduced, which is tested numerically against a lower bound, obtained by extending the dynamic programming algorithm. © 2013 Wiley Periodicals, Inc. Naval Research Logistics 61: 1–16, 2014 相似文献
49.
B. Jay Coleman 《海军后勤学研究》2014,61(1):17-33
This article presents two meta‐ranking models that minimize or nearly minimize violations of past game results while predicting future game winners as well as or better than leading current systems—a combination never before offered for college football. Key to both is the development and integration of a highly predictive ensemble probability model generated from the analysis of 36 existing college football ranking systems. This ensemble model is used to determine a target ranking that is used in two versions of a hierarchical multiobjective mixed binary integer linear program (MOMBILP). When compared to 75 other systems out‐of‐sample, one MOMBILP was the leading predictive system while getting within 0.64% of the retrodictive optimum; the other MOMBILP minimized violations while achieving a prediction total that was 2.55% lower than the best mark. For bowls, prediction sums were not statistically significantly different from the leading value, while achieving optimum or near‐optimum violation counts. This performance points to these models as potential means of reconciling the contrasting perspectives of predictiveness versus the matching of past performance when it comes to ranking fairness in college football. © 2013 Wiley Periodicals, Inc. Naval Research Logistics 61: 17–33, 2014 相似文献
50.
Choosing arrival process models for service systems: Tests of a nonhomogeneous Poisson process
下载免费PDF全文
![点击此处可从《海军后勤学研究》网站下载免费的PDF全文](/ch/ext_images/free.gif)
Service systems such as call centers and hospital emergency rooms typically have strongly time‐varying arrival rates. Thus, a nonhomogeneous Poisson process (NHPP) is a natural model for the arrival process in a queueing model for performance analysis. Nevertheless, it is important to perform statistical tests with service system data to confirm that an NHPP is actually appropriate, as emphasized by Brown et al. [8]. They suggested a specific statistical test based on the Kolmogorov–Smirnov (KS) statistic after exploiting the conditional‐uniform (CU) property to transform the NHPP into a sequence of i.i.d. random variables uniformly distributed on [0,1] and then performing a logarithmic transformation of the data. We investigate why it is important to perform the final data transformation and consider what form it should take. We conduct extensive simulation experiments to study the power of these alternative statistical tests. We conclude that the general approach of Brown et al. [8] is excellent, but that an alternative data transformation proposed by Lewis [22], drawing upon Durbin [10], produces a test of an NHPP test with consistently greater power. We also conclude that the KS test after the CU transformation, without any additional data transformation, tends to be best to test against alternative hypotheses that primarily differ from an NHPP only through stochastic and time dependence. © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 66–90, 2014 相似文献