全文获取类型
收费全文 | 898篇 |
免费 | 184篇 |
国内免费 | 51篇 |
出版年
2024年 | 1篇 |
2023年 | 4篇 |
2022年 | 10篇 |
2021年 | 8篇 |
2020年 | 14篇 |
2019年 | 22篇 |
2018年 | 13篇 |
2017年 | 36篇 |
2016年 | 53篇 |
2015年 | 29篇 |
2014年 | 59篇 |
2013年 | 114篇 |
2012年 | 72篇 |
2011年 | 88篇 |
2010年 | 59篇 |
2009年 | 77篇 |
2008年 | 69篇 |
2007年 | 72篇 |
2006年 | 55篇 |
2005年 | 44篇 |
2004年 | 47篇 |
2003年 | 41篇 |
2002年 | 37篇 |
2001年 | 25篇 |
2000年 | 24篇 |
1999年 | 17篇 |
1998年 | 4篇 |
1997年 | 7篇 |
1996年 | 10篇 |
1995年 | 7篇 |
1994年 | 3篇 |
1993年 | 4篇 |
1992年 | 1篇 |
1991年 | 1篇 |
1990年 | 3篇 |
1989年 | 1篇 |
1988年 | 2篇 |
排序方式: 共有1133条查询结果,搜索用时 46 毫秒
251.
We introduce a multi‐period tree network maintenance scheduling model and investigate the effect of maintenance capacity restrictions on traffic/information flow interruptions. Network maintenance refers to activities that are performed to keep a network operational. For linear networks with uniform flow between every pair of nodes, we devise a polynomial‐time combinatorial algorithm that minimizes flow disruption. The spiral structure of the optimal maintenance schedule sheds insights into general network maintenance scheduling. The maintenance problem on linear networks with a general flow structure is strongly NP‐hard. We formulate this problem as a linear integer program, derive strong valid inequalities, and conduct a polyhedral study of the formulation. Polyhedral analysis shows that the relaxation of our linear network formulation is tight when capacities and flows are uniform. The linear network formulation is then extended to an integer program for solving the tree network maintenance scheduling problem. Preliminary computations indicate that the strengthened formulations can solve reasonably sized problems on tree networks and that the intuitions gained from the uniform flow case continue to hold in general settings. Finally, we extend the approach to directed networks and to maintenance of network nodes. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011 相似文献
252.
This study addresses cyclic scheduling in robotic flowshops with bounded work‐in‐process (WIP) levels. The objective is to minimize the cycle time or, equivalently, to maximize the throughput, under the condition that the WIP level is bounded from above by a given integer number. We present several strongly polynomial algorithms for the 2‐cyclic robotic flowshop scheduling problems for various WIP levels. © 2010 Wiley Periodicals, Inc. Naval Research Logistics 58: 1–16, 2011 相似文献
253.
针对EMS型低速磁浮列车的U型电磁铁,研究其气隙磁密及结构参数的设计方法.气隙磁密应选为铁芯材料的磁导率下降到其最大值的90%时所对应的磁密.结构参数包括极长、极高、窗宽、窗高和轭厚,极长影响牵引效率及过弯能力,极宽影响承载能力和导向刚度,窗宽和窗高影响重量,但随轨宽而定,轭厚按磁轭与磁极的磁密相等的原则来选取. 相似文献
254.
255.
杨霞 《中国人民武装警察部队学院学报》2007,23(10):41-43
化工企业火灾风险评估对于化工生产至关重要。针对化工行业的火灾风险,结合层次分析法和模糊识别模式的优点,提出了基于层次分析—模糊识别的综合评价方法,并通过实例评估证明了这种评价方法行之有效。 相似文献
256.
Assemble in Advance (AIA) policy reduces assembly cost due to advance planning, while Assemble to Order (ATO) policy eliminates assembly of excessive (more than demanded) units. The tradeoffs between the two policies have been studied in the past for single product environments. Moreover, it was shown that it is beneficial to employ AIA and ATO simultaneously. In this article, we study the employment of such a composite assembly policy in a multiproduct environment with component commonality. When common components are used, ATO may also enable us to benefit from the risk pooling effect. We provide important managerial insights such as: the multiperiod problem is myopic and changes in inventory levels due to the use of common components, and demonstrate the potential profit increase compared to other policies.© 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007 相似文献
257.
Burn‐in is a widely used method to improve the quality of products or systems after they have been produced. In this paper, we study burn‐in procedure for a system that is maintained under periodic inspection and perfect repair policy. Assuming that the underlying lifetime distribution of a system has an initially decreasing and/or eventually increasing failure rate function, we derive upper and lower bounds for the optimal burn‐in time, which maximizes the system availability. Furthermore, adopting an age replacement policy, we derive upper and lower bounds for the optimal age parameter of the replacement policy for each fixed burn‐in time and a uniform upper bound for the optimal burn‐in time given the age replacement policy. These results can be used to reduce the numerical work for determining both optimal burn‐in time and optimal replacement policy. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007 相似文献
258.
We consider a mixed‐model assembly line (MMAL) comprised a set of workstations and a conveyor. The workstations are arranged in a serial configuration. The conveyor moves at a constant speed along the workstations. Initial units belonging to different models are successively fed onto the conveyor, and they are moved by the conveyor to pass through the workstations to gradually generate final products. All assembling tasks are manually performed with operation times to be stochastic. An important performance measure of MMALs is overload times that refer to uncompleted operations for operators within their work zones. This paper establishes a method to analyze the expected overload times for MMALs with stochastic operation times. The operation processes of operators form discrete time nonhomogeneous Markov processes with continuous state spaces. For a given daily production schedule, the expected overload times involve in analyzing the Markov processes for finite horizon. Based on some important properties of the performance measure, we propose an efficient approach for calculating the expected overload times. Numerical computations show that the results are very satisfactory. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007 相似文献
259.
We propose three related estimators for the variance parameter arising from a steady‐state simulation process. All are based on combinations of standardized‐time‐series area and Cramér–von Mises (CvM) estimators. The first is a straightforward linear combination of the area and CvM estimators; the second resembles a Durbin–Watson statistic; and the third is related to a jackknifed version of the first. The main derivations yield analytical expressions for the bias and variance of the new estimators. These results show that the new estimators often perform better than the pure area, pure CvM, and benchmark nonoverlapping and overlapping batch means estimators, especially in terms of variance and mean squared error. We also give exact and Monte Carlo examples illustrating our findings.© 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007 相似文献
260.
This study presents power‐of‐two policies for a serial inventory system with constant demand rate and incremental quantity discounts at the most upstream stage. It is shown that an optimal solution is nested and follows a zero‐inventory ordering policy. To prove the effectiveness of power‐of‐two policies, a lower bound on the optimal cost is obtained. A policy that has a cost within 6% of the lower bound is developed for a fixed base planning period. For a variable base planning period, a 98% effective policy is provided. An extension is included for a system with price dependent holding costs. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007 相似文献