首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   185篇
  免费   47篇
  国内免费   7篇
  2023年   2篇
  2022年   2篇
  2021年   6篇
  2020年   7篇
  2019年   10篇
  2018年   3篇
  2017年   3篇
  2016年   3篇
  2015年   7篇
  2014年   15篇
  2013年   18篇
  2012年   15篇
  2011年   15篇
  2010年   18篇
  2009年   18篇
  2008年   12篇
  2007年   12篇
  2006年   11篇
  2005年   9篇
  2004年   10篇
  2003年   5篇
  2002年   7篇
  2001年   8篇
  2000年   6篇
  1999年   4篇
  1998年   1篇
  1997年   1篇
  1996年   3篇
  1994年   1篇
  1993年   1篇
  1990年   5篇
  1989年   1篇
排序方式: 共有239条查询结果,搜索用时 171 毫秒
191.
We consider a manufacturer, served by a single supplier, who has to quote due dates to arriving customers in a make‐to‐order production environment. The manufacturer is penalized for long lead times and for missing due dates. To meet due dates, the manufacturer has to obtain components from a supplier. We model this manufacturer and supplier as a two‐machine flow shop, consider several variations of this problem, and design effective due‐date quotation and scheduling algorithms for centralized and decentralized versions of the model. We perform extensive computational testing to assess the effectiveness of our algorithms and to compare the centralized and decentralized models to quantify the value of centralized control in a make‐to‐order supply chain. Since complete information exchange and centralized control is not always practical or cost‐effective, we explore the value of partial information exchange for this system. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008  相似文献   
192.
When facing uncertain demand, several firms may consider pooling their inventories leading to the emergence of two key contractual issues. How much should each produce or purchase for inventory purposes? How should inventory be allocated when shortages occur to some of the firms? Previously, if the allocations issue was considered, it was undertaken through evaluation of the consequences of an arbitrary priority scheme. We consider both these issues within a Nash bargaining solution (NBS) cooperative framework. The firms may not be risk neutral, hence a nontransferable utility bargaining game is defined. Thus the physical pooling mechanism itself must benefit the firms, even without any monetary transfers. The firms may be asymmetric in the sense of having different unit production costs and unit revenues. Our assumption with respect to shortage allocation is that a firm not suffering from a shortfall, will not be affected by any of the other firms' shortages. For two risk neutral firms, the NBS is shown to award priority on all inventory produced to the firm with higher ratio of unit revenue to unit production cost. Nevertheless, the arrangement is also beneficial for the other firm contributing to the total production. We provide examples of Uniform and Bernoulli demand distributions, for which the problem can be solved analytically. For firms with constant absolute risk aversion, the agreement may not award priority to any firm. Analytically solvable examples allow additional insights, e.g. that higher risk aversion can, for some problem parameters, cause an increase in the sum of quantities produced, which is not the case in a single newsvendor setting. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008  相似文献   
193.
应用Markov骨架过程的方法和补充变量技巧研究了索赔为多类一般到达的保险风险模型 ,分别得到了破产时间与破产时刻前后资产盈余的联合分布以及破产时间的分布。使得索赔为一般到达的保险风险问题的研究取得了较大的进展。  相似文献   
194.
Decentralized decision‐making in supply chain management is quite common, and often inevitable, due to the magnitude of the chain, its geographical dispersion, and the number of agents that play a role in it. But, decentralized decision‐making is known to result in inefficient Nash equilibrium outcomes, and optimal outcomes that maximize the sum of the utilities of all agents need not be Nash equilibria. In this paper we demonstrate through several examples of supply chain models how linear reward/penalty schemes can be implemented so that a given optimal solution becomes a Nash equilibrium. The examples represent both vertical and horizontal coordination issues. The techniques we employ build on a general framework for the use of linear reward/penalty schemes to induce stability in given optimal solutions and should be useful to other multi‐agent operations management settings. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2006  相似文献   
195.
基于供应链管理的战时装备供应保障业务流程重组   总被引:3,自引:0,他引:3  
从战时装备供应链管理的要素和相互关系出发,结合我军实际,提出了基于供应链的战时装备供应保障业务流程重组过程,并对相关方法进行了讨论,旨在使战时所需装备以可预见的方式快速、安全、准确地送抵到作战部队。  相似文献   
196.
This study aims to determine and evaluate dynamic idling policies where an agent can idle while some customers remain waiting. This type of policies can be employed in situations where the flow of urgent customers does not allow the agent to spend sufficient time on back-office tasks. We model the system as a single-agent exponential queue with abandonment. The objective is to minimize the system's congestion while ensuring a certain proportion of idling time for the agent. Using a Markov decision process approach, we prove that the optimal policy is a threshold policy according to which the agent should idle above (below) a certain threshold on the queue length if the congestion-related performance measure is concave (convex) with respect to the number of customers present. We subsequently obtain the stationary probabilities, performance measures, and idling time duration, expressed using complex integrals. We show how these integrals can be numerically computed and provide simpler expressions for fast-agent and heavy-traffic asymptotic cases. In practice, the most common way to regulate congestion is to control access to the service by rejecting some customers upon arrival. Our analysis reveals that idling policies allow high levels of idling probability that such rejection policies cannot reach. Furthermore, the greatest benefit of implementing an optimal idling policy occurs when the objective occupation rate is close to 50% in highly congested situations.  相似文献   
197.
在工作寿命和修理时间之一服从一般的连续型分布,另一个服从指数分布的情形下讨论了单周期的备件存储问题,通过适当地划分系统的状态,利用Markov更新过程的理论进行了分析,建立了概率型模型,并由模型得到了最佳备件数的求法。  相似文献   
198.
基于灰色系统理论,将灰色GM(1,1)预测模型和马尔柯夫预测模型的优点结合起来,形成一个灰色马尔柯夫预测模型,拓宽了灰色预测的应用范围。特别地,这种模型的预测结果比其它随机波动性较大的数据到模型的预测结果精确得多。对柴油机磨损寿命进行预测,取得了令人满意的结果。  相似文献   
199.
对炮兵自动化指挥系统中决策组织的结构和能力进行了研究,建立了较为完善的各级指挥员指挥决策体系的Petri网模型。通过有色Petri网对群一级的炮兵自动化指挥系统在不同任务环境下的不同工作方式进行了建模表示和分析,引入了决策时延这一反应指挥决策体系能力的重要性能指标,并进一步运用马尔科夫链的分析方法对建立的指挥决策体系的Petri网模型进行定量分析,得出了量化结果,为自动化指挥系统中决策组织结构的设计和分析提供了理论根据。  相似文献   
200.
本文首先讨论了边缘跟踪的常用方法,并指出了其存在的缺点,而后提出了虚象点与虚链的概念,并讨论了它们的性质。在此基础上,提出了快速边缘跟踪的算法和边界链码的获取。  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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