全文获取类型
收费全文 | 426篇 |
免费 | 138篇 |
国内免费 | 11篇 |
出版年
2024年 | 1篇 |
2023年 | 2篇 |
2022年 | 3篇 |
2021年 | 12篇 |
2020年 | 10篇 |
2019年 | 10篇 |
2018年 | 5篇 |
2017年 | 12篇 |
2016年 | 15篇 |
2015年 | 22篇 |
2014年 | 26篇 |
2013年 | 68篇 |
2012年 | 26篇 |
2011年 | 24篇 |
2010年 | 30篇 |
2009年 | 28篇 |
2008年 | 35篇 |
2007年 | 31篇 |
2006年 | 21篇 |
2005年 | 22篇 |
2004年 | 17篇 |
2003年 | 18篇 |
2002年 | 18篇 |
2001年 | 19篇 |
2000年 | 15篇 |
1999年 | 28篇 |
1998年 | 5篇 |
1997年 | 4篇 |
1996年 | 7篇 |
1995年 | 6篇 |
1994年 | 5篇 |
1993年 | 7篇 |
1992年 | 4篇 |
1991年 | 4篇 |
1990年 | 3篇 |
1989年 | 2篇 |
1988年 | 1篇 |
1987年 | 2篇 |
1986年 | 1篇 |
1985年 | 2篇 |
1983年 | 1篇 |
1982年 | 2篇 |
1981年 | 1篇 |
排序方式: 共有575条查询结果,搜索用时 218 毫秒
41.
The correlated improvement in yield and reliability has been observed in the case studies on integrated circuits and electronic assemblies. This paper presents a model that incorporates yield and reliability with the addition of a burn‐in step to explain their correlated improvement. The proposed model includes as special cases several yield and reliability models that have been previously published and thus provides a unifying framework. The model is used to derive a condition for which yield functions can be multiplied to obtain the overall yield. Yield and reliability are compared as a function of operation time, and an analytical condition for burn‐in to be effective is also obtained. Finally, Poisson and negative binomial defects models are further considered to investigate how reliability is based on yield. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004. 相似文献
42.
We state a balancing problem for mixed model assembly lines with a paced moving conveyor as: Given the daily assembling sequence of the models, the tasks of each model, the precedence relations among the tasks, and the operations parameters of the assembly line, assign the tasks of the models to the workstations so as to minimize the total overload time. Several characteristics of the problem are investigated. A line‐balancing heuristic is proposed based on a lower bound of the total overload time. A practical procedure is provided for estimating the deviation of any given line‐balance solution from the theoretical optimum. Numerical examples are given to illustrate the methodology. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004. 相似文献
43.
Extending Sastry's result on the uncapacitated two‐commodity network design problem, we completely characterize the optimal solution of the uncapacitated K‐commodity network design problem with zero flow costs for the case when K = 3. By solving a set of shortest‐path problems on related graphs, we show that the optimal solutions can be found in O(n3) time when K = 3, where n is the number of nodes in the network. The algorithm depends on identifying a list of “basic patterns”; the number of basic patterns grows exponentially with K. We also show that the uncapacitated K‐commodity network design problem can be solved in O(n3) time for general K if K is fixed; otherwise, the time for solving the problem is exponential. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004 相似文献
44.
传统的机械压痕法虽能测量火炮零部件的硬度,但对其表面有损害,且某些零部件工作面并不允许使用打点测量方式.为解决这一问题,基于硬度与材料磁导率之间的对应关系,设计了一种硬度电磁无损检测系统,采用DDS技术实现参数可控的正弦信号源,以满足磁导率测试所需的激励条件.为了提高检测灵敏度,利用交流电桥拾取由硬度变化引起的检测线圈和参考线圈电压差分信号,并进一步在调理电路中采用正交锁相放大技术对这一微弱信号进行放大和噪声抑制.硬度试验结果表明,该系统能以无损的检测方式有效地区分零部件的硬度值,为火炮定型试验中的硬度测量提供了新途径. 相似文献
45.
46.
This article studies a min‐max path cover problem, which is to determine a set of paths for k capacitated vehicles to service all the customers in a given weighted graph so that the largest path cost is minimized. The problem has wide applications in vehicle routing, especially when the minimization of the latest service completion time is a critical performance measure. We have analyzed four typical variants of this problem, where the vehicles have either unlimited or limited capacities, and they start from either a given depot or any depot of a given depot set. We have developed approximation algorithms for these four variants, which achieve approximation ratios of max{3 ‐ 2/k,2}, 5, max{5 ‐ 2/k,4}, and 7, respectively. We have also analyzed the approximation hardness of these variants by showing that, unless P = NP , it is impossible for them to achieve approximation ratios less than 4/3, 3/2, 3/2, and 2, respectively. We have further extended the techniques and results developed for this problem to other min‐max vehicle routing problems.© 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010 相似文献
47.
In this paper, we present an optimization model for coordinating inventory and transportation decisions at an outbound distribution warehouse that serves a group of customers located in a given market area. For the practical problems which motivated this paper, the warehouse is operated by a third party logistics provider. However, the models developed here may be applicable in a more general context where outbound distribution is managed by another supply chain member, e.g., a manufacturer. We consider the case where the aggregate demand of the market area is constant and known per period (e.g., per day). Under an immediate delivery policy, an outbound shipment is released each time a demand is realized (e.g., on a daily basis). On the other hand, if these shipments are consolidated over time, then larger (hence more economical) outbound freight quantities can be dispatched. In this case, the physical inventory requirements at the third party warehouse (TPW) are determined by the consolidated freight quantities. Thus, stock replenishment and outbound shipment release policies should be coordinated. By optimizing inventory and freight consolidation decisions simultaneously, we compute the parameters of an integrated inventory/outbound transportation policy. These parameters determine: (i) how often to dispatch a truck so that transportation scale economies are realized and timely delivery requirements are met, and (ii) how often, and in what quantities, the stock should be replenished at the TPW. We prove that the optimal shipment release timing policy is nonstationary, and we present algorithms for computing the policy parameters for both the uncapacitated and finite cargo capacity problems. The model presented in this study is considerably different from the existing inventory/transportation models in the literature. The classical inventory literature assumes that demands should be satisfied as they arrive so that outbound shipment costs are sunk costs, or else these costs are covered by the customer. Hence, the classical literature does not model outbound transportation costs. However, if a freight consolidation policy is in place then the outbound transportation costs can no longer be ignored in optimization. Relying on this observation, this paper models outbound transportation costs, freight consolidation decisions, and cargo capacity constraints explicitly. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 531–556, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10030 相似文献
48.
49.
In many practical manufacturing environments, jobs to be processed can be divided into different families such that a setup is required whenever there is a switch from processing a job of one family to another job of a different family. The time for setup could be sequence independent or sequence dependent. We consider two particular scheduling problems relevant to such situations. In both problems, we are given a set of jobs to be processed on a set of identical parallel machines. The objective of the first problem is to minimize total weighted completion time of jobs, and that of the second problem is to minimize weighted number of tardy jobs. We propose column generation based branch and bound exact solution algorithms for the problems. Computational experiments show that the algorithms are capable of solving both problems of medium size to optimality within reasonable computational time. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 823–840, 2003. 相似文献
50.
In this paper, we derive new families of facet‐defining inequalities for the finite group problem and extreme inequalities for the infinite group problem using approximate lifting. The new valid inequalities for the finite group problem include two‐ and three‐slope facet‐defining inequalities as well as the first family of four‐slope facet‐defining inequalities. The new valid inequalities for the infinite group problem include families of two‐ and three‐slope extreme inequalities. These new inequalities not only illustrate the diversity of strong inequalities for the finite and infinite group problems, but also provide a large variety of new cutting planes for solving integer and mixed‐integer programming problems. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008 相似文献