全文获取类型
收费全文 | 133篇 |
免费 | 25篇 |
国内免费 | 4篇 |
出版年
2024年 | 2篇 |
2023年 | 1篇 |
2022年 | 1篇 |
2021年 | 1篇 |
2020年 | 4篇 |
2019年 | 4篇 |
2017年 | 4篇 |
2016年 | 5篇 |
2015年 | 6篇 |
2014年 | 15篇 |
2013年 | 7篇 |
2012年 | 9篇 |
2011年 | 15篇 |
2010年 | 10篇 |
2009年 | 11篇 |
2008年 | 3篇 |
2007年 | 10篇 |
2006年 | 9篇 |
2005年 | 7篇 |
2004年 | 3篇 |
2003年 | 5篇 |
2002年 | 9篇 |
2001年 | 4篇 |
2000年 | 5篇 |
1999年 | 1篇 |
1997年 | 1篇 |
1996年 | 1篇 |
1995年 | 2篇 |
1993年 | 1篇 |
1992年 | 1篇 |
1991年 | 1篇 |
1990年 | 4篇 |
排序方式: 共有162条查询结果,搜索用时 15 毫秒
91.
92.
We develop a competitive pricing model which combines the complexity of time‐varying demand and cost functions and that of scale economies arising from dynamic lot sizing costs. Each firm can replenish inventory in each of the T periods into which the planning horizon is partitioned. Fixed as well as variable procurement costs are incurred for each procurement order, along with inventory carrying costs. Each firm adopts, at the beginning of the planning horizon, a (single) price to be employed throughout the horizon. On the basis of each period's system of demand equations, these prices determine a time series of demands for each firm, which needs to service them with an optimal corresponding dynamic lot sizing plan. We establish the existence of a price equilibrium and associated optimal dynamic lotsizing plans, under mild conditions. We also design efficient procedures to compute the equilibrium prices and dynamic lotsizing plans.© 2008 Wiley Periodicals, Inc. Naval Research Logistics 2009 相似文献
93.
通过对军队院校读者利用图书馆信息资源的阅读需求情况分析,研究了军队院校不同层次读者的阅读规律和信息需求特点,并对军队院校图书馆完善读者服务工作进行了思考。 相似文献
94.
当前各种油料需求预计单纯地追求表面精确而忽视实有误差,重静止轻动态,脱离了作战保障实际。从技术、勤务和战术结合的层面,将油料需求预计不确定性因素归结为油料消耗标准本身、计划与实际运用差异、影响油耗的自然因素考虑不同、作战任务理解判断差别四点,并对各自的误差范围进行了粗略分析。提出的不确定性因素及误差范围界定,有助于引发人们对作战油料需求预计新的思考,提高油料勤务理论研究和实践能力水平。 相似文献
95.
96.
97.
Hanan Luss 《海军后勤学研究》2010,57(3):266-278
Applications for content distribution over networks, such as Video‐on‐Demand (VOD), are expected to grow significantly over time. Effective bandwidth allocation schemes that can be repeatedly executed must be deployed since new programs are often installed at various servers while other are deleted. We present a model for bandwidth allocation in a content distribution network that consists of multiple trees, where the root of each tree has a server that broadcasts multiple programs throughout the tree. Each network link has limited capacity and may be used by one or more of these trees. The model is formulated as an equitable resource allocation problem with a lexicographic maximin objective function that attempts to provide equitable service performance for all requested programs at the various nodes. The constraints include link capacity constraints and tree‐like ordering constraints imposed on each of the programs. We present an algorithm that provides an equitable solution in polynomial time for certain performance functions. At each iteration, the algorithm solves single‐link maximin optimization problems while relaxing the ordering constraints. The algorithm selects a bottleneck link, fixes various variables at their lexicographic optimal solution while enforcing the ordering constraints, and proceeds with the next iteration. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010 相似文献
98.
Capacity planning decisions affect a significant portion of future revenue. In equipment intensive industries, these decisions usually need to be made in the presence of both highly volatile demand and long capacity installation lead times. For a multiple product case, we present a continuous‐time capacity planning model that addresses problems of realistic size and complexity found in current practice. Each product requires specific operations that can be performed by one or more tool groups. We consider a number of capacity allocation policies. We allow tool retirements in addition to purchases because the stochastic demand forecast for each product can be decreasing. We present a cluster‐based heuristic algorithm that can incorporate both variance reduction techniques from the simulation literature and the principles of a generalized maximum flow algorithm from the network optimization literature. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2006 相似文献
99.
100.
Ward Whitt 《海军后勤学研究》2007,54(5):476-484
One traditional application of queueing models is to help set staffing requirements in service systems, but the way to do so is not entirely straightforward, largely because demand in service systems typically varies greatly by the time of day. This article discusses ways—old and new—to cope with that time‐varying demand. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007 相似文献