全文获取类型
收费全文 | 189篇 |
免费 | 11篇 |
国内免费 | 6篇 |
出版年
2024年 | 1篇 |
2022年 | 1篇 |
2021年 | 2篇 |
2020年 | 3篇 |
2019年 | 3篇 |
2017年 | 8篇 |
2016年 | 8篇 |
2015年 | 8篇 |
2014年 | 13篇 |
2013年 | 18篇 |
2012年 | 7篇 |
2011年 | 14篇 |
2010年 | 8篇 |
2009年 | 15篇 |
2008年 | 6篇 |
2007年 | 13篇 |
2006年 | 16篇 |
2005年 | 13篇 |
2004年 | 9篇 |
2003年 | 7篇 |
2002年 | 4篇 |
2001年 | 5篇 |
2000年 | 2篇 |
1999年 | 6篇 |
1998年 | 2篇 |
1995年 | 1篇 |
1994年 | 3篇 |
1993年 | 1篇 |
1992年 | 7篇 |
1990年 | 2篇 |
排序方式: 共有206条查询结果,搜索用时 15 毫秒
11.
We study a pull‐type, flexible, multi‐product, and multi‐stage production/inventory system with decentralized two‐card kanban control policies. Each stage involves a processor and two buffers with finite target levels. Production stages, arranged in series, can process several product types one at a time. Transportation of semi‐finished parts from one stage to another is performed in fixed lot sizes. The exact analysis is mathematically intractable even for smaller systems. We present a robust approximation algorithm to model two‐card kanban systems with batch transfers under arbitrary complexity. The algorithm uses phase‐type modeling to find effective processing times and busy period analysis to identify delays among product types in resource contention. Our algorithm reduces the effort required for estimating performance measures by a considerable margin and resolves the state–space explosion problem of analytical approaches. Using this analytical tool, we present new findings for a better understanding of some tactical and operational issues. We show that flow of material in small procurement sizes smoothes flow of information within the system, but also necessitates more frequent shipments between stages, raising the risk of late delivery. Balancing the risk of information delays vis‐à‐vis shipment delays is critical for the success of two‐card kanban systems. Although product variety causes time wasted in setup operations, it also facilitates relatively short production cycles enabling processors to switch from one product type to another more rapidly. The latter point is crucial especially in high‐demand environments. Increasing production line size prevents quick response to customer demand, but it may improve system performance if the vendor lead‐time is long or subject to high variation. Finally, variability in transportation and processing times causes the most damage if it arises at stages closer to the customer. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007 相似文献
12.
This study combines inspection and lot‐sizing decisions. The issue is whether to INSPECT another unit or PRODUCE a new lot. A unit produced is either conforming or defective. Demand need to be satisfied in full, by conforming units only. The production process may switch from a “good” state to a “bad” state, at constant rate. The proportion of conforming units in the good state is higher than in the bad state. The true state is unobservable and can only be inferred from the quality of units inspected. We thus update, after each inspection, the probability that the unit, next candidate for inspection, was produced while the production process was in the good state. That “good‐state‐probability” is the basis for our decision to INSPECT or PRODUCE. We prove that the optimal policy has a simple form: INSPECT only if the good‐state‐probability exceeds a control limit. We provide a methodology to calculate the optimal lot size and the expected costs associated with INSPECT and PRODUCE. Surprisingly, we find that the control limit, as a function of the demand (and other problem parameters) is not necessarily monotone. Also, counter to intuition, it is possible that the optimal action is PRODUCE, after revealing a conforming unit. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007 相似文献
13.
Subspace dynamic‐simplex linear interpolation search for mixed‐integer black‐box optimization problems
下载免费PDF全文
![点击此处可从《海军后勤学研究》网站下载免费的PDF全文](/ch/ext_images/free.gif)
Honggang Wang 《海军后勤学研究》2017,64(4):305-322
Design and management of complex systems with both integer and continuous decision variables can be guided using mixed‐integer optimization models and analysis. We propose a new mixed‐integer black‐box optimization (MIBO) method, subspace dynamic‐simplex linear interpolation search (SD‐SLIS), for decision making problems in which system performance can only be evaluated with a computer black‐box model. Through a sequence of gradient‐type local searches in subspaces of solution space, SD‐SLIS is particularly efficient for such MIBO problems with scaling issues. We discuss the convergence conditions and properties of SD‐SLIS algorithms for a class of MIBO problems. Under mild conditions, SD‐SLIS is proved to converge to a stationary solution asymptotically. We apply SD‐SLIS to six example problems including two MIBO problems associated with petroleum field development projects. The algorithm performance of SD‐SLIS is compared with that of a state‐of‐the‐art direct‐search method, NOMAD, and that of a full space simplex interpolation search, Full‐SLIS. The numerical results suggest that SD‐SLIS solves the example problems efficiently and outperforms the compared methods for most of the example cases. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 305–322, 2017 相似文献
14.
随着火炮武器系统的发展,火炮所配属的弹药类型越来越多,针对不同目标选择合适的弹药以达到最佳作战效能具有重要意义。首先,按照"最大化对敌火力效果、最小化附带损伤,最小化费用"的原则,分析了随伴支援炮兵弹药选择模型要考虑的决策指标,包括毁伤比、压制比、非敌伤亡率、安全距离、费用。建立了决策指标的效用函数,在此基础上建立了整体的决策指标,对决策指标的权重系数进行了分析探讨。最后用实例证明该方法是一种有效综合各类因素的弹药选择方法,能够很好地解决弹药选择问题。 相似文献
15.
16.
17.
18.
19.
针对非致命弹药安全管理评估方面的空白,采用模糊层次分析法(FAHP),从宏观上对非致命弹药安全管理系统进行评价。通过分析影响非致命弹药安全管理水平的因素,建立系统综合评价指标。分别建立不同指标间的模糊一致判断矩阵,确定隶属函数、权重值,最后得出定量评判结果,确定非致命弹药安全管理系统等级,对非致命弹药安全管理提供理论依据。 相似文献
20.
弹药保障决策模型的研究 总被引:6,自引:0,他引:6
从弹药保障的工作入手 ,论述了弹药消耗预计算法 ,提出了基于存储论的弹药补充决策模型。给出了战时弹药保障的 3种策略 相似文献