全文获取类型
收费全文 | 538篇 |
免费 | 183篇 |
国内免费 | 58篇 |
出版年
2024年 | 2篇 |
2023年 | 8篇 |
2022年 | 6篇 |
2021年 | 9篇 |
2020年 | 10篇 |
2019年 | 13篇 |
2018年 | 8篇 |
2017年 | 32篇 |
2016年 | 37篇 |
2015年 | 26篇 |
2014年 | 43篇 |
2013年 | 38篇 |
2012年 | 58篇 |
2011年 | 54篇 |
2010年 | 39篇 |
2009年 | 52篇 |
2008年 | 29篇 |
2007年 | 44篇 |
2006年 | 40篇 |
2005年 | 39篇 |
2004年 | 39篇 |
2003年 | 16篇 |
2002年 | 19篇 |
2001年 | 19篇 |
2000年 | 20篇 |
1999年 | 22篇 |
1998年 | 12篇 |
1997年 | 10篇 |
1996年 | 1篇 |
1995年 | 6篇 |
1994年 | 6篇 |
1993年 | 6篇 |
1992年 | 5篇 |
1991年 | 5篇 |
1990年 | 3篇 |
1989年 | 2篇 |
1988年 | 1篇 |
排序方式: 共有779条查询结果,搜索用时 15 毫秒
281.
282.
This paper presents a branch‐and‐price algorithm for scheduling n jobs on m nonhomogeneous parallel machines with multiple time windows. An additional feature of the problem is that each job falls into one of ρ priority classes and may require two operations. The objective is to maximize the weighted number of jobs scheduled, where a job in a higher priority class has “infinitely” more weight or value than a job in a lower priority class. The methodology makes use of a greedy randomized adaptive search procedure (GRASP) to find feasible solutions during implicit enumeration and a two‐cycle elimination heuristic when solving the pricing subproblems. Extensive computational results are presented based on data from an application involving the use of communications relay satellites. Many 100‐job instances that were believed to be beyond the capability of exact methods, were solved within minutes. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2006 相似文献
283.
说明北斗系统有源定位模式的不足,提出一种基于载波相位时间差分的北斗/SINS紧组合导航技术,即以导航卫星载波相位信号的时间差分作为Kalman滤波器的观测量,建立工作于无源方式的北斗/SINS紧组合导航系统。介绍载波相位时间差分的基本原理和数学模型,设计组合导航滤波器。通过动态和静态实验对算法的正确性和精度进行验证。实验结果表明,SINS的位置和速度误差积累受到有效的抑制,导航精度明显提高。 相似文献
284.
285.
286.
287.
288.
We consider the problem of assessing the value of demand sharing in a multistage supply chain in which the retailer observes stationary autoregressive moving average demand with Gaussian white noise (shocks). Similar to previous research, we assume each supply chain player constructs its best linear forecast of the leadtime demand and uses it to determine the order quantity via a periodic review myopic order‐up‐to policy. We demonstrate how a typical supply chain player can determine the extent of its available information in the presence of demand sharing by studying the properties of the moving average polynomials of adjacent supply chain players. The retailer's demand is driven by the random shocks appearing in the autoregressive moving average representation for its demand. Under the assumptions we will make in this article, to the retailer, knowing the shock information is equivalent to knowing the demand process (assuming that the model parameters are also known). Thus (in the event of sharing) the retailer's demand sequence and shock sequence would contain the same information to the retailer's supplier. We will show that, once we consider the dynamics of demand propagation further up the chain, it may be that a player's demand and shock sequences will contain different levels of information for an upstream player. Hence, we study how a player can determine its available information under demand sharing, and use this information to forecast leadtime demand. We characterize the value of demand sharing for a typical supply chain player. Furthermore, we show conditions under which (i) it is equivalent to no sharing, (ii) it is equivalent to full information shock sharing, and (iii) it is intermediate in value to the two previously described arrangements. Although it follows from existing literature that demand sharing is equivalent to full information shock sharing between a retailer and supplier, we demonstrate and characterize when this result does not generalize to upstream supply chain players. We then show that demand propagates through a supply chain where any player may share nothing, its demand, or its full information shocks (FIS) with an adjacent upstream player as quasi‐ARMA in—quasi‐ARMA out. We also provide a convenient form for the propagation of demand in a supply chain that will lend itself to future research applications. © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 515–531, 2014 相似文献
289.
290.