A simpler competitive analysis for scheduling equal-length jobs on one machine with restarts

2008 ◽  
Vol 107 (6) ◽  
pp. 240-245 ◽  
Author(s):  
Michael H. Goldwasser ◽  
Arundhati Bagchi Misra
Keyword(s):  
Competitive Analysis ◽  
Equal Length ◽  
One Machine

Autoradiography of Incorporated Leucine-H3 in the Enamel Matrix and Enamel Organ of the Upper Incisor of the Rat

1964 ◽  
Vol 04 (02) ◽  
pp. 186-192
Author(s):  
Leonel Costacurta
Keyword(s):  
Amino Acid ◽  
Blood Vessels ◽  
Tooth Germ ◽  
Longitudinal Section ◽  
Equal Length ◽  
Enamel Organ ◽  
Enamel Matrix ◽  
Distal Extremity ◽  
Old Rats ◽  
Thin Band

SummaryDental germs of the upper incisors of six-days old rats were studied for the uptake of leucine-H3 by different layers of the enamel organ in correlation to the various stages of the development of enamel.The longitudinal section of the tooth germ was divided into 15 zones of about equal length in order to facilitate the description and interpretation of results. Autoradiographic images of the histologic preparations from rats sacrificed 30 minutes, 1 hour, 1 day and 3 days after the injection were made. The strongest reactions were observed in dental germs of rats sacrificed 1 hour, and particularly one day, after the leucine-H3 injection.The uptake of this compound by the enamel matrix increases progressively up to the young enamel and then decreases to the distal extremity; the greatest quantity of this labeled amino-acid was observed in the primary and young enamel. The reactions were present in the transitional enamel only along a thin band close to the dentine-enamel junction.In the enamel organ leucine-H3 incorporation was greatest in the three layers, the zones corresponding to primary and young enamel. In zones corresponding to transitional enamel, the inner epithelium showed a small quantity, and the stellate reticulum a blackening only in its superficial part, were the blood vessels reach the enamel organ.

scholarly journals Linearization threshold condition and stability analysis of a stochastic dynamic model of one-machine infinite-bus (OMIB) power systems

2021 ◽  
Vol 6 (1) ◽  
Author(s):  
Lijuan Li ◽  
Yongdong Chen ◽  
Bin Zhou ◽  
Hongliang Liu ◽  
Yongfei Liu
Keyword(s):  
Power Systems ◽  
Power System ◽  
Dynamic Model ◽  
Threshold Model ◽  
Security Evaluation ◽  
Stochastic Dynamic ◽  
Threshold Condition ◽  
Stochastic Excitation ◽  
Predictor Corrector ◽  
One Machine

AbstractWith the increase in the proportion of multiple renewable energy sources, power electronics equipment and new loads, power systems are gradually evolving towards the integration of multi-energy, multi-network and multi-subject affected by more stochastic excitation with greater intensity. There is a problem of establishing an effective stochastic dynamic model and algorithm under different stochastic excitation intensities. A Milstein-Euler predictor-corrector method for a nonlinear and linearized stochastic dynamic model of a power system is constructed to numerically discretize the models. The optimal threshold model of stochastic excitation intensity for linearizing the nonlinear stochastic dynamic model is proposed to obtain the corresponding linearization threshold condition. The simulation results of one-machine infinite-bus (OMIB) systems show the correctness and rationality of the predictor-corrector method and the linearization threshold condition for the power system stochastic dynamic model. This study provides a reference for stochastic modelling and efficient simulation of power systems with multiple stochastic excitations and has important application value for stability judgment and security evaluation.

scholarly journals A two-agent one-machine multitasking scheduling problem solving by exact and metaheuristics

2021 ◽  
Author(s):  
Chin-Chia Wu ◽  
Ameni Azzouz ◽  
Jia-Yang Chen ◽  
Jianyou Xu ◽  
Wei-Lun Shen ◽  
...  
Keyword(s):  
Simulated Annealing ◽  
Completion Time ◽  
Simulated Annealing Algorithm ◽  
Optimal Schedule ◽  
Computational Studies ◽  
Scheduling Problem ◽  
Optimal Solutions ◽  
Large Size ◽  
Annealing Algorithm ◽  
One Machine

AbstractThis paper studies a single-machine multitasking scheduling problem together with two-agent consideration. The objective is to look for an optimal schedule to minimize the total tardiness of one agent subject to the total completion time of another agent has an upper bound. For this problem, a branch-and-bound method equipped with several dominant properties and a lower bound is exploited to search optimal solutions for small size jobs. Three metaheuristics, cloud simulated annealing algorithm, genetic algorithm, and simulated annealing algorithm, each with three improvement ways, are proposed to find the near-optimal solutions for large size jobs. The computational studies, experiments, are provided to evaluate the capabilities for the proposed algorithms. Finally, statistical analysis methods are applied to compare the performances of these algorithms.

Competitive Analysis for Points of Interest

2020 ◽  
Author(s):  
Shuangli Li ◽  
Jingbo Zhou ◽  
Tong Xu ◽  
Hao Liu ◽  
Xinjiang Lu ◽  
...  
Keyword(s):  
Competitive Analysis ◽  
Points Of Interest
Sign in / Sign up

Export Citation Format

Share Document