全文获取类型
| 收费全文 | 1186篇 |
| 免费 | 35篇 |
| 国内免费 | 10篇 |
专业分类
| 1231篇 |
出版年
| 2025年 | 9篇 |
| 2024年 | 11篇 |
| 2023年 | 16篇 |
| 2022年 | 9篇 |
| 2021年 | 27篇 |
| 2020年 | 25篇 |
| 2019年 | 22篇 |
| 2018年 | 15篇 |
| 2017年 | 36篇 |
| 2016年 | 56篇 |
| 2015年 | 31篇 |
| 2014年 | 57篇 |
| 2013年 | 66篇 |
| 2012年 | 65篇 |
| 2011年 | 69篇 |
| 2010年 | 37篇 |
| 2009年 | 73篇 |
| 2008年 | 49篇 |
| 2007年 | 55篇 |
| 2006年 | 74篇 |
| 2005年 | 64篇 |
| 2004年 | 57篇 |
| 2003年 | 46篇 |
| 2002年 | 37篇 |
| 2001年 | 37篇 |
| 2000年 | 34篇 |
| 1999年 | 22篇 |
| 1998年 | 28篇 |
| 1997年 | 13篇 |
| 1996年 | 19篇 |
| 1995年 | 11篇 |
| 1994年 | 16篇 |
| 1993年 | 5篇 |
| 1992年 | 18篇 |
| 1991年 | 7篇 |
| 1990年 | 10篇 |
| 1989年 | 3篇 |
| 1988年 | 2篇 |
排序方式： 共有1231条查询结果，搜索用时 0 毫秒
141.
142.
Xiangtong Qi 《海军后勤学研究》2005,52(4):312-320
Logistics scheduling refers to the problems where the decisions of job scheduling and transportation are integrated in a single framework. In this paper, we discuss a logistics scheduling model where the raw material is delivered to the shop in batches. By making the batching and scheduling decisions simultaneously, the total inventory and batch setup cost can be reduced. We study different models on this issue, present complexity analysis and optimal algorithms, and conduct computational experiments. Some managerial insights are observed. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005. 相似文献
143.
144.
In this article, we discuss the optimal allocation problem in a multiple stress levels life‐testing experiment when an extreme value regression model is used for statistical analysis. We derive the maximum likelihood estimators, the Fisher information, and the asymptotic variance–covariance matrix of the maximum likelihood estimators. Three optimality criteria are defined and the optimal allocation of units for two‐ and k‐stress level situations are determined. We demonstrate the efficiency of the optimal allocation of units in a multiple stress levels life‐testing experiment by using real experimental situations discussed earlier by McCool and Nelson and Meeker. Monte Carlo simulations are used to show that the optimality results hold for small sample sizes as well. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007 相似文献
145.
146.
针对战场信息中存在大量不确定性因素的特点,利用一种新的直觉模糊推理方法进行威胁企图分析。推理方法有效利用两个传统Zadeh模糊系统的输出结果,更接近于专家的思维。通过实例研究证明了该方法的可行性。直觉模糊推理是对一般模糊推理的有效扩充和发展,该方法对于提高作战指挥决策智能化具有一定的参考意义。 相似文献
147.
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 相似文献
148.
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 相似文献
149.
In this paper we study higher‐order Markov chain models for analyzing categorical data sequences. We propose an efficient estimation method for the model parameters. Data sequences such as DNA and sales demand are used to illustrate the predicting power of our proposed models. In particular, we apply the developed higher‐order Markov chain model to the server logs data. The objective here is to model the users' behavior in accessing information and to predict their behavior in the future. Our tests are based on a realistic web log and our model shows an improvement in prediction. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004 相似文献
150.
We consider the problem of scheduling a set of jobs on a single machine subject to random breakdowns. We focus on the preemptive‐repeat model, which addresses the situation where, if a machine breaks down during the processing of a job, the work done on the job prior to the breakdown is lost and the job will have to be started from the beginning again when the machine resumes its work. We allow that (i) the uptimes and downtimes of the machine follow general probability distributions, (ii) the breakdown process of the machine depends upon the job being processed, (iii) the processing times of the jobs are random variables following arbitrary distributions, and (iv) after a breakdown, the processing time of a job may either remain a same but unknown amount, or be resampled according to its probability distribution. We first derive the optimal policy for a class of problems under the criterion to maximize the expected discounted reward earned from completing all jobs. The result is then applied to further obtain the optimal policies for other due date‐related criteria. We also discuss a method to compute the moments and probability distributions of job completion times by using their Laplace transforms, which can convert a general stochastic scheduling problem to its deterministic equivalent. The weighted squared flowtime problem and the maintenance checkup and repair problem are analyzed as applications. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004 相似文献