全文获取类型
收费全文 | 453篇 |
免费 | 17篇 |
出版年
2021年 | 4篇 |
2020年 | 5篇 |
2019年 | 7篇 |
2017年 | 8篇 |
2016年 | 10篇 |
2015年 | 9篇 |
2014年 | 8篇 |
2013年 | 80篇 |
2011年 | 5篇 |
2009年 | 5篇 |
2007年 | 8篇 |
2006年 | 4篇 |
2005年 | 4篇 |
2004年 | 9篇 |
2003年 | 4篇 |
2002年 | 8篇 |
2001年 | 7篇 |
2000年 | 5篇 |
1999年 | 8篇 |
1998年 | 9篇 |
1997年 | 10篇 |
1996年 | 9篇 |
1995年 | 12篇 |
1994年 | 12篇 |
1993年 | 12篇 |
1992年 | 12篇 |
1991年 | 11篇 |
1990年 | 8篇 |
1989年 | 10篇 |
1988年 | 9篇 |
1987年 | 11篇 |
1986年 | 4篇 |
1985年 | 12篇 |
1984年 | 9篇 |
1983年 | 7篇 |
1982年 | 5篇 |
1981年 | 9篇 |
1980年 | 6篇 |
1979年 | 12篇 |
1978年 | 6篇 |
1977年 | 7篇 |
1976年 | 6篇 |
1975年 | 8篇 |
1974年 | 7篇 |
1973年 | 7篇 |
1972年 | 8篇 |
1971年 | 6篇 |
1969年 | 3篇 |
1968年 | 6篇 |
1967年 | 5篇 |
排序方式: 共有470条查询结果,搜索用时 15 毫秒
141.
Without restricting the class of permissible schedules, we derive optimal schedules for economic lot scheduling problems that are fully loaded, have external setups, and have only two products. The fully loaded condition accurately represents certain types of bottlenecks. We show that the optimal schedule must have the Wagner-Whitin property. We also develop a measure of aggregate inventory, derive an optimal steady-state aggregate inventory policy, and provide conditions under which the aggregate inventory level of an optimal schedule must approach a steady state. By restricting the class of permissible schedules to rotation cycle schedules, we extend these results to more than two products. 相似文献
142.
Components in a complex system are usually not structurally identical. However, in many cases we may find components that are structurally symmetric, and one should make use of this additional information to simplify reliability analysis. The main purpose of this article is to define and study one such class of systems, namely, those having symmetric components, and to derive some reliability-related properties. © 1996 John Wiley & Sons, Inc. 相似文献
143.
In this article we present an algorithm for the minimum makespan preemptive open shop, which is superior to existing algorithms in both space and time requirements. We define the more complex generalized open shop and flexible open shop and address the minimum makespan problem on these shops. We show how we can use the algorithm for the minimum makespan open shop to achieve load balancing in simple and generalized open shops without increasing the complexity of the algorithm. Load balancing dictates that the number of busy machines in each period is as even as possible. We also consider preventive maintenance issues in the open shop, and makespan retains its minimum value. In particular we consider the scenario where a machine can be maintained during any period that it happens to be idle. Also we consider the case that a maintenance schedule is prespecified. We show that this problem can be solved via a linear programming formulation that can also take into account release times for the jobs and ready times for the machines. Faster algorithms are presented for open shops with three machines or less. © 1995 John Wiley & Sons, Inc. 相似文献
144.
The purpose of this research is to investigate simulation algorithms for nonhomogeneous Poisson processes with proportional intensities. Two algorithmic approaches are studied: inversion and thinning. Motivated by industrial practices, the covariate vector involved in the simulation is permitted to change after every event (or observation). The algorithms are extended to permit the simulation of general nonhomogeneous Poisson processes with possible discontinuities both in baseline intensity and covariate vector. This latter extension can be used to facilitate a wide range of failure situations that can arise with repairable systems. © 1994 John Wiley & Sons, Inc. 相似文献
145.
We consider server scheduling on parallel dedicated machines to minimize the makespan. Each job has a loading operation and a processing operation. The loading operation requires a server that serves all the jobs. Each machine has a given set of jobs to process, and the processing sequence is known and fixed. We design a polynomial‐time algorithm to solve the two‐machine case of the problem. When the number of machines is arbitrary, the problem becomes strongly NP‐hard even if all the jobs have the same processing length or all the loading operations require a unit time. We design two heuristic algorithms to treat the case where all the loading times are unit and analyze their performance. 相似文献
146.
Thomas C. Bruneau 《Defense & Security Analysis》2018,34(4):345-364
ABSTRACTThe article argues that current conceptual approaches in civil-military relations are deeply flawed resulting in its irrelevance in analyzing major issues including war and the collapse of democracy. After highlighting major flaws in the work of the late Samuel Huntington and those who follow his approach, the article argues that other conceptual approaches, including Security Sector Reform, are also flawed, or in the case of the “military effectiveness” literature, largely irrelevant. In explaining the main causes of the flawed conceptual literature, the article highlights the absence of good data and challenges in methodology. While arguing that military forces are very unlikely to engage in armed combat, it highlights the roles and missions which in the world today are implanted by these forces. As it is virtually impossible to prove effectiveness of the armed forces in these roles and missions, the article proposes a conceptual approach based on requirements. 相似文献
147.
Discrete‐time queues with D‐MAP arrival process are more useful in modeling and performance analysis of telecommunication networks based on the ATM environment. This paper analyzes a finite‐buffer discrete‐time queue with general bulk‐service rule, wherein the arrival process is D‐MAP and service times are arbitrarily and independently distributed. The distributions of buffer contents at various epochs (departure, random, and prearrival) have been obtained using imbedded Markov chain and supplementary variable methods. Finally, some performance measures such as loss probability and average delay are discussed. Numerical results are also presented in some cases. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 345–363, 2003. 相似文献
148.
T.C. Edwin Cheng Qing Ding Mikhail Y. Kovalyov Aleksander Bachman Adam Janiak 《海军后勤学研究》2003,50(6):531-554
We study the problems of scheduling a set of nonpreemptive jobs on a single or multiple machines without idle times where the processing time of a job is a piecewise linear nonincreasing function of its start time. The objectives are the minimization of makespan and minimization of total job completion time. The single machine problems are proved to be NP‐hard, and some properties of their optimal solutions are established. A pseudopolynomial time algorithm is constructed for makespan minimization. Several heuristics are derived for both total completion time and makespan minimization. Computational experiments are conducted to evaluate their efficiency. NP‐hardness proofs and polynomial time algorithms are presented for some special cases of the parallel machine problems. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 531–554, 2003 相似文献
149.
A problem often arising in applied linear regression modeling is determining the appropriate weight to attach to each observation. In the extreme, the problem extends to the deletion of observations from a data base. Since the choice of weights, fitting criteria, and estimation procedure depend on the specific objectives of the modeling, universally applicable guidelines are virtually nonexistent. However, the sensitivity of analytic conclusions to weights assigned to “suspect” observations can be conveniently assessed using a graphical display. This report develops such a display based on a modeling of outliers which leads naturally to estimators based on a weighted least-squares criterion, and a data-analytic method for determining how much downweighting to impose on a specific subset of observations. This technique is illustrated with several examples, including one relating air pollution to human mortality. 相似文献
150.
In this article we present and test two heuristics for the economic lot scheduling problem. The first heuristic was developed by one of us (P.C. Geng) during Ph.D. research, while the other is a convergent implementation of an algorithm due to Doll and Whybark. We study the performance of these heuristics on a large set of test problems constructed using a new form of problem generation that yields random problems within an experimental design. 相似文献