全文获取类型
收费全文 | 512篇 |
免费 | 55篇 |
国内免费 | 1篇 |
专业分类
568篇 |
出版年
2021年 | 6篇 |
2019年 | 14篇 |
2018年 | 8篇 |
2017年 | 15篇 |
2016年 | 18篇 |
2015年 | 20篇 |
2014年 | 17篇 |
2013年 | 128篇 |
2012年 | 15篇 |
2011年 | 11篇 |
2010年 | 11篇 |
2009年 | 13篇 |
2008年 | 14篇 |
2007年 | 14篇 |
2006年 | 12篇 |
2005年 | 13篇 |
2004年 | 9篇 |
2003年 | 14篇 |
2002年 | 12篇 |
2001年 | 8篇 |
2000年 | 8篇 |
1999年 | 8篇 |
1997年 | 5篇 |
1996年 | 7篇 |
1994年 | 5篇 |
1993年 | 10篇 |
1992年 | 6篇 |
1991年 | 8篇 |
1989年 | 7篇 |
1988年 | 5篇 |
1987年 | 4篇 |
1986年 | 6篇 |
1985年 | 8篇 |
1984年 | 5篇 |
1983年 | 4篇 |
1982年 | 5篇 |
1981年 | 4篇 |
1980年 | 8篇 |
1979年 | 8篇 |
1978年 | 8篇 |
1976年 | 7篇 |
1975年 | 10篇 |
1974年 | 6篇 |
1973年 | 8篇 |
1972年 | 5篇 |
1971年 | 4篇 |
1970年 | 5篇 |
1969年 | 4篇 |
1968年 | 5篇 |
1967年 | 3篇 |
排序方式: 共有568条查询结果,搜索用时 15 毫秒
371.
Substitutable product inventory problem is analyzed using the concepts of stochastic game theory. It is assumed that there are two substitutable products that are sold by different retailers and the demand for each product is random. Game theoretic nature of this problem is the result of substitution between products. Since retailers compete for the substitutable demand, ordering decision of each retailer depends on the ordering decision of the other retailer. Under the discounted payoff criterion, this problem is formulated as a two‐person nonzero‐sum stochastic game. In the case of linear ordering cost, it is shown that there exists a Nash equilibrium characterized by a pair of stationary base stock strategies for the infinite horizon problem. This is the unique Nash equilibrium within the class of stationary base stock strategies. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 359–375, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10018 相似文献
372.
We consider two opponents that compete in developing asymmetric technologies where each party's technology is aimed at damaging (or neutralizing) the other's technology. The situation we consider is different than the classical problem of commercial R&D races in two ways: First, while in commercial R&D races the competitors compete over the control of market share, in our case the competition is about the effectiveness of technologies with respect to certain capabilities. Second, in contrast with the “winner‐takes‐all” assumption that characterizes much of the literature on this field in the commercial world, we assume that the party that wins the race gains a temporary advantage that expires when the other party develops a superior technology. We formulate a variety of models that apply to a one‐sided situation, where one of the two parties has to determine how much to invest in developing a technology to counter another technology employed by the other party. The decision problems are expressed as (convex) nonlinear optimization problems. We present an application that provides some operational insights regarding optimal resource allocation. We also consider a two‐sided situation and develop a Nash equilibrium solution that sets investment values, so that both parties have no incentive to change their investments. © 2012 Wiley Periodicals, Inc. Naval Research Logistics 59: 128–145, 2012 相似文献
373.
James G. Taylor 《海军后勤学研究》1980,27(1):109-121
This paper studies combat between two homogeneous forces modelled with variable-coefficient Lanchester-type equations of modern warfare with supporting fires not subject to attrition. It shows that this linear differential-equation model for combat with supporting fires may be transformed into one without the supporting fires so that all the previous results for variable-coefficient Lanchester-type equations of modern warfare (without supporting fires) may be invoked. Consequently, new important results for representing the solution (i.e. force levels as functions of time) in terms of canonical Lanchester functions and also for predicting force annihilation are developed for this model with supporting fires. Important insights into the dynamics of combat between two homogeneous forces with such supporting fires are discussed. 相似文献
374.
This article is concerned with a general multi‐class multi‐server priority queueing system with customer priority upgrades. The queueing system has various applications in inventory control, call centers operations, and health care management. Through a novel design of Lyapunov functions, and using matrix‐analytic methods, sufficient conditions for the queueing system to be stable or instable are obtained. Bounds on the queue length process are obtained by a sample path method, with the help of an auxiliary queueing system. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012 相似文献
375.
Anthony G. Pazzanita 《战略研究杂志》2013,36(1):148-152
Peter Trubowitz, Defining the National Interest: Conflict and Change in American Foreign Policy. Chicago and London: University of Chicago Press, 1998. Pp.xvi + 353, biblio., figs, maps, index. $55 (cloth); $18.95 (paper). ISBN 0–226–81302–9. 相似文献
376.
377.
378.
An availability‐oriented approach has been developed to decide when to replace an aging system. For an existing system, it is optimal to operate another year if and only if the incremental cost per available year is less than the lifetime average cost per available year of a new aircraft. We illustrate our approach using United States Air Force KC‐135 tanker data. In demonstrating our approach, we find it will be optimal to replace the KC‐135 by the end of the decade. 相似文献
379.
Nicholas G. Hall Gilbert Laporte Esaignani Selvarajah Chelliah Sriskandarajah 《海军后勤学研究》2005,52(3):261-275
We study the problem of minimizing the makespan in no‐wait two‐machine open shops producing multiple products using lot streaming. In no‐wait open shop scheduling, sublot sizes are necessarily consistent; i.e., they remain the same over all machines. This intractable problem requires finding sublot sizes, a product sequence for each machine, and a machine sequence for each product. We develop a dynamic programming algorithm to generate all the dominant schedule profiles for each product that are required to formulate the open shop problem as a generalized traveling salesman problem. This problem is equivalent to a classical traveling salesman problem with a pseudopolynomial number of cities. We develop and test a computationally efficient heuristic for the open shop problem. Our results indicate that solutions can quickly be found for two machine open shops with up to 50 products. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005 相似文献
380.
Cardiovascular diseases (CVDs) are the leading cause of death and disability both in the United States and worldwide. Despite high morbidity, mortality, and cost in the United States and global healthcare systems, cardiovascular care has been understudied in the healthcare operations management literature. In this paper, we identify research opportunities for healthcare operations management scholars to aid in improving cardiovascular care. We focus on three burdensome conditions, including (1) coronary artery disease, (2) stroke, and (3) heart failure, which, collectively, lead to the vast majority of CVD‐caused mortality and disability. For each condition, we characterize a typical patient's journey in receiving cardiovascular care, elucidating key challenges in improving care and outlining research questions for healthcare operations management scholars. We close with a reference to new research opportunities that emerge as artificial intelligence is likely to transform much of cardiovascular care. 相似文献