首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   275篇
  免费   45篇
  国内免费   7篇
  2022年   1篇
  2021年   5篇
  2020年   3篇
  2019年   7篇
  2018年   2篇
  2017年   6篇
  2016年   11篇
  2015年   15篇
  2014年   15篇
  2013年   61篇
  2012年   10篇
  2011年   11篇
  2010年   8篇
  2009年   13篇
  2008年   13篇
  2007年   16篇
  2006年   7篇
  2005年   18篇
  2004年   10篇
  2003年   12篇
  2002年   10篇
  2001年   9篇
  2000年   6篇
  1999年   9篇
  1998年   5篇
  1997年   12篇
  1996年   7篇
  1995年   2篇
  1994年   4篇
  1993年   6篇
  1992年   1篇
  1991年   6篇
  1990年   2篇
  1988年   2篇
  1986年   1篇
  1983年   1篇
排序方式: 共有327条查询结果,搜索用时 608 毫秒
81.
在1553B 总线的应用中,有两个关键问题:数据总线的使用和传输信息的标准化。本文研究了在连接WPS—1系统中的这些问题,主要内容包括:推论出数据总线能力的计算公式和计算数据WPS—1系统的的计算数据总线能力,除了解决与WPS—1系统有关的问题外,也试着对另外一些类似问题建立一个总的分析方法。  相似文献   
82.
某舰炮驻退复进机为液体气压式复进机,结构较复杂。特别是在复进运动过程中,由于某单向阀打开,使液体流动构成一差动连接回路。本文推导了该舰炮后座和复进过程的液压阻力公式,为对该炮进行反面设计提供了必要的技术储备。  相似文献   
83.
This paper studies a scheduling problem arising in a beef distribution system where pallets of various types of beef products in the warehouse are first depalletized and then individual cases are loaded via conveyors to the trucks which deliver beef products to various customers. Given each customer's demand for each type of beef, the problem is to find a depalletizing and truck loading schedule that fills all the demands at a minimum total cost. We first show that the general problem where there are multiple trucks and each truck covers multiple customers is strongly NP‐hard. Then we propose polynomial‐time algorithms for the case where there are multiple trucks, each covering only one customer, and the case where there is only one truck covering multiple customers. We also develop an optimal dynamic programming algorithm and a heuristic for solving the general problem. By comparing to the optimal solutions generated by the dynamic programming algorithm, the heuristic is shown to be capable of generating near optimal solutions quickly. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2003  相似文献   
84.
Since a system and its components usually deteriorate with age, preventive maintenance (PM) is often performed to restore or keep the function of a system in a good state. Furthermore, PM is capable of improving the health condition of the system and thus prolongs its effective age. There has been a vast amount of research to find optimal PM policies for deteriorating repairable systems. However, such decisions involve numerous uncertainties and the analyses are typically difficult to perform because of the scarcity of data. It is therefore important to make use of all information in an efficient way. In this article, a Bayesian decision model is developed to determine the optimal number of PM actions for systems which are maintained according to a periodic PM policy. A non‐homogeneous Poisson process with a power law failure intensity is used to describe the deteriorating behavior of the repairable system. It is assumed that the status of the system after a PM is somewhere between as good as new for a perfect repair and as good as old for a minimal repair, and for failures between two preventive maintenances, the system undergoes minimal repairs. Finally, a numerical example is given and the results of the proposed approach are discussed after performing sensitivity analysis. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2008  相似文献   
85.
We consider scheduling problems involving two agents (agents A and B), each having a set of jobs that compete for the use of a common machine to process their respective jobs. The due dates of the A‐jobs are decision variables, which are determined by using the common (CON) or slack (SLK) due date assignment methods. Each agent wants to minimize a certain performance criterion depending on the completion times of its jobs only. Under each due date assignment method, the criterion of agent A is always the same, namely an integrated criterion consisting of the due date assignment cost and the weighted number of tardy jobs. Several different criteria are considered for agent B, including the maxima of regular functions (associated with each job), the total (weighted) completion time, and the weighted number of tardy jobs. The overall objective is to minimize the performance criterion of agent A, while keeping the objective value of agent B no greater than a given limit. We analyze the computational complexity, and devise polynomial or pseudo‐polynomial dynamic programming algorithms for the considered problems. We also convert, if viable, any of the devised pseudopolynomial dynamic programming algorithms into a fully polynomial‐time approximation scheme. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 416–429, 2016  相似文献   
86.
We consider the problem of finding the system with the best primary performance measure among a finite number of simulated systems in the presence of a stochastic constraint on a single real‐valued secondary performance measure. Solving this problem requires the identification and removal from consideration of infeasible systems (Phase I) and of systems whose primary performance measure is dominated by that of other feasible systems (Phase II). We use indifference zones in both phases and consider two approaches, namely, carrying out Phases I and II sequentially and carrying out Phases I and II simultaneously, and we provide specific example procedures of each type. We present theoretical results guaranteeing that our approaches (general and specific, sequential and simultaneous) yield the best system with at least a prespecified probability, and we provide a portion of an extensive numerical study aimed at evaluating and comparing the performance of our approaches. The experimental results show that both new procedures are useful for constrained ranking and selection, with neither procedure showing uniform superiority over the other.© 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010  相似文献   
87.
In this article, we study a two‐level lot‐sizing problem with supplier selection (LSS), which is an NP‐hard problem arising in different production planning and supply chain management applications. After presenting various formulations for LSS, and computationally comparing their strengths, we explore the polyhedral structure of one of these formulations. For this formulation, we derive several families of strong valid inequalities, and provide conditions under which they are facet‐defining. We show numerically that incorporating these valid inequalities within a branch‐and‐cut framework leads to significant improvements in computation. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 647–666, 2017  相似文献   
88.
While accepting consumer returns has long been proposed as a solution to resolve the consumer valuation uncertainty problem, there are still a sizable portion of retailers who insist on a “no return” policy. In this article, we offer an economic rationale for these seemingly unreasonable strategies in a supply chain context. We demonstrate when and why the retailer may benefit from refusing consumer returns, even though offering consumer returns allows the supply chain to implement the expostmarket segmentation. Granting the retailer the right to refuse consumer returns may sometimes improve supply chain efficiency: it eliminates the manufacturer's attempt to induce inefficient consumer returns and bring the equilibrium back to that in the vertically integrated benchmark. We also find that the refund and the retail price can move in the opposite directions when product reliability varies, and consumer returns have a nontrivial impact on the quality choice. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 686–701, 2015  相似文献   
89.
In this study,we investigated electric explosion of iron wire in distilled water with different energy input adjusted by charging voltage.The as-prepared samples were characterized by X-ray diffraction (XRD),scanning electron microscopy (SEM),transmission electron microscopy (TEM) and X-ray photoelectron spectroscopy (XPS),showing the presence of iron and multiple iron-based compounds oxides with contents influenced by the experimental conditions.In particular,pure FeO(OH) nanoparticles were obtained using electric explosion of iron wire with energy input of 1125 J at charging voltage of 15 kV.Analysis of discharge current and resistive voltage data indicate that the high energy input induced by strong plasma discharge at high charging voltage is a key factor to form FeO(OH).This study presents a one-step method to synthesize FeO(OH) nanoparticles using electric explosion of iron wire.  相似文献   
90.
We consider a three‐layer supply chain with a manufacturer, a reseller, and a sales agent. The demand is stochastically determined by the random market condition and the sales agent's private effort level. Although the manufacturer is uninformed about the market condition, the reseller and the sales agent conduct demand forecasting and generate private demand signals. Under this framework with two levels of adverse selection intertwined with moral hazard, we study the impact of the reseller's and the sales agent's forecasting accuracy on the profitability of each member. We show that the manufacturer's profitability is convex on the reseller's forecasting accuracy. From the manufacturer's perspective, typically improving the reseller's accuracy is detrimental when the accuracy is low but is beneficial when it is high. We identify the concrete interrelation among the manufacturer‐optimal reseller's accuracy, the volatility of the market condition, and the sales agent's accuracy. Finally, the manufacturer's interest may be aligned with the reseller's when only the reseller can choose her accuracy; this alignment is never possible when both downstream players have the discretion to choose their accuracy. © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 207–222, 2014  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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