全文获取类型
收费全文 | 375篇 |
免费 | 6篇 |
出版年
2021年 | 7篇 |
2019年 | 7篇 |
2018年 | 4篇 |
2017年 | 3篇 |
2016年 | 7篇 |
2015年 | 2篇 |
2014年 | 5篇 |
2013年 | 55篇 |
2012年 | 3篇 |
2009年 | 4篇 |
2007年 | 12篇 |
2005年 | 2篇 |
2004年 | 3篇 |
2003年 | 8篇 |
2002年 | 6篇 |
2001年 | 2篇 |
2000年 | 5篇 |
1999年 | 3篇 |
1998年 | 8篇 |
1997年 | 9篇 |
1996年 | 9篇 |
1995年 | 3篇 |
1994年 | 6篇 |
1993年 | 11篇 |
1992年 | 7篇 |
1991年 | 9篇 |
1990年 | 10篇 |
1989年 | 17篇 |
1988年 | 14篇 |
1987年 | 7篇 |
1986年 | 13篇 |
1985年 | 7篇 |
1984年 | 4篇 |
1983年 | 3篇 |
1982年 | 11篇 |
1981年 | 6篇 |
1980年 | 7篇 |
1979年 | 9篇 |
1978年 | 8篇 |
1977年 | 5篇 |
1976年 | 5篇 |
1975年 | 4篇 |
1974年 | 8篇 |
1973年 | 5篇 |
1972年 | 3篇 |
1971年 | 7篇 |
1970年 | 6篇 |
1969年 | 5篇 |
1967年 | 5篇 |
1948年 | 4篇 |
排序方式: 共有381条查询结果,搜索用时 15 毫秒
51.
Hakimi has considered the problem of finding an optimal location for a single service center, such as a hospital or a police station. He used a graph theoretic model to represent the region being serviced. The communities are represented by the nodes while the road network is represented by the ares of the graph. In his work, the objective is one of minimizing the maximum of the shortest distances between the vertices and the service center. In the present work, the region being serviced is represented by a convex polygon and communities are spread over the entire region. The objective is to minimize the maximum of Euclidian distances between the service center and any point in the polygon. Two methods of solution presented are (i) a geometric method, and (ii) a quadratic programming formulation. Of these, the geometric method is simpler and more efficient. It is seen that for a class of problems, the geometric method is well suited and very efficient while the graph theoretic method, in general, will give only approximate solutions in spite of the increased efforts involved. But, for a different class of problems, the graph theoretic approach will be more appropriate while the geometric method will provide only approximate solutions though with ease. Finally, some feasible applications of importance are outlined and a few meaningful extensions are indicated. 相似文献
52.
R.E. Lillo 《海军后勤学研究》2001,48(3):201-209
An optimal operating policy is characterized for the infinite‐horizon average‐cost case of a single server queueing control problem. The server may be turned on at arrival epochs or off at departure epochs. Two classes of customers, each of them arriving according to an independent Poisson processes, are considered. An arriving 1‐customer enters the system if the server is turned on upon his arrival, or if the server is on and idle. In the former case, the 1‐customer is selected for service ahead of those customers waiting in the system; otherwise he leaves the system immediately. 2‐Customers remain in the system until they complete their service requirements. Under a linear cost structure, this paper shows that a stationary optimal policy exists such that either (1) leaves the server on at all times, or (2) turns the server off when the system is empty. In the latter case, we show that the stationary optimal policy is a threshold strategy, this feature being commonplace in most of priority queueing systems and inventory models. However, the optimal policy in our model is determined by two thresholds instead of one. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 201–209, 2001 相似文献
53.
This paper studies a queueing system with a Markov arrival process with marked arrivals and PH‐distribution service times for each type of customer. Customers (regardless of their types) are served on a mixed first‐come‐first‐served (FCFS) and last‐come‐first‐served (LCFS) nonpreemptive basis. That is, when the queue length is N (a positive integer) or less, customers are served on an FCFS basis; otherwise, customers are served on an LCFS basis. The focus is on the stationary distribution of queue strings, busy periods, and waiting times of individual types of customers. A computational approach is developed for computing the stationary distribution of queue strings, the mean of busy period, and the means and variances of waiting times. The relationship between these performance measures and the threshold number N is analyzed in depth numerically. It is found that the variance of the virtual (actual) waiting time of an arbitrary customer can be reduced by increasing N. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 399–421, 2000 相似文献
54.
In this paper, two different kinds of (N, T)‐policies for an M/M/m queueing system are studied. The system operates only intermittently and is shut down when no customers are present any more. A fixed setup cost of K > 0 is incurred each time the system is reopened. Also, a holding cost of h > 0 per unit time is incurred for each customer present. The two (N, T)‐policies studied for this queueing system with cost structures are as follows: (1) The system is reactivated as soon as N customers are present or the waiting time of the leading customer reaches a predefined time T, and (2) the system is reactivated as soon as N customers are present or the time units after the end of the last busy period reaches a predefined time T. The equations satisfied by the optimal policy (N*, T*) for minimizing the long‐run average cost per unit time in both cases are obtained. Particularly, we obtain the explicit optimal joint policy (N*, T*) and optimal objective value for the case of a single server, the explicit optimal policy N* and optimal objective value for the case of multiple servers when only predefined customers number N is measured, and the explicit optimal policy T* and optimal objective value for the case of multiple servers when only predefined time units T is measured, respectively. These results partly extend (1) the classic N or T policy to a more practical (N, T)‐policy and (2) the conclusions obtained for single server system to a system consisting of m (m ≥ 1) servers. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 240–258, 2000 相似文献
55.
Kenneth R. Baker 《海军后勤学研究》1999,46(8):978-991
This paper examines heuristic solution procedures for scheduling jobs on a single machine to minimize the maximum lateness in the presence of setup times between different job families. It reviews the state of knowledge about the solution of this problem, which is known to be difficult to solve in general, and examines natural solution approaches derived from some of the underlying theory. The emphasis is on the design and computational evaluation of new heuristic procedures. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 978–991, 1999 相似文献
56.
The Joint Replenishment Problem (JRP) involves production planning for a family of items. The items have a coordinated cost structure whereby a major setup cost is incurred whenever any item in the family is produced, and an item-specific minor setup cost is incurred whenever that item is produced. This paper investigates the performance of two types of cyclical production schedules for the JRP with dynamic demands over a finite planning horizon. The cyclical schedules considered are: (1) general cyclical schedules—schedules where the number of periods between successive production runs for any item is constant over the planning horizon—and (2) power-of-two schedules—a subset of cyclical schedules for which the number of periods between successive setups must be a power of 2. The paper evaluates the additional cost incurred by requiring schedules to be cyclical, and identifies problem characteristics that have a significant effect on this additional cost. © 1997 John Wiley & Sons, Inc. Naval Research Logistics 44: 577–589, 1997. 相似文献
57.
In this article we try to identify appropriate solution procedures for different types of multiechelon production planning problems. We conduct an extensive computational study on uncapacitated multiechelon production planning problems with serial and assembly types of bill-of-material structures. Problems are formulated as both single-source fixed charge network problems and as multicommodity flow problems with fixed charges. Solution procedures considered are branch and cut, Lagrangean relaxation (for the network formulation), and branch and bound (for the multicommodity formulation). Three hundred problems with various problem structures are tested. Our conclusions suggest the best approach for each type of problem structure. © 1997 John Wiley & Sons, Inc. 相似文献
58.
The provision of Military Assistance to the Civil Powers (MACP) encapsulates the traditional approach towards countering terrorism on the British mainland, which emphasises minimum force, proportionality, police primacy and the rule of law, with the military retained as a supporting instrument, being employed only as a measure of last resort. Recent terrorist incidents in major urban centres do, however, question the effectiveness of these established methods. This analysis initially codifies the conceptual issues that underscore the tensions between civil policing and military anti-terrorist approaches in the UK, and proceeds to evaluate and compare a number of operations that indicate the nature of the challenges facing the MACP apparatus. In particular, potential shortcomings in the MACP provisions are identified in the form of threat perception and deployment and enforcement gaps. The assessment finds that there are facets of MACP that are of enduring relevance in the current era, yet a continuing need persists to reconcile police and military imperatives toward serious civil disorder contingencies and conditions of emergency. 相似文献
59.
State‐level newborn screening allows for early treatment of genetic disorders, which can substantially improve health outcomes for newborns. As the cost of genetic testing decreases, it is becoming an essential part of newborn screening. A genetic disorder can be caused by many mutation variants; therefore, an important decision is to determine which variants to search for (ie, the panel design), under a testing budget. The frequency of variants that cause a disorder and the incidence of the disorder vary by racial/ethnic group. Consequently, it is important to consider equity issues in panel design, so as to reduce disparities among different groups. We study the panel design problem using cystic fibrosis (CF) as a model disorder, considering the trade‐offs between equity and accuracy, under a limited budget. Most states use a genetic test in their CF screening protocol, but panel designs vary, and, due to cost, no state's panel includes all CF‐causing variants. We develop models that design equitable genetic testing panels, and compare them with panels that maximize sensitivity in the general population. Our case study, based on realistic CF data, highlights the value of equitable panels and provides important insight for newborn screening practices. 相似文献
60.
Studies on ballistic penetration to laminates is complicated, but important for design effective protection of structures. Experimental means of study is expensive and can often be dangerous. Numerical simu-lation has been an excellent supplement, but the computation is time-consuming. Main aim of this thesis was to develop and test an effective tool for real-time prediction of projectile penetrations to laminates by training a neural network and a decision tree regression model. A large number of finite element models were developed;the residual velocities of projectiles fromfinite element simulations were used as the target data and processed to produce sufficient number of training samples. Study focused on steel 4340tpolyurea laminates with various configurations. Four different 3D shapes of the projectiles were modeled and used in the training. The trained neural network and decision tree model was tested using independently generated test samples using finite element models. The predicted projectile velocity values using the trained machine learning models are then compared with thefinite element simulation to verify the effectiveness of the models. Additionally, both models were trained using a published experimental data of projectile impacts to predict residual velocity of projectiles for the unseen samples. Performance of both the models was evaluated and compared. Models trained with Finite element simulation data samples were found capable to give more accurate predication, compared to the models trained with experimental data, becausefinite element modeling can generate much larger training set, and thus finite element solvers can serve as an excellent teacher. This study also showed that neural network model performs better with small experimental dataset compared to decision tree regression model. 相似文献