Pugazhenthi Rajagopal - Academia.edu (original) (raw)

Uploads

Papers by Pugazhenthi Rajagopal

Research paper thumbnail of Characterization of Multilayer Nano-coating of Piston Ring

Nano-structured coatings can be used to reduce surface roughness, improved hardness and to protec... more Nano-structured coatings can be used to reduce surface roughness, improved hardness and to protect against wear of the components. In this, research article the AISI 440C Stainless Steel is considered for coating Nano-particles and different materials such as Nickel, Titanium dioxide and Aluminium dioxide. The deposition of Nano-particles on piston ring by physical vapor deposition (PVD) process namely Electron Beam physical vapor deposition (EB-PVD). The surface morphology and crystallographic texture of the coatings were analyzed by means of the non-contact surface measurement device and XRD. Mechanical properties of the coated substrate namely hardness, friction and wear resistance are evaluated using micro-Vickers hardness and pin on disc test equipment. A major part of the power produced by the engine lost in overcoming friction between the reciprocating parts. Heat lost to the surroundings is a major factor reducing engine efficiency. Nano-coating can be used to reduce the sur...

Research paper thumbnail of A Heuristic toward Minimizing Waiting Time of Critical Jobs in a Flow Shop

Lecture Notes in Mechanical Engineering, 2012

This paper deals with scheduling in permutation flow shop that is considered with the objective o... more This paper deals with scheduling in permutation flow shop that is considered with the objective of minimizing the waiting time of priority based or critical jobs. Generally, priority based jobs are few in nature in all the flow shops. Hence, it is utmost important that we minimize the waiting time of critical or priority based jobs. All the existing heuristics are developed to minimize parameters like makespan time, flow time, etc. While processing jobs through machines, all machines are considered equally important. In this work, an attempt is made to improve the existing utilization of one or more jobs during processing. The above aim was achieved by reducing the waiting time of the critical or priority based jobs under consideration, and hence achieving zero waiting time for the same. The heuristic is proposed to improve the utilization of such critical jobs. The proposed heuristic was compared with the results of CDS method and validated.

Research paper thumbnail of Application of Genetic Algorithm in Flowshop to

In this article presents an approach based on the application of Genetic Algorithm with the help ... more In this article presents an approach based on the application of Genetic Algorithm with the help of Exponential distribution factor (EPDT), to solve the problem of scheduling a permutation flow shop of n jobs on m machines when all jobs are available for processing. The objective is to minimize the makespan. Many researches planned various algorithms to achieve these objectives through an optimal sequence in a PFS. For identifying an optimal sequence for 'n' jobs in 'm' machines, sequences are to be worked. This planned heuristic approach, approximately solve the problem that consists in scheduling the jobs using Exponential Distribution factor which helps in developing a mathematical model with less computational instance. For the evaluation we use Ruben Ruiz well know standard problem using MAT LAB. The result shows that the planned algorithm is very effective and at the same time is easy to implement. Finally the results of newly planned heuristic are better when compare to the makespan of other heuristics; Palmer, Gupta, CDS and RA.

Research paper thumbnail of Idle time of critical machine AMR.984-985.106

In this research article aims to develop a heuristic for minimizing the total material processing... more In this research article aims to develop a heuristic for minimizing the total material processing time and idle time of the critical machine in a flow shop. This heuristic is proposed through the Exponential Distribution (ED) factor which helps in developing a mathematical model with less computational instance. When the idle time of the critical machine is reduced then it is indirectly affects the total material processing time of the flow shop, which makes the objective of critical machine utilization as vital. And a set of constrain had been established to position the critical machines in the flow shop. For several instance, computational experiments had done using the benchmark problems, among other heuristics ED heuristic yields a better result.

Research paper thumbnail of Application of Genetic Algorithm in Flowshop to Minimize Makespan

In this article presents an approach based on the application of Genetic Algorithm with the help ... more In this article presents an approach based on the application of Genetic Algorithm with the help of Exponential distribution factor (EPDT), to solve the problem of scheduling a permutation flow shop of n jobs on m machines when all jobs are available for processing. The objective is to minimize the makespan. Many researches planned various algorithms to achieve these objectives through an optimal sequence in a PFS. For identifying an optimal sequence for ‘n’ jobs in ‘m’ machines, sequences are to be worked. This planned heuristic approach, approximately solve the problem that consists in scheduling the jobs using Exponential Distribution factor which helps in developing a mathematical model with less computational instance. For the evaluation we use Ruben Ruiz well know standard problem using MAT LAB. The result shows that the planned algorithm is very effective and at the same time is easy to implement. Finally the results of newly planned heuristic are better when compare to the m...

Research paper thumbnail of A Characteristic Study of Exponential Distribution Technique in a Flowshop Using Taillard Benchmark Problems

Proceedings of the Pakistan Academy of Sciences

Research paper thumbnail of Computation of Makespan Using Genetic Algorithm in a Flowshop

This research paper addresses the scheduling problems with the primary objective of minimizing th... more This research paper addresses the scheduling problems with the primary objective of minimizing the makespan in a flow shop with 'N' jobs through 'M' machines. The EPDT (Heuristic approach) and BAT (Meta-Heuristic approach) heuristics are proposed to solve the flow shop scheduling problem in a modern manufacturing environment. These two algorithms are applied along with the Genetic Algorithm (GA) for the further improvement of results in achieving the minimal makespan. The performances of these newer heuristics are evaluated by solving the Taillard benchmark problems in MATLAB environment with various sizes of problems. The proposed GA applied EPDT heuristic and GA applied BAT meta-heuristic for the flow shop problems have been found very effective in solving scheduling problems and finding a better sequence which can reduce the makespan to a great extent. The improvement of EPDT and BAT were obtained by applying the GA yields superior results as well as these results...

Research paper thumbnail of Optimization of Permutation Flow Shop with Multi-Objective Criteria

The flowshop scheduling is concerned with allocation of available resources over a period of time... more The flowshop scheduling is concerned with allocation of available resources over a period of time with an optimum objective. The objective may be one or more like minimizing makespan, idle time and/or total flow time. Many researchers proposed various algorithms to achieve these objectives through an optimal sequence in a Permutation Flow Shop (PFS). For identifying an optimum sequence for 'n' jobs in 'm' machines, n! sequences are to be worked. Due to the limitation in computing capabilities, the new heuristics are required to identify an optimal sequence. This paper deals with the heuristic to get an optimal or near to optimal sequence in the PFS. An algorithm is newly proposed with an exponential function of mathematical and computational aspects to validate the optimal sequence. The makespan and total flow time of the newly proposed heuristic is compared with one of the well-known classical algorithm called Gupta algorithm. The various sizes of PFS problems are s...

Research paper thumbnail of A Heuristic toward Minimizing Waiting Time of Critical Jobs in a Flow Shop

Lecture Notes in Mechanical Engineering, 2012

This paper deals with scheduling in permutation flow shop that is considered with the objective o... more This paper deals with scheduling in permutation flow shop that is considered with the objective of minimizing the waiting time of priority based or critical jobs. Generally, priority based jobs are few in nature in all the flow shops. Hence, it is utmost important that we minimize the waiting time of critical or priority based jobs. All the existing heuristics are developed to minimize parameters like makespan time, flow time, etc. While processing jobs through machines, all machines are considered equally important. In this work, an attempt is made to improve the existing utilization of one or more jobs during processing. The above aim was achieved by reducing the waiting time of the critical or priority based jobs under consideration, and hence achieving zero waiting time for the same. The heuristic is proposed to improve the utilization of such critical jobs. The proposed heuristic was compared with the results of CDS method and validated.

Research paper thumbnail of Minimizing Material Processing Time and Idle Time of a Critical Machine in a Flow Shop

Advanced Materials Research, 2014

In this research article aims to develop a heuristic for minimizing the total material processing... more In this research article aims to develop a heuristic for minimizing the total material processing time and idle time of the critical machine in a flow shop. This heuristic is proposed through the Exponential Distribution (ED) factor which helps in developing a mathematical model with less computational instance. When the idle time of the critical machine is reduced then it is indirectly affects the total material processing time of the flow shop, which makes the objective of critical machine utilization as vital. And a set of constrain had been established to position the critical machines in the flow shop. For several instance, computational experiments had done using the benchmark problems, among other heuristics ED heuristic yields a better result.

Research paper thumbnail of A Survey on Occurrence of Critical Machines in a Manufacturing Environment

Procedia Engineering, 2014

The modern manufacturing environment is generally expressed in terms of flowshop, where all the m... more The modern manufacturing environment is generally expressed in terms of flowshop, where all the machines are considered equally, despite the availability of critical machines. Here, a survey was made on the manufacturing environment to identify the critical machines in it. The critical machine is identified based on processing time, operation, maintenance requirement, automation, life, breakdown, buffer or delay time, rental cost, and so on. Mostly, the scheduling was done to reduce the makespan and total completion time. These objectives are indirectly achieved by effective utilization of critical machine. The need to develop heuristics becomes vital to achieve these objectives. Though many heuristics are successful, it does not concentrate on critical machine but the role of critical machines in a flowshop becomes essential. This Study was done to analyze the maximum possibilities and effective utilization of critical machines in a flowshop. Many researchers focused on the critical machines at its first stage, but very few reports are available on its second stage and further stages. The tedious task with the critical machines can be made easier by new solution methods. This article focused on the possibility of critical machine, position of critical machine and the need of a hybrid flowshop in the modern manufacturing environment for the effective management of the critical machines.

Research paper thumbnail of Characterization of Multilayer Nano-coating of Piston Ring

Nano-structured coatings can be used to reduce surface roughness, improved hardness and to protec... more Nano-structured coatings can be used to reduce surface roughness, improved hardness and to protect against wear of the components. In this, research article the AISI 440C Stainless Steel is considered for coating Nano-particles and different materials such as Nickel, Titanium dioxide and Aluminium dioxide. The deposition of Nano-particles on piston ring by physical vapor deposition (PVD) process namely Electron Beam physical vapor deposition (EB-PVD). The surface morphology and crystallographic texture of the coatings were analyzed by means of the non-contact surface measurement device and XRD. Mechanical properties of the coated substrate namely hardness, friction and wear resistance are evaluated using micro-Vickers hardness and pin on disc test equipment. A major part of the power produced by the engine lost in overcoming friction between the reciprocating parts. Heat lost to the surroundings is a major factor reducing engine efficiency. Nano-coating can be used to reduce the sur...

Research paper thumbnail of A Heuristic toward Minimizing Waiting Time of Critical Jobs in a Flow Shop

Lecture Notes in Mechanical Engineering, 2012

This paper deals with scheduling in permutation flow shop that is considered with the objective o... more This paper deals with scheduling in permutation flow shop that is considered with the objective of minimizing the waiting time of priority based or critical jobs. Generally, priority based jobs are few in nature in all the flow shops. Hence, it is utmost important that we minimize the waiting time of critical or priority based jobs. All the existing heuristics are developed to minimize parameters like makespan time, flow time, etc. While processing jobs through machines, all machines are considered equally important. In this work, an attempt is made to improve the existing utilization of one or more jobs during processing. The above aim was achieved by reducing the waiting time of the critical or priority based jobs under consideration, and hence achieving zero waiting time for the same. The heuristic is proposed to improve the utilization of such critical jobs. The proposed heuristic was compared with the results of CDS method and validated.

Research paper thumbnail of Application of Genetic Algorithm in Flowshop to

In this article presents an approach based on the application of Genetic Algorithm with the help ... more In this article presents an approach based on the application of Genetic Algorithm with the help of Exponential distribution factor (EPDT), to solve the problem of scheduling a permutation flow shop of n jobs on m machines when all jobs are available for processing. The objective is to minimize the makespan. Many researches planned various algorithms to achieve these objectives through an optimal sequence in a PFS. For identifying an optimal sequence for 'n' jobs in 'm' machines, sequences are to be worked. This planned heuristic approach, approximately solve the problem that consists in scheduling the jobs using Exponential Distribution factor which helps in developing a mathematical model with less computational instance. For the evaluation we use Ruben Ruiz well know standard problem using MAT LAB. The result shows that the planned algorithm is very effective and at the same time is easy to implement. Finally the results of newly planned heuristic are better when compare to the makespan of other heuristics; Palmer, Gupta, CDS and RA.

Research paper thumbnail of Idle time of critical machine AMR.984-985.106

In this research article aims to develop a heuristic for minimizing the total material processing... more In this research article aims to develop a heuristic for minimizing the total material processing time and idle time of the critical machine in a flow shop. This heuristic is proposed through the Exponential Distribution (ED) factor which helps in developing a mathematical model with less computational instance. When the idle time of the critical machine is reduced then it is indirectly affects the total material processing time of the flow shop, which makes the objective of critical machine utilization as vital. And a set of constrain had been established to position the critical machines in the flow shop. For several instance, computational experiments had done using the benchmark problems, among other heuristics ED heuristic yields a better result.

Research paper thumbnail of Application of Genetic Algorithm in Flowshop to Minimize Makespan

In this article presents an approach based on the application of Genetic Algorithm with the help ... more In this article presents an approach based on the application of Genetic Algorithm with the help of Exponential distribution factor (EPDT), to solve the problem of scheduling a permutation flow shop of n jobs on m machines when all jobs are available for processing. The objective is to minimize the makespan. Many researches planned various algorithms to achieve these objectives through an optimal sequence in a PFS. For identifying an optimal sequence for ‘n’ jobs in ‘m’ machines, sequences are to be worked. This planned heuristic approach, approximately solve the problem that consists in scheduling the jobs using Exponential Distribution factor which helps in developing a mathematical model with less computational instance. For the evaluation we use Ruben Ruiz well know standard problem using MAT LAB. The result shows that the planned algorithm is very effective and at the same time is easy to implement. Finally the results of newly planned heuristic are better when compare to the m...

Research paper thumbnail of A Characteristic Study of Exponential Distribution Technique in a Flowshop Using Taillard Benchmark Problems

Proceedings of the Pakistan Academy of Sciences

Research paper thumbnail of Computation of Makespan Using Genetic Algorithm in a Flowshop

This research paper addresses the scheduling problems with the primary objective of minimizing th... more This research paper addresses the scheduling problems with the primary objective of minimizing the makespan in a flow shop with 'N' jobs through 'M' machines. The EPDT (Heuristic approach) and BAT (Meta-Heuristic approach) heuristics are proposed to solve the flow shop scheduling problem in a modern manufacturing environment. These two algorithms are applied along with the Genetic Algorithm (GA) for the further improvement of results in achieving the minimal makespan. The performances of these newer heuristics are evaluated by solving the Taillard benchmark problems in MATLAB environment with various sizes of problems. The proposed GA applied EPDT heuristic and GA applied BAT meta-heuristic for the flow shop problems have been found very effective in solving scheduling problems and finding a better sequence which can reduce the makespan to a great extent. The improvement of EPDT and BAT were obtained by applying the GA yields superior results as well as these results...

Research paper thumbnail of Optimization of Permutation Flow Shop with Multi-Objective Criteria

The flowshop scheduling is concerned with allocation of available resources over a period of time... more The flowshop scheduling is concerned with allocation of available resources over a period of time with an optimum objective. The objective may be one or more like minimizing makespan, idle time and/or total flow time. Many researchers proposed various algorithms to achieve these objectives through an optimal sequence in a Permutation Flow Shop (PFS). For identifying an optimum sequence for 'n' jobs in 'm' machines, n! sequences are to be worked. Due to the limitation in computing capabilities, the new heuristics are required to identify an optimal sequence. This paper deals with the heuristic to get an optimal or near to optimal sequence in the PFS. An algorithm is newly proposed with an exponential function of mathematical and computational aspects to validate the optimal sequence. The makespan and total flow time of the newly proposed heuristic is compared with one of the well-known classical algorithm called Gupta algorithm. The various sizes of PFS problems are s...

Research paper thumbnail of A Heuristic toward Minimizing Waiting Time of Critical Jobs in a Flow Shop

Lecture Notes in Mechanical Engineering, 2012

This paper deals with scheduling in permutation flow shop that is considered with the objective o... more This paper deals with scheduling in permutation flow shop that is considered with the objective of minimizing the waiting time of priority based or critical jobs. Generally, priority based jobs are few in nature in all the flow shops. Hence, it is utmost important that we minimize the waiting time of critical or priority based jobs. All the existing heuristics are developed to minimize parameters like makespan time, flow time, etc. While processing jobs through machines, all machines are considered equally important. In this work, an attempt is made to improve the existing utilization of one or more jobs during processing. The above aim was achieved by reducing the waiting time of the critical or priority based jobs under consideration, and hence achieving zero waiting time for the same. The heuristic is proposed to improve the utilization of such critical jobs. The proposed heuristic was compared with the results of CDS method and validated.

Research paper thumbnail of Minimizing Material Processing Time and Idle Time of a Critical Machine in a Flow Shop

Advanced Materials Research, 2014

In this research article aims to develop a heuristic for minimizing the total material processing... more In this research article aims to develop a heuristic for minimizing the total material processing time and idle time of the critical machine in a flow shop. This heuristic is proposed through the Exponential Distribution (ED) factor which helps in developing a mathematical model with less computational instance. When the idle time of the critical machine is reduced then it is indirectly affects the total material processing time of the flow shop, which makes the objective of critical machine utilization as vital. And a set of constrain had been established to position the critical machines in the flow shop. For several instance, computational experiments had done using the benchmark problems, among other heuristics ED heuristic yields a better result.

Research paper thumbnail of A Survey on Occurrence of Critical Machines in a Manufacturing Environment

Procedia Engineering, 2014

The modern manufacturing environment is generally expressed in terms of flowshop, where all the m... more The modern manufacturing environment is generally expressed in terms of flowshop, where all the machines are considered equally, despite the availability of critical machines. Here, a survey was made on the manufacturing environment to identify the critical machines in it. The critical machine is identified based on processing time, operation, maintenance requirement, automation, life, breakdown, buffer or delay time, rental cost, and so on. Mostly, the scheduling was done to reduce the makespan and total completion time. These objectives are indirectly achieved by effective utilization of critical machine. The need to develop heuristics becomes vital to achieve these objectives. Though many heuristics are successful, it does not concentrate on critical machine but the role of critical machines in a flowshop becomes essential. This Study was done to analyze the maximum possibilities and effective utilization of critical machines in a flowshop. Many researchers focused on the critical machines at its first stage, but very few reports are available on its second stage and further stages. The tedious task with the critical machines can be made easier by new solution methods. This article focused on the possibility of critical machine, position of critical machine and the need of a hybrid flowshop in the modern manufacturing environment for the effective management of the critical machines.