全文获取类型
收费全文 | 283篇 |
免费 | 48篇 |
国内免费 | 9篇 |
出版年
2021年 | 3篇 |
2020年 | 2篇 |
2019年 | 18篇 |
2018年 | 11篇 |
2017年 | 12篇 |
2016年 | 14篇 |
2015年 | 19篇 |
2014年 | 15篇 |
2013年 | 99篇 |
2012年 | 11篇 |
2011年 | 10篇 |
2010年 | 5篇 |
2009年 | 8篇 |
2008年 | 9篇 |
2007年 | 12篇 |
2006年 | 7篇 |
2005年 | 12篇 |
2004年 | 8篇 |
2003年 | 12篇 |
2002年 | 10篇 |
2001年 | 8篇 |
2000年 | 11篇 |
1999年 | 10篇 |
1998年 | 1篇 |
1997年 | 1篇 |
1995年 | 1篇 |
1994年 | 1篇 |
1993年 | 1篇 |
1990年 | 1篇 |
1986年 | 1篇 |
1984年 | 1篇 |
1978年 | 1篇 |
1975年 | 2篇 |
1974年 | 1篇 |
1972年 | 1篇 |
1970年 | 1篇 |
排序方式: 共有340条查询结果,搜索用时 46 毫秒
271.
This paper tackles the general single machine scheduling problem, where jobs have different release and due dates and the objective is to minimize the weighted number of late jobs. The notion of master sequence is first introduced, i.e., a sequence that contains at least an optimal sequence of jobs on time. This master sequence is used to derive an original mixed‐integer linear programming formulation. By relaxing some constraints, a Lagrangean relaxation algorithm is designed which gives both lower and upper bounds. The special case where jobs have equal weights is analyzed. Computational results are presented and, although the duality gap becomes larger with the number of jobs, it is possible to solve problems of more than 100 jobs. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 50: 2003 相似文献
272.
The maintenance strategy considered in this article is in the class of block replacement policies. The working unit is replaced by new ones at instants T,2T,3T,… independently of the age and state of the unit. If a failure occurs between these instants, the random repair cost is evaluated. If it is smaller than a predetermined control limit then a minimal repair is carried out. Otherwise the unit is replaced by a used unit. The performance of this maintenance strategy is evaluated in terms of average total cost per time unit over an infinite time span. The mathematical model is defined and several analytical results are obtained. A computer program has been written, which solves the mathematical problem, and some examples are given for the cases where the underlying life distribution is gamma, Weibull or truncated normal. 相似文献
273.
Stéfanie von Hlatky 《Defence Studies》2018,18(1):19-38
Why does joint defence production of advanced weapons systems, which appears like a logical choice at first, become harder for both the primary production state and its allies to manage and justify as the acquisition process runs its course? To answer this question, we analyze the multinational politics of the F-35 JSF with a focus on how secondary states who have bought into the program are affected by domestic politics within the primary production state. We find that US congressional and bureaucratic politics, cuts to US defence spending, and a desire to retain tight control over the program has locked allies into a program with which they have little leverage. Potentially losing the ability to fight along side the US if they don’t follow through, coupled with inter-Alliance pressures, leaves secondary states who are involved with the F-35 program, vulnerable to the whims of US domestic politics. 相似文献
274.
This paper investigates what motivates young people to volunteer for peace-keeping or peace-enforcing missions and how their motives change between pre- and post-deployment. Data include information about social and military background, and motives for more than 600 soldiers, 444 of whom answered the survey both before and after deployment. Soldiers are deployed to different missions under the same circumstances. To conceptualize motives among soldiers, we use factor analysis and find three factors: challenge, self-benefit, and fidelity. Challenge represents an occupational orientation; fidelity, an institutional orientation; and self-benefit, a desire for adventure. Exploiting the within-subject design of our data, we find that pre- and post-deployment motives vary significantly according to the type of mission and soldiers’ previous experiences (first-timers or experienced soldiers). Our results suggest that after the mission, peace-keepers are generally more disappointed than peace-enforcers. Our results also show that self-benefit motives are important for younger soldiers with only a high school education, and that this group usually serves as peace-enforcers during their gap year. 相似文献
275.
Despite its ability to result in more effective network plans, the telecommunication network planning problem with signal‐to‐interference ratio constraints gained less attention than the power‐based one because of its complexity. In this article, we provide an exact solution method for this class of problems that combines combinatorial Benders decomposition, classical Benders decomposition, and valid cuts in a nested way. Combinatorial Benders decomposition is first applied, leading to a binary master problem and a mixed integer subproblem. The subproblem is then decomposed using classical Benders decomposition. The algorithm is enhanced using valid cuts that are generated at the classical Benders subproblem and are added to the combinatorial Benders master problem. The valid cuts proved efficient in reducing the number of times the combinatorial Benders master problem is solved and in reducing the overall computational time. More than 120 instances of the W‐CDMA network planning problem ranging from 20 demand points and 10 base stations to 140 demand points and 30 base stations are solved to optimality. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010 相似文献
276.
277.
We consider a make‐to‐order production system where two major components, one nonperishable (referred to as part 1) and one perishable (part 2), are needed to fulfill a customer order. In each period, replenishment decisions for both parts need to be made jointly before demand is realized and a fixed ordering cost is incurred for the nonperishable part. We show that a simple (sn,S,S) policy is optimal. Under this policy, S along with the number of backorders at the beginning of a period if any and the availability of the nonperishable part (part 1) determines the optimal order quantity of the perishable part (part 2), while (sn,S) guide when and how much of part 1 to order at each state. Numerical study demonstrates that the benefits of using the joint replenishment policy can be substantial, especially when the unit costs are high and/or the profit margin is low. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2009 相似文献
278.
We investigate the problem in which an agent has to find an object that moves between two locations according to a discrete Markov process (Pollock, Operat Res 18 (1970) 883–903). At every period, the agent has three options: searching left, searching right, and waiting. We assume that waiting is costless whereas searching is costly. Moreover, when the agent searches the location that contains the object, he finds it with probability 1 (i.e. there is no overlooking). Waiting can be useful because it could induce a more favorable probability distribution over the two locations next period. We find an essentially unique (nearly) optimal strategy, and prove that it is characterized by two thresholds (as conjectured by Weber, J Appl Probab 23 (1986) 708–717). We show, moreover, that it can never be optimal to search the location with the lower probability of containing the object. The latter result is far from obvious and is in clear contrast with the example in Ross (1983) for the model without waiting. © 2009 Wiley Periodicals, Inc. Naval Research Logistics 2009 相似文献
279.
This paper deals with search for a target following a Markovian movement or a conditionally deterministic motion. The problem is to allocate the search efforts, when search resources renew with generalized linear constraints. The model obtained is extended to resource mixing management. New optimality equations of de Guenin's style are obtained. Practically, the problem is solved by using an algorithm derived from the FAB method. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 117–142, 2002; DOI 10.1002/nav.10009 相似文献
280.
Substitutable product inventory problem is analyzed using the concepts of stochastic game theory. It is assumed that there are two substitutable products that are sold by different retailers and the demand for each product is random. Game theoretic nature of this problem is the result of substitution between products. Since retailers compete for the substitutable demand, ordering decision of each retailer depends on the ordering decision of the other retailer. Under the discounted payoff criterion, this problem is formulated as a two‐person nonzero‐sum stochastic game. In the case of linear ordering cost, it is shown that there exists a Nash equilibrium characterized by a pair of stationary base stock strategies for the infinite horizon problem. This is the unique Nash equilibrium within the class of stationary base stock strategies. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 359–375, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10018 相似文献