首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   804篇
  免费   146篇
  国内免费   25篇
  2023年   1篇
  2022年   2篇
  2021年   11篇
  2020年   17篇
  2019年   26篇
  2018年   29篇
  2017年   55篇
  2016年   49篇
  2015年   27篇
  2014年   49篇
  2013年   132篇
  2012年   46篇
  2011年   56篇
  2010年   40篇
  2009年   37篇
  2008年   42篇
  2007年   51篇
  2006年   49篇
  2005年   42篇
  2004年   35篇
  2003年   34篇
  2002年   32篇
  2001年   32篇
  2000年   21篇
  1999年   17篇
  1998年   13篇
  1997年   7篇
  1996年   3篇
  1995年   5篇
  1994年   1篇
  1993年   3篇
  1992年   3篇
  1991年   2篇
  1990年   2篇
  1989年   2篇
  1988年   2篇
排序方式: 共有975条查询结果,搜索用时 15 毫秒
61.
We study a component inventory planning problem in an assemble‐to‐order environment faced by many contract manufacturers in which both quick delivery and efficient management of component inventory are crucial for the manufacturers to achieve profitability in a highly competitive market. Extending a recent study in a similar problem setting by the same authors, we analyze an optimization model for determining the optimal component stocking decision for a contract manufacturer facing an uncertain future demand, where product price depends on the delivery times. In contrast to our earlier work, this paper considers the situation where the contract manufacturer needs to deliver the full order quantity in one single shipment. This delivery requirement is appropriate for many industries, such as the garment and toy industries, where the economies of scale in transportation is essential. We develop efficient solution procedures for solving this optimization problem. We use our model results to illustrate how the different model parameters affect the optimal solution. We also compare the results under this full‐shipment model with those from our earlier work that allows for multiple partial shipments. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007  相似文献   
62.
We introduce and develop models for a physical goods storage system based on the 15‐puzzle, a classic children's game in which 15 numbered tiles slide within a 4 × 4 grid. The objective of the game is to arrange the tiles in numerical sequence, starting from a random arrangement. For our purposes, the tiles represent totes, pallets, or even containers that must be stored very densely, and the objective is to maneuver items to an input–output point for retrieval or processing. We develop analytical results for storage configurations having a single empty location (as in the game) and experimental results for configurations with multiple empty locations. Designs with many empty locations can be made to form aisles, allowing us to compare puzzle‐based designs with traditional aisle‐based designs found in warehousing systems. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007  相似文献   
63.
We consider the infinite horizon serial inventory system with both average cost and discounted cost criteria. The optimal echelon base‐stock levels are obtained in terms of only probability distributions of leadtime demands. This analysis yields a novel approach for developing bounds and heuristics for optimal inventory control polices. In addition to deriving the known bounds in literature, we develop several new upper bounds for both average cost and discounted cost models. Numerical studies show that the bounds and heuristic are very close to optimal.© 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007  相似文献   
64.
Vendor‐managed revenue‐sharing arrangements are common in the newspaper and other industries. Under such arrangements, the supplier decides on the level of inventory while the retailer effectively operates under consignment, sharing the sales revenue with his supplier. We consider the case where the supplier is unable to predict demand, and must base her decisions on the retailer‐supplied probabilistic forecast for demand. We show that the retailer's best choice of a distribution to report to his supplier will not be the true demand distribution, but instead will be a degenerate distribution that surprisingly induces the supplier to provide the system‐optimal inventory quantity. (To maintain credibility, the retailer's reports of daily sales must then be consistent with his supplied forecast.) This result is robust under nonlinear production costs and nonlinear revenue‐sharing. However, if the retailer does not know the supplier's production cost, the forecast “improves” and could even be truthful. That, however, causes the supplier's order quantity to be suboptimal for the overall system. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007  相似文献   
65.
This study combines inspection and lot‐sizing decisions. The issue is whether to INSPECT another unit or PRODUCE a new lot. A unit produced is either conforming or defective. Demand need to be satisfied in full, by conforming units only. The production process may switch from a “good” state to a “bad” state, at constant rate. The proportion of conforming units in the good state is higher than in the bad state. The true state is unobservable and can only be inferred from the quality of units inspected. We thus update, after each inspection, the probability that the unit, next candidate for inspection, was produced while the production process was in the good state. That “good‐state‐probability” is the basis for our decision to INSPECT or PRODUCE. We prove that the optimal policy has a simple form: INSPECT only if the good‐state‐probability exceeds a control limit. We provide a methodology to calculate the optimal lot size and the expected costs associated with INSPECT and PRODUCE. Surprisingly, we find that the control limit, as a function of the demand (and other problem parameters) is not necessarily monotone. Also, counter to intuition, it is possible that the optimal action is PRODUCE, after revealing a conforming unit. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007  相似文献   
66.
This paper proposes a kurtosis correction (KC) method for constructing the X? and R control charts for symmetrical long‐tailed (leptokurtic) distributions. The control charts are similar to the Shewhart control charts and are very easy to use. The control limits are derived based on the degree of kurtosis estimated from the actual (subgroup) data. It is assumed that the underlying quality characteristic is symmetrically distributed and no other distributional and/or parameter assumptions are made. The control chart constants are tabulated and the performance of these charts is compared with that of the Shewhart control charts. For the case of the logistic distribution, the exact control limits are derived and are compared with the KC method and the Shewhart method. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007  相似文献   
67.
基于Monte Carlo法的地空导弹火力分配优化问题研究   总被引:2,自引:0,他引:2  
在确定地空导弹对目标的可射击系数、火力重叠修正系数和转火矛盾修正系数的基础上,结合Monte Carlo法的基本原理,介绍了解决地空导弹火力分配优化问题的一般步骤。运用计算机模拟技术,通过算例,证明了该方法的可行性,为有效解决地空导弹火力分配优化问题提供了一种较为科学的方法。  相似文献   
68.
多目标拦截是弹道导弹防御的重大难题,也是目前美国导弹防御系统所遇到的最大的技术难点。在将多目标问题分为单弹头攻击和多弹头攻击2类问题的基础上,结合美国的相关研究计划,分别针对核爆炸防御、助推段防御、先进的目标识别器和多拦截器防御等多目标拦截策略进行了分析研究。  相似文献   
69.
仔细研究了PbTiO3电场感应铁电相的晶体结构。在初始反铁电相中,各离子位移方向与极轴垂直,但在外电场感应下,Pb离子沿极轴方向有相同方向0.17的位移,从而使晶体呈现铁电相特征,发生反铁电-铁电相变。此铁电相称之为电场感应铁(EFI)电相。通过结构对称性分析,确定EFI铁电相的对称性是C2mm(C2v),用极矢量Ps作为序参量来描述相变时对称性的变化是合适的。  相似文献   
70.
Europe,Russia and the Ukraine crisis: the dynamics of coercion   总被引:2,自引:0,他引:2  
This article analyses European strategy towards Russia during the Ukraine crisis between February 2014 and December 2015, conceptualising it as a coercive diplomatic strategy and analysing the relationship between its ends, ways and means. European strategy sought to reverse Russian intervention. However, this overarching aim was flanked by two ‘constraining’ aims of avoiding an escalation of the conflict and a breakdown of relations with Russia. The strategy shifted between these aims, which proved to be irreconcilable: while the EU partly succeeded in containing the conflict, it failed to reverse Russian intervention and relations between the EU and Russia deteriorated sharply.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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