全文获取类型
收费全文 | 312篇 |
免费 | 14篇 |
国内免费 | 1篇 |
出版年
2021年 | 5篇 |
2019年 | 7篇 |
2018年 | 4篇 |
2017年 | 5篇 |
2016年 | 5篇 |
2015年 | 4篇 |
2014年 | 6篇 |
2013年 | 59篇 |
2012年 | 5篇 |
2011年 | 4篇 |
2010年 | 5篇 |
2009年 | 3篇 |
2008年 | 3篇 |
2007年 | 4篇 |
2006年 | 7篇 |
2003年 | 3篇 |
2002年 | 3篇 |
2000年 | 3篇 |
1998年 | 2篇 |
1997年 | 5篇 |
1996年 | 7篇 |
1995年 | 3篇 |
1994年 | 6篇 |
1993年 | 10篇 |
1992年 | 6篇 |
1991年 | 7篇 |
1990年 | 2篇 |
1989年 | 7篇 |
1988年 | 5篇 |
1987年 | 4篇 |
1986年 | 7篇 |
1985年 | 8篇 |
1984年 | 5篇 |
1983年 | 4篇 |
1982年 | 5篇 |
1981年 | 4篇 |
1980年 | 8篇 |
1979年 | 7篇 |
1978年 | 8篇 |
1977年 | 2篇 |
1976年 | 7篇 |
1975年 | 12篇 |
1974年 | 6篇 |
1973年 | 8篇 |
1972年 | 5篇 |
1971年 | 5篇 |
1970年 | 5篇 |
1969年 | 4篇 |
1968年 | 6篇 |
1967年 | 3篇 |
排序方式: 共有327条查询结果,搜索用时 31 毫秒
251.
The classical work of Gittins, which resulted in the celebrated index result, had applications to research planning as an important part of its motivation. However, research planning problems often have features that are not accommodated within Gittins's original framework. These include precedence constraints on the task set, influence between tasks, stopping or investment options and routes to success in which some tasks do not feature. We consider three classes of Markovian decision models for research planning, each of which has all of these features. Gittins-index heuristics are proposed and are assessed both analytically and computationally. They perform impressively. © 1995 John Wiley & Sons, Inc. 相似文献
252.
Ship berthing plans reserve a location for inbound U.S. Navy surface vessels prior to their port entrance, or reassign ships once in port to allow them to complete, in a timely manner, reprovisioning, repair, maintenance, training, and certification tests prior to redeploying for future operational commitments. Each ship requires different services when in port, such as shore power, crane, ordnance, and fuel. Unfortunately, not all services are offered at all piers, and berth shifting is disruptive and expensive: A port operations scheduler strives to reduce unnecessary berth shifts. We present an optimization model for berth planning and demonstrate it for Norfolk Naval Station, which exhibits all the richness of berthing problems the Navy faces. ® 1994 John Wiley & Sons, Inc. 相似文献
253.
Mark G. Tang 《海军后勤学研究》1993,40(5):677-696
In this article we solve and analyze a stochastic version of the Boiteux problem by employing the stochastic optimal control method. Our setup is close to that of Thompson [22]. Our focus is to analyze, under the same structure, how different production functions and how the variance in machine deterioration/maintenance affect our optimal machine maintenance and sale date decisions. © 1993 John Wiley & Sons, Inc. 相似文献
254.
The Stein-Chen method for establishing Poisson convergence is used to approximate the reliability of coherent systems with exponential-type distribution functions. These bounds lead to quite general limit theorems for the lifetime distribution of large coherent systems. © 1993 John Wiley & Sons, Inc. 相似文献
255.
This article considers a special class of cost allocation problems, where the communication possibilities among the agents are restricted. Integral formulas are derived for two allocation rules: The Myerson value and the position value. © 1993 John Wiley & Sons, Inc. 相似文献
256.
We consider two opponents that compete in developing asymmetric technologies where each party's technology is aimed at damaging (or neutralizing) the other's technology. The situation we consider is different than the classical problem of commercial R&D races in two ways: First, while in commercial R&D races the competitors compete over the control of market share, in our case the competition is about the effectiveness of technologies with respect to certain capabilities. Second, in contrast with the “winner‐takes‐all” assumption that characterizes much of the literature on this field in the commercial world, we assume that the party that wins the race gains a temporary advantage that expires when the other party develops a superior technology. We formulate a variety of models that apply to a one‐sided situation, where one of the two parties has to determine how much to invest in developing a technology to counter another technology employed by the other party. The decision problems are expressed as (convex) nonlinear optimization problems. We present an application that provides some operational insights regarding optimal resource allocation. We also consider a two‐sided situation and develop a Nash equilibrium solution that sets investment values, so that both parties have no incentive to change their investments. © 2012 Wiley Periodicals, Inc. Naval Research Logistics 59: 128–145, 2012 相似文献
257.
Nicholas G. Hall Gilbert Laporte Esaignani Selvarajah Chelliah Sriskandarajah 《海军后勤学研究》2005,52(3):261-275
We study the problem of minimizing the makespan in no‐wait two‐machine open shops producing multiple products using lot streaming. In no‐wait open shop scheduling, sublot sizes are necessarily consistent; i.e., they remain the same over all machines. This intractable problem requires finding sublot sizes, a product sequence for each machine, and a machine sequence for each product. We develop a dynamic programming algorithm to generate all the dominant schedule profiles for each product that are required to formulate the open shop problem as a generalized traveling salesman problem. This problem is equivalent to a classical traveling salesman problem with a pseudopolynomial number of cities. We develop and test a computationally efficient heuristic for the open shop problem. Our results indicate that solutions can quickly be found for two machine open shops with up to 50 products. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005 相似文献
258.
A method previously devised for the solution of the p-center problem on a network has now been extended to solve the analogous minimax location-allocation problem in continuous space. The essence of the method is that we choose a subset of the n points to be served and consider the circles based on one, two, or three points. Using a set-covering algorithm we find a set of p such circles which cover the points in the relaxed problem (the one with m < n points). If this is possible, we check whether the n original points are covered by the solution; if so, we have a feasible solution to the problem. We now delete the largest circle with radius rp (which is currently an upper limit to the optimal solution) and try to find a better feasible solution. If we have a feasible solution to the relaxed problem which is not feasible to the original, we augment the relaxed problem by adding a point, preferably the one which is farthest from its nearest center. If we have a feasible solution to the original problem and we delete the largest circle and find that the relaxed problem cannot be covered by p circles, we conclude that the latest feasible solution to the original problem is optimal. An example of the solution of a problem with ten demand points and two and three service points is given in some detail. Computational data for problems of 30 demand points and 1–30 service points, and 100, 200, and 300 demand points and 1–3 service points are reported. 相似文献
259.
In this article, we define a scheduling/packing problem called the Job Splitting Problem, motivated by the practices in the printing industry. There are n types of items to be produced on an m‐slot machine. A particular assignment of the types to the slots is called a “run” configuration and requires a setup cost. Once a run begins, the production continues according to that configuration and the “length” of the run represents the quantity produced in each slot during that run. For each unit of production in excess of demand, there is a waste cost. Our goal is to construct a production plan, i.e., a set of runs, such that the total setup and waste cost is minimized. We show that the problem is strongly NP‐hard and propose two integer programming formulations, several preprocessing steps, and two heuristics. We also provide a worst‐case bound for one of the heuristics. Extensive tests on real‐world and randomly generated instances show that the heuristics are both fast and effective, finding near‐optimal solutions. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010 相似文献
260.