全文获取类型
收费全文 | 158篇 |
免费 | 4篇 |
出版年
2021年 | 2篇 |
2020年 | 1篇 |
2019年 | 2篇 |
2018年 | 1篇 |
2017年 | 2篇 |
2016年 | 3篇 |
2015年 | 1篇 |
2013年 | 33篇 |
2012年 | 1篇 |
2009年 | 2篇 |
2008年 | 1篇 |
2007年 | 4篇 |
2006年 | 1篇 |
2005年 | 1篇 |
2004年 | 1篇 |
2003年 | 1篇 |
2002年 | 5篇 |
1999年 | 3篇 |
1998年 | 2篇 |
1996年 | 4篇 |
1995年 | 3篇 |
1994年 | 3篇 |
1993年 | 3篇 |
1992年 | 4篇 |
1991年 | 6篇 |
1990年 | 2篇 |
1989年 | 3篇 |
1988年 | 4篇 |
1987年 | 6篇 |
1986年 | 4篇 |
1985年 | 2篇 |
1984年 | 2篇 |
1983年 | 1篇 |
1982年 | 3篇 |
1981年 | 2篇 |
1980年 | 4篇 |
1979年 | 1篇 |
1978年 | 6篇 |
1976年 | 1篇 |
1975年 | 2篇 |
1974年 | 2篇 |
1973年 | 6篇 |
1972年 | 1篇 |
1971年 | 6篇 |
1970年 | 2篇 |
1969年 | 1篇 |
1968年 | 1篇 |
1967年 | 4篇 |
1966年 | 5篇 |
1949年 | 1篇 |
排序方式: 共有162条查询结果,搜索用时 15 毫秒
131.
In this article we present an approach to determine the initially unspecified weights in an additive measurable multiattribute value function. We formulate and solve a series of nonlinear programming problems which (1) incorporate whatever partial information concerning the attribute weights or overall relative value of alternatives the decision maker chooses to provide, yet (2) yield a specific set of weights as a result. Although each formulation is rather easily solved using the nonlinear programming software GINO (general interactive optimizer), solutions in closed form dependent on a single parameter are also provided for a number of these problems. 相似文献
132.
Theodore F. Figinski 《Defence and Peace Economics》2019,30(2):213-226
This study examines whether completed service in the military reserves results in a civilian labor market benefit. Reservists are not completely absent from the civilian labor market during their military service, possibly allowing them to receive the benefits associated with military experience without forgoing valuable civilian labor market experience. Using a resume study, the results suggest that completed service in the military reserves, relative to no military experience, increases the probability of receiving a request for an interview by 19%. 相似文献
133.
Put-to-light order picking systems invert the basic logic of conventional picker-to-parts systems. Instead of successively visiting the storage positions of the stock keeping units (SKUs) when collecting picking orders, an order picker accompanies successive bins each containing multiple items of a specific SKU along a lane of subsequent orders. Whenever the picker passes an order requiring the current SKU, which is indicated by a light signal, she puts the requested number of items into the bin associated with the order. Such an order picking system is well-suited if the assortment is not overly large and all orders demand similar SKUs, so that it is mainly applied in distribution centers of brick-and-mortar retail chains. This paper evaluates four different setups of put-to-light systems, which, during operations, require the solution of different storage assignment and SKU sequencing problems. We formulate these problems, prove computational complexity, and suggest suited solution algorithms. By applying these algorithms in a comprehensive computational study, we benchmark the impact of the four different setups on picking performance. In this way, warehouse managers receive decision support on how to set up their put-to-light systems. 相似文献
134.
135.
This article presents research designed to aid firms who assemble many components into a final product. We assume that purchase quantities are fixed, and that all parts and components are assembled at one stage in a short time. Demand for the final product is represented by a stationary independent and identically distributed random variable; and unmet demand is backordered. Ordering is done on a periodic review basis. We develop infinite horizon, approximate expected cost, and expected service level functions, and we present an algorithm for finding approximately minimum cost reorder points for each part subject to a service level constraint. Extensive results on the accuracy of the approximations are presented. Due to the size of the problem, we present only limited results on the performance of the optimization algorithm. 相似文献
136.
The bilevel programming problem (BLPP) is an example of a two-stage, noncooperative game in which the first player can influence but not control the actions of the second. This article addresses the linear formulation and presents a new algorithm for solving the zero-one case. We begin by converting the leader's objective function into a parameterized constraint, and then attempt to solve the resultant problem. This produces a candidate solution that is used to find a point in the BLPP feasible reagion. Incremental improvements are sought, which ultimately lead to a global optimum. An example is presented to highlight the computations and to demonstrate some basic characteristics of the solution. Computational experience indicates that the algorithm is capable of solving problems with up to 50 variables in a reasonable amount of time. 相似文献
137.
An empirical Bayes estimator is given for the scale parameter in the two-parameter Weibull distribution. The scale parameter is assumed to vary randomly throughout a sequence of experiments according to a common, but unknown, prior distribution. The shape parameter is assumed to be known, however, it may be different in each experiment. The estimator is obtained by means of a continuous approximation to the unknown prior density function. Results from Monte Carlo simulation are reported which show that the estimator has smaller mean-squared errors than the usual maximum-likelihood estimator. 相似文献
138.
This paper develops estimates of true volunteer levels for 1972 and 1973, based on experience gained through 1970 draft lottery data. The paper also formulates estimates of the qualitative characteristics of a 1972-1973 Navy volunteer force, and establishes a relationship between rate of volunteerism and military pay. Utilizing estimates generated in the paper, Navy military personnel budget requirements for FY '72 and '73 are presented. 相似文献
139.
This paper presents a method of selecting design parameters which optimizes a specific measure (aircraft design example: minimum weight, maximum mission effectiveness) and guarantees designated levels of response in specified areas (such as combal ceiling, acceleration time). The method employs direct search optimization applied to a nonlinear functional constrained by nonlinear surfaces. The composite design technique is combined with regression methods to determine adequate surface representations with a minimum of required data points. A sensitivity analysis is conducted at the optimum set of design parameters to test for uniqueness. 相似文献
140.