全文获取类型
收费全文 | 456篇 |
免费 | 14篇 |
出版年
2019年 | 10篇 |
2018年 | 12篇 |
2017年 | 11篇 |
2016年 | 10篇 |
2015年 | 10篇 |
2014年 | 6篇 |
2013年 | 92篇 |
2012年 | 3篇 |
2011年 | 5篇 |
2009年 | 9篇 |
2008年 | 4篇 |
2007年 | 3篇 |
2006年 | 3篇 |
2005年 | 8篇 |
2004年 | 9篇 |
2003年 | 10篇 |
2002年 | 4篇 |
2001年 | 3篇 |
2000年 | 6篇 |
1999年 | 5篇 |
1997年 | 5篇 |
1996年 | 9篇 |
1995年 | 5篇 |
1994年 | 7篇 |
1993年 | 8篇 |
1992年 | 7篇 |
1991年 | 17篇 |
1990年 | 5篇 |
1989年 | 9篇 |
1988年 | 11篇 |
1987年 | 11篇 |
1986年 | 14篇 |
1985年 | 14篇 |
1984年 | 5篇 |
1983年 | 6篇 |
1980年 | 5篇 |
1979年 | 6篇 |
1978年 | 4篇 |
1977年 | 6篇 |
1976年 | 6篇 |
1975年 | 4篇 |
1974年 | 9篇 |
1973年 | 4篇 |
1972年 | 12篇 |
1971年 | 8篇 |
1970年 | 11篇 |
1969年 | 8篇 |
1968年 | 7篇 |
1967年 | 5篇 |
1966年 | 4篇 |
排序方式: 共有470条查询结果,搜索用时 15 毫秒
31.
Jobs with known processing times and due dates have to be processed on a machine which is subject to a single breakdown. The moment of breakdown and the repair time are independent random variables. Two cases are distinguished with reference to the processing time preempted by the breakdown (no other preemptions are allowed): (i) resumption without time losses and (ii) restart from the beginning. Under certain compatible conditions, we find the policies which minimize stochastically the number of tardy jobs. 相似文献
32.
We consider a one-machine scheduling problem with earliness and tardiness penalties. All jobs are assigned a common due date and the objective is to minimize the total penalty due to job earliness and tardiness. We are interested in finding the optimal combination of the common due-date value and the job sequence. Despite the fact that this problem in general is very hard to solve, we prove that there exists at least a common property for all optimal solutions: The first job in an optimal sequence is one of the longest jobs. We also prove that this property holds for a general class of unimodal penalty functions. 相似文献
33.
In sensitivity testing for the Department of Defense, the high cost of experimental units necessitates the use of small sample sizes and accentuates the importance of design. This article compares five data collection-estimation procedures. Four of these are modifications of the Robbins-Monro method, and the other is the Langlie. The simulation study is designed as a factorial experiment with response function, sample size, initial design point, gate width, and noise as factors. The estimated V50 and its MSE are the responses compared to assess the small sample behavior of each method. Although there is no single clear-cut winner, the Delayed Robbins-Monro (DRM) with maximum likelihood estimation and the Estimated Quantal Response Curve (Wu [21]) are shown to perform well over a broad variety of conditions. 相似文献
34.
Until only recently, the mechanism behind determining item price has been ignored and the discount price taken as a given in quantity-discount inventory decision problems. Inventory subject to declining demand further complicates both pricing and replenishment decisions. This article provides the vendor with the means for optimally determining both the discount price and replenishment order frequency for all buyers in the system in an environment of declining demand. In the multiple-buyer case, we provide an efficient algorithm for classifying buyers into homogeneous subgroups to further enhance joint cost savings among all system participants. 相似文献
35.
We consider scheduling a set of jobs with deadlines to minimize the total weighted late work on a single machine, where the late work of a job is the amount of processing of the job that is scheduled after its due date and before its deadline. This is the first study on scheduling with the late work criterion under the deadline restriction. In this paper, we show that (i) the problem is unary NP‐hard even if all the jobs have a unit weight, (ii) the problem is binary NP‐hard and admits a pseudo‐polynomial‐time algorithm and a fully polynomial‐time approximation scheme if all the jobs have a common due date, and (iii) some special cases of the problem are polynomially solvable. 相似文献
36.
37.
38.
A system of two parallel queues where the arrivals from a single stream of customers join the shorter queue is considered. Arrivals form a homogeneous Poisson stream and the service times in each of the two queues are independent exponential variates. By treating one of the queues as bounded, the steady-state probability vector for the system can be expressed in a modified matrix-geometric form and can be computed efficiently. Computational procedures for the sojourn time distribution and characteristics of the departure stream are developed. Some numerical results are presented, and based on these results an efficient approximation scheme for the model is developed which can be readily extended to systems with more than two parallel queues. 相似文献
39.
The use of life-cycle costs in procurement is limited by the accuracy of cost estimates and assessments of availability risks under the conditions generating costs. Critical to these problems are the needs and responses of equipment to maintenance and repair. Using transition probabilities to define the relationships between serviceability and maintenance and repairs, this article develops a comprehensive decision support system for military procurement. It uses a dynamic programming model to determine the least-cost set of maintenance and repair decisions, where adjustments are included for warranty conditions, time value of money, the opportunity costs of equipment failure, and the end-of-cycle salvage values or disposal costs. The system allows users to define working and failed states, create their own rules or indicators of availability from estimates of state probabilities and establish thresholds of risk acceptability. 相似文献
40.