全文获取类型
收费全文 | 112篇 |
免费 | 2篇 |
专业分类
114篇 |
出版年
2020年 | 1篇 |
2019年 | 5篇 |
2018年 | 2篇 |
2017年 | 6篇 |
2016年 | 1篇 |
2015年 | 1篇 |
2014年 | 5篇 |
2013年 | 46篇 |
2012年 | 1篇 |
2010年 | 2篇 |
2009年 | 1篇 |
2007年 | 1篇 |
2002年 | 1篇 |
2001年 | 1篇 |
2000年 | 2篇 |
1999年 | 1篇 |
1998年 | 3篇 |
1997年 | 1篇 |
1996年 | 2篇 |
1995年 | 2篇 |
1994年 | 1篇 |
1993年 | 2篇 |
1992年 | 3篇 |
1990年 | 1篇 |
1989年 | 2篇 |
1988年 | 3篇 |
1987年 | 2篇 |
1986年 | 2篇 |
1985年 | 2篇 |
1982年 | 1篇 |
1978年 | 1篇 |
1977年 | 1篇 |
1976年 | 1篇 |
1971年 | 1篇 |
1970年 | 1篇 |
1969年 | 1篇 |
1968年 | 1篇 |
1967年 | 3篇 |
排序方式: 共有114条查询结果,搜索用时 15 毫秒
41.
Practitioners of maintenance scheduling sometimes use a simple analytic formula, derived based on inspection scheduling, as a heuristic to determine the length of the preventive maintenance period. The sensitivity of this heuristic solution is analyzed and the cost penalties are calculated compared to the exact solution that utilizes the lifetime distribution in the derivation of the optimal preventive maintenance period. A simple extension of the heuristic is suggested to improve the approximation with a slightly increased computational effort. The sensitivity and cost analysis of the improved heuristic are discussed as well. © 1994 John Wiley & Sons, Inc. 相似文献
42.
This paper provides a framework in which warranty policies for non-repairable items can be evaluated according to risk preferences of both buyers and sellers. In particular, a warranty price schedule is established such that sellers are indifferent among the policies. Given this schedule, a buyer's response is expressed by selecting the price-warranty combination that minimizes disutility. Within this framework, a warranty can be viewed as an instrumet of risk management that can induce more sales and greater profitability. For given utility functions, analytical results for the development of a price schedule are developed. Numerical results illustrate the substitution effects between warranty terms, prices, and risk parameters. 相似文献
43.
44.
n periodic tasks are to be processed by a single machine, where each task i has a maximum request rate or periodicity Fi, a processing time Ei, a deadline Di, relative to each request of task i, a task-request interrupt overhead Ii, and a task-independent scheduling overhead S. Two scheduling strategies are considered for sequencing the execution of an arbitrary arrangement of task requests in time: the preemptive and the nonpreemptive earliest-deadline algorithms. Necessary and sufficient conditions are derived for establishing whether a given set of tasks can be scheduled by each scheduling strategy. The conditions are given in the form of limited simulations of a small number of well-defined task-request arrangements. If all simulations succeed, the schedule is feasible for the given set of tasks. If any simulation fails, the schedule is infeasible. While interrupt handling and scheduling overheads can be handled by such simulations, context switching overhead resulting from preemption cannot. A counterexample illustrates how the simulations fail to uncover unschedulable task sets when context switching overhead is considered. 相似文献
45.
L. Peter Jennergren 《海军后勤学研究》1977,24(2):373-376
Three different solutions to a very simple transfer pricing problem are outlined and contrasted. These are labeled by their authors: Hirshleifer, Enzer, and Ronen and McKinney. Weaknesses associated with each solution are pointed out. 相似文献
46.
Proposed is a Heuristic Network (HN) Procedure for balancing assembly lines. The procedure uses simple heuristic rules to generate a network which is then traversed using a shortest route algorithm to obtain a heuristic solution. The advantages of the HN Procedure are: a) it generally yields better solutions than those obtained by application of the heuristics, and b) sensitivity analysis with different values of cycle time is possible without having to regenerate the network. The rationale for its effectiveness and its application to problems with paralleling are presented. Computational experience with the procedure on up to 50 task test problems is provided. 相似文献
47.
Peter J. Kalman 《海军后勤学研究》1970,17(4):547-553
In this paper a stochastically constrained replacement model is formulated. This model determines a sequence of replacement dates such that the total “current account” cost of all future costs and capital expenditures over an infinite time horizon for the n initial incumbent machines is minimized subject to the constraints that an expected number of machines are in a chosen utility class at any point in time. We then indicate one possible solution method for the model. 相似文献
48.
Peter C. Fishburn 《海军后勤学研究》1967,14(1):1-13
A theory of additive utilities is discussed for cases where the set X, on which an individual's preference-indifference relation is defined, is a subset of the Cartesian product of n finite sets. A number of potential applications of additive utilities in decision making are presented. 相似文献
49.
This note examines estimation of the traffic intensity in an M/G/1 queue. We show that the ratio of sample mean service times to the sample mean interarrival times has undesirable sampling properties. To remedy this, two alternative estimators are introduced. © 2009 Wiley Periodicals, Inc. Naval Research Logistics 2009 相似文献
50.
The problem is to protect a set of T identical targets that may come under attack by A identical weapons. The targets are to be defended by D identical interceptors, which must be preallocated to defend selected targets. The attacker is aware of the number of interceptors, but is ignorant of their allocation. The size of the attack is chosen by the attacker from within a specified range. The robust strategies developed in this article do not require the defender to assume an attack size. Rather, the defender chooses a strategy which is good over a wide range of attack sizes, though not necessarily best for any particular attack size. The attacker, knowing that the defender is adopting a robust strategy, chooses the optimal attack strategy for the number of weapons he chooses to expend. The expected number of survivors is a function of the robust defense strategy and optimal attack strategy against this robust defense. 相似文献