首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   170篇
  免费   24篇
  国内免费   9篇
  2023年   2篇
  2022年   1篇
  2021年   2篇
  2020年   7篇
  2019年   5篇
  2018年   3篇
  2017年   5篇
  2016年   5篇
  2015年   7篇
  2014年   12篇
  2013年   18篇
  2012年   8篇
  2011年   15篇
  2010年   10篇
  2009年   11篇
  2008年   15篇
  2007年   22篇
  2006年   8篇
  2005年   8篇
  2004年   8篇
  2003年   2篇
  2002年   6篇
  2001年   6篇
  2000年   5篇
  1999年   4篇
  1998年   3篇
  1997年   4篇
  1996年   1篇
排序方式: 共有203条查询结果,搜索用时 15 毫秒
91.
针对初始库存和终止库存不为零的生产与库存问题,通过适当设置需求量,将其化为初始库存和终止库存为零的问题,以便应用重生性质进行求解。  相似文献   
92.
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  相似文献   
93.
This article addresses the inventory placement problem in a serial supply chain facing a stochastic demand for a single planning period. All customer demand is served from stage 1, where the product is stored in its final form. If the demand exceeds the supply at stage 1, then stage 1 is resupplied from stocks held at the upstream stages 2 through N, where the product may be stored in finished form or as raw materials or subassemblies. All stocking decisions are made before the demand occurs. The demand is nonnegative and continuous with a known probability distribution, and the purchasing, holding, shipping, processing, and shortage costs are proportional. There are no fixed costs. All unsatisfied demand is lost. The objective is to select the stock quantities that should be placed different stages so as to maximize the expected profit. Under reasonable cost assumptions, this leads to a convex constrained optimization problem. We characterize the properties of the optimal solution and propose an effective algorithm for its computation. For the case of normal demands, the calculations can be done on a spreadsheet. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48:506–517, 2001  相似文献   
94.
Optimizing the selection of resources to accomplish a set of tasks involves evaluating the tradeoffs between the cost of maintaining the resources necessary to accomplish the tasks and the penalty cost associated with unfinished tasks. We consider the case where resources are categorized into types, and limits (capacity) are imposed on the number of each type that can be selected. The objective is to minimize the sum of penalty costs and resource costs. This problem has several practical applications including production planning, new product design, menu selection and inventory management. We develop a branch‐and‐bound algorithm to find exact solutions to the problem. To generate bounds, we utilize a dual ascent procedure which exploits the special structure of the problem. Information from the dual and recovered primal solutions are used to select branching variables. We generate strong valid inequalities and use them to fix other variables at each branching step. Results of tests performed on reasonably sized problems are presented. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 19–37, 1999  相似文献   
95.
先验式秘密共享方案及实现   总被引:2,自引:0,他引:2  
分析了传统的秘密共享算法的不足之处,提出了相应的优化方案,形成了先验式秘密共享方案,包括初始化、份额更新、份额恢复和秘密重构,实现了先验式秘密共享协议的各种算法,充分考虑了秘密分享的各个阶段可能遇到的问题,并分别给出了相应的解决方案.  相似文献   
96.
This article studies the inventory competition under yield uncertainty. Two firms with random yield compete for substitutable demand: If one firm suffers a stockout, which can be caused by yield failure, its unsatisfied customers may switch to its competitor. We first study the case in which two competing firms decide order quantities based on the exogenous reliability levels. The results from the traditional inventory competition are generalized to the case with yield uncertainty and we find that quantity and reliability can be complementary instruments in the competition. Furthermore, we allow the firms to endogenously improve their yield reliability before competing in quantity. We show that the reliability game is submodular under some assumptions. The results indicate that the competition in quantity can discourage the reliability improvement. With an extensive numerical study, we also demonstrate the robustness of our analytical results in more general settings. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 107–126, 2015  相似文献   
97.
We study the competition problem of purchase and multiretrieval of perishable seasonal produce, where wholesalers purchase and stock their products in the first period, and then retrieve and sell them in subsequent periods. We first consider the duopoly case and assume that the prices are exogenous and fluctuate. In each period, after the price realization, the wholesalers retrieve some stock from their warehouses to satisfy their demands. One wholesaler's unsatisfied customers can switch to another and be satisfied by its left retrieved products. Any unsold retrieved stock has no salvage value and any unsatisfied demand is lost. The unretrieved stock is carried to the next period at a perishable rate. The wholesalers compete for the substitute demand by determining their own purchase and retrieval quantities. We show the existence and uniqueness of a pure-strategy Nash equilibrium, and that the Nash equilibrium strategy has the simple “sell-down-to” structure. We also consider the general N-person game and show the existence of the Nash equilibrium, and characterize the structure of the equilibrium strategy for the symmetric case. In addition, we consider the case with endogenous prices, and show that the problem reduces to a repeated newsvendor game with price and inventory competition. We derive the conditions under which a unique Nash equilibrium exists and characterize the equilibrium strategy. Finally, we conduct numerical studies to examine the impacts of the model parameters on the equilibrium outcomes and to generate managerial insights.  相似文献   
98.
We investigate information flow in a setting in which 2 retailers order from a supplier and sell to a market with uncertain demand. Each retailer has access to a signal. The retailers can disclose signals to each other (horizontal information sharing), while the supplier can solicit signals by offering retailers differential payments as incentives for signal disclosure (vertical information acquisition). In the base setting, market competition is in quantity, and a retailer can fully infer the signal that the other retailer discloses to the supplier. We show that the supplier prefers to sequentialize the procedure for information acquisition. Moreover, vertical information acquisition by the supplier is a strategic complement to horizontal information sharing between the retailers to establish information flow. In the equilibrium, the retailers have no incentive to exchange signals, but system wide information transparency can be realized through a combination of information acquisition and inference. We further study the signaling effect, whereby the supplier utilizes wholesale pricing as an instrument to affect the retailers' inference of the shared signals, and price competition to explore their impacts on the supplier's preference for sequential acquisition and the sustainability of information flow.  相似文献   
99.
In this paper an inventory model with several demand classes, prioritised according to importance, is analysed. We consider a lot‐for‐lot or (S ? 1, S) inventory model with lost sales. For each demand class there is a critical stock level at and below which demand from that class is not satisfied from stock on hand. In this way stock is retained to meet demand from higher priority demand classes. A set of such critical levels determines the stocking policy. For Poisson demand and a generally distributed lead time, we derive expressions for the service levels for each demand class and the average total cost per unit time. Efficient solution methods for obtaining optimal policies, with and without service level constraints, are presented. Numerical experiments in which the solution methods are tested demonstrate that significant cost reductions can be achieved by distinguishing between demand classes. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 593–610, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10032  相似文献   
100.
We consider a simple two‐stage supply chain with a single retailer facing i.i.d. demand and a single manufacturer with finite production capacity. We analyze the value of information sharing between the retailer and the manufacturer over a finite time horizon. In our model, the manufacturer receives demand information from the retailer even during time periods in which the retailer does not order. To analyze the impact of information sharing, we consider the following three strategies: (1) the retailer does not share demand information with the manufacturer; (2) the retailer does share demand information with the manufacturer and the manufacturer uses the optimal policy to schedule production; (3) the retailer shares demand information with the manufacturer and the manufacturer uses a greedy policy to schedule production. These strategies allow us to study the impact of information sharing on the manufacturer as a function of the production capacity, and the frequency and timing in which demand information is shared. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2003  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号