全文获取类型
收费全文 | 226篇 |
免费 | 85篇 |
国内免费 | 18篇 |
出版年
2023年 | 2篇 |
2022年 | 2篇 |
2021年 | 2篇 |
2020年 | 7篇 |
2019年 | 5篇 |
2018年 | 1篇 |
2017年 | 13篇 |
2016年 | 17篇 |
2015年 | 15篇 |
2014年 | 18篇 |
2013年 | 15篇 |
2012年 | 13篇 |
2011年 | 11篇 |
2010年 | 10篇 |
2009年 | 23篇 |
2008年 | 17篇 |
2007年 | 20篇 |
2006年 | 24篇 |
2005年 | 13篇 |
2004年 | 17篇 |
2003年 | 8篇 |
2002年 | 6篇 |
2001年 | 10篇 |
2000年 | 8篇 |
1999年 | 4篇 |
1998年 | 4篇 |
1997年 | 6篇 |
1996年 | 5篇 |
1995年 | 4篇 |
1994年 | 2篇 |
1993年 | 6篇 |
1992年 | 4篇 |
1991年 | 5篇 |
1990年 | 9篇 |
1989年 | 2篇 |
1988年 | 1篇 |
排序方式: 共有329条查询结果,搜索用时 15 毫秒
31.
We study optimal age‐replacement policies for machines in series with non‐instantaneous repair times by formulating two nonlinear programs: one that minimizes total cost‐rate subject to a steady‐state throughput requirement and another that maximizes steady‐state throughput subject to a cost‐rate budget constraint. Under reasonable assumptions, the single‐machine cost‐optimal and throughput‐optimal solutions are unique and orderable, and the multi‐machine optimal solutions have appealing structure. Furthermore, we establish equivalence between the two formulations and provide an illustrative numerical example. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006 相似文献
32.
在对军事决策问题的主要特点进行分析的基础上,提出从军事概念模型到数学模型再到定性推理模型的一体化建模思想.以空军航空兵遂行直接航空火力支援任务为想定背景,根据EATI模板,利用基于UML的Rose工具依次对想定任务的实体、任务、交互等进行分析;对于兵力筹划中的结构化问题建立了机会约束多目标规划数学模型;对于非结构化问题则构造了推理机,推理机体现了定量与定性相结合的决策分析思想.最后,以一个实例验证文章思路的可行性. 相似文献
33.
分析了战时装备调配保障决策的特点,运用模糊聚类分析法对装备调配保障对象进行了分组和优先级排序,以此为基础,运用目标规划法构建了战时装备调配保障决策模型,最后,通过实例验证了模型的可行性和有效性. 相似文献
34.
摘要:针对单小批量武器装备保障的特殊需求,对传统的质量屋模型进行了改进,建立了基于装备保障需求与保障规则的质量屋模型,利用整数规划技术进行求解,使得单小批量武器的装备保障规则按照实际保障需求重新排列优先次序,并通过对某型火炮保障方案的筛选验证了模型的正确性.新的质量屋模型发展完善了质量屋的理论与方法,有助于提高单小批量武器的装备保障能力. 相似文献
35.
针对部队实兵对抗实验数据生成和采集的投入高、难度大的实际,提出基于小样本数据生成作战计划的方法:首先,采用偏最小二乘回归分析法建立作战因素与作战结果间的多元非线性模型;其次,采用改进的遗传算法,在MATLAB平台编程实现了对模型的整数规划求解,并通过实例验证算法的有效性;最后,利用作战因素的重要性排序分析作战计划的调整流程。 相似文献
36.
卫星任务规划与调度是空间资源管理的重要内容之一,其目的在于为卫星系统的任务计划编制提供科学合理的决策手段与依据。卫星任务调度问题的重要特点在于,调度任务存在可见时间窗口约束。只有在可见时间窗口内,调度任务才可能执行并完成。在进行合理假设的基础上,建立卫星任务调度问题的约束规划模型。对基本禁忌搜索算法进行改进,提出了模型求解的变邻域禁忌搜索算法。应用结果表明,约束规划模型的建立与求解是合理的。 相似文献
37.
In this paper, a condition-based maintenance model for a multi-unit production system is proposed and analyzed using Markov renewal theory. The units of the system are subject to gradual deterioration, and the gradual deterioration process of each unit is described by a three-state continuous time homogeneous Markov chain with two working states and a failure state. The production rate of the system is influenced by the deterioration process and the demand is constant. The states of the units are observable through regular inspections and the decision to perform maintenance depends on the number of units in each state. The objective is to obtain the steady-state characteristics and the formula for the long-run average cost for the controlled system. The optimal policy is obtained using a dynamic programming algorithm. The result is validated using a semi-Markov decision process formulation and the policy iteration algorithm. Moreover, an analytical expression is obtained for the calculation of the mean time to initiate maintenance using the first passage time theory. 相似文献
38.
We study a periodic-review assemble-to-order (ATO) system with multiple components and multiple products, in which the inventory replenishment for each component follows an independent base-stock policy and stochastic product demands are satisfied according to a First-Come-First-Served rule. We assume that the replenishment for various component suffers from lead time uncertainty. However, the decision maker has the so-called advance supply information (ASI) associated with the lead times and thus can take advantage of the information for system optimization. We propose a multistage stochastic integer program that incorporates ASI to address the joint optimization of inventory replenishment and component allocation. The optimal base-stock policy for the inventory replenishment is determined using the sample average approximation algorithm. Also, we provide a modified order-based component allocation (MOBCA) heuristic for the component allocation. We additionally consider a special case of the variable lead times where the resulting two-stage stochastic programming model can be characterized as a single-scenario case of the proposed multistage model. We carry out extensive computational studies to quantify the benefits of integrating ASI into joint optimization and to explore the possibility of employing the two-stage model as a relatively efficient approximation scheme for the multistage model. 相似文献
39.
Martijn van Ee 《海军后勤学研究》2020,67(2):147-158
We consider the salvo policy problem, in which there are k moments, called salvos, at which we can fire multiple missiles simultaneously at an incoming object. Each salvo is characterized by a probability pi: the hit probability of a single missile. After each salvo, we can assess whether the incoming object is still active. If it is, we fire the missiles assigned to the next salvo. In the salvo policy problem, the goal is to assign at most n missiles to salvos in order to minimize the expected number of missiles used. We consider three problem versions. In Gould's version, we have to assign all n missiles to salvos. In the Big Bomb version, a cost of B is incurred when all salvo's are unsuccessful. Finally, we consider the Quota version in which the kill probability should exceed some quota Q. We discuss the computational complexity and the approximability of these problem versions. In particular, we show that Gould's version and the Big Bomb version admit pseudopolynomial time exact algorithms and fully polynomial time approximation schemes. We also present an iterative approximation algorithm for the Quota version, and show that a related problem is NP-complete. 相似文献
40.
Adjacency‐based local top‐down search method for finding maximal efficient faces in multiple objective linear programming
下载免费PDF全文
![点击此处可从《海军后勤学研究》网站下载免费的PDF全文](/ch/ext_images/free.gif)
It is well‐known that the efficient set of a multiobjective linear programming (MOLP) problem can be represented as a union of the maximal efficient faces of the feasible region. In this paper, we propose a method for finding all maximal efficient faces for an MOLP. The new method is based on a condition that all efficient vertices (short for the efficient extreme points and rays) for the MOLP have been found and it relies on the adjacency, affine independence and convexity results of efficient sets. The method uses a local top‐down search strategy to determine maximal efficient faces incident to every efficient vertex for finding maximal efficient faces of an MOLP problem. To our knowledge, the proposed method is the first top‐down search method that uses the adjacency property of the efficient set to find all maximal efficient faces. We discuss this and other advantages and disadvantages of the algorithm. We also discuss some computational experience we have had with our computer code for implementing the algorithm. This computational experience involved solving several MOLP problems with the code. 相似文献