全文获取类型
收费全文 | 824篇 |
免费 | 22篇 |
专业分类
846篇 |
出版年
2021年 | 9篇 |
2019年 | 18篇 |
2018年 | 12篇 |
2017年 | 17篇 |
2016年 | 16篇 |
2015年 | 17篇 |
2014年 | 8篇 |
2013年 | 141篇 |
2011年 | 8篇 |
2010年 | 8篇 |
2009年 | 8篇 |
2007年 | 12篇 |
2006年 | 9篇 |
2005年 | 14篇 |
2004年 | 15篇 |
2003年 | 9篇 |
2001年 | 11篇 |
2000年 | 12篇 |
1999年 | 12篇 |
1998年 | 13篇 |
1997年 | 18篇 |
1996年 | 18篇 |
1995年 | 15篇 |
1994年 | 21篇 |
1993年 | 15篇 |
1992年 | 18篇 |
1991年 | 24篇 |
1990年 | 13篇 |
1989年 | 15篇 |
1988年 | 13篇 |
1987年 | 17篇 |
1986年 | 11篇 |
1985年 | 17篇 |
1984年 | 16篇 |
1983年 | 13篇 |
1982年 | 11篇 |
1981年 | 16篇 |
1980年 | 16篇 |
1979年 | 17篇 |
1978年 | 13篇 |
1977年 | 12篇 |
1976年 | 14篇 |
1975年 | 14篇 |
1974年 | 17篇 |
1973年 | 13篇 |
1972年 | 17篇 |
1971年 | 17篇 |
1969年 | 8篇 |
1968年 | 10篇 |
1967年 | 7篇 |
排序方式: 共有846条查询结果,搜索用时 1 毫秒
181.
Ebru K. Bish Thin‐Yin Leong Chung‐Lun Li Jonathan W. C. Ng David Simchi‐Levi 《海军后勤学研究》2001,48(5):363-385
We consider a container terminal discharging containers from a ship and locating them in the terminal yard. Each container has a number of potential locations in the yard where it can be stored. Containers are moved from the ship to the yard using a fleet of vehicles, each of which can carry one container at a time. The problem is to assign each container to a yard location and dispatch vehicles to the containers so as to minimize the time it takes to download all the containers from the ship. We show that the problem is NP‐hard and develop a heuristic algorithm based on formulating the problem as an assignment problem. The effectiveness of the heuristic is analyzed from both worst‐case and computational points of view. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 363–385, 2001 相似文献
182.
The class of functions expressed as linear (not necessarily convex) combinations of negative exponential functions is dense in the set of all square integrable functions on the nonnegative reals. Because of this and resultant mathematical properties, linear combinations of exponential densities have excellent potential for wide application in stochastic modeling. This work documents the development and testing of a practical procedure for maximum-likelihood estimation for these generalized exponential mixtures. The algorithm offered for the problem is of the Jacobi type and guarantees that the result will provide a legitimate probability function of the prescribed type. Extensive testing has been performed and results are very favorable: convergence is rapid and the use of computer resources rather limited. 相似文献
183.
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 相似文献
184.
Roger C. Vergin 《海军后勤学研究》1968,15(4):523-534
Most maintenance and replacement models for industrial equipment have been developed for independent single-component machines. Most equipment, however, consists of multiple components. Also, when the maintenance crew services several machines, the maintenance policy for each machine is not independent of the states of the other machines. In this paper, two dynamic programming replacement models are presented. The first is used to determine the optimal replacement policy for multi-component equipment. The second is used to determine the optimal replacement policy for a multi-machine system which uses one replacement crew to service several machines. In addition, an approach is suggested for developing an efficient replacement policy for a multi-component, multi-machine system. 相似文献
185.
This paper presents an algorithm for solving the integer programming problem possessing a separable nonlinear objective function subject to linear constraints. The method is based on a generalization of the Balas implicit enumeration scheme. Computational experience is given for a set of seventeen linear and seventeen nonlinear test problems. The results indicate that the algorithm can solve the nonlinear integer programming problem in roughly the equivalent time required to solve the linear integer programming problem of similar size with existing algorithms. Although the algorithm is specifically designed to solve the nonlinear problem, the results indicate that the algorithm compares favorably with the Branch and Bound algorithm in the solution of linear integer programming problems. 相似文献
186.
In this paper, a branch-and-bound procedure is presented for treating the general knapsack problem. The fundamental notion of the procedure involves a variation of traditional branching strategies as well as the incorporation of penalties in order to improve bounds. Substantial computational experience has been obtained, the results of which would indicate the feasibility of the procedure for problems of large size. 相似文献
187.
We consider server scheduling on parallel dedicated machines to minimize the makespan. Each job has a loading operation and a processing operation. The loading operation requires a server that serves all the jobs. Each machine has a given set of jobs to process, and the processing sequence is known and fixed. We design a polynomial‐time algorithm to solve the two‐machine case of the problem. When the number of machines is arbitrary, the problem becomes strongly NP‐hard even if all the jobs have the same processing length or all the loading operations require a unit time. We design two heuristic algorithms to treat the case where all the loading times are unit and analyze their performance. 相似文献
188.
Nathan A. Jennings 《Small Wars & Insurgencies》2013,24(2):313-334
This essay explores how federalized Texas Rangers, in the form of scout companies and larger mounted rifle regiments, provided controversial, and ultimately cost-effective, versatility to the US Army during its campaign in Northern Mexico between 1846 and 1848. It argues that their contributions centered on three tactical tasks that enhanced the invading army's maneuvers: reconnaissance, direct assault, and counterguerrilla patrolling. Each of these actions reflected a distinctive skill-set at which the auxiliaries excelled, marking them as exceptionally multifunctional assets. The Texans' augmentation coincided with, and was necessitated by, the evolving stages of the war in Northern Mexico, beginning with the American army's initial invasion, then transitioning to the assault on Monterrey, and finally ending with a troubled occupation where the rangers' brutality both enabled and undermined American pacification efforts. 相似文献
189.
190.