全文获取类型
收费全文 | 71篇 |
免费 | 2篇 |
出版年
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年 | 2篇 |
1993年 | 1篇 |
1990年 | 2篇 |
1989年 | 1篇 |
1987年 | 2篇 |
1986年 | 2篇 |
1985年 | 4篇 |
1983年 | 2篇 |
1979年 | 1篇 |
1977年 | 3篇 |
1975年 | 1篇 |
1973年 | 2篇 |
1968年 | 1篇 |
1967年 | 2篇 |
排序方式: 共有73条查询结果,搜索用时 54 毫秒
21.
22.
In this article we introduce a 2‐machine flowshop with processing flexibility. Two processing modes are available for each task: namely, processing by the designated processor, and processing simultaneously by both processors. The objective studied is makespan minimization. This production environment is encountered in repetitive manufacturing shops equipped with processors that have the flexibility to execute orders either individually or in coordination. In the latter case, the product designer exploits processing synergies between two processors so as to execute a particular task much faster than a dedicated processor. This type of flowshop environment is also encountered in labor‐intensive assembly lines where products moving downstream can be processed either in the designated assembly stations or by pulling together the work teams of adjacent stations. This scheduling problem requires determining the mode of operation of each task, and the subsequent scheduling that preserves the flowshop constraints. We show that the problem is ordinary NP‐complete and obtain an optimal solution using a dynamic programming algorithm with considerable computational requirements for medium and large problems. Then, we present a number of dynamic programming relaxations and analyze their worst‐case error performance. Finally, we present a polynomial time heuristic with worst‐case error performance comparable to that of the dynamic programming relaxations. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2004. 相似文献
23.
24.
The problem dealt with in this article is as follows. There are n “demand points” on a sphere. Each demand point has a weight which is a positive constant. A facility must be located so that the maximum of the weighted distances (distances are the shortest arcs on the surface of the sphere) is minimized; this is called the minimax problem. Alternatively, in the maximin problem, the minimum weighted distance is maximized. A setup cost associated with each demand point may be added for generality. It is shown that any maximin problem can be reparametrized into a minimax problem. A method for finding local minimax points is described and conditions under which these are global are derived. Finally, an efficient algorithm for finding the global minimax point is constructed. 相似文献
25.
George C. Canavos 《海军后勤学研究》1983,30(3):465-470
A mean-squared error comparison of smooth empirical Bayes and Bayes estimators for the Weibull and gamma scale parameters is studied based on a computer simulation. The smooth empirical Bayes estimators are determined as functions of up to 15 past estimates of the parameter of interest. Results indicate that at best the mean-squared errors of the empirical Bayes estimators are about 20–40% larger than those of the corresponding squared-error optimal Bayes estimators. 相似文献
26.
The maximum likelihood estimator of the service distribution function of an M/G/∞ service system is obtained based on output time observations. This estimator is useful when observation of the service time of each customer could introduce bias or may be impossible. The maximum likelihood estimator is compared to the estimator proposed by Mark Brown, [2]. Relative to each other, Brown's estimator is useful in light traffic while the maximum likelihood estimator is applicble in heavy trafic. Both estimators are compared to the empirical distribution function based on a sample of service times and are found to have drawbacks although each estimator may have applications in special circumstances. 相似文献
27.
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). 相似文献
28.
29.
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. 相似文献
30.