全文获取类型
收费全文 | 494篇 |
免费 | 10篇 |
出版年
2021年 | 6篇 |
2019年 | 17篇 |
2018年 | 10篇 |
2017年 | 16篇 |
2016年 | 12篇 |
2015年 | 10篇 |
2014年 | 3篇 |
2013年 | 90篇 |
2011年 | 6篇 |
2010年 | 8篇 |
2009年 | 5篇 |
2008年 | 3篇 |
2007年 | 7篇 |
2006年 | 9篇 |
2005年 | 12篇 |
2004年 | 11篇 |
2003年 | 6篇 |
2002年 | 7篇 |
2001年 | 4篇 |
2000年 | 10篇 |
1999年 | 6篇 |
1998年 | 7篇 |
1997年 | 9篇 |
1996年 | 12篇 |
1995年 | 4篇 |
1994年 | 10篇 |
1993年 | 5篇 |
1991年 | 6篇 |
1990年 | 5篇 |
1989年 | 4篇 |
1986年 | 9篇 |
1985年 | 13篇 |
1984年 | 10篇 |
1983年 | 9篇 |
1982年 | 6篇 |
1981年 | 9篇 |
1980年 | 12篇 |
1979年 | 7篇 |
1978年 | 8篇 |
1977年 | 8篇 |
1976年 | 10篇 |
1975年 | 8篇 |
1974年 | 13篇 |
1973年 | 10篇 |
1972年 | 9篇 |
1971年 | 16篇 |
1970年 | 3篇 |
1969年 | 6篇 |
1968年 | 5篇 |
1967年 | 3篇 |
排序方式: 共有504条查询结果,搜索用时 250 毫秒
461.
Consider n jobs (J1, …, Jn), m working stations (M1, …, Mm) and λ linear resources (R1, …, Rλ). Job Ji consists of m operations (Oi1, …, Oim). Operation Oij requires Pk(i, j) units of resource Rk to be realized in an Mj. The availability of resource Rk and the ability of the working station Mh to consume resource Rk, vary over time. An operation involving more than one resource consumes them in constant proportions equal to those in which they are required. The order in which operations are realized is immaterial. We seek an allocation of the resources such that the schedule length is minimized. In this paper, polynomial algorithms are developed for several problems, while NP-hardness is demonstrated for several others. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 51–66, 1998 相似文献
462.
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 相似文献
463.
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 相似文献
464.
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 相似文献
465.
This paper proposes the use of a cost-based statistical process control system for monitoring the quality of an unreliable analytical machine. In this environment the accuracy of the process cannot be determined by inspecting the output, but must be verified by analyzing standards of known values. The results demonstrate that a significant cost savings can be obtained if analytical results are placed in a “buffer” and their release delayed until the accuracy of the test can be assured. Results suggest the approach not only dramatically improves the quality of results reported but also significantly reduces the expected total cost of testing. © 1996 John Wiley & Sons, Inc. 相似文献
466.
We consider a class of models for the reliability function of a series system. The models incorporate dependence of the function on environmental covariates. On the basis of censored data obtained by monitoring several series systems operating under various sets of values of the covariates, estimators are derived of the reliability function of a series system operating under a different set of values of the covariates. Estimators of various functionals of the reliability function, such as the trimmed mean and quantiles, are also presented. Asymptotic properties of the estimators are obtained with the use of the framework of counting processes and martingales. The loss in efficiency in estimating the regression parameters and the reliability function is also examined when one assumes a more general semiparametric model, when in fact the true model belongs to a more restricted model. We illustrate these procedures with the use of accelerated failure-time data. © 1996 John Wiley & Sons, Inc. 相似文献
467.
In this article we consider the single period procurement strategy for an item with uncertainty in its demand and uncertainty in the capacity of the supplier. Dedicated capacity can be ensured by paying a premium charge to the supplier. The other decision variable is the replenishment quantity to request. It turns out to be very easy to select the best value of this latter quantity. On the other hand, we are only able to characterize the general behavior of the expected profit as a function of the level of dedicated capacity. In general, there can be multiple local maxima as a function of the dedicated capacity. However, for the special, but important, case of normally distributed demand, normally distributed capacity and a linear cost for reserving capacity, an algorithm is developed for finding the best level of dedicated capacity. Some preliminary insights regarding the extension to multiple periods are presented. © 1995 John Wiley & Sons, Inc. 相似文献
468.
Information technology (IT) infrastructure relies on a globalized supply chain that is vulnerable to numerous risks from adversarial attacks. It is important to protect IT infrastructure from these dynamic, persistent risks by delaying adversarial exploits. In this paper, we propose max‐min interdiction models for critical infrastructure protection that prioritizes cost‐effective security mitigations to maximally delay adversarial attacks. We consider attacks originating from multiple adversaries, each of which aims to find a “critical path” through the attack surface to complete the corresponding attack as soon as possible. Decision‐makers can deploy mitigations to delay attack exploits, however, mitigation effectiveness is sometimes uncertain. We propose a stochastic model variant to address this uncertainty by incorporating random delay times. The proposed models can be reformulated as a nested max‐max problem using dualization. We propose a Lagrangian heuristic approach that decomposes the max‐max problem into a number of smaller subproblems, and updates upper and lower bounds to the original problem via subgradient optimization. We evaluate the perfect information solution value as an alternative method for updating the upper bound. Computational results demonstrate that the Lagrangian heuristic identifies near‐optimal solutions efficiently, which outperforms a general purpose mixed‐integer programming solver on medium and large instances. 相似文献
469.
470.