全文获取类型
收费全文 | 196篇 |
免费 | 9篇 |
出版年
2021年 | 1篇 |
2019年 | 4篇 |
2018年 | 5篇 |
2017年 | 8篇 |
2016年 | 5篇 |
2015年 | 5篇 |
2014年 | 5篇 |
2013年 | 68篇 |
2012年 | 2篇 |
2011年 | 5篇 |
2010年 | 3篇 |
2009年 | 4篇 |
2008年 | 4篇 |
2007年 | 2篇 |
2006年 | 5篇 |
2005年 | 7篇 |
2004年 | 4篇 |
2003年 | 2篇 |
2002年 | 3篇 |
2000年 | 2篇 |
1999年 | 2篇 |
1998年 | 2篇 |
1997年 | 2篇 |
1996年 | 3篇 |
1995年 | 4篇 |
1994年 | 4篇 |
1993年 | 4篇 |
1992年 | 6篇 |
1991年 | 3篇 |
1990年 | 2篇 |
1989年 | 3篇 |
1988年 | 4篇 |
1987年 | 4篇 |
1986年 | 1篇 |
1985年 | 2篇 |
1983年 | 2篇 |
1981年 | 3篇 |
1980年 | 1篇 |
1979年 | 1篇 |
1975年 | 3篇 |
1973年 | 1篇 |
1971年 | 1篇 |
1970年 | 1篇 |
1967年 | 1篇 |
1966年 | 1篇 |
排序方式: 共有205条查询结果,搜索用时 31 毫秒
131.
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 相似文献
132.
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 相似文献
133.
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 相似文献
134.
135.
136.
137.
Michael Goodman 《战略研究杂志》2013,36(2):120-151
With relations with the Soviet Union growing ever ‘hotter’, it became essential for the British to comprehend Soviet atomic development. However, British intelligence had to rely on more overt methods of intelligence collection, which provided an inadequate basis from which to proceed. This was further hindered by the interpretation of such information on the basis of Anglo-American development and by the 1946 McMahon Act. Accordingly the first Soviet atomic bomb in August 1949 was not accurately predicted by the British. Meanwhile British war planning centred on the year 1957, based – it was argued – on strategic forecasts. Yet the impact of recently released intelligence material throws this into question, and instead reveals that the date reflected British war readiness, rather than when British intelligence predicted the Soviet Union would have achieved the nuclear capability to wage a successful war. 相似文献
138.
Michael J. Armstrong 《海军后勤学研究》2013,60(8):652-660
This article analyzes versions of the salvo model of missile combat where area fire is used by one or both sides in a battle. Although these models share some properties with the area fire Lanchester model and the aimed fire salvo model, they also display some interesting differences, especially over the course of several salvos. Although the relative size of each force is important with aimed fire, with area fire, it is the absolute size that matters. Similarly, although aimed fire exhibits square law behavior, area fire shows approximately linear behavior. When one side uses area fire and the other uses aimed fire, the model displays a mix of square and linear law behavior. © 2013 Wiley Periodicals, Inc. Naval Research Logistics 60: 652–660, 2013 相似文献
139.
140.