In this study, we consider a permutation flow shop scheduling problem on a three-machine with deteriorating jobs (a deteriorating job means that the job’s processing time is an increasing function of its starting time) so as to minimize the makespan. We model job deterioration as a function that is proportional to a linear function of time. For some special cases, we prove that the problem can ...

In mobile ad hoc networks connectivity is always an issue of concern. Due to dynamism in the behavior of mobile nodes, efficiency shall be achieved only with the assumption of good network infrastructure. Presence of critical links results in deterioration which should be detected in advance to retain the prevailing communication setup. This paper discusses a short survey on the specialized alg...

--The Motor Current Signature Analysis (MCSA) is considered the most popular fault detection method now a day because it can easily detect the common machine fault such as turn to turn short ckt, cracked /broken rotor bars, bearing deterioration etc. The present paper discusses the fundamentals of Motor Current Signature Analysis (MCSA) plus condition monitoring of the induction motor using MCS...

INTRODUCTION Clinical deterioration (ICU transfer and cardiac arrest) occurs during approximately 5-10% of hospital admissions. Existing prediction models have a high false positive rate, leading to multiple false alarms and alarm fatigue. We used routine vital signs and laboratory values obtained from the electronic medical record (EMR) along with a machine learning algorithm called a neural n...

Abstract: In this article a single machine time-dependent scheduling problem with total completion time criterion is considered. There are n given jobs, j1, . . . , jn, and the processing time pi of the i-th job is given by pi = 1 + bisi, where si is the starting time of the i-th job, i = 1, . . . n. If all jobs have different and non-zero deterioration rates and bi > bj ⇒ bi ≥ bmin+1 bmin bj+ ...

In this article a single machine time-dependent scheduling problem with total completion time criterion is considered. There are n given jobs j1, . . . , jn and the processing time pi of the i-th job is given by pi = 1 + bisi, where si is the starting time of the i-th job, i = 1, . . . n. If all jobs have different and non-zero deterioration rates and bi > bj ⇒ bi ≥ bmin+1 bmin bj + 1 bmin , wh...

The paper deals with a problem of scheduling deteriorating jobs on a single machine to minimize the total completion time. Deterioration of a job means that its processing time is a function of its execution start time. We present some optimal properties for three problems, which correspond to three different decreasing linear functions, whose increasing counterparts have been studied in the li...