全文获取类型
收费全文 | 471篇 |
免费 | 10篇 |
出版年
2021年 | 5篇 |
2019年 | 13篇 |
2018年 | 9篇 |
2017年 | 11篇 |
2016年 | 9篇 |
2015年 | 10篇 |
2013年 | 78篇 |
2011年 | 5篇 |
2010年 | 6篇 |
2009年 | 4篇 |
2007年 | 6篇 |
2006年 | 7篇 |
2005年 | 11篇 |
2004年 | 8篇 |
2003年 | 5篇 |
2001年 | 4篇 |
2000年 | 9篇 |
1999年 | 6篇 |
1998年 | 5篇 |
1997年 | 9篇 |
1996年 | 12篇 |
1995年 | 4篇 |
1994年 | 10篇 |
1993年 | 6篇 |
1992年 | 7篇 |
1991年 | 14篇 |
1990年 | 8篇 |
1989年 | 12篇 |
1988年 | 6篇 |
1987年 | 11篇 |
1986年 | 9篇 |
1985年 | 12篇 |
1984年 | 9篇 |
1983年 | 7篇 |
1982年 | 6篇 |
1981年 | 8篇 |
1980年 | 10篇 |
1979年 | 7篇 |
1978年 | 8篇 |
1977年 | 8篇 |
1976年 | 9篇 |
1975年 | 6篇 |
1974年 | 11篇 |
1973年 | 8篇 |
1972年 | 9篇 |
1971年 | 13篇 |
1970年 | 3篇 |
1969年 | 6篇 |
1968年 | 5篇 |
1967年 | 3篇 |
排序方式: 共有481条查询结果,搜索用时 15 毫秒
411.
In this article we consider the single period procurement strategy for an item with uncertainty in its demand and uncertainty in the capacity of the supplier. Dedicated capacity can be ensured by paying a premium charge to the supplier. The other decision variable is the replenishment quantity to request. It turns out to be very easy to select the best value of this latter quantity. On the other hand, we are only able to characterize the general behavior of the expected profit as a function of the level of dedicated capacity. In general, there can be multiple local maxima as a function of the dedicated capacity. However, for the special, but important, case of normally distributed demand, normally distributed capacity and a linear cost for reserving capacity, an algorithm is developed for finding the best level of dedicated capacity. Some preliminary insights regarding the extension to multiple periods are presented. © 1995 John Wiley & Sons, Inc. 相似文献
412.
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. 相似文献
413.
Michael A. Trick 《海军后勤学研究》1992,39(2):137-151
We examine the basis structure of the linear relaxation of the generalized assignment problem. The basis gives a surprising amount of information. This leads to a very simple heuristic that uses only generalized network optimization codes. Lower bounds can be generated by cut generation, where the violated inequalities are found directly from the relaxation basis. An improvement heuristic with the same flavor is also presented. 相似文献
414.
We present a branch‐and‐price technique for optimal staff scheduling with multiple rest breaks, meal break, and break windows. We devise and implement specialized branching rules suitable for solving the set covering type formulation implicitly, using column generation. Our methodology is more widely applicable and computationally superior to the alternative methods in the literature. We tested our methodology on 365 test problems involving between 1728 and 86400 shift variations, and 20 demand patterns. In a direct comparison with an alternative method, our approach yields significant improvements both in cpu time and in the number of problem instances solved to optimality. The improvements were particularly marked for problems involving larger numbers of feasible shifts. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 185–200, 2000 相似文献
415.
416.
The problem of minimal-cost operation of a fleet of ships carrying a specific amount of bulk cargo from several origin ports to several destination ports during a specified time interval is examined. The fuel oil cost, a major component of the total operating cost, is realistically modeled as a nonlinear function of the vessels' operating speeds. Introduction of both full load and ballast speeds as independent variables results in a nonlinear optimization problem in which the vessels' allocation to the available routes and the optimal speed selection problem are coupled. Within the framework of our model, each vessel of the fleet may load at any origin, unload at a destination and return to the same origin. The solution method developed utilizes specific features of the above fleet deployment model, and may reduce substantially the dimensionality of the problem. Under certain conditions, decoupling of the speed selection from the vessel allocation problem can be achieved, and linear programming can be used to obtain an optimal solution. In the general case, a projected Lagrangian method appears to be more appropriate for the problem under consideration. 相似文献
417.
This article studies a maintenance problem that is applicable for multidivision organizations on lessee-lessor relationships. It is assumed that the parties sign a contract for a fixed time period. Within the period, the lessor is allowed to use the equipment supplied by the lessee. The availability of the equipment that may suffer from breakdown depends on the preventive maintenance policy adopted by the lessor. The properties of this policy as well as other features of the problem are analyzed using a one-period model that takes into account the economic value of the contract as perceived by the lessor and the lessee. The optimal contracting arrangements are analyzed from the perspective of efficient risk sharing and incentive provisions. 相似文献
418.
When solving location problems in practice it is quite common to aggregate demand points into centroids. Solving a location problem with aggregated demand data is computationally easier, but the aggregation process introduces error. We develop theory and algorithms for certain types of centroid aggregations for rectilinear 1‐median problems. The objective is to construct an aggregation that minimizes the maximum aggregation error. We focus on row‐column aggregations, and make use of aggregation results for 1‐median problems on the line to do aggregation for 1‐median problems in the plane. The aggregations developed for the 1‐median problem are then used to construct approximate n‐median problems. We test the theory computationally on n‐median problems (n ≥ 1) using both randomly generated, as well as real, data. Every error measure we consider can be well approximated by some power function in the number of aggregate demand points. Each such function exhibits decreasing returns to scale. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 614–637, 2003. 相似文献
419.
Block replacement and modified block replacement policies for two‐component systems with failure dependence and economic dependence are considered in this paper. Opportunistic maintenance policies are also considered. Where tractable, long‐run costs per unit time are calculated using renewal theory based arguments; otherwise simulation studies are carried out. The management implications for the adoption of the various policies are discussed. The usefulness of the results in the paper is illustrated through application to a particular two‐component system. © 2002 Wiley Periodicals, Inc. Naval Research Logistics, 2003 相似文献
420.
In this article, we consider a single machine scheduling problem, in which identical jobs are split into batches of bounded sizes. For each batch, it is allowed to produce less jobs than a given upper bound, that is, some jobs in a batch can be rejected, in which case a penalty is paid for each rejected job. The objective function is the sum of several components, including the sum of the completion times, total delivery cost, and total rejection cost. We reduce this problem to a min‐cost flow problem with a convex quadratic function and adapt Tamir's algorithm for its solution. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 217–224, 2017 相似文献