全文获取类型
收费全文 | 238篇 |
免费 | 93篇 |
国内免费 | 19篇 |
出版年
2023年 | 2篇 |
2022年 | 3篇 |
2021年 | 3篇 |
2020年 | 7篇 |
2019年 | 5篇 |
2018年 | 2篇 |
2017年 | 14篇 |
2016年 | 17篇 |
2015年 | 15篇 |
2014年 | 20篇 |
2013年 | 16篇 |
2012年 | 14篇 |
2011年 | 13篇 |
2010年 | 12篇 |
2009年 | 23篇 |
2008年 | 17篇 |
2007年 | 21篇 |
2006年 | 24篇 |
2005年 | 14篇 |
2004年 | 17篇 |
2003年 | 9篇 |
2002年 | 8篇 |
2001年 | 11篇 |
2000年 | 8篇 |
1999年 | 5篇 |
1998年 | 4篇 |
1997年 | 6篇 |
1996年 | 5篇 |
1995年 | 4篇 |
1994年 | 2篇 |
1993年 | 6篇 |
1992年 | 5篇 |
1991年 | 5篇 |
1990年 | 10篇 |
1989年 | 2篇 |
1988年 | 1篇 |
排序方式: 共有350条查询结果,搜索用时 15 毫秒
71.
本文提出两种选址问题,对其局部最优性建立了充要条件,并在此基础上提出了该类问题的有效算法。 相似文献
72.
We present a tactical decision model for order acceptance and capacity planning that maximizes the expected profits from accepted orders, allowing for aggregate regular as well as nonregular capacity. The stream of incoming order arrivals is the main source of uncertainty in dynamic order acceptance and the company only has forecasts of the main properties of the future incoming projects. Project proposals arrive sequentially with deterministic interarrival times and a decision on order acceptance and capacity planning needs to be made each time a proposal arrives and its project characteristics are revealed. We apply stochastic dynamic programming to determine a profit threshold for the accept/reject decision as well as to deterministically allocate a single bottleneck resource to the accepted projects, both with an eye on maximizing the expected revenues within the problem horizon. We derive a number of managerial insights based on an analysis of the influence of project and environmental characteristics on optimal project selection and aggregate capacity usage. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007 相似文献
73.
74.
章向明 《海军工程大学学报》1994,(2)
本文用光弹性实验方法验证了有限元法对42—160柴油机离合器换向拨叉优化设计的结果。实验证明,有限元优化设计是正确、可靠的,效果是非常好的。 相似文献
75.
本文提出了一种具有广泛应用前景的程序设计方法——表格驱动(Formdriven)程序设计方法(以下简称表格驱动法)。文中首先描述了表格驱动法的基本思想、解的结构;分析了这种方法的特点与适用性;剖析了基于表格驱动法的办公自动化软件ALL-IN-1的设计思想,并指出表格驱动法特别适合于设计软件开发工具。 相似文献
76.
利用非线性规划方法研究了航天器的有限推力最优交会问题。这种方法利用了近年来发展起来的直接优化技术,用分段多项式来表示整个轨道的状态和控制向量,将最优控制问题转化为非线性规划问题。在应用这种方法时,先将整个轨道分为若干推力段和无推力段,然后利用配置方法产生推力段的约束段,利用状态转移矩阵来产生无推力段的约束。最后,对共面轨道情况下的交会进行了数值仿真,验证了方法的有效性和鲁棒性。 相似文献
77.
Sanjay Mehrotra Hamed Rahimian Masoud Barah Fengqiao Luo Karolina Schantz 《海军后勤学研究》2020,67(5):303-320
We present a stochastic optimization model for allocating and sharing a critical resource in the case of a pandemic. The demand for different entities peaks at different times, and an initial inventory for a central agency are to be allocated. The entities (states) may share the critical resource with a different state under a risk-averse condition. The model is applied to study the allocation of ventilator inventory in the COVID-19 pandemic by FEMA to different U.S. states. Findings suggest that if less than 60% of the ventilator inventory is available for non-COVID-19 patients, FEMA's stockpile of 20 000 ventilators (as of March 23, 2020) would be nearly adequate to meet the projected needs in slightly above average demand scenarios. However, when more than 75% of the available ventilator inventory must be reserved for non-COVID-19 patients, various degrees of shortfall are expected. In a severe case, where the demand is concentrated in the top-most quartile of the forecast confidence interval and states are not willing to share their stockpile of ventilators, the total shortfall over the planning horizon (until May 31, 2020) is about 232 000 ventilator days, with a peak shortfall of 17 200 ventilators on April 19, 2020. Results are also reported for a worst-case where the demand is at the upper limit of the 95% confidence interval. An important finding of this study is that a central agency (FEMA) can act as a coordinator for sharing critical resources that are in short supply over time to add efficiency in the system. Moreover, through properly managing risk-aversion of different entities (states) additional efficiency can be gained. An additional implication is that ramping up production early in the planning cycle allows to reduce shortfall significantly. An optimal timing of this production ramp-up consideration can be based on a cost-benefit analysis. 相似文献
78.
针对当前具有吞吐量和时延约束的软件无线电波形部署决策算法在内存开销方面考虑的不足,提出一个更为通用的波形部署决策系统模型,将波形的处理开销、内存开销和通信带宽开销都纳入到波形部署决策过程中,并设计了一种基于动态规划的波形部署决策算法以最小化波形对平台各种计算资源的占用总和。仿真结果表明,内存对波形部署决策具有重要影响,与未考虑内存开销的解决方案相比,平台支持的平均最大波形数目和平均处理资源利用率均下降40%左右。 相似文献
79.
This article provides an efficient heuristic based on decomposition for the twin robots scheduling problem (TRSP). TRSP concerns two moving robots executing storage and retrieval requests in parallel along a shared pathway. The depots are located at both ends of the line and a dedicated robot is assigned to each of them. While moving goods between their respective depots and some storage locations on the line, noncrossing constraints among robots need to be considered. Our heuristic uses a dynamic programming framework to determine the schedule of one robot while keeping the other one's fixed. It finds near‐optimal solutions even for large problem instances with hundreds of jobs in a short time span. © 2014 Wiley Periodicals, Inc. 62:16–22, 2015 相似文献
80.
Modeling and solution for the ship stowage planning problem of coils in the steel industry
下载免费PDF全文
![点击此处可从《海军后勤学研究》网站下载免费的PDF全文](/ch/ext_images/free.gif)
We consider a ship stowage planning problem where steel coils with known destination ports are to be loaded onto a ship. The coils are to be stowed on the ship in rows. Due to their heavy weight and cylindrical shape, coils can be stowed in at most two levels. Different from stowage problems in previous studies, in this problem there are no fixed positions on the ship for the coils due to their different sizes. At a destination port, if a coil to be unloaded is not at a top position, those blocking it need to be shuffled. In addition, the stability of ship has to be maintained after unloading at each destination port. The objective for the stowage planning problem is to minimize a combination of ship instability throughout the entire voyage, the shuffles needed for unloading at the destination ports, and the dispersion of coils to be unloaded at the same destination port. We formulate the problem as a novel mixed integer linear programming model. Several valid inequalities are derived to help reducing solution time. A tabu search (TS) algorithm is developed for the problem with the initial solution generated using a construction heuristic. To evaluate the proposed TS algorithm, numerical experiments are carried out on problem instances of three different scales by comparing it with a model‐based decomposition heuristic, the classic TS algorithm, the particle swarm optimization algorithm, and the manual method used in practice. The results show that for small problems, the proposed algorithm can generate optimal solutions. For medium and large practical problems, the proposed algorithm outperforms other methods. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 564–581, 2015 相似文献