全文获取类型
收费全文 | 295篇 |
免费 | 9篇 |
出版年
2020年 | 3篇 |
2019年 | 5篇 |
2018年 | 4篇 |
2017年 | 7篇 |
2016年 | 7篇 |
2015年 | 6篇 |
2014年 | 3篇 |
2013年 | 58篇 |
2012年 | 2篇 |
2011年 | 4篇 |
2009年 | 6篇 |
2008年 | 4篇 |
2007年 | 3篇 |
2006年 | 3篇 |
2005年 | 7篇 |
2004年 | 7篇 |
2003年 | 5篇 |
2002年 | 2篇 |
2000年 | 4篇 |
1999年 | 4篇 |
1998年 | 2篇 |
1997年 | 2篇 |
1996年 | 8篇 |
1995年 | 4篇 |
1994年 | 7篇 |
1993年 | 3篇 |
1992年 | 6篇 |
1991年 | 12篇 |
1989年 | 6篇 |
1988年 | 3篇 |
1987年 | 7篇 |
1986年 | 9篇 |
1985年 | 12篇 |
1984年 | 3篇 |
1983年 | 3篇 |
1982年 | 2篇 |
1980年 | 3篇 |
1979年 | 3篇 |
1978年 | 3篇 |
1977年 | 5篇 |
1976年 | 4篇 |
1974年 | 5篇 |
1973年 | 2篇 |
1972年 | 8篇 |
1971年 | 5篇 |
1970年 | 8篇 |
1969年 | 4篇 |
1968年 | 4篇 |
1967年 | 5篇 |
1966年 | 3篇 |
排序方式: 共有304条查询结果,搜索用时 15 毫秒
111.
In this paper we consider the problem of scheduling a set of jobs on a single machine on which a rate‐modifying activity may be performed. The rate‐modifying activity is an activity that changes the production rate of the machine. So the processing time of a job is a variable, which depends on whether it is scheduled before or after the rate‐modifying activity. We assume that the rate‐modifying activity can take place only at certain predetermined time points, which is a constrained case of a similar problem discussed in the literature. The decisions under consideration are whether and when to schedule the rate‐modifying activity, and how to sequence the jobs in order to minimize some objectives. We study the problems of minimizing makespan and total completion time. We first analyze the computational complexity of both problems for most of the possible versions. The analysis shows that the problems are NP‐hard even for some special cases. Furthermore, for the NP‐hard cases of the makespan problem, we present a pseudo‐polynomial time optimal algorithm and a fully polynomial time approximation scheme. For the total completion time problem, we provide a pseudo‐polynomial time optimal algorithm for the case with agreeable modifying rates. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005 相似文献
112.
In this paper, we extend the results of Ferguson M. Naval Research Logistics 8 . on an end‐product manufacturer's choice of when to commit to an order quantity from its parts supplier. During the supplier's lead‐time, information arrives about end‐product demand. This information reduces some of the forecast uncertainty. While the supplier must choose its production quantity of parts based on the original forecast, the manufacturer can wait to place its order from the supplier after observing the information update. We find that a manufacturer is sometimes better off with a contract requiring an early commitment to its order quantity, before the supplier commits resources. On the other hand, the supplier sometimes prefers a delayed commitment. The preferences depend upon the amount of demand uncertainty resolved by the information as well as which member of the supply chain sets the exchange price. We also show conditions where demand information updating is detrimental to both the manufacturer and the supplier. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005 相似文献
113.
114.
In this article, we study the stochastic version of the so-called bottleneck assignment problem. Our primary objective is to maximize the probability that the bottleneck value satisfies a specified target. Under general stochastic assumptions, we show that the solution in this case is easily obtained by solving a linear assignment problem. We next examine the situation where the target is to be minimized, given that the probability of satisfying the target exceeds a specified threshold. Finally, we address extensions to the original problem where a second objective is also considered. 相似文献
115.
This article investigates inference for pmax, the largest cell probability in multinomial trials for the case of a small to moderate number of trials. Emphasis focuses on point and interval estimation. Both frequentist and Bayesian approaches are developed. The results of extensive simulation investigation are included as well as the analysis of a set of crime data for the city of New Orleans taken from the National Crime Survey. 相似文献
116.
Classifying items into distinct groupings is fundamental in scientific inquiry. The objective of cluster analysis is to assign n objects to up to K mutually exclusive groups while minimizing some measure of dissimilarity among the items. Few mathematical programming approaches have been applied to these problems. Most clustering methods to date only consider lowering the amount of interaction between each observation and the group mean or median. Clustering used in information systems development to determine groupings of modules requires a model that will account for the total group interaction. We formulate a mixed-integer programming model for optimal clustering based upon scaled distance measures to account for this total group interaction. We discuss an efficient, implicit enumeration algorithm along with some implementation issues, a method for computing tight bounds for each node in the solution tree, and a small example. A computational example problem, taken from the computer-assisted process organization (CAPO) literature, is presented. Detailed computational results indicate that the method is effective for solving this type of cluster analysis problem. 相似文献
117.
Dirichlet mixed models find wide application. Estimation is usually achieved through the method of moments. Here we present an iterative hybrid algorithm for obtaining the maximum likelihood estimate employing both modified Newton-Raphson and E-M methods. This successful MLE algorithm enables calculation of a jack-knife MLE. Simulation comparison of the three estimates is provided. The MLE substantially improves upon the moments estimator particularly with increasing dimension. The jack-knife MLE in turn offers dramatic improvement over the MLE. 相似文献
118.
119.
We consider scheduling problems involving two agents (agents A and B), each having a set of jobs that compete for the use of a common machine to process their respective jobs. The due dates of the A‐jobs are decision variables, which are determined by using the common (CON) or slack (SLK) due date assignment methods. Each agent wants to minimize a certain performance criterion depending on the completion times of its jobs only. Under each due date assignment method, the criterion of agent A is always the same, namely an integrated criterion consisting of the due date assignment cost and the weighted number of tardy jobs. Several different criteria are considered for agent B, including the maxima of regular functions (associated with each job), the total (weighted) completion time, and the weighted number of tardy jobs. The overall objective is to minimize the performance criterion of agent A, while keeping the objective value of agent B no greater than a given limit. We analyze the computational complexity, and devise polynomial or pseudo‐polynomial dynamic programming algorithms for the considered problems. We also convert, if viable, any of the devised pseudopolynomial dynamic programming algorithms into a fully polynomial‐time approximation scheme. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 416–429, 2016 相似文献
120.
John E. Angus 《海军后勤学研究》1987,34(6):845-851
The confidence coefficient of a two-sided confidence interval for the binomial parameter p is the infimum of the coverage probability of the interval as p ranges between 0 and 1. The confidence coefficients for five different approximate confidence intervals are computed and compared to the confidence coefficient for the two-sided Clopper-Pearson confidence interval. Pratt's approximation method [10] yields virtually the same confidence coefficients as the Clopper-Pearson interval, and is easily computed without resorting to interative methods. 相似文献