全文获取类型
收费全文 | 763篇 |
免费 | 129篇 |
国内免费 | 72篇 |
专业分类
964篇 |
出版年
2024年 | 2篇 |
2023年 | 3篇 |
2022年 | 4篇 |
2021年 | 12篇 |
2020年 | 12篇 |
2019年 | 23篇 |
2018年 | 29篇 |
2017年 | 55篇 |
2016年 | 50篇 |
2015年 | 34篇 |
2014年 | 47篇 |
2013年 | 124篇 |
2012年 | 55篇 |
2011年 | 56篇 |
2010年 | 36篇 |
2009年 | 49篇 |
2008年 | 41篇 |
2007年 | 65篇 |
2006年 | 71篇 |
2005年 | 52篇 |
2004年 | 37篇 |
2003年 | 25篇 |
2002年 | 19篇 |
2001年 | 24篇 |
2000年 | 21篇 |
1999年 | 8篇 |
1998年 | 1篇 |
1997年 | 1篇 |
1996年 | 1篇 |
1994年 | 3篇 |
1993年 | 3篇 |
1990年 | 1篇 |
排序方式: 共有964条查询结果,搜索用时 15 毫秒
201.
We study an infinite‐horizon, N‐stage, serial production/inventory system with two transportation modes between stages: regular shipping and expedited shipping. The optimal inventory policy for this system is a top–down echelon base‐stock policy, which can be computed through minimizing 2N nested convex functions recursively (Lawson and Porteus, Oper Res 48 (2000), 878–893). In this article, we first present some structural properties and comparative statics for the parameters of the optimal inventory policies, we then derive simple, newsvendor‐type lower and upper bounds for the optimal control parameters. These results are used to develop near optimal heuristic solutions for the echelon base‐stock policies. Numerical studies show that the heuristic performs well. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2010 相似文献
202.
In this paper we consider the problem of scheduling a set of jobs on a single machine on which a rate‐modifying activity may be performed. The rate‐modifying activity is an activity that changes the production rate of the machine. So the processing time of a job is a variable, which depends on whether it is scheduled before or after the rate‐modifying activity. We assume that the rate‐modifying activity can take place only at certain predetermined time points, which is a constrained case of a similar problem discussed in the literature. The decisions under consideration are whether and when to schedule the rate‐modifying activity, and how to sequence the jobs in order to minimize some objectives. We study the problems of minimizing makespan and total completion time. We first analyze the computational complexity of both problems for most of the possible versions. The analysis shows that the problems are NP‐hard even for some special cases. Furthermore, for the NP‐hard cases of the makespan problem, we present a pseudo‐polynomial time optimal algorithm and a fully polynomial time approximation scheme. For the total completion time problem, we provide a pseudo‐polynomial time optimal algorithm for the case with agreeable modifying rates. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005 相似文献
203.
Stephen J. Cimbala 《Defense & Security Analysis》2012,28(1):65-80
Minimum deterrence is a compromise, or halfway house, between nuclear abolition or nearly zero and assured destruction, the dominant paradigm for strategic nuclear arms control during and after the cold war. Minimum deterrence as applied to the current relationship between the United States and Russia would require downsizing the numbers of operationally deployed long-range nuclear weapons to 1000, or fewer, on each side. More drastic bilateral Russian–American reductions would require the cooperation of other nuclear weapons states in making proportional reductions in their own arsenals. In addition, US plans for European-based and global missile defenses cause considerable angst in Russia and threaten to derail the Obama “reset” in Russian–American relations, despite the uncertainties about current and plausible future performances of missile defense technologies. 相似文献
204.
205.
206.
In the last decade, there has been much progress in understanding scheduling problems in which selfish jobs aim to minimize their individual completion time. Most of this work has focused on makespan minimization as social objective. In contrast, we consider as social cost the total weighted completion time, that is, the sum of the agent costs, a standard definition of welfare in economics. In our setting, jobs are processed on restricted uniform parallel machines, where each machine has a speed and is only capable of processing a subset of jobs; a job's cost is its weighted completion time; and each machine sequences its jobs in weighted shortest processing time (WSPT) order. Whereas for the makespan social cost the price of anarchy is not bounded by a constant in most environments, we show that for our minsum social objective the price of anarchy is bounded above by a small constant, independent of the instance. Specifically, we show that the price of anarchy is exactly 2 for the class of unit jobs, unit speed instances where the finite processing time values define the edge set of a forest with the machines as nodes. For the general case of mixed job strategies and restricted uniform machines, we prove that the price of anarchy equals 4. From a classical machine scheduling perspective, our results establish the same constant performance guarantees for WSPT list scheduling. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012 相似文献
207.
208.
In this article, we consider the performance evaluation of a multicomponent, multiproduct assemble‐to‐order (ATO) system. Each component is managed independently using a base‐stock policy at a supply facility with limited production capacity and an infinite buffer. The arrivals of demands follow a multivariate Poisson process and unfilled demands are backlogged. Because exact analysis of the proposed system is not feasible, we propose two approximation methods which provide upper and lower bounds for various performance measures such as fill rate, average waiting time, and average number of backorders of the proposed system. Our computational experiments demonstrate the effectiveness of the two approximation methods under various system settings. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011 相似文献
209.
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 相似文献
210.
In progressive censoring, items are removed at certain times during the life test. Commonly, it is assumed that the removed items are used for further testing. In order to take into account information about these additional testing in inferential procedures, we propose a two‐step model of stage life testing with one fixed stage‐change time which incorporates information about both the removed items (further tested under different conditions) and those remaining in the current life test. We show that some marginal distributions in our model correspond either to progressive censoring with a fixed censoring time or to a simple‐step stress model. Furthermore, assuming a cumulative exposure model, we establish exact inferential results for the distribution parameters when the lifetimes are exponentially distributed. An extension to Weibull distributed lifetimes is also discussed. 相似文献