全文获取类型
收费全文 | 433篇 |
免费 | 18篇 |
国内免费 | 1篇 |
出版年
2021年 | 5篇 |
2019年 | 9篇 |
2018年 | 5篇 |
2017年 | 6篇 |
2016年 | 10篇 |
2015年 | 6篇 |
2014年 | 10篇 |
2013年 | 102篇 |
2012年 | 5篇 |
2011年 | 5篇 |
2010年 | 7篇 |
2009年 | 4篇 |
2008年 | 6篇 |
2007年 | 4篇 |
2006年 | 6篇 |
2002年 | 3篇 |
2001年 | 3篇 |
2000年 | 3篇 |
1998年 | 5篇 |
1997年 | 6篇 |
1996年 | 10篇 |
1995年 | 4篇 |
1994年 | 5篇 |
1993年 | 12篇 |
1992年 | 11篇 |
1991年 | 10篇 |
1990年 | 4篇 |
1989年 | 8篇 |
1988年 | 10篇 |
1987年 | 7篇 |
1986年 | 8篇 |
1985年 | 11篇 |
1984年 | 6篇 |
1983年 | 6篇 |
1982年 | 6篇 |
1981年 | 5篇 |
1980年 | 8篇 |
1979年 | 11篇 |
1978年 | 9篇 |
1976年 | 9篇 |
1975年 | 11篇 |
1974年 | 6篇 |
1973年 | 10篇 |
1972年 | 9篇 |
1971年 | 5篇 |
1970年 | 8篇 |
1969年 | 6篇 |
1968年 | 5篇 |
1967年 | 6篇 |
1966年 | 3篇 |
排序方式: 共有452条查询结果,搜索用时 15 毫秒
411.
In this paper we address a bin-packing problem which possesses a variety of modifications of the classic theme. Among these are bin-dependent chip weights, bin costs, and bin-dependent penalties for unused capacity. Lagrangian relaxations are employed in the context of a branch-and-bound framework in order to solve the problem after which substantial computational experience is provided. 相似文献
412.
An important class of network flow problems is that class for which the objective is to minimize the cost of the most expensive unit of flow while obtaining a desired total flow through the network. Two special cases of this problem have been solved, namely, the bottleneck assignment problem and time-minimizing transportation problem. This paper addresses the more general case which we shall refer to as the time-minimizing network flow problem. Associated with each arc is an arc capacity (static) and a transferral time. The objective is to find a maximal flow for which the length (in time) of the longest path carrying flow is minimized. The character of the problem is discussed and a solution algorithm is presented. 相似文献
413.
This paper shows that by making use of an unusual property of the decision table associated with the dynamic programming solution to the goup problem, it is possible to dispense with table storage as such, and instead overlay values for both the objective and history functions. Furthermore, this storage reduction is accomplished with no loss in computational efficiency. An algorithm is presented which makes use of this technique and incorporates various additional efficiencies. The reduction in storage achieved for problems from the literature is shown. 相似文献
414.
We consider the multiple-attribute decision problem with finite action set and additive utility function. We suppose that the decision maker cannot specify nonnegative weights for the various attributes which would resolve the problem, but that he/she supplies ordinal information about these weights which can be translated into a set of linear constraints restricting their values. A bounded polytope W of feasible weight vectors is thus determined. Supposing that each element of W has the same chance of being the “appropriate one,” we compute the expected utility value of each action. The computation method uses a combination of numerical integration and Monte Carlo simulation and is equivalent to finding the center of mass of the bounded polytope W . Comparisons are made with another criterion already presented, the comparative hyper-volume criterion, and two small examples are presented. 相似文献
415.
Research and development activities in a business firm or government laboratory are portrayed as a multi-stage information generation and conversion process. A “basic research” phase generates opportunities, in the form of findings in a set of scientific disciplines, which are available for subsequent exploitation. It is assumed that increments to information in a subject area are stochastic, proportional to the amount of knowledge which already exists in the area, and have values which are randomly distributed. An “exploratory development” phase is viewed as a process of selecting a subset of alternative research opportunities, improving each opportunity in the direction of its applications, estimating the value of the improved opportunity and using these estimates to choose the exploratory development results to be implemented in engineering development. The “engineering development” phase makes the value of exploratory results realizable without changing value or risk. Engineering development costs are assumed to increase as value increases. If exploratory development is not successful, additional costs in engineering development must be incurred to bring the design up to a minimum desirable level. The model is intended as a step toward formulating and analyzing problems in management planning and control of the several interrelated stages of the research and development process. 相似文献
416.
417.
418.
A mixed-model multilevel manufacturing facility running under a just-in-time (JIT) production system is controlled by setting the production schedule for the highest level in the facility, which is usually a mixed-model final assembly line. The schedule is set to achieve the goals of the organization, which under JIT are (1) to keep a constant rate of part usage, and (2) to maintain a smooth production load. In this article we extend earlier work in the literature, which focused on the first goal, by developing scheduling procedures which satisfy both goals. Properties of the resulting production schedules are analyzed and illustrative examples are presented. 相似文献
419.
We develop a simple, approximately optimal solution to a model with Erlang lead time and deterministic demand. The method is robust to misspecification of the lead time and has good accuracy. We compare our approximate solution to the optimal for the case where we have prior information on the lead‐time distribution, and another where we have no information, except for computer‐generated sample data. It turns out that our solution is as easy as the EOQ's, with an accuracy rate of 99.41% when prior information on the lead‐time distribution is available and 97.54–99.09% when only computer‐generated sample information is available. Apart from supplying the inventory practitioner with an easy heuristic, we gain insights into the efficacy of stochastic lead time models and how these could be used to find the cost and a near‐optimal policy for the general model, where both demand rate and lead time are stochastic. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004 相似文献
420.