全文获取类型
收费全文 | 893篇 |
免费 | 21篇 |
出版年
2021年 | 14篇 |
2019年 | 29篇 |
2018年 | 19篇 |
2017年 | 20篇 |
2016年 | 20篇 |
2015年 | 20篇 |
2014年 | 11篇 |
2013年 | 166篇 |
2011年 | 8篇 |
2009年 | 9篇 |
2008年 | 8篇 |
2007年 | 11篇 |
2006年 | 11篇 |
2005年 | 15篇 |
2004年 | 16篇 |
2003年 | 10篇 |
2002年 | 8篇 |
2000年 | 14篇 |
1999年 | 10篇 |
1998年 | 12篇 |
1997年 | 24篇 |
1996年 | 19篇 |
1994年 | 18篇 |
1993年 | 7篇 |
1992年 | 11篇 |
1991年 | 22篇 |
1990年 | 12篇 |
1989年 | 19篇 |
1988年 | 12篇 |
1987年 | 21篇 |
1986年 | 16篇 |
1985年 | 16篇 |
1984年 | 12篇 |
1983年 | 15篇 |
1982年 | 13篇 |
1981年 | 13篇 |
1980年 | 16篇 |
1979年 | 17篇 |
1978年 | 14篇 |
1977年 | 15篇 |
1976年 | 14篇 |
1975年 | 12篇 |
1974年 | 18篇 |
1973年 | 18篇 |
1972年 | 15篇 |
1971年 | 19篇 |
1970年 | 9篇 |
1969年 | 11篇 |
1968年 | 10篇 |
1967年 | 8篇 |
排序方式: 共有914条查询结果,搜索用时 15 毫秒
781.
An algorithm for determining the optimal, unidirectional flow path for an automated guided vehicle system with a given facility layout is presented. The problem is formulated as an integer program. The objective is to minimize the total distance traveled by vehicles subject to the constraint that the resulting network consists of a single strongly connected component. A specialized branch-and-bound solution procedure is discussed in detail. 相似文献
782.
We examine the static sequencing problem of ordering the processing of jobs on a single machine so as to minimize the average weighted flow time. It is assumed that all jobs have zero ready times, and that the jobs are grouped into classes with the property that setup tasks are only required when processing switches from jobs of one class to jobs of another class. The time required for each setup task is given by the sum of a setdown time from the previous class and a setup time for the new class. We show that an algorithm presented in the literature for solving a special case of this problem gives suboptimal solutions. A number of properties of the optimal solution are derived, and their use in algorithms is evaluated. Computational results are presented for both a branch-and-bound procedure and a simpler depth-first search. 相似文献
783.
Bounds for P(X + X ⩽ k2σ) are given where X1 and X2 are independent normal variables having zero means and variances σ, σ, respectively. This is generalized when X1 and X2 are dependent variables with known covariance matrix. 相似文献
784.
785.
786.
Traditional inventory systems treat all demands of a given item equally. This approach is optimal if the penalty costs of all customers are the same, but it is not optimal if the penalty costs are different for different customer classes. Then, demands of customers with high penalty costs must be filled before demands of customers with low penalty costs. A commonly used inventory policy for dealing with demands with different penalty costs is the critical level inventory policy. Under this policy demands with low penalty costs are filled as long as inventory is above a certain critical level. If the inventory reaches the critical level, only demands with high penalty costs are filled and demands with low penalty costs are backordered. In this article, we consider a critical level policy for a periodic review inventory system with two demand classes. Because traditional approaches cannot be used to find the optimal parameters of the policy, we use a multidimensional Markov chain to model the inventory system. We use a sample path approach to prove several properties of this inventory system. Although the cost function is not convex, we can build on these properties to develop an optimization approach that finds the optimal solution. We also present some numerical results. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008 相似文献
787.
Gary M. Thompson 《海军后勤学研究》1997,44(8):719-740
The problems of labor staffing and scheduling have received substantial attention in the literature. We introduce two new models of the labor staffing and scheduling problems that avoid the limitations of existing models. Collectively, the models have five important attributes. First, both models ensure the delivery of a minimally acceptable level of service in all periods. Second, one model can identify the least expensive way of delivering a specified aggregate level of customer service (the labor staffing problem and a form of labor scheduling problem). Third, the other model can identify the highest level of service attainable with a fixed amount of labor (the other form of the labor scheduling problem). Fourth, the models enable managers to identify the pareto relationship between labor costs and customer service. Fifth, the models allow a degree of control over service levels that is unattainable with existing models. Because of these attributes, which existing models largely do not possess, we expect these models to have broad applicability in a wide range of organizations operating in both competitive and noncompetitive environments. © 1997 John Wiley & Sons, Inc. Naval Research Logistics 44: 719–740, 1997 相似文献
788.
A unified treatment is given for a class of discrete distributions derived by compounding a bivariate Poisson with a bivariate discrete or continuous distribution. Using generating functions a number of interesting results are obtained for probabilities, moments, cumulants, factorial moments, and factorial cumulants. Conditional distributions and regression functions are also examined. Five illustrative examples are presented in detail. © 1994 John Wiley & Sons, Inc. 相似文献
789.
In this article we study the problem of scheduling independent tasks, each of which requires the simultaneous availability of a set of prespecified processors, with the objective of minimizing the maximum completion time. We propose a graph-theoretical approach and identify a class of polynomial instances, corresponding to comparability graphs. We show that the scheduling problem is polynomially equivalent to the problem of extending a graph to a comparability graph whose maximum weighted clique has minimum weight. Using this formulation we show that in some cases it is possible to decompose the problem according to the canonical decomposition of the graph. Finally, a general solution procedure is given that includes a branch-and-bound algorithm for the solution of subproblems which can be neither decomposed nor solved in polynomial time. Some examples and computational results are presented. © 1994 John Wiley & Sons, Inc. 相似文献
790.
This article generalizes the model for the economic design of x̄-control charts of Duncan [4], starting from the more recent papers of Lorenzen and Vance [8] and Banerjee and Rahim [3]. The classical model of Duncan [4] and its several extensions including the unified model of Lorenzen and Vance [8] assumed exponentially distributed in-control periods and provided uniform sampling schemes. Banerjee and Rahim [3], however, assumed a Weibull-distributed in-control period having an increasing failure rate and used variable sampling intervals. The present article is an extension of the work of Banerjee and Rahim [3], where a general distribution of in-control periods having an increasing failure rate is assumed and the possibility of age-dependent repair before failure is considered. Several different truncated and nontruncated probability models are chosen. It is proposed that economic benefits can be achieved by adopting a nonuniform inspection scheme and by truncating a production cycle when it attains a certain age. Numerical examples are presented to support this proposition. Finally, the effect of model specification in the choice of failure mechanism is investigated. © 1993 John Wiley & Sons, Inc. 相似文献