全文获取类型
收费全文 | 453篇 |
免费 | 17篇 |
国内免费 | 1篇 |
出版年
2021年 | 6篇 |
2019年 | 16篇 |
2018年 | 12篇 |
2017年 | 10篇 |
2016年 | 8篇 |
2014年 | 11篇 |
2013年 | 70篇 |
2010年 | 9篇 |
2009年 | 4篇 |
2007年 | 6篇 |
2006年 | 5篇 |
2005年 | 9篇 |
2004年 | 7篇 |
2002年 | 12篇 |
2001年 | 5篇 |
2000年 | 5篇 |
1999年 | 6篇 |
1998年 | 9篇 |
1997年 | 11篇 |
1996年 | 5篇 |
1995年 | 4篇 |
1994年 | 10篇 |
1993年 | 17篇 |
1992年 | 7篇 |
1991年 | 11篇 |
1990年 | 8篇 |
1989年 | 7篇 |
1988年 | 16篇 |
1987年 | 6篇 |
1986年 | 10篇 |
1985年 | 14篇 |
1984年 | 9篇 |
1983年 | 4篇 |
1982年 | 7篇 |
1981年 | 6篇 |
1980年 | 8篇 |
1979年 | 8篇 |
1978年 | 8篇 |
1977年 | 9篇 |
1976年 | 5篇 |
1975年 | 3篇 |
1974年 | 8篇 |
1973年 | 5篇 |
1972年 | 5篇 |
1971年 | 8篇 |
1970年 | 3篇 |
1969年 | 5篇 |
1968年 | 6篇 |
1967年 | 4篇 |
1966年 | 4篇 |
排序方式: 共有471条查询结果,搜索用时 15 毫秒
21.
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. 相似文献
22.
The problem of multiple-resource capacity planning under an infinite time horizon is analyzed using a nonlinear programming model. The analysis generalizes to the long term the short-run pricing model for computer networks developed in Kriebel and Mikhail [5]. The environment assumes heterogeneous resource capacities by age (vingate), which service a heterogeneous and relatively captive market of users with known demand functions in each time period. Total variable operating costs are given by a continuous psuedoconcave function of system load, capacity, and resource age. Optimal investment, pricing, and replacement decision rules are derived in the presence of economies of scale and exogenous technological progress. Myopic properties of the decision rules which define natural (finite) planning subhorizons are discussed. 相似文献
23.
Timothy C. Barkdoll Donald P. Gaver Kevin D. Glazebrook Patricia A. Jacobs Sergio Posadas 《海军后勤学研究》2002,49(8):723-742
Blue strike aircraft enter region ? to attack Red targets. In Case 1, Blue conducts (preplanned) SEAD to establish air superiority. In the (reactive) SEAD scenario, which is Case 2, such superiority is already in place, but is jeopardized by prohibitive interference from Red, which threatens Blue's ability to conduct missions. We utilize both deterministic and stochastic models to explore optimal tactics for Red in such engagements. Policies are developed which will guide both Red's determination of the modes of operation of his engagement radar, and his choice of Blue opponent to target next. An index in the form of a simple transaction kill ratio plays a major role throughout. Published 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 723–742, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10046 相似文献
24.
25.
26.
We address the problem of dispatching a vehicle with different product classes. There is a common dispatch cost, but holding costs that vary by product class. The problem exhibits multidimensional state, outcome and action spaces, and as a result is computationally intractable using either discrete dynamic programming methods, or even as a deterministic integer program. We prove a key structural property for the decision function, and exploit this property in the development of continuous value function approximations that form the basis of an approximate dispatch rule. Comparisons on single product‐class problems, where optimal solutions are available, demonstrate solutions that are within a few percent of optimal. The algorithm is then applied to a problem with 100 product classes, and comparisons against a carefully tuned myopic heuristic demonstrate significant improvements. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 742–769, 2003. 相似文献
27.
A linear-programming-based method for determining whether or not n demand points are on a hemisphere
Whenever n demand points are located on a hemisphere, spherical location problems can be solved easily using geometrical methods or mathematical programming. A method based on a linear programming formulation with four constraints is presented to determine whether n demand points are on a hemisphere. The formulation is derived from a modified minimax spherical location problem whose Karush-Kuhn-Tucker conditions are the constraints of the linear program. © 1993 John Wiley & Sons, Inc. 相似文献
28.
P. Patrick Wang 《海军后勤学研究》1993,40(3):345-360
In this article we consider a single-server system whose customers arrive by appointments only. Both static and dynamic scheduling problems are studied. In static scheduling problems, one considers scheduling a finite number of customer arrivals, assuming there is no scheduled customer arrival to the system. In dynamic scheduling problems, one considers scheduling one customer arrival only, assuming that there are a number of scheduled customers already. The expected delay time is recursively computed in terms of customer interarrival times for both cases. The objective is to minimize the weighted customer delay time and the server completion time. The problem is formulated as a set of nonlinear equations. Various numerical examples are illustrated. © 1993 John Wiley & Sons, Inc. 相似文献
29.
Jobs with known processing times and due dates have to be processed on a machine which is subject to a single breakdown. The moment of breakdown and the repair time are independent random variables. Two cases are distinguished with reference to the processing time preempted by the breakdown (no other preemptions are allowed): (i) resumption without time losses and (ii) restart from the beginning. Under certain compatible conditions, we find the policies which minimize stochastically the number of tardy jobs. 相似文献
30.
We consider a one-machine scheduling problem with earliness and tardiness penalties. All jobs are assigned a common due date and the objective is to minimize the total penalty due to job earliness and tardiness. We are interested in finding the optimal combination of the common due-date value and the job sequence. Despite the fact that this problem in general is very hard to solve, we prove that there exists at least a common property for all optimal solutions: The first job in an optimal sequence is one of the longest jobs. We also prove that this property holds for a general class of unimodal penalty functions. 相似文献