全文获取类型
| 收费全文 | 538篇 |
| 免费 | 1篇 |
专业分类
| 539篇 |
出版年
| 2021年 | 5篇 |
| 2020年 | 5篇 |
| 2019年 | 5篇 |
| 2017年 | 10篇 |
| 2016年 | 13篇 |
| 2015年 | 10篇 |
| 2014年 | 10篇 |
| 2013年 | 72篇 |
| 2012年 | 22篇 |
| 2011年 | 27篇 |
| 2010年 | 22篇 |
| 2009年 | 15篇 |
| 2008年 | 27篇 |
| 2007年 | 15篇 |
| 2006年 | 16篇 |
| 2005年 | 5篇 |
| 2004年 | 6篇 |
| 2002年 | 5篇 |
| 2001年 | 4篇 |
| 1998年 | 7篇 |
| 1997年 | 7篇 |
| 1996年 | 4篇 |
| 1995年 | 6篇 |
| 1994年 | 7篇 |
| 1993年 | 12篇 |
| 1992年 | 9篇 |
| 1991年 | 6篇 |
| 1990年 | 6篇 |
| 1989年 | 16篇 |
| 1988年 | 4篇 |
| 1987年 | 12篇 |
| 1986年 | 12篇 |
| 1985年 | 11篇 |
| 1983年 | 7篇 |
| 1982年 | 5篇 |
| 1981年 | 8篇 |
| 1980年 | 9篇 |
| 1979年 | 11篇 |
| 1978年 | 4篇 |
| 1977年 | 8篇 |
| 1976年 | 7篇 |
| 1975年 | 8篇 |
| 1973年 | 4篇 |
| 1972年 | 12篇 |
| 1971年 | 3篇 |
| 1970年 | 3篇 |
| 1969年 | 9篇 |
| 1968年 | 8篇 |
| 1967年 | 3篇 |
| 1966年 | 3篇 |
排序方式： 共有539条查询结果，搜索用时 0 毫秒
101.
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 相似文献
102.
In this article we introduce a 2‐machine flowshop with processing flexibility. Two processing modes are available for each task: namely, processing by the designated processor, and processing simultaneously by both processors. The objective studied is makespan minimization. This production environment is encountered in repetitive manufacturing shops equipped with processors that have the flexibility to execute orders either individually or in coordination. In the latter case, the product designer exploits processing synergies between two processors so as to execute a particular task much faster than a dedicated processor. This type of flowshop environment is also encountered in labor‐intensive assembly lines where products moving downstream can be processed either in the designated assembly stations or by pulling together the work teams of adjacent stations. This scheduling problem requires determining the mode of operation of each task, and the subsequent scheduling that preserves the flowshop constraints. We show that the problem is ordinary NP‐complete and obtain an optimal solution using a dynamic programming algorithm with considerable computational requirements for medium and large problems. Then, we present a number of dynamic programming relaxations and analyze their worst‐case error performance. Finally, we present a polynomial time heuristic with worst‐case error performance comparable to that of the dynamic programming relaxations. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2004. 相似文献
103.
Tobias Brueggemann Johann L. Hurink Tjark Vredeveld Gerhard J. Woeginger 《海军后勤学研究》2011,58(8):795-803
We investigate the quality of local search heuristics for the scheduling problem of minimizing the makespan on identical parallel machines. We study exponential size neighborhoods (whose size grows exponentially with the input length) that can be searched in polynomial time, and we derive worst‐case approximation guarantees for the local optima of such neighborhoods. The so‐called split neighborhood splits a feasible schedule into two layers, and then recombines the two layers by finding a perfect matching. We show that the makespan of every local optimum for split is at most a factor of 2 away from the globally optimal makespan. We then combine the split neighborhood with two neighborhoods from the literature. The combination of split with the jump neighborhood only marginally improves the approximation guarantee, whereas the combination with the lexicographic‐jump neighborhood decreases the approximation guarantee from 2 to 3/2. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011 相似文献
104.
Ordered flow shop models have appeared in the literature since the mid‐1970s and proportionate flow shop models have appeared since the early 1980s. We provide a detailed review of these models along with some analysis and potential topics for future research. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2013 相似文献
105.
ABSTRACTThis study seeks to evaluate the threat of malicious chemical use by non-state actors. It finds that non-state actors have primarily turned to ready-to-use crude chemical weapons (CW) instead of traditional CW agents. Interestingly, the worst crude CW attacks have been more destructive than those employing traditional CW. Scenarios for catastrophic consequences exist, but chemical attacks have typically been used to accomplish tactical goals, which leverage psychological and economic impacts. Therefore, successful efforts to counter CW proliferation by non-state actors must be substantially different from those targeting states. 相似文献
106.
设计了四轮全向移动机器人的传感器信息采集硬件电路,并通过分析四轮全向移动机器人的运动学模型,提出了基于TI公司最新研发的TMS320F28069为主控制器的直流电机双闭环速度控制方案.试验结果表明:所提控制方案能够满足四轮全向移动机器人速度控制的要求,且响应速度快、误差小. 相似文献
107.
108.
Many logistics systems operate in a decentralized way, while most optimization models assume a centralized planner. One example of a decentralized system is in some sea cargo companies: sales agents, who share ship capacity on a network, independently accept cargo from their location and contribute to the revenue of the system. The central headquarters does not directly control the agents' decisions but can influence them through system design and incentives. In this paper, we model the firm's problem to determine the best capacity allocation to the agents such that system revenue is maximized. In the special case of a single‐route, we formulate the problem as a mixed integer program incorporating the optimal agent behavior. For the NP‐hard multiple‐route case, we propose several heuristics for the problem. Computational experiments show that the decentralized system generally performs worse when network capacity is tight and that the heuristics perform reasonably well. We show that the decentralized system may perform arbitrarily worse than the centralized system when the number of locations goes to infinity, although the choice of sales incentive impacts the performance. We develop an upper bound for the decentralized system, where the bound gives insight on the performance of the heuristics in large systems. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007 相似文献
109.
110.
This article considers a two-person game in which the first player has access to certain information that is valuable but unknown to the second player. The first player can distort the information before it is passed on to the second player. The purpose in distorting the information is to render it as useless as possible to the second player. Based on the distorted information received, the second player then maximizes some given objective. In certain cases he may still be able to use the distorted information, but sometimes the information has been so badly distorted that it becomes completely useless to him. © 1993 John Wiley & Sons, Inc. 相似文献