首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   893篇
  免费   21篇
  2021年   14篇
  2019年   29篇
  2018年   19篇
  2017年   20篇
  2016年   20篇
  2015年   20篇
  2014年   11篇
  2013年   166篇
  2011年   8篇
  2009年   9篇
  2008年   8篇
  2007年   11篇
  2006年   11篇
  2005年   15篇
  2004年   16篇
  2003年   10篇
  2002年   8篇
  2000年   14篇
  1999年   10篇
  1998年   12篇
  1997年   24篇
  1996年   19篇
  1994年   18篇
  1993年   7篇
  1992年   11篇
  1991年   22篇
  1990年   12篇
  1989年   19篇
  1988年   12篇
  1987年   21篇
  1986年   16篇
  1985年   16篇
  1984年   12篇
  1983年   15篇
  1982年   13篇
  1981年   13篇
  1980年   16篇
  1979年   17篇
  1978年   14篇
  1977年   15篇
  1976年   14篇
  1975年   12篇
  1974年   18篇
  1973年   18篇
  1972年   15篇
  1971年   19篇
  1970年   9篇
  1969年   11篇
  1968年   10篇
  1967年   8篇
排序方式: 共有914条查询结果,搜索用时 15 毫秒
741.
An efficient algorithm for determining the optimal arrival schedule for customers in a stochastic service system is developed. All customers arrive exactly when scheduled, and service times are modeled as iid Erlang random variables. Costs are incurred at a fixed rate per unit of time each customer waits for service, and an additional cost is incurred for every unit of time the server operates beyond a scheduled closing time. The objective is to minimize total operating cost. This type of problem arises in many operational contexts including transportation, manufacturing, and appointment‐based services. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 549–559, 1999  相似文献   
742.
The paper considers the open shop scheduling problem to minimize the make-span, provided that one of the machines has to process the jobs according to a given sequence. We show that in the preemptive case the problem is polynomially solvable for an arbitrary number of machines. If preemption is not allowed, the problem is NP-hard in the strong sense if the number of machines is variable, and is NP-hard in the ordinary sense in the case of two machines. For the latter case we give a heuristic algorithm that runs in linear time and produces a schedule with the makespan that is at most 5/4 times the optimal value. We also show that the two-machine problem in the nonpreemptive case is solvable in pseudopolynomial time by a dynamic programming algorithm, and that the algorithm can be converted into a fully polynomial approximation scheme. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 705–731, 1998  相似文献   
743.
We explore the management of inventory for stochastic-demand systems, where the product's supply is randomly disrupted for periods of random duration, and demands that arrive when the inventory system is temporarily out of stock become a mix of backorders and lost sales. The stock is managed according to the following modified (s, S) policy: If the inventory level is at or below s and the supply is available, place an order to bring the inventory level up to S. Our analysis yields the optimal values of the policy parameters, and provides insight into the optimal inventory strategy when there are changes in the severity of supply disruptions or in the behavior of unfilled demands. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 687–703, 1998  相似文献   
744.
We discuss the problem of scheduling several jobs on a single machine with the objective of minimizing the weighted mean absolute deviation of flow times around the weighted mean flow time. We first show that the optimal schedule is W-shaped. For the unweighted case, we show that all optimal schedules are V-shaped. This characterization enables us to show that the problem is NP-hard. We then provide a pseudopolynomial algorithm for the unweighted problem. Finally, we consider three heuristic algorithms for the unweighted problem and report computational experience with these algorithms. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 297–311, 1998  相似文献   
745.
Iran’s support for terrorist groups is the subject of countless articles and monographs. Less emphasis is placed on Tehran’s efforts to fight terrorist groups targeting the Iranian state. Yet, modern domestic and foreign terrorist groups have targeted Iran for decades. As a result, the country has developed fairly sophisticated, albeit opaque, counterterrorism apparatus and mechanisms. This article sheds light on the Iranian counterterrorism apparatus and efforts since the 1979 Islamic Revolution, drawing on several years of fieldwork in Iran, interviews with current and former officials, and Persian sources.  相似文献   
746.
747.
Ethnicity and ideology are frequently used to determine whether an armed group is hostile or friendly vis-à-vis the state. By contrast, I argue that the social structure of insurgent movements holds more explanatory power for their respective positions than ethnicity or ideology. To illustrate this, I apply Pierre Bourdieu’s concept of a contest between forces of ‘conservation’ and forces of ‘heresy’ to the current Afghanistan war. I demonstrate that the social structure of the Taleban renders them prone to ‘heresy’, while the formerly second biggest insurgent group, Gulbuddin Hekmatyar’s party, has rather been an impeded force of ‘conservation.’  相似文献   
748.
In 1920, the Birmingham Small Arms Company supplied 10,000 Pattern 1907 bayonets to the government of Siam to accompany an order for rifles. The original maker of these bayonets was unknown, but historical research indicates that the Wilkinson Sword Co. Ltd. was a primary maker. The weights of some surviving Pattern 1907 bayonets, including twelve bayonets from the 10,000 described above, produced by the six makers in the UK before and during the Great War (1914–1918) period were available. A statistical analysis of the data was performed to compare with the historical research. The results strongly supported that the Wilkinson Sword Co. Ltd. was a primary maker. They were also sufficient to exclude from this batch of twelve bayonets the Royal Small Arms Factory (Enfield) and Vickers Ltd. as manufacturers. The statistical evidence for the presence of bayonets made by J.A. Chapman Ltd., R. Mole & Sons and Sanderson Bros. was weaker than that for the Wilkinson Sword Co. Ltd., but was nevertheless supportive of that hypothesis. Overall, the analysis was consistent with the supply to Siam of commingled bayonets from British government stores. It was noted that the bayonets for the Siam contract fell into a relatively narrow weight range, but the reason for this could not be determined.  相似文献   
749.
We consider stochastic scheduling models which have the natural character that jobs improve while being processed, but deteriorate (and may possibly leave the system altogether) while processing is diverted elsewhere. Such restless bandit problems are shown to be indexable in the sense of Whittle. A numerical study which elucidates the strong performance of the resulting index policy is complemented by a theoretical study which demonstrates the optimality of the index policy under given conditions and which develops performance guarantees for the index heuristic more generally. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 706–721, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10036  相似文献   
750.
In this paper we analyze a two‐period supply contract which allows for order adjustment by the buyer. The buyer is required to place orders for two periods. After observing initial demand, the buyer is then allowed to adjust the second order, paying a per unit order adjustment penalty. We describe the optimal behavior of the buyer under such a contract, both in determining the initial order quantities and in subsequently adjusting the order. We compare the solution to a contract where no adjustment is allowed and to the case where adjustment is allowed without penalty. We demonstrate that flexible contracts can reduce the potentially negative effect of correlation of demand between two periods. Further, we investigate how the duration of the first period vis‐à‐vis the second period affects the profitability of the buyer as a function of the degree of correlation. © 2002 John Wiley & Sons, Inc. Naval Research Logistics, 49: 25–45, 2002; DOI 10.1002/nav.10002  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号