全文获取类型
收费全文 | 1345篇 |
免费 | 425篇 |
国内免费 | 68篇 |
专业分类
1838篇 |
出版年
2024年 | 1篇 |
2023年 | 2篇 |
2022年 | 18篇 |
2021年 | 24篇 |
2020年 | 18篇 |
2019年 | 26篇 |
2018年 | 19篇 |
2017年 | 75篇 |
2016年 | 78篇 |
2015年 | 65篇 |
2014年 | 92篇 |
2013年 | 187篇 |
2012年 | 150篇 |
2011年 | 163篇 |
2010年 | 82篇 |
2009年 | 54篇 |
2008年 | 70篇 |
2007年 | 104篇 |
2006年 | 99篇 |
2005年 | 97篇 |
2004年 | 92篇 |
2003年 | 74篇 |
2002年 | 47篇 |
2001年 | 50篇 |
2000年 | 47篇 |
1999年 | 26篇 |
1998年 | 7篇 |
1997年 | 13篇 |
1996年 | 12篇 |
1995年 | 6篇 |
1994年 | 4篇 |
1993年 | 5篇 |
1992年 | 9篇 |
1991年 | 7篇 |
1990年 | 11篇 |
1989年 | 4篇 |
排序方式: 共有1838条查询结果,搜索用时 0 毫秒
31.
32.
33.
We consider the problem of scheduling customer orders in a flow shop with the objective of minimizing the sum of tardiness, earliness (finished goods inventory holding), and intermediate (work‐in‐process) inventory holding costs. We formulate this problem as an integer program, and based on approximate solutions to two different, but closely related, Dantzig‐Wolfe reformulations, we develop heuristics to minimize the total cost. We exploit the duality between Dantzig‐Wolfe reformulation and Lagrangian relaxation to enhance our heuristics. This combined approach enables us to develop two different lower bounds on the optimal integer solution, together with intuitive approaches for obtaining near‐optimal feasible integer solutions. To the best of our knowledge, this is the first paper that applies column generation to a scheduling problem with different types of strongly ????‐hard pricing problems which are solved heuristically. The computational study demonstrates that our algorithms have a significant speed advantage over alternate methods, yield good lower bounds, and generate near‐optimal feasible integer solutions for problem instances with many machines and a realistically large number of jobs. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004. 相似文献
34.
Failure rate and mean residual life are two important characteristics for studying reliability of products. In literature, some work studied the shape of failure rate function based on the knowledge of the associated probability density function; some other work investigated the shape of mean residual life function based on the shape of the associated failure rate function separately for continuous case and discrete case. In this article, a general approach is developed which can be applied to the aforementioned studies. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004 相似文献
35.
In this paper we study higher‐order Markov chain models for analyzing categorical data sequences. We propose an efficient estimation method for the model parameters. Data sequences such as DNA and sales demand are used to illustrate the predicting power of our proposed models. In particular, we apply the developed higher‐order Markov chain model to the server logs data. The objective here is to model the users' behavior in accessing information and to predict their behavior in the future. Our tests are based on a realistic web log and our model shows an improvement in prediction. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004 相似文献
36.
We consider the problem of scheduling a set of jobs on a single machine subject to random breakdowns. We focus on the preemptive‐repeat model, which addresses the situation where, if a machine breaks down during the processing of a job, the work done on the job prior to the breakdown is lost and the job will have to be started from the beginning again when the machine resumes its work. We allow that (i) the uptimes and downtimes of the machine follow general probability distributions, (ii) the breakdown process of the machine depends upon the job being processed, (iii) the processing times of the jobs are random variables following arbitrary distributions, and (iv) after a breakdown, the processing time of a job may either remain a same but unknown amount, or be resampled according to its probability distribution. We first derive the optimal policy for a class of problems under the criterion to maximize the expected discounted reward earned from completing all jobs. The result is then applied to further obtain the optimal policies for other due date‐related criteria. We also discuss a method to compute the moments and probability distributions of job completion times by using their Laplace transforms, which can convert a general stochastic scheduling problem to its deterministic equivalent. The weighted squared flowtime problem and the maintenance checkup and repair problem are analyzed as applications. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004 相似文献
37.
Extending Sastry's result on the uncapacitated two‐commodity network design problem, we completely characterize the optimal solution of the uncapacitated K‐commodity network design problem with zero flow costs for the case when K = 3. By solving a set of shortest‐path problems on related graphs, we show that the optimal solutions can be found in O(n3) time when K = 3, where n is the number of nodes in the network. The algorithm depends on identifying a list of “basic patterns”; the number of basic patterns grows exponentially with K. We also show that the uncapacitated K‐commodity network design problem can be solved in O(n3) time for general K if K is fixed; otherwise, the time for solving the problem is exponential. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004 相似文献
38.
39.
40.