全文获取类型
收费全文 | 411篇 |
免费 | 9篇 |
出版年
2021年 | 4篇 |
2019年 | 7篇 |
2018年 | 11篇 |
2017年 | 8篇 |
2016年 | 11篇 |
2014年 | 7篇 |
2013年 | 105篇 |
2011年 | 3篇 |
2010年 | 6篇 |
2009年 | 5篇 |
2008年 | 4篇 |
2006年 | 4篇 |
2005年 | 8篇 |
2004年 | 4篇 |
2003年 | 6篇 |
2002年 | 9篇 |
2001年 | 4篇 |
2000年 | 6篇 |
1999年 | 5篇 |
1998年 | 3篇 |
1997年 | 8篇 |
1996年 | 4篇 |
1995年 | 4篇 |
1994年 | 6篇 |
1993年 | 12篇 |
1992年 | 6篇 |
1991年 | 7篇 |
1990年 | 3篇 |
1989年 | 6篇 |
1988年 | 11篇 |
1987年 | 9篇 |
1986年 | 9篇 |
1985年 | 10篇 |
1984年 | 10篇 |
1983年 | 3篇 |
1982年 | 4篇 |
1981年 | 3篇 |
1980年 | 5篇 |
1979年 | 6篇 |
1978年 | 9篇 |
1977年 | 6篇 |
1976年 | 4篇 |
1974年 | 9篇 |
1972年 | 5篇 |
1971年 | 10篇 |
1970年 | 5篇 |
1969年 | 7篇 |
1968年 | 3篇 |
1967年 | 3篇 |
1966年 | 2篇 |
排序方式: 共有420条查询结果,搜索用时 312 毫秒
311.
The problem of optimizing a linear function over the efficient set of a multiple objective linear program is an important but difficult problem in multiple criteria decision making. In this article we present a flexible face search heuristic algorithm for the problem. Preliminary computational experiments indicate that the algorithm gives very good estimates of the global optimum with relatively little computational effort. © 1993 John Wiley & Sons, Inc. 相似文献
312.
We address a single-machine scheduling problem in which penalties are assigned for early and tardy completion of jobs. These penalties are common in industrial settings where early job completion can cause the cash commitment to resources in a time frame earlier than needed, giving rise to early completion penalties. Tardiness penalties arise from a variety of sources, such as loss of customer goodwill, opportunity costs of lost sales, and direct cash penalties. Accounting for earliness cost makes the performance measure nonregular, and this nonregularity has apparently discouraged researchers from seeking solutions to this problem. We found that it is not much more difficult to design an enumerative search for this problem than it would be if the performance measure were regular. We present and demonstrate an efficient timetabling procedure which can be embedded in an enumerative algorithm allowing the search to be conducted over the domain of job permutations.© 1993 John Wiley & Sons, Inc. 相似文献
313.
A two-unit cold standby production system with one repairman is considered. After inspection of a failed unit the repairman chooses either a slow or a fast repair rate to carry out the corresponding amount of work. At system breakdown the repairman has an additional opportunity to switch to the fast rate. If there are no fixed costs associated with system breakdowns, then the policy which minimizes longrun average costs is shown to be a two-dimensional control limit rule. If fixed costs are incurred every time the system breaks down, then the optimal policy is not necessarily of control limit type. This is illustrated by a counterexample. Furthermore, we present several performance measures for this maintenance system controlled by a two-dimensional control limit rule. © 1993 John Wiley & Sons, Inc. 相似文献
314.
P. Patrick Wang 《海军后勤学研究》2000,47(5):440-454
We study discrete‐time, parallel queues with two identical servers. Customers arrive randomly at the system and join the queue with the shortest workload that is defined as the total service time required for the server to complete all the customers in the queue. The arrivals are assumed to follow a geometric distribution and the service times are assumed to have a general distribution. It is a no‐jockeying queue. The two‐dimensional state space is truncated into a banded array. The resulting modified queue is studied using the method of probability generating function (pgf) The workload distribution in steady state is obtained in form of pgf. A special case where the service time is a deterministic constant is further investigated. Numerical examples are illustrated. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 440–454, 2000 相似文献
315.
We consider the problem of optimally maintaining a stochastically degrading, single‐unit system using heterogeneous spares of varying quality. The system's failures are unannounced; therefore, it is inspected periodically to determine its status (functioning or failed). The system continues in operation until it is either preventively or correctively maintained. The available maintenance options include perfect repair, which restores the system to an as‐good‐as‐new condition, and replacement with a randomly selected unit from the supply of heterogeneous spares. The objective is to minimize the total expected discounted maintenance costs over an infinite time horizon. We formulate the problem using a mixed observability Markov decision process (MOMDP) model in which the system's age is observable but its quality must be inferred. We show, under suitable conditions, the monotonicity of the optimal value function in the belief about the system quality and establish conditions under which finite preventive maintenance thresholds exist. A detailed computational study reveals that the optimal policy encourages exploration when the system's quality is uncertain; the policy is more exploitive when the quality is highly certain. The study also demonstrates that substantial cost savings are achieved by utilizing our MOMDP‐based method as compared to more naïve methods of accounting for heterogeneous spares. 相似文献
316.
Lionel P. Fatton 《Contemporary Security Policy》2016,37(2):200-222
Amid tensions with the West over Ukraine, Russia pulled out of the Treaty on Conventional Armed Forces in Europe in March 2015. The Russian case is another example of a country disengaging from conventional arms control when relations with other member states deteriorate. This raises an important question: can arms control regimes aimed at preventing conflict survive periods of tension and preserve peace? This article argues no. It demonstrates that the prospect and stability of conventional arms control regimes depend on healthy international relations. In times of tension, governments rely on military institutions for advice and absorb military biases incompatible with arms control. Therefore, these regimes fail when most needed and are impotent as instruments of peace. Beyond conventional arms control, the article hints at the fragility of nuclear agreements such as the 2015 Iran deal and the 2010 New START between the United States and Russia. 相似文献
317.
A general Markovian model representing several multiple-unit redundant repairable systems is proposed and its transient behavior is studied. Specifically, for multiple-unit reliability system the reliability and availability functions are derived in an explicit form for the transient case. The stationary availability and mean time to system failure are deduced from the main results as special cases. 相似文献
318.
Consider a renewal process whose interrenewal-time distribution is phase type with representation (α, T). We show that the (time-dependent) excess-life distribution is phase type with representation (α′, T), where α′ is an appropriately modified initial probability vector. Using this result, we derive the (time-dependent) distributions for the current life and the total life of the phase-type renewal process. They in turn enable us to obtain the equilibrium distributions for the three random variables. These results simplify the computation of the respective distribution functions and consequently enhance the potential use of renewal theory in stochastic modeling—particularly in inventory, queueing, and reliability applications. © 1992 John Wiley & Sons, Inc. 相似文献
319.
A point is placed at random on the real line according to some known distribution F, and a search is made for this point, beginning at some starting points s on the line, and moving along the line according to some function x(t). The objective of this article is to maximize the probability of finding the point while traveling at most d units. Characterizations of simple optimal searches are found for arbitrary distributions, for continuous distributions with continuous density everywhere (e.g., normal, Cauchy, triangular), and for continuous distributions with density which is continuous on its support (e.g., exponential, uniform). These optimal searches are also shown to be optimal for maximization of the expected number of points found if the points are placed on the line independently from a known distribution F. 相似文献
320.
In this article, we define a scheduling/packing problem called the Job Splitting Problem, motivated by the practices in the printing industry. There are n types of items to be produced on an m‐slot machine. A particular assignment of the types to the slots is called a “run” configuration and requires a setup cost. Once a run begins, the production continues according to that configuration and the “length” of the run represents the quantity produced in each slot during that run. For each unit of production in excess of demand, there is a waste cost. Our goal is to construct a production plan, i.e., a set of runs, such that the total setup and waste cost is minimized. We show that the problem is strongly NP‐hard and propose two integer programming formulations, several preprocessing steps, and two heuristics. We also provide a worst‐case bound for one of the heuristics. Extensive tests on real‐world and randomly generated instances show that the heuristics are both fast and effective, finding near‐optimal solutions. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010 相似文献