全文获取类型
收费全文 | 699篇 |
免费 | 222篇 |
国内免费 | 11篇 |
出版年
2023年 | 3篇 |
2022年 | 9篇 |
2021年 | 30篇 |
2020年 | 6篇 |
2019年 | 10篇 |
2018年 | 8篇 |
2017年 | 10篇 |
2016年 | 13篇 |
2015年 | 32篇 |
2014年 | 22篇 |
2013年 | 85篇 |
2012年 | 27篇 |
2011年 | 21篇 |
2010年 | 26篇 |
2009年 | 35篇 |
2008年 | 28篇 |
2007年 | 47篇 |
2006年 | 21篇 |
2005年 | 40篇 |
2004年 | 14篇 |
2003年 | 13篇 |
2002年 | 14篇 |
2001年 | 15篇 |
2000年 | 27篇 |
1999年 | 52篇 |
1998年 | 50篇 |
1997年 | 39篇 |
1996年 | 41篇 |
1995年 | 30篇 |
1994年 | 33篇 |
1993年 | 27篇 |
1992年 | 18篇 |
1991年 | 24篇 |
1990年 | 21篇 |
1989年 | 11篇 |
1988年 | 5篇 |
1987年 | 7篇 |
1986年 | 8篇 |
1985年 | 5篇 |
1983年 | 2篇 |
1982年 | 2篇 |
1977年 | 1篇 |
排序方式: 共有932条查询结果,搜索用时 31 毫秒
771.
772.
Approximation schemes for single‐machine scheduling with a fixed maintenance activity to minimize the total amount of late work
下载免费PDF全文
![点击此处可从《海军后勤学研究》网站下载免费的PDF全文](/ch/ext_images/free.gif)
We consider the problem of scheduling n independent and simultaneously available jobs without preemption on a single machine, where the machine has a fixed maintenance activity. The objective is to find the optimal job sequence to minimize the total amount of late work, where the late work of a job is the amount of processing of the job that is performed after its due date. We first discuss the approximability of the problem. We then develop two pseudo‐polynomial dynamic programming algorithms and a fully polynomial‐time approximation scheme for the problem. Finally, we conduct extensive numerical studies to evaluate the performance of the proposed algorithms. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 172–183, 2016 相似文献
773.
Algorithm to solve a chance‐constrained network capacity design problem with stochastic demands and finite support
下载免费PDF全文
![点击此处可从《海军后勤学研究》网站下载免费的PDF全文](/ch/ext_images/free.gif)
Kathryn M. Schumacher Richard Li‐Yang Chen Amy E.M. Cohn Jeremy Castaing 《海军后勤学研究》2016,63(3):236-246
We consider the problem of determining the capacity to assign to each arc in a given network, subject to uncertainty in the supply and/or demand of each node. This design problem underlies many real‐world applications, such as the design of power transmission and telecommunications networks. We first consider the case where a set of supply/demand scenarios are provided, and we must determine the minimum‐cost set of arc capacities such that a feasible flow exists for each scenario. We briefly review existing theoretical approaches to solving this problem and explore implementation strategies to reduce run times. With this as a foundation, our primary focus is on a chance‐constrained version of the problem in which α% of the scenarios must be feasible under the chosen capacity, where α is a user‐defined parameter and the specific scenarios to be satisfied are not predetermined. We describe an algorithm which utilizes a separation routine for identifying violated cut‐sets which can solve the problem to optimality, and we present computational results. We also present a novel greedy algorithm, our primary contribution, which can be used to solve for a high quality heuristic solution. We present computational analysis to evaluate the performance of our proposed approaches. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 236–246, 2016 相似文献
774.
The warehouse problem with deterministic production cost, selling prices, and demand was introduced in the 1950s and there is a renewed interest recently due to its applications in energy storage and arbitrage. In this paper, we consider two extensions of the warehouse problem and develop efficient computational algorithms for finding their optimal solutions. First, we consider a model where the firm can invest in capacity expansion projects for the warehouse while simultaneously making production and sales decisions in each period. We show that this problem can be solved with a computational complexity that is linear in the product of the length of the planning horizon and the number of capacity expansion projects. We then consider a problem in which the firm can invest to improve production cost efficiency while simultaneously making production and sales decisions in each period. The resulting optimization problem is non‐convex with integer decision variables. We show that, under some mild conditions on the cost data, the problem can be solved in linear computational time. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 367–373, 2016 相似文献
775.
776.
改革开放以来 ,我国意识形态领域的斗争错综复杂。随着国家安全由传统的军事安全发展为综合安全 ,意识形态安全已成为国家安全利益的重要组成部分。党的第二代、第三代领导集体自觉顺应时代要求 ,把意识形态建设提高到国家安全的战略地位。着眼于 2 1世纪中国的发展 ,必须从国家安全的战略高度 ,切实加强社会主义意识形态建设 ,为国家的发展构筑一个安全的思想文化环境。 相似文献
777.
本文通过分析信息化武器装备体系概念演示验证仿真系统结构,对集成所需的平台相关资源进行了分类,在应用SOA、MDA部分思想基础上,继承了按需服务-按需仿真服务(XOD-SOD)技术,提出了“服务描述-静态映射-动态映射”三级策略,用于实现平台相关资源(Platform Specific Resources,PSR)的集成。 相似文献
778.
陈晨 《兵团教育学院学报》2018,(1):62-66
批判性思维能力的培养对大学生的心理健康、自主学习能力、创新能力以及个性发展等方面都有重要的作用.批判性思维是大学生综合素质的体现.大学英语提高课程"英文小说与电影"以英美文学中经典小说为教学内容,旨在通过英美文学的教学培养学生的批判性思维能力,本课程改变传统教学中教师"一言堂"的教学模式,采用混合式教学模式和问题导向式学习方法,营造批判性思维学习氛围,通过让学生们解读、分析和言说文学经典作品,提高学生的批判性思维能力. 相似文献
779.
In this paper, we study upper and lower bounds on the reliability in new better than used in expectation (NBUE) life distribution class with fixed first two moments. By a constructive proof, we determine the upper bounds on the reliability analytically in different regions and show that these bounds are sharp. For the lower bounds, similar results are obtained except in one region. For that region, a conjecture is given for further study. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 781–797, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10035 相似文献
780.
In order‐quantity reorder‐point formulations for inventory items where backordering is allowed, some of the more common ways to prevent excessive stockouts in an optimal solution are to impose either a cost per unit short, a cost per stockout occasion, or a target fill rate. We show that these popular formulations, both exact and approximate, can become “degenerate” even with quite plausible parameters. By degeneracy we mean any situation in which the formulation either cannot be solved, leads to nonsensical “optimal” solutions, or becomes equivalent to something substantially simpler. We explain the reasons for the degeneracies, yielding new insight into these models, and we provide practical advice for inventory managers. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 686–705, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10037 相似文献