全文获取类型
收费全文 | 394篇 |
免费 | 10篇 |
出版年
2021年 | 12篇 |
2019年 | 8篇 |
2017年 | 9篇 |
2016年 | 8篇 |
2015年 | 11篇 |
2014年 | 9篇 |
2013年 | 71篇 |
2010年 | 2篇 |
2008年 | 4篇 |
2007年 | 4篇 |
2006年 | 5篇 |
2005年 | 4篇 |
2003年 | 2篇 |
2002年 | 6篇 |
2001年 | 6篇 |
2000年 | 4篇 |
1999年 | 6篇 |
1998年 | 9篇 |
1997年 | 8篇 |
1996年 | 6篇 |
1995年 | 6篇 |
1994年 | 8篇 |
1993年 | 8篇 |
1992年 | 7篇 |
1991年 | 8篇 |
1990年 | 2篇 |
1989年 | 7篇 |
1988年 | 16篇 |
1987年 | 6篇 |
1986年 | 15篇 |
1985年 | 9篇 |
1984年 | 6篇 |
1983年 | 7篇 |
1982年 | 4篇 |
1981年 | 8篇 |
1980年 | 6篇 |
1979年 | 11篇 |
1978年 | 7篇 |
1977年 | 7篇 |
1976年 | 2篇 |
1975年 | 9篇 |
1974年 | 7篇 |
1973年 | 5篇 |
1972年 | 7篇 |
1971年 | 4篇 |
1970年 | 4篇 |
1969年 | 6篇 |
1968年 | 3篇 |
1967年 | 2篇 |
1966年 | 3篇 |
排序方式: 共有404条查询结果,搜索用时 31 毫秒
351.
Bounds for P(X + X ⩽ k2σ) are given where X1 and X2 are independent normal variables having zero means and variances σ, σ, respectively. This is generalized when X1 and X2 are dependent variables with known covariance matrix. 相似文献
352.
We study competitive due‐date and capacity management between the marketing and engineering divisions within an engineer‐to‐order (ETO) firm. Marketing interacts directly with the customers and quotes due‐dates for their orders. Engineering is primarily concerned with the efficient utilization of resources and is willing to increase capacity if the cost is compensated. The two divisions share the responsibility for timely delivery of the jobs. We model the interaction between marketing and engineering as a Nash game and investigate the effect of internal competition on the equilibrium decisions. We observe that the internal competition not only degrades the firm's overall profitability but also the serviceability. Finally, we extend our analysis to multiple‐job settings that consider both flexible and inflexible capacity. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008 相似文献
353.
S. Andrew Starbird 《海军后勤学研究》1997,44(6):515-530
Acceptance sampling is often used to monitor the quality of raw materials and components when product testing is destructive, time-consuming, or expensive. In this paper we consider the effect of a buyer-imposed acceptance sampling policy on the optimal batch size and optimal quality level delivered by an expected cost minimizing supplier. We define quality as the supplier's process capability, i.e., the probability that a unit conforms to all product specifications, and we assume that unit cost is an increasing function of the quality level. We also assume that the supplier faces a known and constant “pass-through” cost, i.e., a fixed cost per defective unit passed on to the buyer. We show that the acceptance sampling plan has a significant impact on the supplier's optimal quality level, and we derive the conditions under which zero defects (100% conformance) is the policy that minimizes the supplier's expected annual cost. © 1997 John Wiley & Sons, Inc. Naval Research Logistics 44: 515–530, 1997 相似文献
354.
An economic sequential screening procedure is considered for limited failure populations in which defective items fail soon after they are put in operation and nondefective ones never fail during the technical life of the items. A cost model is constructed that involves screening test cost and external failure cost. A sequential scheme that minimizes the expected cost is derived from the solution of a dynamic programming formulation and the optimal decision at each stage is obtained in a closed form. © 1994 John Wiley & Sons, Inc. 相似文献
355.
Timothy S. Vaughan 《海军后勤学研究》1994,41(5):635-651
This article examines the applicability of acceptance sampling and the effectiveness of Deming's kp rule in relation to the degree of process stability achieved through statistical process control techniques. A discrete-event simulation model is used to characterize the correlation between the number of defective units in a randomly drawn sample versus in the remainder of a lot, in response to a number of system and control chart parameters. The model reveals that such correlation is typically present when special causes of variation affect the production process from time to time, even though the process is tightly monitored through statistical process control. Comparison of these results to an analogous mixed binomial scenario reveals that the mixed binomial model overstates the correlation in question if the state of the process is not necessarily constant during lot production. A generalization of the kp analysis is presented that incorporates the possibility of dependence between a sample and the unsampled portion of the lot. This analysis demonstrates that acceptance sampling is generally ineffective for lots generated by a process subject to statistical process control, despite the fact that the number of defectives in the sample and in the remainder of the lot are not strictly independent. © 1994 John Wiley & Sons, Inc. 相似文献
356.
This article generalizes the classical periodical replacement model with minimal repair by considering the effect of the overhaul, which is assumed to be able to rejuvenate the system. The generalization is based on the notion of the virtual age of a system introduced by Kijima, Morimura, and Suzuki [“Periodical Replacement Problem without Assuming Minimal Repair,” European Journal of Operational Research, 37 , 194–203 (1988)]. © 1995 John Wiley & Sons, Inc. 相似文献
357.
This article presents models for determining the optimum number of Red weapons required to win a heterogeneous combat in which m(m> 1) types of Red weapons face a single type of Blue weapon under a newly defined termination policy. Red aims at either minimizing the total cost or maximizing the aggregated remaining force strength. Kuhn-Tucker and simulated annealing techniques are used for obtaining the optimal solution. The methodology is illustrated by analysing heterogeneous combat to determine (i) the feasibility of introducing new types of weapons and (ii) the number of weapons required to win if a specific type of weapon, say infantry, dominates. © 1995 John Wiley & Sons, Inc. 相似文献
358.
We introduce an algorithm, called TMO (Two-Machine Optimal Scheduling) which minimizes the makespan for two identical processors. TMO employs lexicographic search in conjunction with the longest-processing time sequence to derive an optimal schedule. For the m identical parallel processors problem, we propose an improvement algorithm, which improves the seed solution obtained by any existing heuristic. The improvement algorithm, called Extended TMO, breaks the original m-machine problem into a set of two-machine problems and solves them repeatedly by the TMO. A simulation study is performed to evaluate the effectiveness of the proposed algorithms by comparing it against three existing heuristics: LPT (Graham, [11]), MULTIFIT (Coffman, Garey, and Johnson, [6]), and RMG (Lee and Massey, [17]). The simulation results show that: for the two processors case, the TMO performs significantly better than LPT, MULTIFIT, and RMG, and it generally takes considerably less CPU time than MULTIFIT and RMG. For the general parallel processors case, the Extended TMO algorithm is shown to be capable of greatly improving any seed solution. © 1995 John Wiley & Sons, Inc. 相似文献
359.
We consider a device that deteriorates over time according to a Markov process so that the failure rate at each state is constant. The reliability of the device is characterized by a Markov renewal equation, and an IFRA (increasing failure rate on average) property of the lifetime is obtained. The optimal replacement and repair problems are analyzed under various cost structures. Furthermore, intuitive and counterintuitive characterizations of the optimal policies and results on some interesting special problems are presented. © 1992 John Wiley & Sons, Inc. 相似文献
360.
We present an algorithm called the exact ceiling point algorithm (XCPA) for solving the pure, general integer linear programming problem (P). A recent report by the authors demonstrates that, if the set of feasible integer solutions for (P) is nonempty and bounded, all optimal solutions for (P) are “feasible 1-ceiling points,” roughly, feasible integer solutions lying on or near the boundary of the feasible region for the LP-relaxation associated with (P). Consequently, the XCPA solves (P) by implicitly enumerating only feasible 1-ceiling points, making use of conditional bounds and “double backtracking.” We discuss the results of computational testing on a set of 48 problems taken from the literature. 相似文献