全文获取类型
收费全文 | 81篇 |
免费 | 3篇 |
出版年
2020年 | 1篇 |
2019年 | 1篇 |
2017年 | 1篇 |
2016年 | 3篇 |
2015年 | 2篇 |
2014年 | 2篇 |
2013年 | 20篇 |
2011年 | 1篇 |
2010年 | 1篇 |
2009年 | 1篇 |
2007年 | 2篇 |
2006年 | 2篇 |
2004年 | 2篇 |
2002年 | 2篇 |
2001年 | 1篇 |
2000年 | 1篇 |
1999年 | 2篇 |
1998年 | 1篇 |
1997年 | 1篇 |
1996年 | 3篇 |
1995年 | 1篇 |
1993年 | 2篇 |
1992年 | 1篇 |
1990年 | 2篇 |
1989年 | 6篇 |
1988年 | 1篇 |
1987年 | 3篇 |
1986年 | 2篇 |
1985年 | 4篇 |
1983年 | 2篇 |
1979年 | 1篇 |
1977年 | 3篇 |
1975年 | 1篇 |
1973年 | 2篇 |
1968年 | 1篇 |
1967年 | 2篇 |
排序方式: 共有84条查询结果,搜索用时 296 毫秒
31.
The effectiveness of Johnson's Approximate Method (JAM) for the 3 × n job shop scheduling problems was examined on 1,500 test cases with n ranging from 6 to 50 and with the processing times Ai, Bi, Ci (for item i on machines A, B, C) being uniformly and normally distributed. JAM proved to be quite effective for the case Bi ? max (Ai, Ci) and optimal for Bi, ? min (Ai, Ci). 相似文献
32.
We consider the problem of maximizing the number of on‐time jobs on two uniform parallel machines. We show that a straightforward extension of an algorithm developed for the simpler two identical parallel machines problem yields a heuristic with a worst‐case ratio bound of at least . We then show that the infusion of a “look ahead” feature into the aforementioned algorithm results in a heuristic with the tight worst‐case ratio bound of , which, to our knowledge, is the tightest worst‐case ratio bound available for the problem. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006 相似文献
33.
34.
A fundamental unsolved problem in the programming area is one in which various activities have fixed charges (e.g., set-up time charges) if operating at a positive level. Properties of a general solution to this type problem are discussed in this paper. Under special circumstances it is shown that a fixed charge problem can be reduced to an ordinary linear programming problem. 相似文献
35.
George R. Fitzpatrick Jerome Bracken Mary J. O'brien Lee G. Wentling Justin C. Whiton 《海军后勤学研究》1967,14(2):241-255
A linear programming model for analyzing the strategic deployment mix of airlift and sealift forces and prepositioning to accomplish the composite requirements of a set of possible contingencies is described in this paper. It solves for the least-cost mix of deployment means capable of meeting any one of a spectrum of contingencies, or meeting simultaneous contingencies. The model was developed by RAC as part of the U.S. Army's study program and has been used in analyses of deployment systems conducted in support of the U.S. Army, the Joint Chiefs of Staff and the Office of the Secretary of Defense. Results of analyses have influenced the preparation of long-range plans as well as the formulation of the FY67 Department of Defense budget. The paper gives the background and assumptions of the model, describes the model by means of a simple hypothetical example followed by a selected subset of a complete version, and discusses how the model is used. 相似文献
36.
37.
38.
39.
George Dimitriu 《Small Wars & Insurgencies》2013,24(3):429-458
Rarely has a military commitment led to such intense discussion in the Netherlands as the Task Force Uruzgan (TFU) mission in Afghanistan. In February 2010, the Netherlands' coalition government even collapsed after the two largest parties failed to agree on the withdrawal of Dutch troops from Afghanistan later this year. This article deals first of all with the difficult discussion over the Afghanistan mission of the TFU. The authors then subject three ISAF operations to close scrutiny. The authors provide some suggestions to help understand better this pivotal point in the execution of the whole operation and thus give a fuller picture of the Dutch counterinsurgency approach in Uruzgan. 相似文献
40.