全文获取类型
收费全文 | 129篇 |
免费 | 74篇 |
国内免费 | 17篇 |
出版年
2024年 | 1篇 |
2023年 | 3篇 |
2022年 | 4篇 |
2021年 | 3篇 |
2020年 | 9篇 |
2019年 | 8篇 |
2018年 | 7篇 |
2017年 | 15篇 |
2016年 | 7篇 |
2015年 | 10篇 |
2014年 | 17篇 |
2013年 | 10篇 |
2012年 | 8篇 |
2011年 | 13篇 |
2010年 | 12篇 |
2009年 | 14篇 |
2008年 | 8篇 |
2007年 | 10篇 |
2006年 | 15篇 |
2005年 | 11篇 |
2004年 | 8篇 |
2003年 | 5篇 |
2002年 | 2篇 |
2001年 | 4篇 |
2000年 | 2篇 |
1999年 | 2篇 |
1998年 | 2篇 |
1995年 | 2篇 |
1994年 | 2篇 |
1993年 | 1篇 |
1992年 | 2篇 |
1991年 | 3篇 |
排序方式: 共有220条查询结果,搜索用时 382 毫秒
91.
Dimitrios G. Pandelis 《海军后勤学研究》2014,61(6):435-446
We consider two‐stage tandem queueing systems with dedicated servers in each station and a flexible server that is trained to serve both stations. We assume no arrivals, exponential service times, and linear holding costs for jobs present in the system. We study the optimal dynamic assignment of servers to jobs assuming a noncollaborative work discipline with idling and preemptions allowed. For larger holding costs in the first station, we show that (i) nonidling policies are optimal and (ii) if the flexible server is not faster than the dedicated servers, the optimal server allocation strategy has a threshold‐type structure. For all other cases, we provide numerical results that support the optimality of threshold‐type policies. Our numerical experiments also indicate that when the flexible server is faster than the dedicated server of the second station, the optimal policy may have counterintuitive properties, which is not the case when a collaborative service discipline is assumed. © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 435–446, 2014 相似文献
92.
针对机械臂关节对中误差对机械臂末端定位精度影响进行研究。以6自由度机械臂为研究对象,利用D-H法建立了机械臂运动学模型,并建立对中误差传递数学模型。利用蒙特卡洛方法以MATLAB为平台进行了误差分布仿真实验,得出了由于对中误差引起的机械臂末端定位误差分布特点,以及在不同对中误差等级下,机械臂末端定位误差概率分布情况。为对中误差修正提供了参考基础,同时为机械臂定位精度评价提供了定量化依据。 相似文献
93.
文中主要对一体化联合作战中的精确控制内涵进行了阐述,然后分别从重要性和实现途径两个方面对作战时序的精确控制、作战空间的精确控制、作战目标的精确控制和作战信息环境的精确控制进行探讨。 相似文献
94.
95.
The quick response (QR) system that can cope with demand volatility by shortening lead time has been well studied in the literature. Much of the existing literature assumes implicitly or explicitly that the manufacturers under QR can always meet the demand because the production capacity is always sufficient. However, when the order comes with a short lead time under QR, availability of the manufacturer's production capacity is not guaranteed. This motivates us to explore QR in supply chains with stochastic production capacity. Specifically, we study QR in a two-echelon supply chain with Bayesian demand information updating. We consider the situation where the manufacturer's production capacity under QR is uncertain. We first explore how stochastic production capacity affects supply chain decisions and QR implementation. We then incorporate the manufacturer's ability to expand capacity into the model. We explore how the manufacturer determines the optimal capacity expansion decision, and the value of such an ability to the supply chain and its agents. Finally, we extend the model to the two-stage two-ordering case and derive the optimal ordering policy by dynamic programming. We compare the single-ordering and two-ordering cases to generate additional managerial insights about how ordering flexibility affects QR when production capacity is stochastic. We also explore the transparent supply chain and find that our main results still hold. 相似文献
96.
97.
张元祥 《中国人民武装警察部队学院学报》2004,20(1):34-36
根据消防部队联合作战的特点,分析目前联合作战中存在的问题,提出联合作战的组织指挥原则,并从六个方面阐述了联合作战的组织指挥方法。 相似文献
98.
99.
This study introduces one modeling methodology that describes a broad range of multiple stage production planning issues, including multiple limited resources with setup times and joint fixed cost relationships. An existing production system is modeled in this fashion, creating a new set of 1350 highly generalized benchmark problems. A computational study is conducted with the 1350 benchmark problems introduced in this paper and 2100 benchmark problems, with more restrictive assumptions, from the existing literature. The relative merits of a decomposition‐based algorithm and a neighborhood search technique known as NIPPA, or the Non‐sequential Incremental Part Period Algorithm, are assessed. NIPPA is generally the more successful of the two techniques, although there are specific instances in which the decomposition‐based algorithm displayed a distinct advantage. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005 相似文献
100.
黄兴春 《武警工程学院学报》2011,(6):73-74
军事理论课程教学,在武警部队“合训”院校课程设置中所处的位置越来越重要。如何在由培养工程技术类干部向指挥类干部“学历教育合训”为主的转变过程中,提高军事理论课程讲授的效益和质量,关键在于军事理论课程教学方法的选择与应用。 相似文献