全文获取类型
收费全文 | 318篇 |
免费 | 6篇 |
出版年
2021年 | 7篇 |
2020年 | 2篇 |
2019年 | 7篇 |
2018年 | 4篇 |
2017年 | 3篇 |
2016年 | 7篇 |
2015年 | 2篇 |
2014年 | 5篇 |
2013年 | 55篇 |
2012年 | 3篇 |
2009年 | 4篇 |
2008年 | 2篇 |
2007年 | 12篇 |
2005年 | 2篇 |
2004年 | 3篇 |
2003年 | 7篇 |
2002年 | 6篇 |
2001年 | 2篇 |
2000年 | 3篇 |
1999年 | 3篇 |
1998年 | 7篇 |
1997年 | 8篇 |
1994年 | 2篇 |
1993年 | 5篇 |
1992年 | 6篇 |
1991年 | 2篇 |
1990年 | 8篇 |
1989年 | 10篇 |
1988年 | 2篇 |
1987年 | 4篇 |
1986年 | 13篇 |
1985年 | 7篇 |
1984年 | 4篇 |
1983年 | 3篇 |
1982年 | 10篇 |
1981年 | 6篇 |
1980年 | 7篇 |
1979年 | 9篇 |
1978年 | 8篇 |
1977年 | 5篇 |
1976年 | 5篇 |
1975年 | 4篇 |
1974年 | 8篇 |
1973年 | 5篇 |
1972年 | 3篇 |
1971年 | 7篇 |
1970年 | 6篇 |
1969年 | 5篇 |
1967年 | 5篇 |
1948年 | 4篇 |
排序方式: 共有324条查询结果,搜索用时 417 毫秒
61.
Kenneth R. Baker 《海军后勤学研究》1999,46(8):978-991
This paper examines heuristic solution procedures for scheduling jobs on a single machine to minimize the maximum lateness in the presence of setup times between different job families. It reviews the state of knowledge about the solution of this problem, which is known to be difficult to solve in general, and examines natural solution approaches derived from some of the underlying theory. The emphasis is on the design and computational evaluation of new heuristic procedures. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 978–991, 1999 相似文献
62.
The Joint Replenishment Problem (JRP) involves production planning for a family of items. The items have a coordinated cost structure whereby a major setup cost is incurred whenever any item in the family is produced, and an item-specific minor setup cost is incurred whenever that item is produced. This paper investigates the performance of two types of cyclical production schedules for the JRP with dynamic demands over a finite planning horizon. The cyclical schedules considered are: (1) general cyclical schedules—schedules where the number of periods between successive production runs for any item is constant over the planning horizon—and (2) power-of-two schedules—a subset of cyclical schedules for which the number of periods between successive setups must be a power of 2. The paper evaluates the additional cost incurred by requiring schedules to be cyclical, and identifies problem characteristics that have a significant effect on this additional cost. © 1997 John Wiley & Sons, Inc. Naval Research Logistics 44: 577–589, 1997. 相似文献
63.
In this article we try to identify appropriate solution procedures for different types of multiechelon production planning problems. We conduct an extensive computational study on uncapacitated multiechelon production planning problems with serial and assembly types of bill-of-material structures. Problems are formulated as both single-source fixed charge network problems and as multicommodity flow problems with fixed charges. Solution procedures considered are branch and cut, Lagrangean relaxation (for the network formulation), and branch and bound (for the multicommodity formulation). Three hundred problems with various problem structures are tested. Our conclusions suggest the best approach for each type of problem structure. © 1997 John Wiley & Sons, Inc. 相似文献
64.
This article examines the historical impact of foreign fighters and how the international community has sought to counter this threat. It argues that foreign fighters have contributed significantly to the metastasis of Salafi-jihadism over the past 30 years. They have globalized local conflicts. They have brought advanced skills to battlefields. Further, the logistics infrastructure built by foreign fighters has allowed Salafi-jihadism to expand rapidly. The challenge for security officials today is how to prevent the foreign fighters in Syria and Iraq from expanding the threat of Salafi-jihadism further. To inform this effort, this article derives lessons learned from past efforts against Arab Afghans in Bosnia (1992–1995) and Abu Musab al-Zarqawi’s foreign volunteers in Iraq (2003–2008). 相似文献
65.
In this paper we study a machine repair problem in which a single unreliable server maintains N identical machines. The breakdown times of the machines are assumed to follow an exponential distribution. The server is subject to failure and the failure times are exponentially distributed. The repair times of the machine and the service times of the repairman are assumed to be of phase type. Using matrix‐analytic methods, we perform steady state analysis of this model. The time spent by a failed machine in service and the total time in the repair facility are shown to be of phase type. Several performance measures are evaluated. An optimization problem to determine the number of machines to be assigned to the server that will maximize the expected total profit per unit time is discussed. An illustrative numerical example is presented. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 462–480, 2003 相似文献
66.
In this paper we consider networks that consist of components operating under a randomly changing common environment. Our work is motivated by power system networks that are subject to fluctuating weather conditions over time that affect the performance of the network. We develop a general setup for any network that is subject to such environment and present results for network reliability assessment under two repair scenarios. We also present Bayesian analysis of network failure data and illustrate how reliability predictions can be obtained for the network. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 574–591, 2003 相似文献
67.
Why did the United States fail to stop Israeli acquisition of nuclear weapons? Existing research argues that patrons such as the U.S. should have an easy time halting proliferation by militarily and economically vulnerable clients. Nevertheless, Israel acquired nuclear weapons with relatively little American opposition. Utilizing extensive primary source research, we argue that problematic intelligence-policy relations hindered U.S. efforts to arrest Israeli proliferation as (1) policymakers often gave mixed guidance to the intelligence community, resulting in (2) limited information on Israeli efforts that reinforced policy ambiguity. The results carry implications for understanding the dynamics of nuclear proliferation and intelligence-policy relations. 相似文献
68.
International population assistance in the UN is a relatively recent development; it is only since 1966 that a broad-based technical assistance program in population was authorized by the General Assembly. The desire of developing country members for accelerated economic growth ultimately brought about a change in the views on population. In 1967, the Secretary General established a trust fund for population activities, later renamed the United Nations Fund for Population Activities (UNFPA). 3 principles have guided UNFPA work since its inception: 1) national sovereignty in population matters is to be resspected and adhered to at all times, 2) individuals and couples are to be provided the information and services necessary to determine freely and responsibly the number and spacing of their children, and 3) population goals and policies are integral parts of socioeconomic defelopment. The areas of assistance by the UNFPA consist of 1) family planning, 2) communication and education, 3) population dynamics, 4) basic data collection, 5) population policy formulation and implementation, and 6) special programs such as those for women and the aging population. In 16 years, the UNFPA has received about $1.4 billion for transfer to developing countries as population assistanceand has financed 4373 population projects in 149 countries and territories. The relation between the US government and UNFPA is tenuous and likely to remain so as long as the US cannot resolve its own domestic controversies over famly planning, foreign population assistance, abortion, which, ironically, is legalin the country. There will always be some sort of domestic controversy over population; the UN has overcome domestic difficulties by framing the arguments properly within the demographic, social, economic, ecological, and political concerns of countries and applying the fundamental principles of national sovereignty, freedom of individual choice, and the link of population and development,to reconcile differences. 相似文献
69.
Multi-echelon logistic systems are essential parts of the service support function of high technology firms. The combination of technological developments and competitive pressures has led to the development of services systems with a unique set of characteristics. These characteristics include (1) low demand probabilities: (2) high cost items; (3) complex echelon structures; (4) existence of pooling mechanisms among stocking locations at the same echelon level; (5) high priority for service, which is often expressed in terms of response time service levels for product groups of items: (6) scrapping of failed parts; and (7) recycling of issued stock due to diagnostic use. This article develops a comprehensive model of a stochastic, multi-echelon inventory system that takes account of the above characteristics. Solutions to the constrained optimization problem are found using a branch and bound procedure. The results of applying this procedure to a spare parts inventory system for a computer manufacturer have led to a number of important policy conclusions. 相似文献
70.
R. K. Ahuja 《海军后勤学研究》1986,33(4):725-739
In this paper, we consider a variant of the classical transportation problem as well as of the bottleneck transportation problem, which we call the minimax transportation problem. The problem considered is to determine a feasible flow xij from a set of origins I to a set of destinations J for which max(i,j)εIxJ{cijxij} is minimum. In this paper, we develop a parametric algorithm and a primal-dual algorithm to solve this problem. The parametric algorithm solves a transportation problem with parametric upper bounds and the primal-dual algorithm solves a sequence of related maximum flow problems. The primal-dual algorithm is shown to be polynomially bounded. Numerical investigations with both the algorithms are described in detail. The primal-dual algorithm is found to be computationally superior to the parametric algorithm and it can solve problems up to 1000 origins, 1000 destinations and 10,000 arcs in less than 1 minute on a DEC 10 computer system. The optimum solution of the minimax transportation problem may be noninteger. We also suggest a polynomial algorithm to convert this solution into an integer optimum solution. 相似文献