首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   622篇
  免费   151篇
  国内免费   14篇
  2023年   2篇
  2022年   5篇
  2021年   9篇
  2020年   6篇
  2019年   20篇
  2018年   9篇
  2017年   33篇
  2016年   35篇
  2015年   25篇
  2014年   39篇
  2013年   86篇
  2012年   27篇
  2011年   41篇
  2010年   35篇
  2009年   43篇
  2008年   44篇
  2007年   49篇
  2006年   34篇
  2005年   32篇
  2004年   36篇
  2003年   20篇
  2002年   34篇
  2001年   31篇
  2000年   29篇
  1999年   14篇
  1998年   9篇
  1997年   11篇
  1996年   8篇
  1995年   4篇
  1993年   2篇
  1992年   3篇
  1991年   3篇
  1990年   4篇
  1989年   2篇
  1988年   2篇
  1987年   1篇
排序方式: 共有787条查询结果,搜索用时 15 毫秒
781.
We propose a new method for making the inventory replenishment decisions in distribution systems. In particular, we consider distribution systems consisting of multiple retailers that face random demand and a warehouse that supplies the retailers. The method that we propose is based on formulating the distribution problem as a dynamic program, and relaxing the constraints that ensure the nonnegativity of the shipments to the retailers, by associating Lagrange multipliers with them. We show that our method provides lower bounds on the value functions, and a good set of values for the Lagrange multipliers can be obtained by maximizing a concave function in a relatively straightforward manner. Computational experiments indicate that our method can provide significant improvements over the traditional approaches for making the inventory replenishment decisions, in terms of both the tightness of the lower bounds on the value functions and the performance of the policies. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008  相似文献   
782.
Traditional inventory systems treat all demands of a given item equally. This approach is optimal if the penalty costs of all customers are the same, but it is not optimal if the penalty costs are different for different customer classes. Then, demands of customers with high penalty costs must be filled before demands of customers with low penalty costs. A commonly used inventory policy for dealing with demands with different penalty costs is the critical level inventory policy. Under this policy demands with low penalty costs are filled as long as inventory is above a certain critical level. If the inventory reaches the critical level, only demands with high penalty costs are filled and demands with low penalty costs are backordered. In this article, we consider a critical level policy for a periodic review inventory system with two demand classes. Because traditional approaches cannot be used to find the optimal parameters of the policy, we use a multidimensional Markov chain to model the inventory system. We use a sample path approach to prove several properties of this inventory system. Although the cost function is not convex, we can build on these properties to develop an optimization approach that finds the optimal solution. We also present some numerical results. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008  相似文献   
783.
This article considers the empty vehicle redistribution problem in a hub‐and‐spoke transportation system, with random demands and stochastic transportation times. An event‐driven model is formulated, which yields the implicit optimal control policy. Based on the analytical results for two‐depot systems, a dynamic decomposition procedure is presented which produces a near‐optimal policy with linear computational complexity in terms of the number of spokes. The resulting policy has the same asymptotic behavior as that of the optimal policy. It is found that the threshold‐type control policy is not usually optimal in such systems. The results are illustrated through small‐scale numerical examples. Through simulation the robustness of the dynamic decomposition policy is tested using a variety of scenarios: more spokes, more vehicles, different combinations of distribution types for the empty vehicle travel times and loaded vehicle arrivals. This shows that the dynamic decomposition policy is significantly better than a heuristics policy in all scenarios and appears to be robust to the assumptions of the distribution types. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008  相似文献   
784.
In many manufacturing environments, equipment condition has a significant impact on product quality, or yield. This paper presents a semi‐Markov decision process model of a single‐stage production system with multiple products and multiple maintenance actions. The model simultaneously determines maintenance and production schedules, accounting for the fact that equipment condition affects the yield of each product differently. It extends earlier work by allowing the expected time between decision epochs to vary by both action and machine state, by allowing multiple maintenance actions, and by treating the outcome of maintenance as less than certain. Sufficient conditions are developed that ensure the monotonicity of both the optimal production and maintenance actions. While the maintenance conditions closely resemble previously studied conditions for this type of problem, the production conditions represent a significant departure from earlier results. The simultaneous solution method is compared to an approach commonly used in industry, where the maintenance and production problems are treated independently. Solving more than one thousand test problems confirms that the combination of both features of the model—accounting for product differences and solving the problems simultaneously—has a significant impact on performance. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2008  相似文献   
785.
We propose a dynamic escape route system for emergency evacuation of a naval ship. The system employs signals that adapt to the causative contingency and the crew's physical distribution about the ship. A mixed‐integer nonlinear programming model, with underlying network structure, optimizes the evacuation process. The network's nodes represent compartments, closures (e.g., doors and hatches) and intersections, while arcs represent various types of passageways. The objective function integrates two potentially conflicting factors: average evacuation time and the watertight and airtight integrity of the ship after evacuation. A heuristic solves the model approximately using a sequence of mixed‐integer linear approximating problems. Using data for a Spanish frigate, with standard static routes specified by the ship's designers, computational tests show that the dynamic system can reduce average evacuation times, nearly 23%, and can improve a combined measure of ship integrity by up to 50%. In addition, plausible design changes to the frigate yield further, substantial improvements. Published 2008 Wiley Periodicals, Inc. Naval Research Logistics 2008  相似文献   
786.
We study competitive due‐date and capacity management between the marketing and engineering divisions within an engineer‐to‐order (ETO) firm. Marketing interacts directly with the customers and quotes due‐dates for their orders. Engineering is primarily concerned with the efficient utilization of resources and is willing to increase capacity if the cost is compensated. The two divisions share the responsibility for timely delivery of the jobs. We model the interaction between marketing and engineering as a Nash game and investigate the effect of internal competition on the equilibrium decisions. We observe that the internal competition not only degrades the firm's overall profitability but also the serviceability. Finally, we extend our analysis to multiple‐job settings that consider both flexible and inflexible capacity. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008  相似文献   
787.
Traffic is the lifeblood of every e-commerce platform. The question of how to channel traffic to merchants operating on a platform lies at the heart of platform management. We consider a platform on which two independent merchants sell their products. Merchants compete on inventory in the sense that some of the unmet demand at one merchant will spill over to the other. The platform channels traffic based on products' conversion rates to maximize the total sale on the platform. We show that traffic channeling plays three roles. First, it allows more efficient allocation of traffic; that is, the merchant with a high conversion rate is given a higher priority in receiving traffic. Second, it allows the platform to control demand spillover between the merchants to maximize total sales. The platform either facilitates or prevents demand spillover, depending on product substitutability. Third, traffic channeling intensifies competition between the merchants and hence increases the total inventory. More efficient allocation of traffic and the increase in inventory increase sales inequality between the merchants. In contrast, demand spillover decreases sales inequality. While the platform always benefits from traffic channeling, the merchants do not benefit when their products are moderately substitutable. Interestingly, when the two products are owned and sold by the same merchant, the opposite happens–traffic channeling always benefits the merchant but may hurt the platform. Our study provides a basis for informed discussions on how platforms should channel traffic in response to conversion rates, and how traffic channeling affects the welfare of merchants and platforms.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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