全文获取类型
收费全文 | 441篇 |
免费 | 10篇 |
出版年
2023年 | 2篇 |
2020年 | 5篇 |
2019年 | 18篇 |
2018年 | 11篇 |
2017年 | 12篇 |
2016年 | 17篇 |
2015年 | 13篇 |
2014年 | 16篇 |
2013年 | 121篇 |
2012年 | 4篇 |
2011年 | 13篇 |
2010年 | 7篇 |
2009年 | 8篇 |
2008年 | 8篇 |
2007年 | 9篇 |
2006年 | 5篇 |
2005年 | 7篇 |
2004年 | 5篇 |
2003年 | 8篇 |
2002年 | 9篇 |
2001年 | 4篇 |
2000年 | 2篇 |
1999年 | 7篇 |
1998年 | 5篇 |
1997年 | 6篇 |
1996年 | 6篇 |
1995年 | 8篇 |
1994年 | 10篇 |
1993年 | 7篇 |
1992年 | 10篇 |
1991年 | 8篇 |
1990年 | 6篇 |
1989年 | 10篇 |
1988年 | 9篇 |
1987年 | 7篇 |
1986年 | 6篇 |
1985年 | 6篇 |
1983年 | 3篇 |
1981年 | 2篇 |
1979年 | 3篇 |
1976年 | 2篇 |
1975年 | 2篇 |
1974年 | 2篇 |
1973年 | 3篇 |
1972年 | 4篇 |
1971年 | 2篇 |
1970年 | 3篇 |
1968年 | 3篇 |
1967年 | 2篇 |
1966年 | 1篇 |
排序方式: 共有451条查询结果,搜索用时 0 毫秒
51.
In an endeavor to broaden the application of scheduling models to decisions involving the use of a manager's time we use simulation to investigate the performance of a number of simple algorithms (including eight priority rules and a construction heuristic) in a dynamic setting with tasks arriving (randomly) and scheduling decisions being made, over time. We compare these simple methods relative to a bound that uses an adjacent pairwise interchange algorithm. We model uncertainty in task durations, and costs being incurred for early and tardy task completion (representative of JIT settings). In addition to evaluating the efficacy of the scheduling rules and various preemption strategies (using ANOVA), we highlight the managerial implications of the effects of eight environmental parameters. © 1996 John Wiley & Sons, Inc. 相似文献
52.
In statistical analysis of stationary time series or in steady-state simulation output analysis, it is desired to find consistent estimates of the process variance parameter. Here, we consider variants of the area estimator of standardized time series, namely, the weighted area and the Cramér-von Mises area estimators, and provide their consistency, in the strong sense and mean-square sense. A sharp bound for the (asymptotic) variance of these estimators is obtained. We also present a central limit theorem for the weighted area estimator: this gives a rate of convergence of this estimator, as well as a confidence interval for the variance parameter. © 1995 John Wiley & Sons, Inc. 相似文献
53.
Many Markov chain models have very large state spaces, making the computation of stationary probabilities very difficult. Often the structure and numerical properties of the Markov chain allows for more efficient computation through state aggregation and disaggregation. In this article we develop an efficient exact single pass aggregation/disaggregation algorithm which exploits structural properties of large finite irreducible mandatory set decomposable Markov chains. The required property of being of mandatory set decomposable structure is a generalization of several other Markov chain structures for which exact aggregation/disaggregation algorithms exist. © 1995 John Wiley & Sons, Inc. 相似文献
54.
55.
In this article we present a queueing-location problem where a location of a service station has to be determined. The two main results of this article are a convexity proof for general distances and a theorem that limits the area in the plane where the solution can lie. We also propose some solution procedures. 相似文献
56.
David Simchi-Levi 《海军后勤学研究》1994,41(4):579-585
In this note we consider the familiar bin-packing problem and provide new worst-case results for a number of classical heuristics. We show that the first-fit and best-fit heuristics have an absolute performance ratio of no more than 1.75, and first-fit decreasing and best-fit decreasing heuristics have an absolute performance ratio of 1.5. The latter is the best possible absolute performance ratio for the bin-packing problem, unless P = NP. © 1994 John Wiley & Sons, Inc. 相似文献
57.
Until only recently, the mechanism behind determining item price has been ignored and the discount price taken as a given in quantity-discount inventory decision problems. Inventory subject to declining demand further complicates both pricing and replenishment decisions. This article provides the vendor with the means for optimally determining both the discount price and replenishment order frequency for all buyers in the system in an environment of declining demand. In the multiple-buyer case, we provide an efficient algorithm for classifying buyers into homogeneous subgroups to further enhance joint cost savings among all system participants. 相似文献
58.
We consider a system of N (nonsymmetric) machine centers of the K-out-of-M : G type that are maintained by a single repairman. [A machine center functions if and only if at least K of the M machines belonging to the center are good (G).] Such systems are commonly found in various manufacturing and service industries. A stochastic model is developed that accommodates generally distributed repair times and repairman walk times, and most repair scheduling disciplines. K-out-of-M : G type systems also appear as a modeling paradigm in reliability analysis and polling systems performance analysis. Several performance measures are derived for machine-repair systems having K-out-of-M-type centers. A simple example system is developed in detail that exposes the computations involved in modeling applications. © 1992 John Wiley & Sons, Inc. 相似文献
59.
David H. Tomback 《Arms and Armour》2019,16(1):56-74
The sword which is the subject of this article and which will be referred to as the Capel sword, is a fine example of what has become known as an Irish basket-hilt. Whilst there are other examples in existence, what makes this sword unique and particularly important is the fact that it is known to have been owned by two important Royalist military leaders, Lord Arthur Capel and Sir John Owen. These two extraordinary men came from different backgrounds but their fate was linked through circumstances beyond their control. The story this sword tells is one of comradeship, loyalty, total belief in a cause, betrayal and ultimate sacrifice. 相似文献
60.
Jutta Joachim Marlen Martin Henriette Lange Andrea Schneiker Magnus Dau 《Contemporary Security Policy》2018,39(2):298-316
Private military and security companies (PMSCs) play an increasingly important role in the provision of security-related services. In their attempts to win new clients and find suitable personnel, they take on different identities by presenting themselves as conventional businesses, military actors, and humanitarians. In this article, we examine how PMSCs deploy these identities when they recruit new personnel through social media. Our computer-assisted content analysis of Twitter messages posted by two major United States-based companies—CACI and DynCorp International—shows that while both PMSCs amplify their business and military identities to attract the most talented personnel, they construct and communicate these identities in different ways with CACI branding itself as a sophisticated, modern, and patriotic business and DynCorp as a home-grown, traditional military provider. In addition, our analysis lends force to scholars suggesting that state militaries and the private security sector compete increasingly for prospective employees using similar strategies. 相似文献