全文获取类型
| 收费全文 | 367篇 |
| 免费 | 7篇 |
| 国内免费 | 2篇 |
专业分类
| 376篇 |
出版年
| 2025年 | 2篇 |
| 2024年 | 1篇 |
| 2023年 | 5篇 |
| 2022年 | 2篇 |
| 2021年 | 2篇 |
| 2020年 | 7篇 |
| 2019年 | 6篇 |
| 2018年 | 1篇 |
| 2017年 | 14篇 |
| 2016年 | 19篇 |
| 2015年 | 18篇 |
| 2014年 | 23篇 |
| 2013年 | 16篇 |
| 2012年 | 15篇 |
| 2011年 | 14篇 |
| 2010年 | 11篇 |
| 2009年 | 28篇 |
| 2008年 | 17篇 |
| 2007年 | 21篇 |
| 2006年 | 27篇 |
| 2005年 | 16篇 |
| 2004年 | 19篇 |
| 2003年 | 10篇 |
| 2002年 | 7篇 |
| 2001年 | 11篇 |
| 2000年 | 9篇 |
| 1999年 | 4篇 |
| 1998年 | 5篇 |
| 1997年 | 7篇 |
| 1996年 | 5篇 |
| 1995年 | 4篇 |
| 1994年 | 2篇 |
| 1993年 | 6篇 |
| 1992年 | 5篇 |
| 1991年 | 5篇 |
| 1990年 | 9篇 |
| 1989年 | 2篇 |
| 1988年 | 1篇 |
排序方式： 共有376条查询结果，搜索用时 0 毫秒
21.
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. 相似文献
22.
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. 相似文献
23.
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. 相似文献
24.
词汇学习和记忆是学习语言的最基本的手段,也是运用语言的先决条件。学习英语词汇除了从词汇的语音、拼写和一般定义入手外,还应特别注意词汇的语义。本文尝试从词汇的语义关系这个角度论述语义在英语词汇学习中的重要性。 相似文献
25.
本文以 MCS-51系列单片微型机为例,讨论了当前单片机最新编程技术 MBASIC 语言编程和在 IBM-PC 机及兼容机中直接进行模拟/调试,文中给出相应的例子。 相似文献
26.
27.
针对工程项目目标控制问题,通过德尔菲法确定工程项目目标控制的主要影响因素,基于系统动力学反馈与仿真分析理论建立了工程项目目标控制系统动力学模型。采用专家打分法确定参数,利用Vensim软件对模型进行模拟演化和算例分析,讨论不同策略和策略组合的工程项目目标控制效果,最终得到基于算例工程的理想方案为0时增加人工8人,0时加班1 d,管理费水平为3。采用该方案,该工程的完工时间提前47.2%,质量下降2.0%,费用上升6.7%。通过不同策略和策略组合的效果比较,得出结论：加班宜尽量少用,尤其要避免连续加班;尽量避免无效管理费用支出,但对于可以带来管理水平提高的管理费用支出宜适量增加;增加人工越早越好。 相似文献
28.
数据分布是影响并行程序在分布主存多处理机上执行性能的重要因素.针对分布主存多处理机中的数据分布问题,提出了一种基于0-1整数规划、利用数据变换技术进行有效数据分布的方法.该方法通过数据变换技术改变数据的存储布局,以使得数据能被有效地分布,并且该方法还利用数据分布图描述程序被并行的情况及其所含数组被访问的情况,并将全局数据分布优化问题转换为求解数据分布图中最优路径的问题,从而可用0-1整数规划求解最优路径问题.该方法能对多个嵌套循环中具有仿射数组下标的任意维数组进行有效的数据分布,并且也能使嵌套循环的并行度尽可能地大.另外,该方法也考虑了偏移常量的对准问题,从而能使数据通信量尽量地小.实验结果验证了该方法的有效性. 相似文献
29.
远程反舰导弹弹道规划研究 总被引：5，自引：0，他引：5
以保证远程反舰导弹迅速捕捉目标为出发点,以远程反舰导弹的作战需求为牵引,论述了对远程反舰导弹进行弹道规划的重要意义;从战术和技术两个方面探索了对远程反舰导弹进行弹道规划的主要依据、基本原则、规划思路和基本方法。 相似文献
30.