Search

In this paper, the single-machine scheduling problems under the common and slack due date assignments are studied, where the actual processing time of the job needs to consider some factors, such as convex resource allocation, maintenance activity, and learning effects. The goal of this study is to find the optimal sequence, maintenance activity location, resource allocation and common due date (flow allowance). The objective function is (1) to minimize the sum of scheduling cost (including the weighted sum of earliness, tardiness and common due date (flow allowance), where the weights are position-dependent weights) and resource consumption cost, and (2) to minimize the scheduling cost under the resource consumption cost which is bounded. We prove that these problems can be solved in polynomial time. [ABSTRACT FROM AUTHOR]

This paper studies a single-machine problem with resource allocation ( R A ) and deteriorating effect ( D E ). Under group technology ( G T ) and limited resource availability, our goal is to determine the schedules of groups and jobs within each group such that the total completion time is minimized. For three special cases, polynomial time algorithms are given. For a general case, a heuristic, a tabu search algorithm, and an exact (i.e., branch-and-bound) algorithm are proposed to solve this problem. [ABSTRACT FROM AUTHOR]

Abstract: In this paper we investigate a single machine scheduling problem with decreasing time-dependent processing times and group technology assumption. By the decreasing time-dependent processing times and group technology assumption, we mean that the group setup times and job processing times are both decreasing linear functions of their starting times. We want to minimize the makespan subject to release dates. We show that the problem can be solved in polynomial time. [Copyright &y& Elsevier]

Abstract: In this paper we consider several single-machine scheduling problems with general learning effects. By general learning effects, we mean that the processing time of a job depends not only on its scheduled position, but also on the total normal processing time of the jobs already processed. We show that the scheduling problems of minimization of the makespan, the total completion time and the sum of the θth () power of job completion times can be solved in polynomial time under the proposed models. We also prove that some special cases of the total weighted completion time minimization problem and the maximum lateness minimization problem can be solved in polynomial time. [Copyright &y& Elsevier]

This paper considers a scheduling problem with general job-dependent learning curves and controllable processing times on a single machine. The objective is to determine the optimal compressions of the processing times and the optimal sequence of jobs so as to minimize some total cost functions, which consist of regular and non-regular functions and the processing time compressions. It shows that the problem can be solved by an assignment problem and thus can be solved in polynomial time. Some extensions of the problem are also given. [ABSTRACT FROM AUTHOR]

The focus of this paper is to analyze unrelated parallel-machine resource allocation scheduling problem with learning effect and deteriorating jobs. The goal is to find the optimal sequence of jobs and the optimal resource allocation separately for minimizing the cost function including the total load, the total completion time, the total absolute deviation of completion time and the total resource cost. We show that the problem is polynomial time solvable if the number of machines is a given constant. [ABSTRACT FROM AUTHOR]

A variety of 3-iodoindole and 3-iodobenzo[ b ]furan derivatives were conveniently prepared from the corresponding 2-alkynylanilines and 2-alkynylphenols through Ph 3 P-catalyzed iodocyclization in the presence of N -iodosuccinimide (NIS). This protocol provides a rapid access to 3-iodoindoles and 3-iodobenzo[ b ]furans in good to excellent yields under mild conditions. [ABSTRACT FROM AUTHOR]

This article deals with common due-window assignment and single-machine scheduling with proportional-linear shortening processing times. Objective cost is a type of minmax, that is, the maximal cost among all processed jobs is minimized. Our goal is to determine an optimal schedule, the optimal starting time, and size of due-window that minimize the worst cost, which consist of four parts: earliness, tardiness, starting time and length of the due-window. Optimal properties of the problem are given, and then an optimal polynomial algorithm is proposed to solve the problem.

We discussed the role of IL-1β, IL-6, IL-8 and IFN-γ in the pathogenesis of central nervous system neuropsychiatric systemic lupus erythematous (CNS-NPSLE). Serum and cerebrospinal fluid samples were collected from CNS-NPSLE patients, non-CNS SLE patients, patients with intracranial infection and normal subjects. Levels of IL-1β, IL-6, IL-8 and IFN-γ in serum and cerebrospinal fluid were detected by ELISA, and the results were compared across the groups. All subjects received cerebral MRI. The risk threshold for each cytokine in CNS-NPSLE group was set as 2.5%. The positive rates of cytokines for different lesions in cerebral MRI findings in CNS-NPSLE group were compared. The correlations between cytokine levels and cerebral MRI findings were analyzed. All groups did not show significant differences in age and gender (F=1.34, P>0.05; x (2)=2.05, P>0.05); The IL-1β, IL-6, IL-8 and IFN-γ levels of serum and cerebrospinal fluid in CNS-NPSLE group were obviously higher than those of the normal control (serum Z14 =6.22, 6.04, 6.22, 5.70; cerebrospinal fluid Z14 =6.38, 7.10, 6.97, 6.34, P<0.0083); IL-1β, IL-6 and IL-8 levels of cerebrospinal fluid of CNS-NPSLE group were higher than those of the non-CNS SLE group (Z12 =2.73, Z12 =3.18, Z12 =3.86; P<0.0083); IL-1β, IL-6, IL-8 and IFN-γ levels of cerebrospinal fluid of CNS-NPSLE group were higher than those of the serum (Z=3.19, 6.30, 5.44, 3.19, P<0.05); IL-6>20.0679 pg/ml and IL-8>87.1811 pg/ml in the cerebrospinal fluid predicted a higher risk of CNS-NPSLE (x (2)=11.98, P<0.05; x (2)=4.65, P<0.05); The positive rates of IL-1β and IL-6 in the cerebrospinal fluid of CNS-NPSLE patients with demyelinating diseases were considerably higher than those of CNS-NPSLE patients with normal MRI findings (x (2)=10.89, P<0.005; x (2)=18.47, P<0.005). The positive rates of IL-6 and IFN-γ in the cerebrospinal fluid of CNS-NPSLE patients presenting with multiple ischemic foci were significantly higher than those with normal MRI findings (x (2)=5.56, P<0.005; x (2)=14.59, P<0.005). Some cytokines are involved in the pathogenesis of CNS-NPSLE and correlated with cerebral MRI findings in CNS-NPSLE.

Objective: To study a population of rheumatoid arthritis patients and determine the extent of periodontal disease in these patients, in order to investigate the relationship between periodontal disease and rheumatoid arthritis., Methods: The experimental group was composed of 70 patients with rheumatoid arthritis and the control group consisted of 70 age- and gender-matched individuals without rheumatoid arthritis. The relationship between periodontal status in rheumatoid arthritis and control groups as well as the relationship between periodontal status and rheumatological findings in patients were analyzed., Results: The percentage of periodontal disease was statistically significant between experimental and control group (P < 0.01). The difference of average number of missing teeth and bleeding on probing in the experimental group and control group were not statistically significant (P >0.05). There were more number of periodontal disease index 5 or 6 in experimental group than in control group ( P < 0.05). Rheumatoid arthritis patients with moderate to severe bone loss had deeper degree of morning stiffness, erythrocyte sedimentation rate levels and serum C-reactive protein levels than patients with no or mild bone loss., Conclusion: Individuals with rheumatoid arthritis are more likely to experience periodontal disease compares to healthy subjects. They are also very likely to suffer from moderate to severe periodontitis.