全文获取类型
收费全文 | 431篇 |
免费 | 163篇 |
国内免费 | 27篇 |
出版年
2023年 | 3篇 |
2022年 | 5篇 |
2021年 | 14篇 |
2020年 | 11篇 |
2019年 | 14篇 |
2018年 | 4篇 |
2017年 | 24篇 |
2016年 | 31篇 |
2015年 | 23篇 |
2014年 | 41篇 |
2013年 | 24篇 |
2012年 | 27篇 |
2011年 | 45篇 |
2010年 | 23篇 |
2009年 | 39篇 |
2008年 | 29篇 |
2007年 | 32篇 |
2006年 | 31篇 |
2005年 | 35篇 |
2004年 | 30篇 |
2003年 | 17篇 |
2002年 | 15篇 |
2001年 | 19篇 |
2000年 | 17篇 |
1999年 | 12篇 |
1998年 | 12篇 |
1997年 | 7篇 |
1996年 | 8篇 |
1995年 | 3篇 |
1994年 | 1篇 |
1993年 | 5篇 |
1992年 | 5篇 |
1991年 | 3篇 |
1990年 | 5篇 |
1989年 | 3篇 |
1988年 | 3篇 |
1987年 | 1篇 |
排序方式: 共有621条查询结果,搜索用时 15 毫秒
291.
We present a stochastic programming approach to capacity planning under demand uncertainty in semiconductor manufacturing. Given multiple demand scenarios together with associated probabilities, our aim is to identify a set of tools that is a good compromise for all these scenarios. More precisely, we formulate a mixed‐integer program in which expected value of the unmet demand is minimized subject to capacity and budget constraints. This is a difficult two‐stage stochastic mixed‐integer program which cannot be solved to optimality in a reasonable amount of time. We instead propose a heuristic that can produce near‐optimal solutions. Our heuristic strengthens the linear programming relaxation of the formulation with cutting planes and performs limited enumeration. Analyses of the results in some real‐life situations are also presented. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005. 相似文献
292.
One of the major problems in modeling production systems is how to treat the job arrival process. Restrictive assumptions such as Markovian arrivals do not represent real world systems, especially if the arrival process is generated by job departures from upstream workstations. Under these circumstances, cost‐effective policies that are robust with respect to the nature of the arrival process become of interest. In this paper, we focus on minimizing the expected total holding and setup costs in a two‐stage produce‐to‐order production system operated by a cross‐trained worker. We will show that if setup times are insignificant in comparison with processing times, then near‐optimal policies can be generated with very robust performances with respect to the arrival process. We also present conditions under which these near‐optimal policies can be obtained by using only the arrival and service rates. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2005. 相似文献
293.
Operational processes are usually studied in terms of stochastic processes. The main information measure used for predictability of stochastic processes is the entropy rate, which is asymptotic conditional entropy, thus not suitable for application over a finite horizon. We use the conditional entropy to study the predictability of stochastic processes over the finite horizon. It is well‐known that the conditional entropies of stationary processes decrease as the processes evolve, implying that, on average, their pasts become more informative about prediction of their future outcomes. Some important operational processes such as martingale, models for maintenance policies, nonhomogeneous Poisson, and mixed Poisson processes are nonstationary. We show that as a nonstationary process evolves, it may provide more information or less information about the future state of the system. We develop results for comparing the predictability of stochastic processes. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011 相似文献
294.
We consider a supplier with finite production capacity and stochastic production times. Customers provide advance demand information (ADI) to the supplier by announcing orders ahead of their due dates. However, this information is not perfect, and customers may request an order be fulfilled prior to or later than the expected due date. Customers update the status of their orders, but the time between consecutive updates is random. We formulate the production‐control problem as a continuous‐time Markov decision process and prove there is an optimal state‐dependent base‐stock policy, where the base‐stock levels depend upon the numbers of orders at various stages of update. In addition, we derive results on the sensitivity of the state‐dependent base‐stock levels to the number of orders in each stage of update. In a numerical study, we examine the benefit of ADI, and find that it is most valuable to the supplier when the time between updates is moderate. We also consider the impact of holding and backorder costs, numbers of updates, and the fraction of customers that provide ADI. In addition, we find that while ADI is always beneficial to the supplier, this may not be the case for the customers who provide the ADI. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011 相似文献
295.
Johan Marklund 《海军后勤学研究》2011,58(1):59-71
This article analyses a divergent supply chain consisting of a central warehouse and N nonidentical retailers. The focus is on joint evaluation of inventory replenishment and shipment consolidation effects. A time‐based dispatching and shipment consolidation policy is used at the warehouse in conjunction with real‐time point‐of‐sale data and centralized inventory information. This represents a common situation, for example, in various types of vendor managed inventory systems. The main contribution is the derivation of an exact recursive procedure for determining the expected inventory holding and backorder costs for the system, under the assumption of Poisson demand. Two heuristics for determining near optimal shipment intervals are also presented. The results are applicable both for single‐item and multiitem systems. © 2011 Wiley Periodicals, Inc. Naval Research Logistics 58: 59–71, 2011 相似文献
296.
张崇 《武警工程学院学报》2011,(2):31-33
提出了一种基于DSP和FPGA的实时图像瞄准具的设计方案。其核心部分实时图像处理系统的设计采用了DSP+FPGA的混合结构,即DSP作为视频图像处理核心芯片,完成复杂的图像处理算法,而采用FPGA实现视频图像的实时采集与显示,以及系统所有时序和逻辑控制。充分利用DSP高速的图像处理能力,以及FPGA灵活的系统编程能力,大大减轻了DSP的负担,使得DSP能够专心于图像处理,极大地提高了系统的实时性、可靠性与灵活性。 相似文献
297.
针对武器装备体系能力概念抽象、关系复杂特点导致建模困难、重用性差、语义不一致等诸多问题,提出了一种基于本体的能力多视图模型构建方法,建立了6个能力视图的元模型.该方法首先明确能力领域问题,确定武器装备体系能力领域核心本体及构建原则,然后采用形式化方法描述本体,建立核心本体的关系模型,最后面向能力视图内容建立元模型,通过... 相似文献
298.
299.
300.