全文获取类型
收费全文 | 640篇 |
免费 | 11篇 |
专业分类
651篇 |
出版年
2021年 | 11篇 |
2019年 | 15篇 |
2018年 | 9篇 |
2017年 | 7篇 |
2016年 | 9篇 |
2015年 | 5篇 |
2014年 | 9篇 |
2013年 | 101篇 |
2010年 | 5篇 |
2009年 | 7篇 |
2008年 | 7篇 |
2007年 | 14篇 |
2004年 | 9篇 |
2003年 | 11篇 |
2002年 | 9篇 |
2001年 | 6篇 |
2000年 | 7篇 |
1998年 | 12篇 |
1997年 | 12篇 |
1996年 | 17篇 |
1995年 | 6篇 |
1994年 | 8篇 |
1993年 | 13篇 |
1992年 | 12篇 |
1991年 | 14篇 |
1990年 | 12篇 |
1989年 | 25篇 |
1988年 | 22篇 |
1987年 | 14篇 |
1986年 | 19篇 |
1985年 | 13篇 |
1984年 | 9篇 |
1983年 | 5篇 |
1982年 | 14篇 |
1981年 | 11篇 |
1980年 | 16篇 |
1979年 | 12篇 |
1978年 | 12篇 |
1977年 | 9篇 |
1976年 | 10篇 |
1975年 | 10篇 |
1974年 | 12篇 |
1973年 | 7篇 |
1972年 | 6篇 |
1971年 | 13篇 |
1970年 | 9篇 |
1969年 | 8篇 |
1968年 | 6篇 |
1967年 | 10篇 |
1966年 | 6篇 |
排序方式: 共有651条查询结果,搜索用时 15 毫秒
431.
Roy D. Shapiro 《海军后勤学研究》1980,27(3):489-498
Consider a set of task pairs coupled in time: a first (initial) and second (completion) tasks of known durations with a specified time between them. If the operator or machine performing these tasks is able to process only one at a time, scheduling is necessary to insure that no overlap occurs. This problem has a particular application to production scheduling, transportation, and radar operations (send-receive pulses are ideal examples of time-linked tasks requiring scheduling). This article discusses several candidate techniques for schedule determination, and these are evaluated in a specific radar scheduling application. 相似文献
432.
The segregated storage problem involves the optimal distribution of products among compartments with the restriction that only one product may be stored in each compartment. The storage capacity of each compartment, the storage demand for each product, and the linear cost of storing one unit of a product in a given compartment are specified. The problem is reformulated as a large set-packing problem, and a column generation scheme is devised to solve the associated linear programming problem. In case of fractional solutions, a branch and bound procedure is utilized. Computational results are presented. 相似文献
433.
A serial production line is defined wherein a unit is produced if, and only if, all machines are functioning. A single buffer stock with finite capacity is to be placed immediately after one of the first N-1 machines in the N machine line. When all machines have equal probability of failure it is shown that the optimal buffer position is exactly in the middle of the line. This result is synthesized with the earlier work of Koenigsberg and Buzacott including an analysis of the covariance between transition states. An alternative model formulation is presented and integrated with previous results. Finally, a sufficient condition and solution procedure is derived for the installation of a buffer where there is a possible trade-off between increasing the reliability of the line versus adding a buffer stock. 相似文献
434.
435.
This paper studies the one-period, general network distribution problem with linear costs. The approach is to decompose the problem into a transportation problem that represents a stocking decision, and into decoupled newsboy problems that represent the realization of demand with the usual associated holding and shortage costs. This approach leads to a characterization of optimal policies in terms of the dual of the transportation problem. This method is not directly suitable for the solution for large problems, but the exact solution for small problems can be obtained. For the numerical solutions of large problems, the problem has been formulated as a linear program with column generation. This latter approach is quite robust in the sense that it is easily extended to incorporate capacity constraints and the multiproduct case. 相似文献
436.
This article analyzes two general warranty policies involving an initial free replacement period, followed by a pro rata period. We examine the short-run total costs and longrun average costs under these policies. Formulas for both consumer costs and manufacturer profits under warranty are derived. We also study the expected number of purchases over the product life cycle under both policies. Bounds for the expected total costs and expected number of purchases are obtained for the case where the failure distribution of the item is new better than used. 相似文献
437.
For a service provider facing stochastic demand growth, expansion lead times and economies of scale complicate the expansion timing and sizing decisions. We formulate a model to minimize the infinite horizon expected discounted expansion cost under a service‐level constraint. The service level is defined as the proportion of demand over an expansion cycle that is satisfied by available capacity. For demand that follows a geometric Brownian motion process, we impose a stationary policy under which expansions are triggered by a fixed ratio of demand to the capacity position, i.e., the capacity that will be available when any current expansion project is completed, and each expansion increases capacity by the same proportion. The risk of capacity shortage during a cycle is estimated analytically using the value of an up‐and‐out partial barrier call option. A cutting plane procedure identifies the optimal values of the two expansion policy parameters simultaneously. Numerical instances illustrate that if demand grows slowly with low volatility and the expansion lead times are short, then it is optimal to delay the start of expansion beyond when demand exceeds the capacity position. Delays in initiating expansions are coupled with larger expansion sizes. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2009 相似文献
438.
This article investigates optimal static prices for a finite capacity queueing system serving customers from different classes. We first show that the original multi‐class formulation in which the price for each class is a decision variable can be reformulated as a single dimensional problem with the total load as the decision variable. Using this alternative formulation, we prove an upper bound for the optimal arrival rates for a fairly large class of queueing systems and provide sufficient conditions that ensure the existence of a unique optimal arrival rate vector. We show that these conditions hold for M/M/1/m and M/G/s/s systems and prove structural results on the relationships between the optimal arrival rates and system capacity. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008 相似文献
439.
Michael J. Armstrong 《海军后勤学研究》2007,54(1):66-77
This article considers two related questions of tactics in the context of the salvo model for naval missile combat. For a given set of targets, how many missiles should be fired to produce an effective attack? For a given available salvo size, how many enemy targets should be fired at? In the deterministic version of the model I derive a simple optimality relationship between the number of missiles to fire and the number of targets to engage. In the stochastic model I employ the expected loss inflicted and the probability of enemy elimination as the main performance measures and use these to derive salvo sizes that are in some sense “optimal.” I find that the offensive firepower needed for an effective attack depends not only on a target's total strength but also on the relative balance between its active defensive power and passive staying power. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007 相似文献
440.
We revisit the capacity investment decision problem studied in the article “Resource Flexibility with Responsive Pricing” by Chod and Rudi [Operations Research 53, (2005) 532–548]. A monopolist firm producing two dependent (substitutable or complementary) products needs to determine the capacity of one flexible resource under demand risk so as to maximize its expected profit. Product demands are linear functions of the prices of both products, and the market potentials are random and correlated. We perform a comparative statics analysis on how demand variability and correlation impact the optimal capacity and the resulting expected profit. In particular, C&R study this problem under the following assumptions/approximations: (i) demand intercepts follow a bivariate Normal distribution; (ii) demand uncertainty is of an additive form; (iii) and under approximate expressions for the optimal capacity and optimal expected profit. We revisit Propositions 2, 3, 4, 5, and 10 of C&R without these assumptions and approximations, and show that these results continue to hold (i) for the exact expressions for the optimal expected profit and optimal capacity, and (ii) under any arbitrary continuous distribution of demand intercepts. However, we also show that the additive demand uncertainty is a critical assumption for the C&R results to hold. In particular, we provide a case of multiplicative uncertainty under which the C&R results (Propositions 2 and 3) fail. © 2010 Wiley Periodicals, Inc. Naval Research Logistics 2010 相似文献