全文获取类型
收费全文 | 492篇 |
免费 | 23篇 |
国内免费 | 1篇 |
出版年
2021年 | 6篇 |
2019年 | 11篇 |
2018年 | 9篇 |
2017年 | 13篇 |
2016年 | 10篇 |
2015年 | 9篇 |
2014年 | 10篇 |
2013年 | 125篇 |
2012年 | 7篇 |
2011年 | 9篇 |
2010年 | 8篇 |
2009年 | 7篇 |
2008年 | 7篇 |
2007年 | 6篇 |
2006年 | 11篇 |
2005年 | 9篇 |
2004年 | 6篇 |
2003年 | 5篇 |
2002年 | 6篇 |
2000年 | 5篇 |
1997年 | 7篇 |
1996年 | 10篇 |
1995年 | 6篇 |
1994年 | 8篇 |
1993年 | 12篇 |
1992年 | 12篇 |
1991年 | 9篇 |
1990年 | 4篇 |
1989年 | 10篇 |
1988年 | 9篇 |
1987年 | 8篇 |
1986年 | 7篇 |
1985年 | 10篇 |
1984年 | 5篇 |
1983年 | 6篇 |
1982年 | 5篇 |
1981年 | 7篇 |
1980年 | 9篇 |
1979年 | 8篇 |
1978年 | 8篇 |
1976年 | 7篇 |
1975年 | 13篇 |
1974年 | 6篇 |
1973年 | 9篇 |
1972年 | 5篇 |
1971年 | 5篇 |
1970年 | 6篇 |
1969年 | 4篇 |
1968年 | 5篇 |
1967年 | 4篇 |
排序方式: 共有516条查询结果,搜索用时 15 毫秒
321.
ABSTRACTChina’s efforts to build a ‘new type of great power relations’ and a ‘new type of military-to-military relations’ do not constitute a major turning point in relations with the United States. Political relations set limits on military cooperation, and the two sides have been unable to construct a sustainable strategic basis for relations. This has contributed to an ‘on-again, off-again’ pattern in military ties. Trends show a pattern of frequent disruptions in military-to-military relations from 2000 to 2010, followed by an increase in interactions beginning in 2012. Nevertheless, obstacles on both sides are likely to limit mutual trust and constrain future development of military-to-military relations. 相似文献
322.
On the surface of a sphere, we take as inputs two points, neither of them contained in any of a number of spherical polygon obstacles, and quickly find the shortest route connecting these two points while avoiding any obstacle. The WetRoute method presented here has been adopted by the US Navy for several applications. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 374–385, 2016 相似文献
323.
We consider a class of production scheduling models with m identical machines in parallel and k different product types. It takes a time pi to produce one unit of product type i on any one of the machines. There is a demand stream for product type i consisting of ni units with each unit having a given due date. Before a machine starts with the production of a batch of products of type i a setup cost c is incurred. We consider several different objective functions. Each one of the objective functions has three components, namely a total setup cost, a total earliness cost, and a total tardiness cost. In our class of problems we find a relatively large number of problems that can be solved either in polynomial time or in pseudo‐polynomial time. The polynomiality or pseudo‐polynomiality is achieved under certain special conditions that may be of practical interest; for example, a regularity pattern in the string of due dates combined with earliness and tardiness costs that are similar for different types of products. The class of models we consider includes as special cases discrete counterparts of a number of inventory models that have been considered in the literature before, e.g., Wagner and Whitin (Manage Sci 5 (1958), 89–96) and Zangwill (Oper Res 14 (1966), 486–507; Manage Sci 15 (1969), 506–527). © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008 相似文献
324.
We consider a supply chain in which a retailer faces a stochastic demand, incurs backorder and inventory holding costs and uses a periodic review system to place orders from a manufacturer. The manufacturer must fill the entire order. The manufacturer incurs costs of overtime and undertime if the order deviates from the planned production capacity. We determine the optimal capacity for the manufacturer in case there is no coordination with the retailer as well as in case there is full coordination with the retailer. When there is no coordination the optimal capacity for the manufacturer is found by solving a newsvendor problem. When there is coordination, we present a dynamic programming formulation and establish that the optimal ordering policy for the retailer is characterized by two parameters. The optimal coordinated capacity for the manufacturer can then be obtained by solving a nonlinear programming problem. We present an efficient exact algorithm and a heuristic algorithm for computing the manufacturer's capacity. We discuss the impact of coordination on the supply chain cost as well as on the manufacturer's capacity. We also identify the situations in which coordination is most beneficial. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008 相似文献
325.
Lot splitting is a new approach for improving productivity by dividing production lots into sublots. This approach enables accelerating production flow, reducing lead‐time and increasing the utilization of organization resources. Most of the lot splitting models in the literature have addressed a single objective problem, usually the makespan or flowtime objectives. Simultaneous minimization of these two objectives has rarely been addressed in the literature despite of its high relevancy to most industrial environments. This work aims at solving a multiobjective lot splitting problem for multiple products in a flowshop environment. Tight mixed‐integer linear programming (MILP) formulations for minimizing the makespan and flowtime are presented. Then, the MinMax solution, which takes both objectives into consideration, is defined and suggested as an alternative objective. By solving the MILP model, it was found that minimizing one objective results in an average loss of about 15% in the other objective. The MinMax solution, on the other hand, results in an average loss of 4.6% from the furthest objective and 2.5% from the closest objective. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010 相似文献
326.
327.
328.
329.
Michael J. Armstrong 《海军后勤学研究》2007,54(1):66-77
This article considers two related questions of tactics in the context of the salvo model for naval missile combat. For a given set of targets, how many missiles should be fired to produce an effective attack? For a given available salvo size, how many enemy targets should be fired at? In the deterministic version of the model I derive a simple optimality relationship between the number of missiles to fire and the number of targets to engage. In the stochastic model I employ the expected loss inflicted and the probability of enemy elimination as the main performance measures and use these to derive salvo sizes that are in some sense “optimal.” I find that the offensive firepower needed for an effective attack depends not only on a target's total strength but also on the relative balance between its active defensive power and passive staying power. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007 相似文献
330.