首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   183篇
  免费   8篇
  2019年   6篇
  2018年   9篇
  2017年   4篇
  2016年   4篇
  2015年   6篇
  2014年   5篇
  2013年   37篇
  2012年   3篇
  2011年   3篇
  2010年   1篇
  2009年   4篇
  2005年   1篇
  2004年   2篇
  2003年   6篇
  2002年   2篇
  2001年   2篇
  2000年   4篇
  1999年   1篇
  1998年   1篇
  1997年   3篇
  1996年   1篇
  1995年   2篇
  1994年   2篇
  1993年   4篇
  1992年   2篇
  1991年   3篇
  1990年   4篇
  1989年   4篇
  1988年   7篇
  1987年   4篇
  1986年   5篇
  1985年   2篇
  1984年   2篇
  1983年   3篇
  1981年   1篇
  1980年   2篇
  1979年   3篇
  1978年   1篇
  1977年   1篇
  1976年   3篇
  1975年   2篇
  1974年   6篇
  1973年   2篇
  1972年   4篇
  1971年   4篇
  1970年   3篇
  1969年   4篇
  1968年   3篇
  1966年   1篇
  1948年   1篇
排序方式: 共有191条查询结果,搜索用时 281 毫秒
101.
A fundamental unsolved problem in the programming area is one in which various activities have fixed charges (e.g., set-up time charges) if operating at a positive level. Properties of a general solution to this type problem are discussed in this paper. Under special circumstances it is shown that a fixed charge problem can be reduced to an ordinary linear programming problem.  相似文献   
102.
103.
104.
In this paper we consider a practical scheduling problem commonly arising from batch production in a flexible manufacturing environment. Different part‐types are to be produced in a flexible manufacturing cell organized into a two‐stage production line. The jobs are processed in batches on the first machine, and the completion time of a job is defined as the completion time of the batch containing it. When processing of all jobs in a batch is completed on the first machine, the whole batch of jobs is transferred intact to the second machine. A constant setup time is incurred whenever a batch is formed on any machine. The tradeoff between the setup times and batch processing times gives rise to the batch composition decision. The problem is to find the optimal batch composition and the optimal schedule of the batches so that the makespan is minimized. The problem is shown to be strongly NP‐hard. We identify some special cases by introducing their corresponding solution methods. Heuristic algorithms are also proposed to derive approximate solutions. We conduct computational experiments to study the effectiveness of the proposed heuristics. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 128–144, 2000  相似文献   
105.
The well‐known generalized assignment problem (GAP) involves the identification of a minimum‐cost assignment of tasks to agents when each agent is constrained by a resource in limited supply. The multi‐resource generalized assignment problem (MRGAP) is the generalization of the GAP in which there are a number of different potentially constraining resources associated with each agent. This paper explores heuristic procedures for the MRGAP. We first define a three‐phase heuristic which seeks to construct a feasible solution to MRGAP and then systematically attempts to improve the solution. We then propose a modification of the heuristic for the MRGAP defined previously by Gavish and Pirkul. The third procedure is a hybrid heuristic that combines the first two heuristics, thus capturing their relative strengths. We discuss extensive computational experience with the heuristics. The hybrid procedure is seen to be extremely effective in solving MRGAPs, generating feasible solutions to more than 99% of the test problems and consistently producing near‐optimal solutions. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 468–483, 2001  相似文献   
106.
This paper is concerned with the joint prior distribution of the dependent reliabilities of the components of a binary system. When this distribution is MTP2 (Multivariate Totally Positive of Order 2), it is shown in general that this actually makes the machinery of Natvig and Eide [7] available to arrive at the posterior distribution of the system's reliability, based on data both at the component and system level. As an illustration in a common environmental stress case, the joint prior distribution of the reliabilities is shown to have the MTP2 property. We also show, similarly to Gåsemyr and Natvig [3], for the case of independent components given component reliabilities how this joint prior distribution may be based on the combination of expert opinions. A specific system is finally treated numerically. © 1997 John Wiley & Sons, Inc. Naval Research Logistics 44: 741–755, 1997  相似文献   
107.
108.
This article deals with the statistical analysis of an N-component series system supported by an active standby and one repair facility. Assuming that the life and repair times of the components are independent exponential random variables, the probability distribution of the first passage to the system failure time is shown to be a convolution of two independent exponential distributions. Three observation schemes are considered to obtain the maximum likelihood estimates of the survival function. Information matrices are supplied. Numerical results based on Monte Carlo simulation are presented. It is noted that component level information (failure rate, repair rate) is not necessary for estimating the survival function of the system.  相似文献   
109.
The paper considers the economic lot scheduling problem (ELSP) where production facility is assumed to deteriorate, owing to aging, with an increasing failure rate. The time to shift from an “in‐control” state to an “out‐of‐control” state is assumed to be normally distributed. The system is scheduled to be inspected at the end of each production lot. If the process is found to be in an “out‐of‐control” state, then corrective maintenance is performed to restore it to an “in‐control” state before the start of the next production run. Otherwise, preventive maintenance is carried out to enhance system reliability. The ELSP is formulated under the capacity constraint taking into account the quality related cost due to possible production of non‐conforming items, process inspection, and maintenance costs. In order to find a feasible production schedule, both the common cycle and time‐varying lot sizes approaches are utilized. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 650–661, 2003  相似文献   
110.
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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