首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   229篇
  免费   33篇
  国内免费   13篇
  2022年   1篇
  2021年   5篇
  2020年   3篇
  2019年   3篇
  2018年   2篇
  2017年   7篇
  2016年   14篇
  2015年   7篇
  2014年   17篇
  2013年   13篇
  2012年   18篇
  2011年   30篇
  2010年   12篇
  2009年   8篇
  2008年   8篇
  2007年   14篇
  2006年   20篇
  2005年   17篇
  2004年   10篇
  2003年   12篇
  2002年   15篇
  2001年   14篇
  2000年   6篇
  1999年   9篇
  1998年   3篇
  1997年   3篇
  1995年   3篇
  1994年   1篇
排序方式: 共有275条查询结果,搜索用时 15 毫秒
131.
In this article, we seek to understand how a capacity‐constrained seller optimally prices and schedules product shipping to customers who are heterogeneous on willingness to pay (WTP) and willingness to wait (WTW). The capacity‐constrained seller does not observe each customer's WTP and WTW and knows only the aggregate distributions of WTP and WTW. The seller's problem is modeled as an M/M/Ns queueing model with multiclass customers and multidimensional information screening. We contribute to the literature by providing an optimal and efficient algorithm. Furthermore, we numerically find that customers with a larger waiting cost enjoys a higher scheduling priority, but customers with higher valuation do not necessarily get a higher scheduling priority. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 215–227, 2015  相似文献   
132.
机制建设具有根本性、独立性、规范性和稳定性,对廉政建设能够起到持续的促进作用。在加强武警部队后勤系统反腐倡廉建设中,必须注重建立教育倡廉、权力制衡、制度兴廉、监督促廉等科学防范长效机制。  相似文献   
133.
从党和国家当前所面临问题的严重性和紧迫性出发,从全面深化改革的重大战略意义、总体战略思路、系统战略部署三个方面,对十八届三中全会及其《决定》的内容进行了深入解读。  相似文献   
134.
在司法实践中,由盗窃、诈骗、抢夺转化为抢劫的刑事犯罪是一类比较典型的犯罪,其典型性主要体现为其犯罪性质已由盗窃、诈骗、抢夺转化为抢劫。现行刑法典第269条规定:“犯盗窃、诈骗、抢夺罪,为窝藏赃物、抗拒抓捕或者毁灭罪证而当场使用暴力或者以暴力相威胁的,依照本法第二百六十三条的规定定罪处罚,”根据这一规定,上述犯罪应以抢劫罪论处。笔者认为,在司法实务中适用本条来处理案件时,要真正理解本条的立法原意,并正确把握转化型抢劫罪严格的适用条件。这在实践中具有十分重要的意义。本文结合实践,对刑法典第269条转化型抢劫罪的适用条件等问题作一初步探讨。  相似文献   
135.
地空导弹阵地伪装及效果评价   总被引:5,自引:0,他引:5  
分析了某型地空导弹武器阵地的暴露特征,根据伪装学的原理,针对这些特征采取了相应的伪装措施,并根据观测试验数据,对该型地空导弹武器阵地伪装前后的光学、热红外及雷达伪装效果进行了定量评价分析。结果表明,在伪装前完全暴露的阵地,伪装后目标的暴露特征大大减小,伪装效果非常明显。  相似文献   
136.
复杂战场环境下,中远程防空导弹武器的中末制导交班问题越来越突出。实战要素影响到武器系统的各个环节,尤其是传感器测量精度,从而影响中末制导交班概率。通过灵敏度分析方法,对实战条件下影响中末制导交班的关键因素进行了分析,筛选出了高敏感影响因素,并得到了表征其影响程度的定量化灵敏度系数。  相似文献   
137.
Assemble‐to‐order (ATO) is an important operational strategy for manufacturing firms to achieve quick response to customer orders while keeping low finished good inventories. This strategy has been successfully used not only by manufacturers (e.g., Dell, IBM) but also by retailers (e.g., Amazon.com). The evaluation of order‐based performance is known to be an important but difficult task, and the existing literature has been mainly focused on stochastic comparison to obtain performance bounds. In this article, we develop an extremely simple Stein–Chen approximation as well as its error‐bound for order‐based fill rate for a multiproduct multicomponent ATO system with random leadtimes to replenish components. This approximation gives an expression for order‐based fill rate in terms of component‐based fill rates. The approximation has the property that the higher the component replenishment leadtime variability, the smaller the error bound. The result allows an operations manager to analyze the improvement in order‐based fill rates when the base‐stock level for any component changes. Numerical studies demonstrate that the approximation performs well, especially when the demand processes of different components are highly correlated; when the components have high base‐stock levels; or when the component replenishment leadtimes have high variability. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012  相似文献   
138.
高可靠性软件的极值统计分析   总被引:2,自引:1,他引:1  
提出了极值统计分析的方法.对于失效数据极值分布函数的拟合检验,采用了相关系数法;对于母体分布的参数估计,则分别采用了最小二乘估计(LSE)和极大似然估计(MLE);最后通过一个实例说明了统计过程,并用模拟的方法证明了最小二乘估计较好.  相似文献   
139.
We consider a supplier with finite production capacity and stochastic production times. Customers provide advance demand information (ADI) to the supplier by announcing orders ahead of their due dates. However, this information is not perfect, and customers may request an order be fulfilled prior to or later than the expected due date. Customers update the status of their orders, but the time between consecutive updates is random. We formulate the production‐control problem as a continuous‐time Markov decision process and prove there is an optimal state‐dependent base‐stock policy, where the base‐stock levels depend upon the numbers of orders at various stages of update. In addition, we derive results on the sensitivity of the state‐dependent base‐stock levels to the number of orders in each stage of update. In a numerical study, we examine the benefit of ADI, and find that it is most valuable to the supplier when the time between updates is moderate. We also consider the impact of holding and backorder costs, numbers of updates, and the fraction of customers that provide ADI. In addition, we find that while ADI is always beneficial to the supplier, this may not be the case for the customers who provide the ADI. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011  相似文献   
140.
This article studies the optimal control of a periodic‐review make‐to‐stock system with limited production capacity and multiple demand classes. In this system, a single product is produced to fulfill several classes of demands. The manager has to make the production and inventory allocation decisions. His objective is to minimize the expected total discounted cost. The production decision is made at the beginning of each period and determines the amount of products to be produced. The inventory allocation decision is made after receiving the random demands and determines the amount of demands to be satisfied. A modified base stock policy is shown to be optimal for production, and a multi‐level rationing policy is shown to be optimal for inventory allocation. Then a heuristic algorithm is proposed to approximate the optimal policy. The numerical studies show that the heuristic algorithm is very effective. © 2011 Wiley Periodicals, Inc. Naval Research Logistics 58: 43–58, 2011  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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