全文获取类型
收费全文 | 399篇 |
免费 | 16篇 |
出版年
2021年 | 9篇 |
2020年 | 4篇 |
2019年 | 10篇 |
2017年 | 9篇 |
2016年 | 8篇 |
2015年 | 11篇 |
2014年 | 5篇 |
2013年 | 83篇 |
2011年 | 7篇 |
2009年 | 5篇 |
2008年 | 4篇 |
2007年 | 8篇 |
2005年 | 7篇 |
2004年 | 6篇 |
2003年 | 7篇 |
2002年 | 4篇 |
2001年 | 4篇 |
2000年 | 3篇 |
1999年 | 11篇 |
1996年 | 5篇 |
1995年 | 6篇 |
1994年 | 8篇 |
1993年 | 7篇 |
1992年 | 8篇 |
1991年 | 10篇 |
1990年 | 5篇 |
1989年 | 7篇 |
1988年 | 9篇 |
1987年 | 7篇 |
1986年 | 9篇 |
1985年 | 6篇 |
1983年 | 3篇 |
1982年 | 9篇 |
1981年 | 4篇 |
1980年 | 5篇 |
1979年 | 6篇 |
1978年 | 4篇 |
1977年 | 6篇 |
1976年 | 3篇 |
1975年 | 6篇 |
1974年 | 9篇 |
1973年 | 6篇 |
1972年 | 6篇 |
1971年 | 11篇 |
1970年 | 3篇 |
1969年 | 7篇 |
1968年 | 8篇 |
1967年 | 4篇 |
1966年 | 4篇 |
1948年 | 4篇 |
排序方式: 共有415条查询结果,搜索用时 31 毫秒
141.
We study a deterministic two‐machine flowshop scheduling problem with an assumption that one of the two machines is not available in a specified time period. This period can be due to a breakdown, preventive maintenance, or processing unfinished jobs from a previous planning horizon. The problem is known to be NP‐hard. Pseudopolynomial dynamic programming algorithms and heuristics with worst case error bounds are given in the literature to solve the problem. They are different for the cases when the unavailability interval is for the first or second machine. The existence of a fully polynomial time approximation scheme (FPTAS) was formulated as an open conjecture in the literature. In this paper, we show that the two cases of the problem under study are equivalent to similar partition type problems. Then we derive a generic FPTAS for the latter problems with O(n5/ε4) time complexity. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2004. 相似文献
142.
Nano-sized aluminum(Nano-Al)powders hold promise in enhancing the total energy of explosives and the metal acceleration ability at the same time.However,the near-detonation zone effects of reaction between Nano-Al with detonation products remain unclear.In this study,the overall reaction process of 170 nm Al with RDX explosive and its effect on detonation characteristics,detonation reaction zone,and the metal acceleration ability were comprehensively investigated through a variety of experiments such as the detonation velocity test,detonation pressure test,explosive/window interface velocity test and confined plate push test using high-resolution laser interferometry.Lithium fluoride(LiF),which has an inert behavior during the explosion,was used as a control to compare the contribution of the reaction of aluminum.A thermochemical approach that took into account the reactivity of aluminum and ensuing detonation products was adopted to calculate the additional energy release by afterburn.Combining the numerical simulations based on the calculated afterburn energy and experimental results,the param-eters in the detonation equation of state describing the Nano-Al reaction characteristics were calibrated.This study found that when the 170 nm Al content is from 0%to 15%,every 5%increase of aluminum resulted in about a 1.3%decrease in detonation velocity.Manganin pressure gauge measurement showed no significant enhancement in detonation pressure.The detonation reaction time and reaction zone length of RDX/Al/wax/80/15/5 explosive is 64 ns and 0.47 mm,which is respectively 14%and 8%higher than that of RDX/wax/95/5 explosive(57 ns and 0.39 mm).Explosive/window interface velocity curves show that 170 nm Al mainly reacted with the RDX detonation products after the detonation front.For the recording time of about 10 μs throughout the plate push test duration,the maximum plate velocity and plate acceleration time accelerated by RDX/Al/wax/80/15/5 explosive is 12%and 2.9 μs higher than that of RDX/LiF/wax/80/15/5,respectively,indicating that the aluminum reaction energy significantly increased the metal acceleration time and ability of the explosive.Numerical simulations with JWLM explosive equation of state show that when the detonation products expanded to 2 times the initial volume,over 80%of the aluminum had reacted,implying very high reactivity.These results are significant in attaining a clear understanding of the reaction mechanism of Nano-Al in the development of aluminized explosives. 相似文献
143.
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 相似文献
144.
We study a generalization of the weighted set covering problem where every element needs to be covered multiple times. When no set contains more than two elements, we can solve the problem in polynomial time by solving a corresponding weighted perfect b‐matching problem. In general, we may use a polynomial‐time greedy heuristic similar to the one for the classical weighted set covering problem studied by D.S. Johnson [Approximation algorithms for combinatorial problems, J Comput Syst Sci 9 (1974), 256–278], L. Lovasz [On the ratio of optimal integral and fractional covers, Discrete Math 13 (1975), 383–390], and V. Chvatal [A greedy heuristic for the set‐covering problem, Math Oper Res 4(3) (1979), 233–235] to get an approximate solution for the problem. We find a worst‐case bound for the heuristic similar to that for the classical problem. In addition, we introduce a general type of probability distribution for the population of the problem instances and prove that the greedy heuristic is asymptotically optimal for instances drawn from such a distribution. We also conduct computational studies to compare solutions resulting from running the heuristic and from running the commercial integer programming solver CPLEX on problem instances drawn from a more specific type of distribution. The results clearly exemplify benefits of using the greedy heuristic when problem instances are large. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2005 相似文献
145.
This paper addresses optimal power allocation in a wireless communication network under uncertainty. The paper introduces a framework for optimal transmit power allocation in a wireless network where both the useful and interference coefficients are random. The new approach to power control is based on a stochastic programming formulation with probabilistic SIR constraints. This allows to state the power allocation problem as a convex optimization problem assuming normally or log‐normally distributed communication link coefficients. Numerical examples illustrate the performance of the optimal stochastic power allocation. A distributed algorithm for the decentralized solution of the stochastic power allocation problem is discussed. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2005 相似文献
146.
We consider a generalization of the well‐known generalized assignment problem (GAP) over discrete time periods encompassed within a finite planning horizon. The resulting model, MultiGAP, addresses the assignment of tasks to agents within each time period, with the attendant single‐period assignment costs and agent‐capacity constraint requirements, in conjunction with transition costs arising between any two consecutive periods in which a task is reassigned to a different agent. As is the case for its single‐period antecedent, MultiGAP offers a robust tool for modeling a wide range of capacity planning problems occurring within supply chain management. We provide two formulations for MultiGAP and establish that the second (alternative) formulation provides a tighter bound. We define a Lagrangian relaxation‐based heuristic as well as a branch‐and‐bound algorithm for MultiGAP. Computational experience with the heuristic and branch‐and‐bound algorithm on over 2500 test problems is reported. The Lagrangian heuristic consistently generates high‐quality and in many cases near‐optimal solutions. The branch‐and‐bound algorithm is also seen to constitute an effective means for solving to optimality MultiGAP problems of reasonable size. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012 相似文献
147.
Stochastic dynamic programming models are attractive for multireservoir control problems because they allow non‐linear features to be incorporated and changes in hydrological conditions to be modeled as Markov processes. However, with the exception of the simplest cases, these models are computationally intractable because of the high dimension of the state and action spaces involved. This paper proposes a new method of determining an operating policy for a multireservoir control problem that uses stochastic dynamic programming, but is practical for systems with many reservoirs. Decomposition is first used to reduce the problem to a number of independent subproblems. Each subproblem is formulated as a low‐dimensional stochastic dynamic program and solved to determine the operating policy for one of the reservoirs in the system. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006 相似文献
148.
149.
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 相似文献
150.