全文获取类型
收费全文 | 223篇 |
免费 | 2篇 |
专业分类
225篇 |
出版年
2018年 | 7篇 |
2017年 | 7篇 |
2016年 | 8篇 |
2015年 | 2篇 |
2014年 | 4篇 |
2013年 | 82篇 |
2012年 | 2篇 |
2011年 | 1篇 |
2010年 | 3篇 |
2009年 | 1篇 |
2008年 | 1篇 |
2006年 | 1篇 |
2005年 | 5篇 |
2004年 | 1篇 |
2003年 | 4篇 |
2002年 | 5篇 |
2000年 | 3篇 |
1999年 | 3篇 |
1998年 | 1篇 |
1997年 | 4篇 |
1996年 | 2篇 |
1995年 | 2篇 |
1994年 | 4篇 |
1993年 | 5篇 |
1992年 | 3篇 |
1991年 | 3篇 |
1990年 | 2篇 |
1989年 | 4篇 |
1988年 | 1篇 |
1987年 | 6篇 |
1986年 | 4篇 |
1985年 | 1篇 |
1984年 | 2篇 |
1983年 | 1篇 |
1982年 | 2篇 |
1981年 | 2篇 |
1980年 | 1篇 |
1979年 | 2篇 |
1978年 | 6篇 |
1977年 | 1篇 |
1976年 | 3篇 |
1975年 | 2篇 |
1974年 | 3篇 |
1972年 | 3篇 |
1971年 | 3篇 |
1970年 | 2篇 |
1969年 | 4篇 |
1968年 | 2篇 |
1967年 | 1篇 |
1966年 | 1篇 |
排序方式: 共有225条查询结果,搜索用时 15 毫秒
1.
John P. Matthews 《海军后勤学研究》1977,24(4):679-690
The purpose of this paper and the accompanying tables is to facilitate the calculation of constrained optimum order quantities and reorder points for an inventory control system where the criterion of optimality is the minimization of expected inventory holding, ordering, and time-weighted backorder costs. The tables provided in the paper allow the identification of the optimal solution when order quantities and/or reorder points are restricted to a set of values which do not include the unconstrained optimal solution. 相似文献
2.
3.
Component grouping problems, a type of set-partitioning problem, arise in a number of different manufacturing and material logistics application areas. For example, in circuit board assembly, robotic work cells can be used to insert components onto a number of different types of circuit boards. Each type of circuit board requires particular components, with some components appearing on more than one type. The problem is to decide which components should be assigned to each work cell in order to minimize the number of visits by circuit boards to work cells. We describe two new heuristics for this problem, based on so-called greedy random adaptive search procedures (GRASP). With GRASP, a local search technique is replicated many times with different starting points. The starting points are determined by a greedy procedure with a probabilistic aspect. The best result is then kept as the solution. Computational experiments on problems based on data from actual manufacturing processes indicate that these GRASP methods outperform, both in speed and in solution quality, an earlier, network-flow-based heuristic. We also describe techniques for generating lower bounds for the component grouping problem, based on the combinatorial structure of a problem instance. The lower bounds for our real-world test problems averaged within 7%-8% of the heuristic solutions. Similar results are obtained for larger, randomly generated problems. © 1994 John Wiley & Sons. Inc. 相似文献
4.
John A. Muckstadt 《海军后勤学研究》1978,25(3):377-394
The optimization problem as formulated in the METRIC model takes the form of minimizing the expected number of total system backorders in a two-echelon inventory system subject to a budget constraint. The system contains recoverable items – items subject to repair when they fail. To solve this problem, one needs to find the optimal Lagrangian multiplier associated with the given budget constraint. For any large-scale inventory system, this task is computationally not trivial. Fox and Landi proposed one method that was a significant improvement over the original METRIC algorithm. In this report we first develop a method for estimating the value of the optimal Lagrangian multiplier used in the Fox-Landi algorithm, present alternative ways for determining stock levels, and compare these proposed approaches with the Fox-Landi algorithm, using two hypothetical inventory systems – one having 3 bases and 75 items, the other 5 bases and 125 items. The comparison shows that the computational time can be reduced by nearly 50 percent. Another factor that contributes to the higher requirement for computational time in obtaining the solution to two-echelon inventory systems is that it has to allocate stock optimally to the depot as well as to bases for a given total-system stock level. This essentially requires the evaluation of every possible combination of depot and base stock levels – a time-consuming process for many practical inventory problems with a sizable system stock level. This report also suggests a simple approximation method for estimating the optimal depot stock level. When this method was applied to the same two hypotetical inventory systems indicated above, it was found that the estimate of optimal depot stock is quite close to the optimal value in all cases. Furthermore, the increase in expected system backorders using the estimated depot stock levels rather than the optimal levels is generally small. 相似文献
5.
Inventory systems with returns are systems in which there are units returned in a repairable state, as well as demands for units in a serviceable state, where the return and demand processes are independent. We begin by examining the control of a single item at a single location in which the stationary return rate is less than the stationary demand rate. This necessitates an occasional procurement of units from an outside source. We present a cost model of this system, which we assume is managed under a continuous review procurement policy, and develop a solution method for finding the policy parameter values. The key to the analysis is the use of a normally distributed random variable to approximate the steady-state distribution of net inventory. Next, we study a single item, two echelon system in which a warehouse (the upper echelon) supports N(N ? 1) retailers (the lower echelon). In this case, customers return units in a repairable state as well as demand units in a serviceable state at the retailer level only. We assume the constant system return rate is less than the constant system demand rate so that a procurement is required at certain times from an outside supplier. We develop a cost model of this two echelon system assuming that each location follows a continuous review procurement policy. We also present an algorithm for finding the policy parameter values at each location that is based on the method used to solve the single location problem. 相似文献
6.
An allocation problem is considered in lvhich different kinds of resources must be allocated to various activities, within a given time period. The opportunities for allo'cation appear randomly during this period. Certain assumptions about the values of possible allocations and the distribution of occurrences of opportunities lead to a dynamic programming formulation of the problem. This leads to a system of ordinary differential equations which are (in theory) solvable recursively, and can be solved numerically to any desired degree of precision. An example is given for the allocation of aircraft-carried weapons to targets of opportunity. 相似文献
7.
Johnson [2] in 1954 solved the two machine flow shop problem by giving an argument for a sufficient condition of optimality and by stating an efficient algorithm which produces a solution via satisfaction of the sufficient condition. Moreover, Johnson solved two special cases of the corresponding three machine flow shop problem. Since that time, six other special cases have been solved, two contributed by Arthanari and Mukhopadhyay [1], two by Smith, Panwalkar, and Dudek [3], and two of a different nature by Szwarc [5]. This paper contributes an extension to one of the classes described by Szwarc. 相似文献
8.
9.
10.
We consider sequencing n jobs on a single machine subject to job completion times arising from either machine breakdowns or other causes. The objective is to minimize an expected weighted combination of due dates, completion times, earliness, and tardiness penalties. The determination of optimal distinct due dates or optimal common due dates for a given schedule is investigated. The scheduling problem for a fixed common due date is considered when random completion times arise from machine breakdowns. The optimality of a V-shaped about (a point) T sequence is established when the number of machine breakdowns follows either a Poisson or a geometric distribution and the duration of a breakdown has an exponential distribution. © 1996 John Wiley & Sons, Inc. 相似文献