首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   331篇
  免费   77篇
  国内免费   8篇
  2023年   2篇
  2021年   7篇
  2020年   8篇
  2019年   5篇
  2018年   4篇
  2017年   7篇
  2016年   13篇
  2015年   18篇
  2014年   11篇
  2013年   72篇
  2012年   18篇
  2011年   20篇
  2010年   14篇
  2009年   18篇
  2008年   22篇
  2007年   25篇
  2006年   9篇
  2005年   14篇
  2004年   14篇
  2003年   15篇
  2002年   15篇
  2001年   9篇
  2000年   8篇
  1999年   16篇
  1998年   8篇
  1997年   9篇
  1996年   4篇
  1994年   2篇
  1993年   5篇
  1992年   3篇
  1991年   1篇
  1990年   2篇
  1989年   3篇
  1988年   3篇
  1987年   1篇
  1986年   3篇
  1985年   2篇
  1982年   1篇
  1979年   1篇
  1978年   2篇
  1972年   1篇
  1967年   1篇
排序方式: 共有416条查询结果,搜索用时 31 毫秒
181.
In this article, we seek to understand how a capacity‐constrained seller optimally prices and schedules product shipping to customers who are heterogeneous on willingness to pay (WTP) and willingness to wait (WTW). The capacity‐constrained seller does not observe each customer's WTP and WTW and knows only the aggregate distributions of WTP and WTW. The seller's problem is modeled as an M/M/Ns queueing model with multiclass customers and multidimensional information screening. We contribute to the literature by providing an optimal and efficient algorithm. Furthermore, we numerically find that customers with a larger waiting cost enjoys a higher scheduling priority, but customers with higher valuation do not necessarily get a higher scheduling priority. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 215–227, 2015  相似文献   
182.
This article describes a polynomial transformation for a class of unit‐demand vehicle routing problems, named node‐balanced routing problems (BRP), where the number of nodes on each route is restricted to be in an interval such that the workload across the routes is balanced. The transformation is general in that it can be applied to single or multiple depot, homogeneous or heterogeneous fleet BRPs, and any combination thereof. At the heart of the procedure lies transforming the BRP into a generalized traveling salesman problem (TSP), which can then be transformed into a TSP. The transformed graph exhibits special properties which can be exploited to significantly reduce the number of arcs, and used to construct a formulation for the resulting TSP that amounts to no more than that of a constrained assignment problem. Computational results on a number of instances are presented. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 370–387, 2015  相似文献   
183.
磁悬浮列车系统轨道动力学分析与试验研究   总被引:1,自引:0,他引:1       下载免费PDF全文
本文建立了磁悬浮列车系统轨道动力学方程组,讨论了轨道结构参数对弹性轨变形、极限速度及模态的影响,并结合KDⅢ车的试验结果作出分析。  相似文献   
184.
Earlier research on the effects of nonoverlapping temporal aggregation on demand forecasting showed the benefits associated with such an approach under a stationary AR(1) or MA(1) processes for decision making conducted at the disaggregate level. The first objective of this note is to extend those important results by considering a more general underlying demand process. The second objective is to assess the conditions under which aggregation may be a preferable approach for improving decision making at the aggregate level as well. We confirm the validity of previous results under more general conditions, and we show the increased benefit resulting from forecasting by temporal aggregation at lower frequency time units. © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 489–500, 2014  相似文献   
185.
我院图书馆馆藏结构与利用情况的统计研究   总被引:2,自引:0,他引:2  
按照《中国图书馆分类法》以大类和二级类目统计了我院图书馆图书馆藏结构,分析了馆藏结构与馆藏利用结构的匹配情况,发现一些类目的图书有很高的利用效率,而另一些类目图书的馆藏结构与利用呈背离状态,得出的结论为今后调整图书采访策略提供了依据。  相似文献   
186.
Lot splitting refers to breaking a production lot into smaller sublots during production. Coordinating lot splitting decisions across multiple stages of a production process is a challenging task. Traditional lot splitting and lot streaming models implicitly assume that the entire system is operated and owned by the same firm, or there exists a coordinator who controls the operation of all machines in the system. In this paper, we consider the situation where the machines in a multiple‐stage production process are owned and managed by different companies. Every item in a given production lot has to go through the processing by the supplier's machine, followed by the manufacturer's machine, and so on. We develop and analyze coordination mechanisms that enable different parties in the supply chain to coordinate their lot splitting decisions so as to achieve a systemwide optimum. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004  相似文献   
187.
文章介绍了数据融合定义和模型发展历程,概述了基于JDL模型的五级战场数据融合模型及各层功能,简要分析了用于多目标跟踪的融合系统结构和关键技术,概括了数据融合系统评估、理论研究和应用现状。  相似文献   
188.
We present a group testing model for items characterized by marker random variables. An item is defined to be good (defective) if its marker is below (above) a given threshold. The items can be tested in groups; the goal is to obtain a prespecified number of good items by testing them in optimally sized groups. Besides this group size, the controller has to select a threshold value for the group marker sums, and the target number of groups which by the tests are classified to consist only of good items. These decision variables have to be chosen so as to minimize a cost function, which is a linear combination of the expected number of group tests and an expected penalty for missing the desired number of good items, subject to constraints on the probabilities of misclassifications. We treat two models of this kind: the first one is based on an infinite population size, whereas the second one deals with the case of a finite number of available items. All performance measures are derived in closed form; approximations are also given. Furthermore, we prove monotonicity properties of the components of the objective function and of the constraints. In several examples, we study (i) the dependence of the cost function on the decision variables and (ii) the dependence of the optimal values of the decision variables (group size, group marker threshold, and stopping rule for groups classified as clean) and of the target functionals (optimal expected number of tests, optimal expected penalty, and minimal expected cost) on the system parameters.© 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011  相似文献   
189.
The significance of integrating reliability into logistics performance has been established [The Logistics Performance Index and Its Indicators, World Bank International Trade and Transport Departments, (2010)]. Hence, as a response to the work by the World Bank, the present article aims to evaluate the performance index Rb,d of logistics systems as the probability that a specified demand d can be distributed successfully through multistate arc capacities from the source to the destination under the constraint that the total distribution cost should not exceed the cost limitation b. This article provides a pioneering approach for a straightforward computation of the performance index Rb,d. The proposed algorithm is a hybrid between the polynomial time capacity‐scaling algorithm, which was presented by Edmonds and Karp [JACM 19 (1972)], and the decomposition algorithm, which was presented by Jane and Laih [IEEE (2008)]. Currently, the proposed approach is the only algorithm that can directly compute Rb,d. An illustration of the proposed algorithm is presented. The results of the computational experiments indicate that the presented algorithm outperforms existing algorithms. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012  相似文献   
190.
We study a service design problem in diagnostic service centers, call centers that provide medical advice to patients over the phone about what the appropriate course of action is, based on the caller's symptoms. Due to the tension between increased diagnostic accuracy and the increase in waiting times more in‐depth service requires, managers face a difficult decision in determining the optimal service depth to guide the diagnostic process. The specific problem we consider models the situation when the capacity (staffing level) at the center is fixed, and when the callers have both congestion‐ and noncongestion‐related costs relating to their call. We develop a queueing model incorporating these features and find that the optimal service depth can take one of two different structures, depending on factors such as the nurses' skill level and the maximum potential demand. Sensitivity analyses of the two optimal structures show that they are quite different. In some situations, it may (or may not) be optimal for the manager to try to expand the demand at the center, and increasing skill level may (or may not) increase congestion. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号