全文获取类型
收费全文 | 139篇 |
免费 | 4篇 |
出版年
2019年 | 2篇 |
2018年 | 1篇 |
2017年 | 1篇 |
2016年 | 5篇 |
2015年 | 2篇 |
2014年 | 4篇 |
2013年 | 48篇 |
2011年 | 1篇 |
2010年 | 2篇 |
2009年 | 1篇 |
2008年 | 3篇 |
2005年 | 1篇 |
2004年 | 1篇 |
2001年 | 1篇 |
1998年 | 3篇 |
1997年 | 1篇 |
1996年 | 3篇 |
1995年 | 2篇 |
1993年 | 3篇 |
1992年 | 5篇 |
1991年 | 3篇 |
1990年 | 2篇 |
1989年 | 1篇 |
1988年 | 5篇 |
1987年 | 3篇 |
1986年 | 3篇 |
1985年 | 3篇 |
1984年 | 1篇 |
1983年 | 2篇 |
1982年 | 1篇 |
1981年 | 1篇 |
1980年 | 1篇 |
1979年 | 4篇 |
1978年 | 1篇 |
1977年 | 1篇 |
1976年 | 2篇 |
1975年 | 1篇 |
1973年 | 2篇 |
1972年 | 4篇 |
1971年 | 1篇 |
1970年 | 3篇 |
1969年 | 2篇 |
1967年 | 3篇 |
1966年 | 3篇 |
排序方式: 共有143条查询结果,搜索用时 15 毫秒
1.
2.
Richard V. Evans 《海军后勤学研究》1969,16(1):85-92
The system to be controlled produces n products simultaneously in fixed proportions every time it is activated. Demands for the products in any period are components of an n dimensional vector random variable with known distribution function. Cases of excess demands backlogged and excess demands lost are considered. In the former the notion of k convexity can be generalized to guarantee relatively simple form for the optimal policy in an n decision problem. In the latter, this generalization was not successful although when there is no setup cost, a convexity argument can be used to show that the optimal policy has a simple form. 相似文献
3.
4.
The bounded interval generalized assignment model is a “many-for-one” assignment model. Each task must be assigned to exactly one agent; however, each agent can be assigned multiple tasks as long as the agent resource consumed by performing the assigned tasks falls within a specified interval. The bounded interval generalized assignment model is formulated, and an algorithm for its solution is developed. Algorithms for the bounded interval versions of the semiassignment model and sources-to-uses transportation model are also discussed. 相似文献
5.
A survey of the research done on preventive maintenance is presented. The scope of the present survey is on the research published after the 1976 paper by Pierskalla and Voelker [98]. This article includes optimization models for repair, replacement, and inspection of systems subject to stochastic deterioration. A classification scheme is used that categorizes recent research into inspection models, minimal repair models, shock models, or miscellaneous replacement models. 相似文献
6.
Todas information and communication network requires a design that is secure to tampering. Traditional performance measures of reliability and throughput must be supplemented with measures of security. Recognition of an adversary who can inflict damage leads toward a game‐theoretic model. Through such a formulation, guidelines for network designs and improvements are derived. We opt for a design that is most robust to withstand both natural degradation and adversarial attacks. Extensive computational experience with such a model suggests that a Nash‐equilibrium design exists that can withstand the worst possible damage. Most important, the equilibrium is value‐free in that it is stable irrespective of the unit costs associated with reliability vs. capacity improvement and how one wishes to trade between throughput and reliability. This finding helps to pinpoint the most critical components in network design. From a policy standpoint, the model also allows the monetary value of information‐security to be imputed. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2009 相似文献
7.
In this paper, we derive new families of facet‐defining inequalities for the finite group problem and extreme inequalities for the infinite group problem using approximate lifting. The new valid inequalities for the finite group problem include two‐ and three‐slope facet‐defining inequalities as well as the first family of four‐slope facet‐defining inequalities. The new valid inequalities for the infinite group problem include families of two‐ and three‐slope extreme inequalities. These new inequalities not only illustrate the diversity of strong inequalities for the finite and infinite group problems, but also provide a large variety of new cutting planes for solving integer and mixed‐integer programming problems. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008 相似文献
8.
We consider a make‐to‐order manufacturer facing random demand from two classes of customers. We develop an integrated model for reserving capacity in anticipation of future order arrivals from high priority customers and setting due dates for incoming orders. Our research exhibits two distinct features: (1) we explicitly model the manufacturer's uncertainty about the customers' due date preferences for future orders; and (2) we utilize a service level measure for reserving capacity rather than estimating short and long term implications of due date quoting with a penalty cost function. We identify an interesting effect (“t‐pooling”) that arises when the (partial) knowledge of customer due date preferences is utilized in making capacity reservation and order allocation decisions. We characterize the relationship between the customer due date preferences and the required reservation quantities and show that not considering the t‐pooling effect (as done in traditional capacity and inventory rationing literature) leads to excessive capacity reservations. Numerical analyses are conducted to investigate the behavior and performance of our capacity reservation and due date quoting approach in a dynamic setting with multiple planning horizons and roll‐overs. One interesting and seemingly counterintuitive finding of our analyses is that under certain conditions reserving capacity for high priority customers not only improves high priority fulfillment, but also increases the overall system fill rate. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008 相似文献
9.
10.
Sungil Kim Heeyoung Kim Jye‐Chyi Lu Michael J. Casciato Martha A. Grover Dennis W. Hess Richard W. Lu Xin Wang 《海军后勤学研究》2015,62(2):127-142
In the field of nanofabrication, engineers often face unique challenges in resource‐limited experimental budgets, the sensitive nature of process behavior with respect to controllable variables, and highly demanding tolerance requirements. To effectively overcome these challenges, this article proposes a methodology for a sequential design of experiments through batches of experimental runs, aptly named Layers of Experiments with Adaptive Combined Design (LoE/ACD). In higher layers, where process behavior is less understood, experimental regions cover more design space and data points are more spread out. In lower layers, experimental regions are more focused to improve understanding of process sensitivities in a local, data‐rich environment. The experimental design is a combination of a space‐filling and an optimal design with a tuning parameter that is dependent on the amount of information accumulated over the various layers. The proposed LoE/ACD method is applied to optimize a carbon dioxide (epet‐CO2) assisted deposition process for fabricating silver nanoparticles with pressure and temperature variables. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 127–142, 2015 相似文献