Improved Rejection Penalty Algorithm with Multiprocessor Rejection Technique

This paper deals with multiprocessor scheduling with rejection technique where each job is provided with processing time and a given penalty cost. If the job satisfies the acceptance condition, it will schedule in the least loaded identical parallel machine else job is rejected. In this way its penalty cost is calculated. Our objective is to minimize the makespan of the scheduled job and to minimize the sum of the penalties of rejected jobs. We have merged ‘CHOOSE ‘and ‘REJECTION PENALTY’ algorithm to reduce the sum of penalties cost and makespan. Our proposed ‘Improved Reject penalty algorithm’ reduce competitive ratio, which in turn enhances the efficiency of the on-line algorithm. By applying our new on-line technique, we got the lower bound of our algorithm is is 1.286 which is far better from the existing algorithms whose competitive ratio is at 1.819. In our approach we have consider non-preemption scheduling technique .

In silico analysis of permeability properties of polyacrylic acid and polyacrylic_acid-c_butadiene composite

In silico analysis of mechanical properties of polyacrylic acid and polyacrylic acid-c_butadienecomposite

In silico analysis of thermal and dielectric properties of polyacrylic acid and Polyacrylic acid-c butadiene composite

Deactivation of 6M03 enzyme of corona by CC1OC(C[N+](C)(C)C)CC1

Deactivation of 6M03 enzyme of corona by OC(=O)CCC(=O)N(NC1CCCCC1)C2CCCCC2

Deactivation of 6M03 enzyme of corona by CC(C)[C@@H]1CC[C@@H](C)C[C@H]1OC(=O)C(O)O

Deactivation of 6Y84 enzyme of corona by pharmacophore NCCC(=O)NCCc1ncc[nH]1 (SMILES)

In silico Analysis of Gas Permeability Properties of Polyvinyl Alcohol and Polyoxyethelene Composite

Deactivation of 6VWW enzyme of corona by pharmacophore Nc1cc(CCC(=O)O)ccc1O (SMILES)

Improved Rejection Penalty Algorithm with Multiprocessor Rejection Technique

This paper deals with multiprocessor scheduling with rejection technique where each job is provided with processing time and a given penalty cost. If the job satisfies the acceptance condition, it will schedule in the least loaded identical parallel machine else job is rejected. In this way its penalty cost is calculated. Our objective is to minimize the makespan of the scheduled job and to minimize the sum of the penalties of rejected jobs. We have merged ‘CHOOSE ‘and ‘REJECTION PENALTY’algorithm to reduce the sum of penalties cost and makespan. Our proposed ‘Improved Reject penalty algorithm’reduce competitive ratio, which in turn enhances the efficiency of the on-line algorithm. By applying our new on-line technique, we got the lower bound of our algorithm is is 1.286 which is far better from the existing algorithms whose competitive ratio is at 1.819. In our approach we have consider non-preemption scheduling technique.

This paper deals with multiprocessor scheduling with rejection technique where each job is provided with processing time and a given penalty cost. If the job satisfies the acceptance condition, it will schedule in the least loaded identical parallel machine else job is rejected. In this way its penalty cost is calculated. Our objective is to minimize the makespan of the scheduled job and to minimize the sum of the penalties of rejected jobs. We have merged ‘CHOOSE ‘and ‘REJECTION PENALTY’algorithm to reduce the sum of penalties cost and makespan. Our proposed ‘Improved Reject penalty algorithm’reduce competitive ratio, which in turn enhances the efficiency of the on-line algorithm. By applying our new on-line technique, we got the lower bound of our algorithm is is 1.286 which is far better from the existing algorithms whose competitive ratio is at 1.819. In our approach we have consider non-preemption scheduling technique.