全文获取类型
收费全文 | 198篇 |
免费 | 9篇 |
出版年
2019年 | 11篇 |
2018年 | 12篇 |
2017年 | 4篇 |
2016年 | 7篇 |
2015年 | 6篇 |
2014年 | 10篇 |
2013年 | 48篇 |
2012年 | 4篇 |
2011年 | 2篇 |
2010年 | 1篇 |
2009年 | 7篇 |
2008年 | 1篇 |
2005年 | 1篇 |
2004年 | 2篇 |
2003年 | 6篇 |
2002年 | 2篇 |
2001年 | 2篇 |
2000年 | 4篇 |
1999年 | 1篇 |
1998年 | 1篇 |
1997年 | 3篇 |
1996年 | 1篇 |
1995年 | 2篇 |
1994年 | 3篇 |
1993年 | 4篇 |
1992年 | 1篇 |
1991年 | 1篇 |
1990年 | 2篇 |
1988年 | 1篇 |
1986年 | 5篇 |
1985年 | 2篇 |
1984年 | 3篇 |
1983年 | 3篇 |
1981年 | 1篇 |
1980年 | 2篇 |
1979年 | 3篇 |
1978年 | 1篇 |
1977年 | 1篇 |
1976年 | 3篇 |
1975年 | 3篇 |
1974年 | 6篇 |
1973年 | 3篇 |
1972年 | 4篇 |
1971年 | 5篇 |
1970年 | 3篇 |
1969年 | 4篇 |
1968年 | 3篇 |
1966年 | 1篇 |
1948年 | 1篇 |
排序方式: 共有207条查询结果,搜索用时 203 毫秒
11.
12.
We consider the problem of scheduling a set of n jobs on a single batch machine, where several jobs can be processed simultaneously. Each job j has a processing time pj and a size sj. All jobs are available for processing at time 0. The batch machine has a capacity D. Several jobs can be batched together and processed simultaneously, provided that the total size of the jobs in the batch does not exceed D. The processing time of a batch is the largest processing time among all jobs in the batch. There is a single vehicle available for delivery of the finished products to the customer, and the vehicle has capacity K. We assume that K = rD, where and r is an integer. The travel time of the vehicle is T; that is, T is the time from the manufacturer to the customer. Our goal is to find a schedule of the jobs and a delivery plan so that the service span is minimized, where the service span is the time that the last job is delivered to the customer. We show that if the jobs have identical sizes, then we can find a schedule and delivery plan in time such that the service span is minimum. If the jobs have identical processing times, then we can find a schedule and delivery plan in time such that the service span is asymptotically at most 11/9 times the optimal service span. When the jobs have arbitrary processing times and arbitrary sizes, then we can find a schedule and delivery plan in time such that the service span is asymptotically at most twice the optimal service span. We also derive upper bounds of the absolute worst‐case ratios in both cases. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 470–482, 2015 相似文献
13.
B. Jay Coleman 《海军后勤学研究》2014,61(1):17-33
This article presents two meta‐ranking models that minimize or nearly minimize violations of past game results while predicting future game winners as well as or better than leading current systems—a combination never before offered for college football. Key to both is the development and integration of a highly predictive ensemble probability model generated from the analysis of 36 existing college football ranking systems. This ensemble model is used to determine a target ranking that is used in two versions of a hierarchical multiobjective mixed binary integer linear program (MOMBILP). When compared to 75 other systems out‐of‐sample, one MOMBILP was the leading predictive system while getting within 0.64% of the retrodictive optimum; the other MOMBILP minimized violations while achieving a prediction total that was 2.55% lower than the best mark. For bowls, prediction sums were not statistically significantly different from the leading value, while achieving optimum or near‐optimum violation counts. This performance points to these models as potential means of reconciling the contrasting perspectives of predictiveness versus the matching of past performance when it comes to ranking fairness in college football. © 2013 Wiley Periodicals, Inc. Naval Research Logistics 61: 17–33, 2014 相似文献
14.
In this article, we develop an interactive algorithm to place alternatives in ordered preference classes for a decision maker (DM) with an increasing quasiconcave value function. Such value functions are quite general in that they include linear and concave value functions. Our aim is to elicit sorting information from the DM as few times as possible; our algorithm places other alternatives using previous responses from the DM utilizing properties of quasiconcave value functions. As an application, we sort 81 global MBA programs into preference classes using criteria such as alumni career progress, idea generation, and diversity. We study the performance of our proposed algorithm, when we change the number of criteria, number of alternatives, and introduce response errors. © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 447–457, 2014 相似文献
15.
Paul B Rich 《Small Wars & Insurgencies》2014,25(1):5-40
Say not the struggle naught availeth,The labour and the wounds are vain,The enemy faints not, nor faileth,And as things have been, things remain. Arthur Hugh Clough 相似文献
16.
Chen and Bhattacharyya [Exact confidence bounds for an exponential parameter under hybrid censoring, Commun Statist Theory Methods 17 (1988), 1857–1870] considered a hybrid censoring scheme and obtained the exact distribution of the maximum likelihood estimator of the mean of an exponential distribution along with an exact lower confidence bound. Childs et al. [Exact likelihood inference based on Type‐I and Type‐II hybrid censored samples from the exponential distribution, Ann Inst Statist Math 55 (2003), 319–330] recently derived an alternative simpler expression for the distribution of the MLE. These authors also proposed a new hybrid censoring scheme and derived similar results for the exponential model. In this paper, we propose two generalized hybrid censoring schemes which have some advantages over the hybrid censoring schemes already discussed in the literature. We then derive the exact distribution of the maximum likelihood estimator as well as exact confidence intervals for the mean of the exponential distribution under these generalized hybrid censoring schemes. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004 相似文献
17.
Björn Hagelin 《Defense & Security Analysis》2012,28(2):163-175
From the recipients’ perspective, arms transfers have, through the use of offsets, technology transfers, and industrial participation, become an opportunity to receive not only advanced weapons, but also technologies not otherwise available. How important are friendly relations for securing a military export order? To what extent do buyers demand advanced military or commercial technology and how are these demands accepted by the supplier? How does this influence smaller producers in relation to major producers? These questions are addressed by studying (a) the Joint Strike Fighter/F-35 by Lockheed Martin, USA, and the JAS-39 Gripen aircraft by Saab, Sweden, (b) the Medium Multi-Role Combat Aircraft competition in India for 126 combat aircraft, and (c) the Indian offset policy. In the final section, some long-term consequences are discussed. 相似文献
18.
Susan B. Martin 《战略研究杂志》2016,39(3):321-364
The role of norms and military utility in the use of weapons is disputed by constructivist and realist scholars. Through an examination of US decision-making regarding anti-plant and irritant agents in the Vietnam War, I advance this debate in three key ways. First, I develop structural realism’s expectations regarding the role of military utility. Second, I demonstrate that social and material factors are at play in our understandings of both ‘norms’ and ‘military utility’, and that both played a role in US decisions. Third, I find that the dominant role – as structural realism expects – was played by military utility. 相似文献
19.
In many practical manufacturing environments, jobs to be processed can be divided into different families such that a setup is required whenever there is a switch from processing a job of one family to another job of a different family. The time for setup could be sequence independent or sequence dependent. We consider two particular scheduling problems relevant to such situations. In both problems, we are given a set of jobs to be processed on a set of identical parallel machines. The objective of the first problem is to minimize total weighted completion time of jobs, and that of the second problem is to minimize weighted number of tardy jobs. We propose column generation based branch and bound exact solution algorithms for the problems. Computational experiments show that the algorithms are capable of solving both problems of medium size to optimality within reasonable computational time. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 823–840, 2003. 相似文献
20.
We use a unique data-set gathered during a short-lived interwar period in the Nuba Mountains of Sudan to compare characteristics of the households returning after the conflict with those that stayed in their communities of origin. We found that returning households seemed to face worse economic conditions, particularly in the case of female-headed returnee households. Nevertheless, our results show that returnees tend to perform better on different health indicators. Using a detailed set of variables about hygiene and sanitary habits, we explore the hypothesis that the latter result may be related to changes in attitudes given the distinct experiences during displacement. We show that returnees are indeed more likely to adopt these measures. 相似文献