全文获取类型
| 收费全文 | 891篇 |
| 免费 | 0篇 |
专业分类
| 891篇 |
出版年
| 2021年 | 13篇 |
| 2019年 | 28篇 |
| 2018年 | 22篇 |
| 2017年 | 20篇 |
| 2016年 | 21篇 |
| 2015年 | 19篇 |
| 2014年 | 14篇 |
| 2013年 | 190篇 |
| 2011年 | 8篇 |
| 2009年 | 12篇 |
| 2008年 | 11篇 |
| 2007年 | 9篇 |
| 2006年 | 10篇 |
| 2005年 | 19篇 |
| 2004年 | 17篇 |
| 2003年 | 12篇 |
| 2002年 | 9篇 |
| 2000年 | 9篇 |
| 1999年 | 8篇 |
| 1998年 | 11篇 |
| 1997年 | 18篇 |
| 1996年 | 16篇 |
| 1995年 | 9篇 |
| 1994年 | 19篇 |
| 1992年 | 11篇 |
| 1991年 | 26篇 |
| 1989年 | 15篇 |
| 1988年 | 12篇 |
| 1987年 | 23篇 |
| 1986年 | 15篇 |
| 1985年 | 19篇 |
| 1984年 | 11篇 |
| 1983年 | 10篇 |
| 1982年 | 10篇 |
| 1981年 | 7篇 |
| 1980年 | 11篇 |
| 1979年 | 14篇 |
| 1978年 | 10篇 |
| 1977年 | 14篇 |
| 1976年 | 12篇 |
| 1975年 | 8篇 |
| 1974年 | 13篇 |
| 1973年 | 15篇 |
| 1972年 | 15篇 |
| 1971年 | 11篇 |
| 1970年 | 14篇 |
| 1969年 | 11篇 |
| 1968年 | 9篇 |
| 1967年 | 10篇 |
| 1966年 | 7篇 |
排序方式： 共有891条查询结果，搜索用时 15 毫秒
201.
In this paper we consider the problem of scheduling a set of jobs on a single machine on which a rate‐modifying activity may be performed. The rate‐modifying activity is an activity that changes the production rate of the machine. So the processing time of a job is a variable, which depends on whether it is scheduled before or after the rate‐modifying activity. We assume that the rate‐modifying activity can take place only at certain predetermined time points, which is a constrained case of a similar problem discussed in the literature. The decisions under consideration are whether and when to schedule the rate‐modifying activity, and how to sequence the jobs in order to minimize some objectives. We study the problems of minimizing makespan and total completion time. We first analyze the computational complexity of both problems for most of the possible versions. The analysis shows that the problems are NP‐hard even for some special cases. Furthermore, for the NP‐hard cases of the makespan problem, we present a pseudo‐polynomial time optimal algorithm and a fully polynomial time approximation scheme. For the total completion time problem, we provide a pseudo‐polynomial time optimal algorithm for the case with agreeable modifying rates. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005 相似文献
202.
The scheduling problem addressed in this paper concerns a manufacturer who produces a variety of product types and operates in a make‐to‐order environment. Each customer order consists of known quantities of the different product types, and must be delivered as a single shipment. Periodically the manufacturer schedules the accumulated and unscheduled customer orders. Instances of this problem occur across industries in manufacturing as well as in service environments. In this paper we show that the problem of minimizing the weighted sum of customer order delivery times is unary NP‐hard. We characterize the optimal schedule, solve several special cases of the problem, derive tight lower bounds, and propose several heuristic solutions. We report the results of a set of computational experiments to evaluate the lower bounding procedures and the heuristics, and to determine optimal solutions. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005. 相似文献
203.
In this paper, we extend the results of Ferguson M. Naval Research Logistics 8 . on an end‐product manufacturer's choice of when to commit to an order quantity from its parts supplier. During the supplier's lead‐time, information arrives about end‐product demand. This information reduces some of the forecast uncertainty. While the supplier must choose its production quantity of parts based on the original forecast, the manufacturer can wait to place its order from the supplier after observing the information update. We find that a manufacturer is sometimes better off with a contract requiring an early commitment to its order quantity, before the supplier commits resources. On the other hand, the supplier sometimes prefers a delayed commitment. The preferences depend upon the amount of demand uncertainty resolved by the information as well as which member of the supply chain sets the exchange price. We also show conditions where demand information updating is detrimental to both the manufacturer and the supplier. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005 相似文献
204.
Command and Control (C2) in a military setting can be epitomized in battles‐of‐old when commanders would seek high ground to gain superior spatial‐temporal information; from this vantage point, decisions were made and relayed to units in the field. Although the fundamentals remain, technology has changed the practice of C2; for example, enemy units may be observed remotely, with instruments of varying positional accuracy. A basic problem in C2 is the ability to track an enemy object in the battlespace and to forecast its future position; the (extended) Kalman filter provides a straightforward solution. The problem changes fundamentally if one assumes that the moving object is headed for an (unknown) location, or waypoint. This article is concerned with the new problem of estimation of such a waypoint, for which we use Bayesian statistical prediction. The computational burden is greater than an ad hoc regression‐based estimate, which we also develop, but the Bayesian approach has a big advantage in that it yields both a predictor and a measure of its variability. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004 相似文献
205.
206.
An important aspect of supply chain management is dealing with demand and supply uncertainty. The uncertainty of future supply can be reduced if a company is able to obtain advance capacity information (ACI) about future supply/production capacity availability from its supplier. We address a periodic‐review inventory system under stochastic demand and stochastic limited supply, for which ACI is available. We show that the optimal ordering policy is a state‐dependent base‐stock policy characterized by a base‐stock level that is a function of ACI. We establish a link with inventory models that use advance demand information (ADI) by developing a capacitated inventory system with ADI, and we show that equivalence can only be set under a very specific and restrictive assumption, implying that ADI insights will not necessarily hold in the ACI environment. Our numerical results reveal several managerial insights. In particular, we show that ACI is most beneficial when there is sufficient flexibility to react to anticipated demand and supply capacity mismatches. Further, most of the benefits can be achieved with only limited future visibility. We also show that the system parameters affecting the value of ACI interact in a complex way and therefore need to be considered in an integrated manner. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011 相似文献
207.
Thomas G. Mahnken 《战略研究杂志》2013,36(4):26-54
An analysis of US assessments of Germany's development of armored warfare illustrates the problems that intelligence agencies face as they attempt to understand military innovation. The covert nature of German Army's tank research in the years immediately following World War I limited the number of indicators of Berlin's interest in armored warfare. Similarly, the United States possessed at best a fragmentary picture of German experimentation with armor. By the outbreak of World War II, however, US military attaches had nonetheless developed an accurate understanding of German concepts of armored warfare. If the United States is to avoid strategic surprise in the future, it must cultivate intelligence sources and employ considerably different methods from those of the Cold War. 相似文献
208.
Strengthening the United States' ability to prevent adversaries from smuggling nuclear materials into the country is a vital and ongoing issue. The prospect of additional countries, such as Iran, obtaining the know‐how and equipment to produce these special nuclear materials in the near future underscores the need for efficient and effective inspection policies at ports and border crossings. In addition, the reduction of defense and homeland security budgets in recent years has made it increasingly important to accomplish the interdiction mission with fewer funds. Addressing these complications, in this article, we present a novel two‐port interdiction model. We propose using prior inspection data as a low‐cost way of increasing overall interdiction performance. We provide insights into two primary questions: first, how should a decision maker at a domestic port use detection data from the foreign port to improve the overall detection capability? Second, what are potential limitations to the usefulness of prior inspection data—is it possible that using prior data actually harms decision making at the domestic port? We find that a boundary curve policy (BCP) that takes into account both foreign and domestic inspection data can provide a significant improvement in detection probability. This BCP also proves to be surprisingly robust, even if adversaries are able to infiltrate shipments during transit. © 2013 Wiley Periodicals, Inc. Naval Research Logistics 60: 433‐448, 2013 相似文献
209.
Gary E Weir 《战略研究杂志》2013,36(2):411-427
The Cold War at sea expanded in many realms, including the frigid and treacherous waters of the Arctic Ocean. The US Navy pioneered these efforts with the visit of USS Nautilus to the North Pole in 1958. During the latter stages of the Cold War, however, Soviet naval strategists began to conceptualize the polar ice cap as a strategic asset for cloaking the operations of its nuclear missile submarines. As under-ice operations afforded the Soviet submarine fleet advantages of stealth, proximity to target and tighter lines of communications, both navies were forced to try to develop tactics for combat under these extremely complex and arduous conditions. 相似文献
210.
In this article, a distribution system is studied where the sum of transportation and inventory costs is to be minimized. The inventory holding cost is assumed to be the same for all retailers. A fixed partition (FP) periodic policy is proposed with tight asymptotic worst‐case performance of 3/2 with respect to the best possible policy. This bound cannot be improved in the class of FP periodic policies. In partition‐based PB policies, the retailers are first partitioned into sets and then the sets are grouped in such a way that sets of retailers within a group are served together at selected times. A PB periodic, policy is presented with tight worst‐case asymptotic performance of with respect to the best possible policy. This latter performance improves the worst‐case asymptotic performance of of the previously best known policy for this problem. We also show that the proposed PB periodic policy has the best worst‐case asymptotic performance within the class of PB policies. Finally, practical heuristics inspired by the analyzed policies are designed and tested. The asymptotic worst–case performances of the heuristics are shown to be the same of those of the analyzed policies. Computational results show that the heuristics suggested are less than 6.4% on average from a lower bound on the optimal cost when 50 or more retailers are involved. © 2013 Wiley Periodicals, Inc. Naval Research Logistics 00: 000–000, 2013 相似文献