全文获取类型
收费全文 | 256篇 |
免费 | 36篇 |
国内免费 | 12篇 |
出版年
2023年 | 1篇 |
2022年 | 2篇 |
2021年 | 6篇 |
2020年 | 7篇 |
2019年 | 8篇 |
2018年 | 6篇 |
2017年 | 10篇 |
2016年 | 5篇 |
2015年 | 11篇 |
2014年 | 22篇 |
2013年 | 32篇 |
2012年 | 22篇 |
2011年 | 17篇 |
2010年 | 23篇 |
2009年 | 20篇 |
2008年 | 19篇 |
2007年 | 12篇 |
2006年 | 10篇 |
2005年 | 11篇 |
2004年 | 10篇 |
2003年 | 7篇 |
2002年 | 5篇 |
2001年 | 9篇 |
2000年 | 5篇 |
1999年 | 6篇 |
1998年 | 2篇 |
1997年 | 1篇 |
1996年 | 2篇 |
1995年 | 4篇 |
1994年 | 1篇 |
1993年 | 1篇 |
1992年 | 3篇 |
1991年 | 1篇 |
1990年 | 3篇 |
排序方式: 共有304条查询结果,搜索用时 15 毫秒
141.
We consider several independent decision makers who stock expensive, low‐demand spare parts for their high‐tech machines. They can collaborate by full pooling of their inventories via free transshipments. We examine the stability of such pooling arrangements, and we address the issue of fairly distributing the collective holding and downtime costs over the participants, by applying concepts from cooperative game theory. We consider two settings: one where each party maintains a predetermined stocking level and one where base stock levels are optimized. For the setting with fixed stocking levels, we unravel the possibly conflicting effects of implementing a full pooling arrangement and study these effects separately to establish intuitive conditions for existence of a stable cost allocation. For the setting with optimized stocking levels, we provide a simple proportional rule that accomplishes a population monotonic allocation scheme if downtime costs are symmetric among participants. Although our whole analysis is motivated by spare parts applications, all results are also applicable to other pooled resource systems of which the steady‐state behavior is equivalent to that of an Erlang loss system. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012 相似文献
142.
在一般供应链性能评价指标体系的基础上,结合现代战争中军械维修器材供应链的特点,从资源、输出和柔性三个角度构建了战时军械维修器材供应链性能评价的指标体系.考虑到战争环境下信息的模糊性和不确定性,建立了战时军械维修器材供应链性能评价的证据理论模型.以某战时军械维修器材供应链为例,基于构建的战时军械维修器材供应链性能评价指标体系和模型进行案例研究.结果表明,基于证据理论构建的战时军械维修器材供应链性能评价模型是可行的,有效的. 相似文献
143.
基于.NET的装备保障辅助决策系统(ESADS)的设计与实现 总被引:1,自引:0,他引:1
介绍了一种基于.NET框架的异构数据库应用系统的集成方法,并设计开发了战时装备保障辅助决策系统。该方法利用XML的特点和.NET技术,将原有的应用系统数据源与系统分离,并能在各异构数据库之间快速交互数据,从而共享原有的装备管理信息,为战时装备保障决策提供数据资源。 相似文献
144.
综合深水系统是美国海岸警卫队20世纪90年代提出构想并逐步实施的其在21世纪的装备系统,它具有系统性、兼容性、互动性和先进性,是美国海岸警卫队历史上最大的最具革新性的装备系统。由于我国分散执法的海上执法体制等原因,我国海上执法队伍整体装备存在重复建设、兼容性差、技术水平落后、整体效能差等问题。美国海岸警卫队“综合深水系统”对我国未来海上执法队伍装备建设具有一定的借鉴意义。 相似文献
145.
146.
We examine the behavior of a manufacturer and a retailer in a decentralized supply chain under price‐dependent, stochastic demand. We model a retail fixed markup (RFM) policy, which can arise as a form of vertically restrictive pricing in a supply chain, and we examine its effect on supply chain performance. We prove the existence of the optimal pricing and replenishment policies when demand has a linear additive form and the distribution of the uncertainty component has a nondecreasing failure rate. We numerically compare the relative performance of RFM to a price‐only contract and we find that RFM results in greater profit for the supply chain than the price‐only contract in a variety of scenarios. We find that RFM can lead to Pareto‐improving solutions where both the supplier and the retailer earn more profit than under a price‐only contract. Finally, we compare RFM to a buyback contract and explore the implications of allowing the fixed markup parameter to be endogenous to the model. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006. 相似文献
147.
Dr. Ir. F.J. Sluiman 《海军后勤学研究》2017,64(3):225-248
A transit vessel traffic scheduling algorithm has been developed to limit the negative effects on cargo volume throughput in two‐way waterways where separation distances between transiting vessels must be maintained and passage restrictions may hold. It runs in time that is polynomial in the number of ships involved in the computation and finds schedules which increase the utilization of waterways. Three examples illustrate its use. The first example is situated in the Sunda Strait where the algorithm is used to enhance the safety of merchant shipping against a terrorist threat. It illustrates important features of the algorithm and demonstrates how it can be used with cross traffic. The second example is situated in the Strait of Istanbul and offers a comparison between the developed algorithm and the transit vessel scheduling algorithm of Ulusçu et al., J Navig 62 (2009), 59–77. This was done using a plausible model of the Strait of Istanbul. The third and last example shows how the algorithm can be used to schedule transit vessel traffic in two‐way waterways with junctions. This feature is especially useful in congested waters with a high risk of collisions like the Inland Sea of Japan. An extreme test case proves that the developed algorithm is a practical algorithm ready for such use. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 225–248, 2017 相似文献
148.
When an unreliable supplier serves multiple retailers, the retailers may compete with each other by inflating their order quantities in order to obtain their desired allocation from the supplier, a behavior known as the rationing game. We introduce capacity information sharing and a capacity reservation mechanism in the rationing game and show that a Nash equilibrium always exists. Moreover, we provide conditions guaranteeing the existence of the reverse bullwhip effect upstream, a consequence of the disruption caused by the supplier. In contrast, we also provide conditions under which the bullwhip effect does not exist. In addition, we show that a smaller unit reservation payment leads to more bullwhip and reverse bullwhip effects, while a large unit underage cost results in a more severe bullwhip effect. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 203–216, 2017 相似文献
149.
We consider a problem of optimal division of stock between a logistic depot and several geographically dispersed bases, in a two‐echelon supply chain. The objective is to minimize the total cost of inventory shipment, taking into account direct shipments between the depot and the bases, and lateral transshipments between bases. We prove the convexity of the objective function and suggest a procedure for identifying the optimal solution. Small‐dimensional cases, as well as a limit case in which the number of bases tends to infinity, are solved analytically for arbitrary distributions of demand. For a general case, an approximation is suggested. We show that, in many practical cases, partial pooling is the best strategy, and large proportions of the inventory should be kept at the bases rather than at the depot. The analytical and numerical examples show that complete pooling is obtained only as a limit case in which the transshipment cost tends to infinity. © 2017 Wiley Periodicals, Inc. Naval Research Logistics, 64: 3–18, 2017 相似文献
150.