Optimal clustering of frequency-constrained maintenance jobs with shared set-ups
نویسندگان
چکیده
منابع مشابه
Frequency filters for space constrained cryogenic set - ups
Noise filtering is an essential part for measurement of quantum phenomena at extremely low temperatures. Here, we present the design of a filter which can be installed in space constrained cryogenic environment containing a large number of signal carrying lines. Our filters have a -3db point of 65kHz and its performance at GHz frequencies are comparable to the best available RF filters. PACS nu...
متن کاملRepeated Record Ordering for Constrained Size Clustering
One of the main techniques used in data mining is data clustering, which has many applications in computer science, biology, and social sciences. Constrained clustering is a type of clustering in which side information provided by the user is incorporated into current clustering algorithms. One of the well researched constrained clustering algorithms is called microaggregation. In a microaggreg...
متن کاملScheduling Maintenance Jobs in Networks
We investigate the problem of scheduling the maintenance of edges in a network, motivated by the goal of minimizing outages in transportation or telecommunication networks. We focus on maintaining connectivity between two nodes over time; for the special case of path networks, this is related to the problem of minimizing the busy time of machines. We show that the problem can be solved in polyn...
متن کاملOptimal spares and preventive maintenance frequencies for constrained industrial systems
The research investigates the influence of an effective maintenance system on the efficient performance of any industrial system. The core concept of the research explains that the simultaneous focus on the spares inventory subsystem as well as on the preventive maintenance subsystem must be considered when developing a quality maintenance programme. Considering and developing such aspects sepa...
متن کاملPrecedence-Constrained Scheduling of Malleable Jobs with Preemption
Scheduling jobs with precedence constraints on a set of identical machines to minimize the total processing time (makespan) is a fundamental problem in combinatorial optimization. In practical settings such as cloud computing, jobs are often malleable, i.e., can be processed on multiple machines simultaneously. The instantaneous processing rate of a job is a non-decreasing function of the numbe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Operational Research
سال: 1997
ISSN: 0377-2217
DOI: 10.1016/s0377-2217(96)00320-7