全文获取类型
收费全文 | 384篇 |
免费 | 14篇 |
专业分类
398篇 |
出版年
2021年 | 3篇 |
2020年 | 3篇 |
2019年 | 15篇 |
2018年 | 10篇 |
2017年 | 6篇 |
2016年 | 11篇 |
2015年 | 8篇 |
2014年 | 7篇 |
2013年 | 106篇 |
2011年 | 8篇 |
2009年 | 5篇 |
2008年 | 5篇 |
2007年 | 10篇 |
2006年 | 3篇 |
2005年 | 6篇 |
2004年 | 3篇 |
2003年 | 4篇 |
2002年 | 7篇 |
2001年 | 3篇 |
1999年 | 7篇 |
1998年 | 3篇 |
1997年 | 3篇 |
1996年 | 7篇 |
1995年 | 6篇 |
1994年 | 9篇 |
1993年 | 5篇 |
1992年 | 6篇 |
1991年 | 9篇 |
1990年 | 4篇 |
1989年 | 7篇 |
1988年 | 8篇 |
1987年 | 10篇 |
1986年 | 5篇 |
1985年 | 3篇 |
1984年 | 3篇 |
1983年 | 4篇 |
1982年 | 3篇 |
1981年 | 3篇 |
1980年 | 4篇 |
1979年 | 3篇 |
1978年 | 7篇 |
1975年 | 4篇 |
1974年 | 3篇 |
1973年 | 8篇 |
1972年 | 5篇 |
1971年 | 8篇 |
1970年 | 4篇 |
1968年 | 3篇 |
1967年 | 5篇 |
1966年 | 6篇 |
排序方式: 共有398条查询结果,搜索用时 0 毫秒
91.
We examine the problem of scheduling n jobs with a common due date on a single machine. The processing time of each job is a random variable, which follows an arbitrary distribution with a known mean and a known variance. The machine is not reliable; it is subject to stochastic breakdowns. The objective is to minimize the expected sum of squared deviations of job completion times from the due date. Two versions of the problem are addressed. In the first one the due date is a given constant, whereas in the second one the due date is a decision variable. In each case, a general form of the deterministic equivalent of the stochastic scheduling problem is obtained when the counting process related to the machine uptime distribution is a generalized Poisson process. A sufficient condition is derived under which optimal sequences are V-shaped with respect to mean processing times. Other characterizations of optimal solutions are also established. Based on the optimality properties, algorithms with pseudopolynomial time complexity are proposed to solve both versions of the problem. © 1996 John Wiley & Sons, Inc. 相似文献
92.
We consider the multiperiod lot-sizing problem in which the production yield (the proportion of usable goods) is variable according to a known probability distribution. We review two economic order quantity (EOQ) models for the stationary demand continuous-time problem and derive an EOQ model when the production yield follows a binomial distribution and backlogging of demand is permitted. A dynamic programming algorithm for an arbitrary sequence of demand requirements is presented. Heuristics based on both the EOQ model and appropriate modification of the underlying perfect-yield lot-sizing policies are discussed, and extensive computational evaluation of these heuristics is presented. Two of these heuristics are then modified to include the notion of supply safety stock. The modified heuristics consistently produce near-optimal lot-sizing policies for problems with stationary and time-varying demands. 相似文献
93.
Single- and multi-facility location problems are often solved with iterative computational procedures. Although these procedures have proven to converage, in practice it is desirable to be able to compute a lower bound on the objective function at each iteration. This enables the user to stop the iterative process when the objective function is within a prespecified tolerance of the optimum value. In this article we generalize a new bounding method to include multi-facility problems with lp distances. A proof is given that for Euclidean distance problems the new bounding procedure is superior to two other known methods. Numerical results are given for the three methods. 相似文献
94.
95.
96.
97.
98.
Empirical distance functions are used to estimate actual travel distances in a transportation network, to verify the accuracy of road mileage data, and to formulate continuous location models. In this article we consider the problem of fitting the weighted lp norm to a given network. Mathematical properties are derived for two fitting criteria found in the literature. These properties are used to develop an accurate and efficient methodology to solve for the best-fitting parameter values. The directional bias of the lp norm is analyzed for its effect on the range of search for the optimal p value. Concepts and methodology are applied to a case study of the road system in Southern Ontario. In conclusion, a general framework for other types of distance functions is briefly discussed. 相似文献
99.
A procedure for obtaining a facilities scatter diagram within a rectangular boundary is developed using a multifacility location model. This method gives favorable computational results and has the advantage over other scatter diagram methods of being able to accommodate fixed facility locations. Examples illustrate how this method can be used by a designer/analyst either as a one-step algorithm or iteratively to build a layout. 相似文献
100.
The article considers a two-person zero-sum game in which a searcher with b bombs wishes to destroy a mobile hider. The players are restricted to move on a straight line with maximum speeds v and u satisfying v > u > 0; neither player can see the other but each knows the other's initial position. The bombs all have destructive radius R and there is a time lag T between the release of a bomb and the bomb exploding. The searcher gets 1 unit if the hider is destroyed and 0 if he survives. A solution is given for b = 1, and extended to b > 1 when the time lag is small. Various applications of the game are discussed. 相似文献