全文获取类型
收费全文 | 153篇 |
免费 | 5篇 |
出版年
2019年 | 5篇 |
2018年 | 8篇 |
2017年 | 3篇 |
2016年 | 3篇 |
2015年 | 4篇 |
2014年 | 5篇 |
2013年 | 32篇 |
2012年 | 2篇 |
2011年 | 2篇 |
2010年 | 1篇 |
2009年 | 4篇 |
2005年 | 1篇 |
2004年 | 2篇 |
2003年 | 6篇 |
2002年 | 2篇 |
2001年 | 2篇 |
2000年 | 4篇 |
1999年 | 1篇 |
1998年 | 1篇 |
1997年 | 3篇 |
1996年 | 1篇 |
1995年 | 2篇 |
1994年 | 2篇 |
1993年 | 4篇 |
1992年 | 1篇 |
1991年 | 1篇 |
1990年 | 2篇 |
1988年 | 1篇 |
1986年 | 5篇 |
1985年 | 2篇 |
1984年 | 2篇 |
1983年 | 3篇 |
1981年 | 1篇 |
1980年 | 2篇 |
1979年 | 3篇 |
1978年 | 1篇 |
1977年 | 1篇 |
1976年 | 3篇 |
1975年 | 2篇 |
1974年 | 6篇 |
1973年 | 2篇 |
1972年 | 4篇 |
1971年 | 4篇 |
1970年 | 3篇 |
1969年 | 4篇 |
1968年 | 3篇 |
1966年 | 1篇 |
1948年 | 1篇 |
排序方式: 共有158条查询结果,搜索用时 62 毫秒
81.
Existing theory on counterinsurgency does not adequately explain persistent insurrection in face of the reconstruction work currently underway in Afghanistan and Iraq. We starkly depart from the literature by developing a simple model of reconstruction allowing misalignment of occupier spending with community preferences. Insurgency arises endogenously as a result of the mix of spending rather than its level. Occupier insistence on its preferred path of reconstruction may lead to fewer projects of any kind being completed. In equilibrium, the occupier may accept an endogenous insurgency to achieve a preferred project mix, or be constrained in its choice even when no insurgency occurs. 相似文献
82.
A single machine scheduling problem in which both the processing times and due-dates of the jobs awaiting servicing are random variables is analyzed. It is proved that the properties of the shortest processing time rule and the due-date rule which are known for the deterministic situation also hold in the probabilistic environment when they are suitably, and reasonably, refined for this context. 相似文献
83.
The MAD model presents a mathematic treatment of the relationship between aircraft reliability and maintainability, system manning and inspection policies, scheduling and sortie length, and aircraft downtime. Log normal distributions are postulated for subsystem repair times and simultaneous repair of malfunctions is assumed. The aircraft downtime for maintenance is computed with the distribution of the largest of k log normal distributions. Waiting time for maintenance men is calculated either by using a multiple-channel queuing model or by generating the distribution of the number of maintenance men required and comparing this to the number of men available to determine the probability of waiting at each inspection. 相似文献
84.
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. 相似文献
85.
86.
87.
88.
In this paper we consider a practical scheduling problem commonly arising from batch production in a flexible manufacturing environment. Different part‐types are to be produced in a flexible manufacturing cell organized into a two‐stage production line. The jobs are processed in batches on the first machine, and the completion time of a job is defined as the completion time of the batch containing it. When processing of all jobs in a batch is completed on the first machine, the whole batch of jobs is transferred intact to the second machine. A constant setup time is incurred whenever a batch is formed on any machine. The tradeoff between the setup times and batch processing times gives rise to the batch composition decision. The problem is to find the optimal batch composition and the optimal schedule of the batches so that the makespan is minimized. The problem is shown to be strongly NP‐hard. We identify some special cases by introducing their corresponding solution methods. Heuristic algorithms are also proposed to derive approximate solutions. We conduct computational experiments to study the effectiveness of the proposed heuristics. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 128–144, 2000 相似文献
89.
The well‐known generalized assignment problem (GAP) involves the identification of a minimum‐cost assignment of tasks to agents when each agent is constrained by a resource in limited supply. The multi‐resource generalized assignment problem (MRGAP) is the generalization of the GAP in which there are a number of different potentially constraining resources associated with each agent. This paper explores heuristic procedures for the MRGAP. We first define a three‐phase heuristic which seeks to construct a feasible solution to MRGAP and then systematically attempts to improve the solution. We then propose a modification of the heuristic for the MRGAP defined previously by Gavish and Pirkul. The third procedure is a hybrid heuristic that combines the first two heuristics, thus capturing their relative strengths. We discuss extensive computational experience with the heuristics. The hybrid procedure is seen to be extremely effective in solving MRGAPs, generating feasible solutions to more than 99% of the test problems and consistently producing near‐optimal solutions. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 468–483, 2001 相似文献
90.
This paper is concerned with the joint prior distribution of the dependent reliabilities of the components of a binary system. When this distribution is MTP2 (Multivariate Totally Positive of Order 2), it is shown in general that this actually makes the machinery of Natvig and Eide [7] available to arrive at the posterior distribution of the system's reliability, based on data both at the component and system level. As an illustration in a common environmental stress case, the joint prior distribution of the reliabilities is shown to have the MTP2 property. We also show, similarly to Gåsemyr and Natvig [3], for the case of independent components given component reliabilities how this joint prior distribution may be based on the combination of expert opinions. A specific system is finally treated numerically. © 1997 John Wiley & Sons, Inc. Naval Research Logistics 44: 741–755, 1997 相似文献