This paper considers some permutation flow shop scheduling problems with a learning effect on no-idle dominant machines. The objective is to minimize maximum completion time. This objective is considered under following dominant machines constraint: idm, ddm, idm–ddm and ddm–idm. We present a polynomial-time solution algorithm for each of the above cases.
BACKGROUND A satisfied glaucoma model is absent now. The aim of this study was to evaluate the effect of a combination of intracameral injection of silicone oil and electrocoagulation of corneal limbal vessels and episcleral veins in the rats to establish glaucoma model. METHODS Operation was performed in each of the left eyes of 90 adult male rats. Right… (More)
This paper presents the design and study of a digital capacitance measuring circuit with theoretical analysis, numerical simulation, and experimental evaluation. The static and dynamic performances of the capacitance measuring circuit are first defined, including signal-to-noise ratio (SNR), standard deviation, accuracy, linearity, sensitivity, and response… (More)
The science and technology of CPR is only just emerging from its infancy. However, substantial improvements are anticipated, including the ability of lay rescuers to identify cardiac arrest promptly, the availability of additional measurements, and expanded intelligence provided by expanded AEDs with which to more effectively prompt the rescuer through the… (More)