Single-machine scheduling with deteriorating jobs and aging effects under an optional maintenance activity consideration

This article studies a single-machine scheduling with deteriorating jobs and aging effects under an optional maintenance activity. We assume that after maintenance activity, the machine will revert to its initial condition and the aging effects will start anew. Moreover, due to the restriction of budget of maintenance, the limitation of the maintenance frequency on the machine is assumed to be known in advance. The optional maintenance activity of this study means that the starting time of the maintenance activity is unknown in advance. It can be scheduled immediately after the processing of any job that has been completed. Therefore, the planner must to make decision on whether or when to schedule the maintenance activity during the scheduling horizon to optimal the performance measures. The objective is to minimize the makespan. We first show that the addressed problem is NP-hard in the strong sense. Then a fully polynomial-time approximation scheme (FPTAS) for the proposed problem is presented.     

A New Approach to the Group Ranking Problem: Finding Consensus Ordered Segments from Users’ Preference Data

The group ranking problem involves constructing coherent aggregated results from users’ preference data. The goal of most group ranking problems is to generate an ordered list of all items that represents the user consensus. There are, however, two weaknesses to this approach. First, a complete list of ranked items is always output even when there is no consensus or only a slight consensus. Second, due to similarity of performance, in many practical situations, it is very difficult to differentiate whether one item is really better than another within a set. These weaknesses have motivated us to apply the clustering concept to the group ranking problem, to output an ordered list of segments containing a set of similarly preferred items, called consensus ordered segments. The advantages of our approach are that (i) the list of segments is based on the users’ consensuses, (ii) the items with similar preferences are grouped together in the same segment, and (iii) the relationships between items can be easily seen. An algorithm is developed to construct the consensus of the ordered segments from the users’ total ranking data. Finally, the experimental results indicate that the proposed method is computationally efficient, and can effectively identify consensus ordered segments.     

Testing the Unconfoundedness Assumption via Inverse Probability Weighted Estimators of (L)ATT

We propose inverse probability weighted estimators for the local average treatment effect (LATE) and the local average treatment effect for the treated (LATT) under instrumental variable assumptions with covariates. We show that these estimators are asymptotically normal and efficient. When the (binary) instrument satisfies one-sided noncompliance, we propose a Durbin–Wu–Hausman-type test of whether treatment assignment is unconfounded conditional on some observables. The test is based on the fact that under one-sided noncompliance LATT coincides with the average treatment effect for the treated (ATT). We conduct Monte Carlo simulations to demonstrate, among other things, that part of the theoretical efficiency gain afforded by unconfoundedness in estimating ATT survives pretesting. We illustrate the implementation of the test on data from training programs administered under the Job Training Partnership Act in the United States. This article has online supplementary material.     

A two-phase method for controlling Erlang-failure processes with high reliability

Monitoring a failure process and measuring its performance are important issues for complex nonrepairable and repairable systems. For a highly reliable process, traditional methods for reliability monitoring and performance measuring become inapplicable. This paper proposes a new two-phase controlling method for monitoring and measuring an Erlang-failure process (EFP). In the first-phase controlling method, a control chart is used to monitor the EFP condition. When special causes of variation have been removed from the EFP and all of the failure times plotted on the control chart lie within the control limits, the EFP is considered to be in control. However, the in-control EFP still likely carries out bad or out-of-lifetime-specification conditions. Thus, its lifetime-specification limit is taken into consideration as the second-phase controlling method for measuring the in-control EFP performance. We propose a lifetime-capability index. Its value has a one-to-one corresponding relationship with the lifetime-conforming rate, which indicates the lifetime performance of this EFP. Without collecting additional data efforts, in-control data gathered from the control chart in the first phase is employed to estimate the lifetime-capability index. To realize main lifetime-capability of the EFP impacting on downstream customers, the lower confidence bound of the estimate of the lifetime-capability index, capturing its minimum lifetime capability, is considered. The advantage of this two-phase method for controlling the failure processes can motivate the manufacturer to develop a reliability-monitoring technique, establish an adequate reliability improvement program and implement an appropriate analysis to ensure its lifetime performance meeting the customers requirement.     

Young Infants' Behavioral Reactivity to Mild Perturbation: Developmental Continuity,Stability, and Organization

This study investigated the developmental continuity, stability, and organization of infants' behavioral response to mild stress from 1 to 3 months of age. Changes in infant stress reactivity were expected to coincide with a suspected neurobiological shift around the 2nd month. A total of 53 infants and their mothers participated in this study. At 1 and 3 months, infants' stress reactivity to mild perturbation was assessed by withdrawing a pacifier during nonnutritive sucking. Infant baseline heart rate activity and maternal reports of infant temperament were also obtained. Focusing on facial and vocal negativity, behavioral measures of infant reactivity to pacifier withdrawal were coded from videos. Results showed that developmental continuity and individual instability characterized changes in infant stress reactivity over the 2nd‐month transition. Developmental reorganization was also evidenced by changes in the direction and magnitude of infant stress reactivity in relation to baseline heart period and maternal temperament ratings, respectively. These findings provide direct supporting evidence for the contention that changes in infant stress reactivity to mild perturbation may be a function of developmental shifts in underlying neurobiological mechanisms in early infancy.     

Evidence for significant polydrug use among ecstasy-using college students

Ecstasy (MDMA) has been added to the spectrum of illicit drugs used by college students. In this study, the authors estimated the prevalence of ecstasy use within a large college student sample and investigated the polydrug-use history of those ecstasy users. They administered an anonymous questionnaire to college students (N = 1,206) in classrooms at a large university in the mid-Atlantic United States. The overall student response rate was 91%. Nine percent of the sample reported lifetime ecstasy use. Because 98% of ecstasy users had used marijuana, the authors compared polydrug use between ecstasy users and individuals who had used marijuana but not ecstasy. Ecstasy users, as compared with these marijuana users, were significantly more likely to have used inhalants (38% vs. 10%), LSD (38% vs. 5%), cocaine (46% vs 2%), and heroin (17% vs 1%) in the past year. Significant polydrug use among college student ecstasy users has important implications for their substance abuse treatment.     

A single-machine learning effect scheduling problem with release times

In this paper, we investigate a single-machine problem with the learning effect and release times where the objective is to minimize the makespan. A branch-and-bound algorithm incorporating with several dominance properties and lower bounds is developed to derive the optimal solution. A heuristic algorithm is proposed to obtain a near-optimal solution. The computational experiments show that the branch-and-bound algorithm can solve instances up to 36 jobs, and the average error percentage of the proposed heuristic is less than 0.11%.     

A Unifying Augmentation Algorithm for Two-Edge Connectivity and Biconnectivity

Given an undirected graph G and two vertex subsets H1 and H2, the bi-level augmentation problem is that of adding to G the smallest number of edges such that the resulting graph contains two internally vertex-disjoint paths between every pair of vertices in H1 and two edge-disjoint paths between every pair of vertices in H2. We present an algorithm to solve this problem in linear time. By properly setting H1 and H2, this augmentation algorithm subsumes existing optimal algorithms for several graph augmentation problems.