This paper introduces a novel reasoning methodology, in combination with appropriate models and measurements (data) to perform accurately and expeditiously expert troubleshooting for complex military and industrial processes. This automated troubleshooting tool is designed to support the maintainer/ repairman by identifying and locating faulty system components. The enabling technologies build ...

The multiple traveling repairman problem with profits consists of repairmen serving a subset all customers to maximize the revenues collected through visited customers. To address this problem, an effective hybrid search algorithm based on memetic framework is proposed. In proposed method, three features are integrated: dedicated arc-based crossover generate high-quality offspring solutions, fa...

Apart from important but particular cases, such as state-dependent exponential distributions, for example, [1, 4] or an arbitrary repair time distribution [12], the reliability analysis of multiple cold standby systems is far from complete. We present a general reliability analysis of a basic multiple cold standby system attended by a single repairman, henceforth called a K-system. The K-system...

In this paper we consider a closed queueing system in which N customers circulate between two stations. One station contains customers which are functioning, the other is a single server queue containing failed customers. Each functioning customer can fail, independently of the other customers, and when that happens it arrives at the queue. The repairman or server can repair the broken customer...

We study a scheduling problem in which jobs have locations. For example, consider a repairman that is supposed to visit customers at their homes. Each customer is given a time window during which the repairman is allowed to arrive. The goal is to find a schedule that visits as many homes as possible. We refer to this problem as the Prize-Collecting Traveling Salesman Problem with time windows (...

We study a scheduling problem in which jobs have locations. For example, consider a repairman that is supposed to visit customers at their homes. Each customer is given a time window during which the repairman is allowed to arrive. The goal is to find a schedule that visits as many homes as possible. We refer to this problem as the prize-collecting traveling salesman problem with time windows (...

0

A 2D finite-differences time-domain full-wave code is used to simulate the measurements of plasma filaments with fixed frequency O-mode reflectometry. The plasma is modeled by a linear slab plasma plus a Gaussian perturbation propagating in a direction that can vary from poloidal to radial. The plasma background density gradient is chosen in agreement with the steep edge transport barrier of H-...