首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   183篇
  免费   39篇
  222篇
  2021年   1篇
  2019年   5篇
  2018年   2篇
  2017年   6篇
  2016年   10篇
  2015年   14篇
  2014年   8篇
  2013年   59篇
  2012年   9篇
  2011年   8篇
  2010年   4篇
  2009年   7篇
  2008年   9篇
  2007年   12篇
  2006年   7篇
  2005年   11篇
  2004年   7篇
  2003年   11篇
  2002年   10篇
  2001年   8篇
  2000年   5篇
  1999年   6篇
  1993年   1篇
  1986年   1篇
  1977年   1篇
排序方式: 共有222条查询结果,搜索用时 15 毫秒
151.
152.
Ranking is a common task for selecting and evaluating alternatives. In the past few decades, combining rankings results from various sources into a consensus ranking has become an increasingly active research topic. In this study, we focus on the evaluation of rank aggregation methods. We first develop an experimental data generation method, which can provide ground truth ranking for alternatives based on their “inherent ability.” This experimental data generation method can generate the required individual synthetic rankings with adjustable accuracy and length. We propose characterizing the effectiveness of rank aggregation methods by calculating the Kendall tau distance between the aggregated ranking and the ground truth ranking. We then compare four classical rank aggregation methods and present some useful findings on the relative performances of the four methods. The results reveal that both the accuracy and length of individual rankings have a remarkable effect on the comparison results between rank aggregation methods. Our methods and results may be helpful to both researchers and decision‐makers.  相似文献   
153.
A joint optimization of the production run length and preventive maintenance (PM) policy is studied for a deteriorating production system where the in‐control period follows a general probability distribution with non‐decreasing failure rate. In the literature, the sufficient conditions for the optimality of the equal‐interval PM schedule is explored to derive an optimal production run length and an optimal number of PM actions. Nevertheless, an exhaustive search may arise. In this study, based on the assumption that the conditions for the optimality of the equal‐interval PM schedule hold, we derive some structural properties for the optimal production/PM policy, which increases the efficiency of the solution procedure. These analyses have implications for the practical application of the production/PM model to be more available in practice. A numerical example of gamma shift distribution with non‐decreasing failure rates is used to illustrate the solution procedure, leading to some insight into the management process. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2006  相似文献   
154.
We consider a generalized one‐dimensional bin‐packing model where the cost of a bin is a nondecreasing concave function of the utilization of the bin. Four popular heuristics from the literature of the classical bin‐packing problem are studied: First Fit (FF), Best Fit (BF), First Fit Decreasing (FFD), and Best Fit Decreasing (BFD). We analyze their worst‐case performances when they are applied to our model. The absolute worst‐case performance ratio of FF and BF is shown to be exactly 2, and that of FFD and BFD is shown to be exactly 1.5. Computational experiments are also conducted to test the performance of these heuristics. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006  相似文献   
155.
Retrial queueing systems are widely used in teletraffic theory and computer and communication networks. Although there has been a rapid growth in the literature on retrial queueing systems, the research on retrial queues with nonexponential retrial times is very limited. This paper is concerned with the analytical treatment of an M/G/1 retrial queue with general retrial times. Our queueing model is different from most single server retrial queueing models in several respectives. First, customers who find the server busy are queued in the orbit in accordance with an FCFS (first‐come‐first‐served) discipline and only the customer at the head of the queue is allowed for access to the server. Besides, a retrial time begins (if applicable) only when the server completes a service rather upon a service attempt failure. We carry out an extensive analysis of the queue, including a necessary and sufficient condition for the system to be stable, the steady state distribution of the server state and the orbit length, the waiting time distribution, the busy period, and other related quantities. Finally, we study the joint distribution of the server state and the orbit length in non‐stationary regime. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 561–581, 1999  相似文献   
156.
157.
Despite its ability to result in more effective network plans, the telecommunication network planning problem with signal‐to‐interference ratio constraints gained less attention than the power‐based one because of its complexity. In this article, we provide an exact solution method for this class of problems that combines combinatorial Benders decomposition, classical Benders decomposition, and valid cuts in a nested way. Combinatorial Benders decomposition is first applied, leading to a binary master problem and a mixed integer subproblem. The subproblem is then decomposed using classical Benders decomposition. The algorithm is enhanced using valid cuts that are generated at the classical Benders subproblem and are added to the combinatorial Benders master problem. The valid cuts proved efficient in reducing the number of times the combinatorial Benders master problem is solved and in reducing the overall computational time. More than 120 instances of the W‐CDMA network planning problem ranging from 20 demand points and 10 base stations to 140 demand points and 30 base stations are solved to optimality. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010  相似文献   
158.
This paper tackles the general single machine scheduling problem, where jobs have different release and due dates and the objective is to minimize the weighted number of late jobs. The notion of master sequence is first introduced, i.e., a sequence that contains at least an optimal sequence of jobs on time. This master sequence is used to derive an original mixed‐integer linear programming formulation. By relaxing some constraints, a Lagrangean relaxation algorithm is designed which gives both lower and upper bounds. The special case where jobs have equal weights is analyzed. Computational results are presented and, although the duality gap becomes larger with the number of jobs, it is possible to solve problems of more than 100 jobs. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 50: 2003  相似文献   
159.
This paper presents a deterministic approach to schedule patients in an ambulatory surgical center (ASC) such that the number of postanesthesia care unit nurses at the center is minimized. We formulate the patient scheduling problem as new variants of the no‐wait, two‐stage process shop scheduling problem and present computational complexity results for the new scheduling models. Also, we develop a tabu search‐based heuristic algorithm to solve the patient scheduling problem. Our algorithm is shown to be very effective in finding near optimal schedules on a set of real data from a university hospital's ASC. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2003  相似文献   
160.
It is often stated that technological change in the military field is characterised by the introduction of radical innovations rather than by incremental processes of technological change. This article illustrates the diversity of military innovation by arguing that technological change in missiles systems is dominated by incremental change. While some large weapons platforms display the design rigidities normally associated with complex systems, missiles are characterised by “flexible modularity”. Flexible modularity facilitates the continuous introduction of upgrades, and makes missile systems amenable to gradual technological change. Besides, it has significant implications for the future role of missile systems, and poses special problems for missile disarmament and technology control initiatives.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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