International Conference on Semigroups, Algebras and Applications (ICSA 2015)

Mathematicians who make significant contributions towards development of mathematical science are not getting the recognition they deserve, according to Cusat Vice Chancellor Dr. J. Letha. She was delivering the inaugural address at the International Conference on Semigroups, Algebras and Applications (ICSA 2015) organized by Dept. of Mathematics, Cochin university of Science and Technology on Thursday. Mathematics plays an important role in the development of basic science. The academic community should not delay in accepting and appreciating this, Dr. Letha added. Dr. Godfrey Louis, Dean, Faculty of Science presided over the inaugural function. Prof. P. G. Romeo, Head, Dept. of Mathematics, Prof. John C. Meakin, University of Nebraska-Lincoln, USA, Prof. A. N. Balchand, Syndicate Member, Prof. K. A. Zakkariya, Syndicate Member, Prof. A. R. Rajan, Emeritus Professor, University of Kerala and Prof. A. Vijayakumar, Dept. of Mathematics, Cusat addressed the gathering. Around 50 research papers will be presented at the Conference.Prof. K. S. S. Nambooripad, the internationally famous mathematician with enormous contributions in the field of semigroup theory, who has attained eighty years of age will be felicitated on 18th at 5.00 pm during a function presided over by Dr. K. Poulose Jacob, Pro-Vice Chancellor. Dr. Suresh Das, Executive President, KSCSTE, Dr. A. M. Mathai, Director, CMSS and President, Indian Mathematical Society, Dr. P. G. Romeo, Head, Dept. of Mathematics and Dr. B. Lakshmi, Dept. of Mathematics will speak on the occasion.

Multi-objective assembly job shop scheduling using genetic algorithm and tabu search

Assembly job shop scheduling problem (AJSP) is one of the most complicated combinatorial optimization problem that involves simultaneously scheduling the processing and assembly operations of complex structured products. The problem becomes even more complicated if a combination of two or more optimization criteria is considered. This thesis addresses an assembly job shop scheduling problem with multiple objectives. The objectives considered are to simultaneously minimizing makespan and total tardiness. In this thesis, two approaches viz., weighted approach and Pareto approach are used for solving the problem. However, it is quite difficult to achieve an optimal solution to this problem with traditional optimization approaches owing to the high computational complexity. Two metaheuristic techniques namely, genetic algorithm and tabu search are investigated in this thesis for solving the multiobjective assembly job shop scheduling problems. Three algorithms based on the two metaheuristic techniques for weighted approach and Pareto approach are proposed for the multi-objective assembly job shop scheduling problem (MOAJSP). A new pairing mechanism is developed for crossover operation in genetic algorithm which leads to improved solutions and faster convergence. The performances of the proposed algorithms are evaluated through a set of test problems and the results are reported. The results reveal that the proposed algorithms based on weighted approach are feasible and effective for solving MOAJSP instances according to the weight assigned to each objective criterion and the proposed algorithms based on Pareto approach are capable of producing a number of good Pareto optimal scheduling plans for MOAJSP instances.