This document provides a critical review of various optimization methods that have been used to solve exam timetabling and scheduling problems. It discusses several approaches that have been applied, including sequential construction algorithms, iterative improvement methods like genetic algorithms and simulated annealing, and various heuristics based on graph coloring techniques. The review examines how different ordering and assignment strategies can impact the feasibility and quality of generated timetables. It provides an overview of the general framework for exam timetabling as a two-phase process involving initial construction and subsequent improvement.
Attitude of Students towards Integral Calculus through the Screening Examinat...ijtsrd
One thing that may affect the students’ perception of mathematics is the attitude of the students towards the subject. This study was conducted to assess the attitude of students towards integral calculus. The subjects of this study were the 94 second year students of the College of Engineering taking up BSAE, BSCE, BSEE and BSME who were enrolled in Integral Calculus. This group of students were a combination of the first timer and repeaters in Integral Calculus. This were the students who were not screened out from the screening examination conducted by the researcher. It employed the descriptive correlational method using the frequency counts, weighted means and analysis of variance.The instrument used in this study was the attitude scale. This instrument was administered to the students before the first screening examination and after the last screening examination.Results revealed that students have favourable attitudes towards integral calculus before and after the screening examination strategy. However, results also revealed that the profile of the students in terms of gender, number of times the student took the subject and the students’ performance on the prerequisite subject has nothing to do or did not influence the attitudes of the students towards the subject. Merewina Llanie A. Tapong | Benjamin D. Varela "Attitude of Students towards Integral Calculus through the Screening Examination Strategy" Published in International Journal of Trend in Scientific Research and Development (ijtsrd), ISSN: 2456-6470, Volume-5 | Issue-1 , December 2020, URL: https://www.ijtsrd.com/papers/ijtsrd37935.pdf Paper URL : https://www.ijtsrd.com/engineering/agricultural-engineering/37935/attitude-of-students-towards-integral-calculus-through-the-screening-examination-strategy/merewina-llanie-a-tapong
Attitude of Students towards Integral Calculus through the Screening Examinat...ijtsrd
One thing that may affect the students’ perception of mathematics is the attitude of the students towards the subject. This study was conducted to assess the attitude of students towards integral calculus. The subjects of this study were the 94 second year students of the College of Engineering taking up BSAE, BSCE, BSEE and BSME who were enrolled in Integral Calculus. This group of students were a combination of the first timer and repeaters in Integral Calculus. This were the students who were not screened out from the screening examination conducted by the researcher. It employed the descriptive correlational method using the frequency counts, weighted means and analysis of variance.The instrument used in this study was the attitude scale. This instrument was administered to the students before the first screening examination and after the last screening examination.Results revealed that students have favourable attitudes towards integral calculus before and after the screening examination strategy. However, results also revealed that the profile of the students in terms of gender, number of times the student took the subject and the students’ performance on the prerequisite subject has nothing to do or did not influence the attitudes of the students towards the subject. Merewina Llanie A. Tapong | Benjamin D. Varela "Attitude of Students towards Integral Calculus through the Screening Examination Strategy" Published in International Journal of Trend in Scientific Research and Development (ijtsrd), ISSN: 2456-6470, Volume-5 | Issue-1 , December 2020, URL: https://www.ijtsrd.com/papers/ijtsrd37935.pdf Paper URL : https://www.ijtsrd.com/engineering/agricultural-engineering/37935/attitude-of-students-towards-integral-calculus-through-the-screening-examination-strategy/merewina-llanie-a-tapong
Students’ Conceptual Understanding and Misconceptions on Force and Motion through different instruments combined with Certainty Response Index (CRI)
Force & motion misconceptions among AL students among different schools
Research Inventy : International Journal of Engineering and Scienceinventy
Research Inventy : International Journal of Engineering and Science is published by the group of young academic and industrial researchers with 12 Issues per year. It is an online as well as print version open access journal that provides rapid publication (monthly) of articles in all areas of the subject such as: civil, mechanical, chemical, electronic and computer engineering as well as production and information technology. The Journal welcomes the submission of manuscripts that meet the general criteria of significance and scientific excellence. Papers will be published by rapid process within 20 days after acceptance and peer review process takes only 7 days. All articles published in Research Inventy will be peer-reviewed.
Human Patient Simulator Network 2012 Presentation: Large Class Simulation in a day
How to successfully design a schedule and perform 2 simulations and debriefings for 120+ senior nursing students with 4 faculty and 4 simulators in a nine hour day.
A comparison-between-paper-and-pencil-and-paperless-assessmentRose Shayeghi
مقاله A Comparison between Paper-and-Pencil and Paperless Assessment نوشته آقای شهرام کیانوش مدیر و خانم المیرا سلطانی کارشناس آموزش دپارتمان آزمون و سنجش آکادمی سفیر گفتمان در اولین کنفرانس ملی New Trends in English Language Teaching and Applied Linguistics دانشگاه گلستان در تاریخ 26 بهمن ماه 96 به صورت شفاهی ارائه شد.
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
In preparing the schedule of course not an easy job. There are several aspects that influence in the preparation of schedules of courses that professors, students, courses, lecture rooms, and a time slot. Each of these aspects has a state that can be a problem and a conflict in scheduling courses. For example, the problems facing aspect lecturers are lecturers conflict is a lecturer teaches courses scheduled at two different locations at a time. Or from the aspect of students, the problem is the number of classes per generation. In addition to these problems, there are many more potential problems that can arise from each of these aspects. A decision support system needed a model settlement of the problems encountered. To be able to determine the right model can be done by identifying problems and analyze environmental problems and identify variables that are involved in decision making. In scheduling the course, the problem is a complex problem that is solved by routine or repetitive. The complexity of the problem can be seen from every aspect in the preparation schedule of courses that are interconnected with other aspects. Then, the scheduling is done every semester by environmental circumstances different issues each semester. So that the right model for this system is a heuristic programming model.
Parallel Genetic Algorithms for University Scheduling ProblemIJECEIAES
University scheduling timetabling problem, falls into NP hard problems. Re-searchers have tried with many techniques to find the most suitable and fastest way for solving the problem. With the emergence of multi-core systems, the parallel implementation was considered for finding the solution. Our approaches attempt to combine several techniques in two algorithms: coarse grained algorithm and multi thread tournament algorithm. The results obtained from two algorithms are compared, using an algorithm evaluation function. Considering execution time, the coarse grained algorithm performed twice better than the multi thread algorithm.
Preparation of courses at every university is done by hand. This method has limitations that often cause collisions schedule. In lectures and lab scheduling frequent collision against the faculty member teaching schedule, collisions on the class schedule and student, college collision course with lab time, the allocation of the use of the rooms were not optimal. Heuristic method of genetic algorithm based on the mechanism of natural selection; it is a process of biological evolution. Genetic algorithms are used to obtain optimal schedule that consists of the initialization process of the population, fitness evaluation, selection, crossover, and mutation. Data used include the teaching of data, the data subjects, the room data and time data retrieved from the database of the Faculty of Computer Science, Universitas Pembangunan Panca Budi. The data in advance through the stages of the process of genetic algorithms to get optimal results The results of this study in the form of a schedule of courses has been optimized so that no error occurred and gaps.
Students’ Conceptual Understanding and Misconceptions on Force and Motion through different instruments combined with Certainty Response Index (CRI)
Force & motion misconceptions among AL students among different schools
Research Inventy : International Journal of Engineering and Scienceinventy
Research Inventy : International Journal of Engineering and Science is published by the group of young academic and industrial researchers with 12 Issues per year. It is an online as well as print version open access journal that provides rapid publication (monthly) of articles in all areas of the subject such as: civil, mechanical, chemical, electronic and computer engineering as well as production and information technology. The Journal welcomes the submission of manuscripts that meet the general criteria of significance and scientific excellence. Papers will be published by rapid process within 20 days after acceptance and peer review process takes only 7 days. All articles published in Research Inventy will be peer-reviewed.
Human Patient Simulator Network 2012 Presentation: Large Class Simulation in a day
How to successfully design a schedule and perform 2 simulations and debriefings for 120+ senior nursing students with 4 faculty and 4 simulators in a nine hour day.
A comparison-between-paper-and-pencil-and-paperless-assessmentRose Shayeghi
مقاله A Comparison between Paper-and-Pencil and Paperless Assessment نوشته آقای شهرام کیانوش مدیر و خانم المیرا سلطانی کارشناس آموزش دپارتمان آزمون و سنجش آکادمی سفیر گفتمان در اولین کنفرانس ملی New Trends in English Language Teaching and Applied Linguistics دانشگاه گلستان در تاریخ 26 بهمن ماه 96 به صورت شفاهی ارائه شد.
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
In preparing the schedule of course not an easy job. There are several aspects that influence in the preparation of schedules of courses that professors, students, courses, lecture rooms, and a time slot. Each of these aspects has a state that can be a problem and a conflict in scheduling courses. For example, the problems facing aspect lecturers are lecturers conflict is a lecturer teaches courses scheduled at two different locations at a time. Or from the aspect of students, the problem is the number of classes per generation. In addition to these problems, there are many more potential problems that can arise from each of these aspects. A decision support system needed a model settlement of the problems encountered. To be able to determine the right model can be done by identifying problems and analyze environmental problems and identify variables that are involved in decision making. In scheduling the course, the problem is a complex problem that is solved by routine or repetitive. The complexity of the problem can be seen from every aspect in the preparation schedule of courses that are interconnected with other aspects. Then, the scheduling is done every semester by environmental circumstances different issues each semester. So that the right model for this system is a heuristic programming model.
Parallel Genetic Algorithms for University Scheduling ProblemIJECEIAES
University scheduling timetabling problem, falls into NP hard problems. Re-searchers have tried with many techniques to find the most suitable and fastest way for solving the problem. With the emergence of multi-core systems, the parallel implementation was considered for finding the solution. Our approaches attempt to combine several techniques in two algorithms: coarse grained algorithm and multi thread tournament algorithm. The results obtained from two algorithms are compared, using an algorithm evaluation function. Considering execution time, the coarse grained algorithm performed twice better than the multi thread algorithm.
Preparation of courses at every university is done by hand. This method has limitations that often cause collisions schedule. In lectures and lab scheduling frequent collision against the faculty member teaching schedule, collisions on the class schedule and student, college collision course with lab time, the allocation of the use of the rooms were not optimal. Heuristic method of genetic algorithm based on the mechanism of natural selection; it is a process of biological evolution. Genetic algorithms are used to obtain optimal schedule that consists of the initialization process of the population, fitness evaluation, selection, crossover, and mutation. Data used include the teaching of data, the data subjects, the room data and time data retrieved from the database of the Faculty of Computer Science, Universitas Pembangunan Panca Budi. The data in advance through the stages of the process of genetic algorithms to get optimal results The results of this study in the form of a schedule of courses has been optimized so that no error occurred and gaps.
Courses timetabling based on hill climbing algorithm IJECEIAES
In addition to its monotonous nature and excessive time requirements, the manual school timetable scheduling often leads to more than one class being assigned to the same instructor, or more than one instructor being assigned to the same classroom during the same slot time, or even leads to exercise in intentional partialities in favor of a particular group of instructors. In this paper, an automated school timetable scheduling is presented to help overcome the traditional conflicts inherent in the manual scheduling approach. In this approach, hill climbing algorithms have been modified to transact hard and soft constraints. Soft constraints are not easy to be satisfied typically, but hard constraints are obligated. The implementation of this technique has been successfully experimented in different schools with various kinds of side constraints. Results show that the initial solution can be improved by 72% towards the optimal solution within the first 5 seconds and by 50% from the second iteration while the optimal solution will be achieved after 15 iterations ensuring that more than 50% of scientific courses will take place in the early slots time while more than 50% of non-scientific courses will take place during the later time's slots.
The International Journal of Engineering and Science (The IJES)theijes
The International Journal of Engineering & Science is aimed at providing a platform for researchers, engineers, scientists, or educators to publish their original research results, to exchange new ideas, to disseminate information in innovative designs, engineering experiences and technological skills. It is also the Journal's objective to promote engineering and technology education. All papers submitted to the Journal will be blind peer-reviewed. Only original articles will be published.
The main problems of school course timetabling are time, curriculum, and classrooms. In addition there
are other problems that vary from one institution to another. This paper is intended to solve the problem of
satisfying the teachers’ preferred schedule in a way that regards the importance of the teacher to the
supervising institute, i.e. his score according to some criteria. Genetic algorithm (GA) has been presented
as an elegant method in solving timetable problem (TTP) in order to produce solutions with no conflict. In
this paper, we consider the analytic hierarchy process (AHP) to efficiently obtain a score for each teacher,
and consequently produce a GA-based TTP solution that satisfies most of the teachers’ preferences.
Presentation by Jean-Claude Callens, Vives University at the 2018 European Distance Learning Week's third day webinar on "Innovative Education – Case Studies" - 7 November 2018
Recording of the discussion is available: https://eden-online.adobeconnect.com/pynq0w4ku2b1/
HIGH SCHOOL TIMETABLING USING TABU SEARCH AND PARTIAL FEASIBILITY PRESERVING ...P singh
The high school timetabling is a combinatorial optimization problem. It is proved to be NP-hard and has several hard and soft constraints. A given set of events, class-teacher meetings and resources are assigned to the limited space and time under hard constraints which are strictly followed and soft constraints which are satisfied as far as possible. The feasibility of timetable is determined by hard constraints and the soft constraints determine its quality. Difficult combinatorial optimization problems are frequently solved using Genetic Algorithm (GA). We propose Partial Feasibility Preserving Genetic Algorithm (PFP-GA) combined with tabu search to solve hdtt4, “hard timetabling” problem a test data set in OR-Library. The solution to this problem is zero clashes and maintaining teacher’s workload on each class in given venue. The modified GA procedures are written for intelligent operators and repair. The PFP-GA in association with Tabu Search (TS) converges faster and gives solution within a few seconds. The results are compared to that of using different methodologies on same data set.
Submission Deadline: 30th September 2022
Acceptance Notification: Within Three Days’ time period
Online Publication: Within 24 Hrs. time Period
Expected Date of Dispatch of Printed Journal: 5th October 2022
MODELING AND ANALYSIS OF SURFACE ROUGHNESS AND WHITE LATER THICKNESS IN WIRE-...IAEME Publication
White layer thickness (WLT) formed and surface roughness in wire electric discharge turning (WEDT) of tungsten carbide composite has been made to model through response surface methodology (RSM). A Taguchi’s standard Design of experiments involving five input variables with three levels has been employed to establish a mathematical model between input parameters and responses. Percentage of cobalt content, spindle speed, Pulse on-time, wire feed and pulse off-time were changed during the experimental tests based on the Taguchi’s orthogonal array L27 (3^13). Analysis of variance (ANOVA) revealed that the mathematical models obtained can adequately describe performance within the parameters of the factors considered. There was a good agreement between the experimental and predicted values in this study.
A STUDY ON THE REASONS FOR TRANSGENDER TO BECOME ENTREPRENEURSIAEME Publication
The study explores the reasons for a transgender to become entrepreneurs. In this study transgender entrepreneur was taken as independent variable and reasons to become as dependent variable. Data were collected through a structured questionnaire containing a five point Likert Scale. The study examined the data of 30 transgender entrepreneurs in Salem Municipal Corporation of Tamil Nadu State, India. Simple Random sampling technique was used. Garrett Ranking Technique (Percentile Position, Mean Scores) was used as the analysis for the present study to identify the top 13 stimulus factors for establishment of trans entrepreneurial venture. Economic advancement of a nation is governed upon the upshot of a resolute entrepreneurial doings. The conception of entrepreneurship has stretched and materialized to the socially deflated uncharted sections of transgender community. Presently transgenders have smashed their stereotypes and are making recent headlines of achievements in various fields of our Indian society. The trans-community is gradually being observed in a new light and has been trying to achieve prospective growth in entrepreneurship. The findings of the research revealed that the optimistic changes are taking place to change affirmative societal outlook of the transgender for entrepreneurial ventureship. It also laid emphasis on other transgenders to renovate their traditional living. The paper also highlights that legislators, supervisory body should endorse an impartial canons and reforms in Tamil Nadu Transgender Welfare Board Association.
BROAD UNEXPOSED SKILLS OF TRANSGENDER ENTREPRENEURSIAEME Publication
Since ages gender difference is always a debatable theme whether caused by nature, evolution or environment. The birth of a transgender is dreadful not only for the child but also for their parents. The pain of living in the wrong physique and treated as second class victimized citizen is outrageous and fully harboured with vicious baseless negative scruples. For so long, social exclusion had perpetuated inequality and deprivation experiencing ingrained malign stigma and besieged victims of crime or violence across their life spans. They are pushed into the murky way of life with a source of eternal disgust, bereft sexual potency and perennial fear. Although they are highly visible but very little is known about them. The common public needs to comprehend the ravaged arrogance on these insensitive souls and assist in integrating them into the mainstream by offering equal opportunity, treat with humanity and respect their dignity. Entrepreneurship in the current age is endorsing the gender fairness movement. Unstable careers and economic inadequacy had inclined one of the gender variant people called Transgender to become entrepreneurs. These tiny budding entrepreneurs resulted in economic transition by means of employment, free from the clutches of stereotype jobs, raised standard of living and handful of financial empowerment. Besides all these inhibitions, they were able to witness a platform for skill set development that ignited them to enter into entrepreneurial domain. This paper epitomizes skill sets involved in trans-entrepreneurs of Thoothukudi Municipal Corporation of Tamil Nadu State and is a groundbreaking determination to sightsee various skills incorporated and the impact on entrepreneurship.
DETERMINANTS AFFECTING THE USER'S INTENTION TO USE MOBILE BANKING APPLICATIONSIAEME Publication
The banking and financial services industries are experiencing increased technology penetration. Among them, the banking industry has made technological advancements to better serve the general populace. The economy focused on transforming the banking sector's system into a cashless, paperless, and faceless one. The researcher wants to evaluate the user's intention for utilising a mobile banking application. The study also examines the variables affecting the user's behaviour intention when selecting specific applications for financial transactions. The researcher employed a well-structured questionnaire and a descriptive study methodology to gather the respondents' primary data utilising the snowball sampling technique. The study includes variables like performance expectations, effort expectations, social impact, enabling circumstances, and perceived risk. Each of the aforementioned variables has a major impact on how users utilise mobile banking applications. The outcome will assist the service provider in comprehending the user's history with mobile banking applications.
ANALYSE THE USER PREDILECTION ON GPAY AND PHONEPE FOR DIGITAL TRANSACTIONSIAEME Publication
Technology upgradation in banking sector took the economy to view that payment mode towards online transactions using mobile applications. This system enabled connectivity between banks, Merchant and user in a convenient mode. there are various applications used for online transactions such as Google pay, Paytm, freecharge, mobikiwi, oxygen, phonepe and so on and it also includes mobile banking applications. The study aimed at evaluating the predilection of the user in adopting digital transaction. The study is descriptive in nature. The researcher used random sample techniques to collect the data. The findings reveal that mobile applications differ with the quality of service rendered by Gpay and Phonepe. The researcher suggest the Phonepe application should focus on implementing the application should be user friendly interface and Gpay on motivating the users to feel the importance of request for money and modes of payments in the application.
VOICE BASED ATM FOR VISUALLY IMPAIRED USING ARDUINOIAEME Publication
The prototype of a voice-based ATM for visually impaired using Arduino is to help people who are blind. This uses RFID cards which contain users fingerprint encrypted on it and interacts with the users through voice commands. ATM operates when sensor detects the presence of one person in the cabin. After scanning the RFID card, it will ask to select the mode like –normal or blind. User can select the respective mode through voice input, if blind mode is selected the balance check or cash withdraw can be done through voice input. Normal mode procedure is same as the existing ATM.
IMPACT OF EMOTIONAL INTELLIGENCE ON HUMAN RESOURCE MANAGEMENT PRACTICES AMONG...IAEME Publication
There is increasing acceptability of emotional intelligence as a major factor in personality assessment and effective human resource management. Emotional intelligence as the ability to build capacity, empathize, co-operate, motivate and develop others cannot be divorced from both effective performance and human resource management systems. The human person is crucial in defining organizational leadership and fortunes in terms of challenges and opportunities and walking across both multinational and bilateral relationships. The growing complexity of the business world requires a great deal of self-confidence, integrity, communication, conflict and diversity management to keep the global enterprise within the paths of productivity and sustainability. Using the exploratory research design and 255 participants the result of this original study indicates strong positive correlation between emotional intelligence and effective human resource management. The paper offers suggestions on further studies between emotional intelligence and human capital development and recommends for conflict management as an integral part of effective human resource management.
VISUALISING AGING PARENTS & THEIR CLOSE CARERS LIFE JOURNEY IN AGING ECONOMYIAEME Publication
Our life journey, in general, is closely defined by the way we understand the meaning of why we coexist and deal with its challenges. As we develop the "inspiration economy", we could say that nearly all of the challenges we have faced are opportunities that help us to discover the rest of our journey. In this note paper, we explore how being faced with the opportunity of being a close carer for an aging parent with dementia brought intangible discoveries that changed our insight of the meaning of the rest of our life journey.
A STUDY ON THE IMPACT OF ORGANIZATIONAL CULTURE ON THE EFFECTIVENESS OF PERFO...IAEME Publication
The main objective of this study is to analyze the impact of aspects of Organizational Culture on the Effectiveness of the Performance Management System (PMS) in the Health Care Organization at Thanjavur. Organizational Culture and PMS play a crucial role in present-day organizations in achieving their objectives. PMS needs employees’ cooperation to achieve its intended objectives. Employees' cooperation depends upon the organization’s culture. The present study uses exploratory research to examine the relationship between the Organization's culture and the Effectiveness of the Performance Management System. The study uses a Structured Questionnaire to collect the primary data. For this study, Thirty-six non-clinical employees were selected from twelve randomly selected Health Care organizations at Thanjavur. Thirty-two fully completed questionnaires were received.
Living in 21st century in itself reminds all of us the necessity of police and its administration. As more and more we are entering into the modern society and culture, the more we require the services of the so called ‘Khaki Worthy’ men i.e., the police personnel. Whether we talk of Indian police or the other nation’s police, they all have the same recognition as they have in India. But as already mentioned, their services and requirements are different after the like 26th November, 2008 incidents, where they without saving their own lives has sacrificed themselves without any hitch and without caring about their respective family members and wards. In other words, they are like our heroes and mentors who can guide us from the darkness of fear, militancy, corruption and other dark sides of life and so on. Now the question arises, if Gandhi would have been alive today, what would have been his reaction/opinion to the police and its functioning? Would he have some thing different in his mind now what he had been in his mind before the partition or would he be going to start some Satyagraha in the form of some improvement in the functioning of the police administration? Really these questions or rather night mares can come to any one’s mind, when there is too much confusion is prevailing in our minds, when there is too much corruption in the society and when the polices working is also in the questioning because of one or the other case throughout the India. It is matter of great concern that we have to thing over our administration and our practical approach because the police personals are also like us, they are part and parcel of our society and among one of us, so why we all are pin pointing towards them.
A STUDY ON TALENT MANAGEMENT AND ITS IMPACT ON EMPLOYEE RETENTION IN SELECTED...IAEME Publication
The goal of this study was to see how talent management affected employee retention in the selected IT organizations in Chennai. The fundamental issue was the difficulty to attract, hire, and retain talented personnel who perform well and the gap between supply and demand of talent acquisition and retaining them within the firms. The study's main goals were to determine the impact of talent management on employee retention in IT companies in Chennai, investigate talent management strategies that IT companies could use to improve talent acquisition, performance management, career planning and formulate retention strategies that the IT firms could use. The respondents were given a structured close-ended questionnaire with the 5 Point Likert Scale as part of the study's quantitative research design. The target population consisted of 289 IT professionals. The questionnaires were distributed and collected by the researcher directly. The Statistical Package for Social Sciences (SPSS) was used to collect and analyse the questionnaire responses. Hypotheses that were formulated for the various areas of the study were tested using a variety of statistical tests. The key findings of the study suggested that talent management had an impact on employee retention. The studies also found that there is a clear link between the implementation of talent management and retention measures. Management should provide enough training and development for employees, clarify job responsibilities, provide adequate remuneration packages, and recognise employees for exceptional performance.
ATTRITION IN THE IT INDUSTRY DURING COVID-19 PANDEMIC: LINKING EMOTIONAL INTE...IAEME Publication
Globally, Millions of dollars were spent by the organizations for employing skilled Information Technology (IT) professionals. It is costly to replace unskilled employees with IT professionals possessing technical skills and competencies that aid in interconnecting the business processes. The organization’s employment tactics were forced to alter by globalization along with technological innovations as they consistently diminish to remain lean, outsource to concentrate on core competencies along with restructuring/reallocate personnel to gather efficiency. As other jobs, organizations or professions have become reasonably more appropriate in a shifting employment landscape, the above alterations trigger both involuntary as well as voluntary turnover. The employee view on jobs is also afflicted by the COVID-19 pandemic along with the employee-driven labour market. So, having effective strategies is necessary to tackle the withdrawal rate of employees. By associating Emotional Intelligence (EI) along with Talent Management (TM) in the IT industry, the rise in attrition rate was analyzed in this study. Only 303 respondents were collected out of 350 participants to whom questionnaires were distributed. From the employees of IT organizations located in Bangalore (India), the data were congregated. A simple random sampling methodology was employed to congregate data as of the respondents. Generating the hypothesis along with testing is eventuated. The effect of EI and TM along with regression analysis between TM and EI was analyzed. The outcomes indicated that employee and Organizational Performance (OP) were elevated by effective EI along with TM.
INFLUENCE OF TALENT MANAGEMENT PRACTICES ON ORGANIZATIONAL PERFORMANCE A STUD...IAEME Publication
By implementing talent management strategy, organizations would have the option to retain their skilled professionals while additionally working on their overall performance. It is the course of appropriately utilizing the ideal individuals, setting them up for future top positions, exploring and dealing with their performance, and holding them back from leaving the organization. It is employee performance that determines the success of every organization. The firm quickly obtains an upper hand over its rivals in the event that its employees having particular skills that cannot be duplicated by the competitors. Thus, firms are centred on creating successful talent management practices and processes to deal with the unique human resources. Firms are additionally endeavouring to keep their top/key staff since on the off chance that they leave; the whole store of information leaves the firm's hands. The study's objective was to determine the impact of talent management on organizational performance among the selected IT organizations in Chennai. The study recommends that talent management limitedly affects performance. On the off chance that this talent is appropriately management and implemented properly, organizations might benefit as much as possible from their maintained assets to support development and productivity, both monetarily and non-monetarily.
A STUDY OF VARIOUS TYPES OF LOANS OF SELECTED PUBLIC AND PRIVATE SECTOR BANKS...IAEME Publication
Banking regulations act of India, 1949 defines banking as “acceptance of deposits for the purpose of lending or investment from the public, repayment on demand or otherwise and withdrawable through cheques, drafts order or otherwise”, the major participants of the Indian financial system are commercial banks, the financial institution encompassing term lending institutions. Investments institutions, specialized financial institution and the state level development banks, non banking financial companies (NBFC) and other market intermediaries such has the stock brokers and money lenders are among the oldest of the certain variants of NBFC and the oldest market participants. The asset quality of banks is one of the most important indicators of their financial health. The Indian banking sector has been facing severe problems of increasing Non- Performing Assets (NPAs). The NPAs growth directly and indirectly affects the quality of assets and profitability of banks. It also shows the efficiency of banks credit risk management and the recovery effectiveness. NPA do not generate any income, whereas, the bank is required to make provisions for such as assets that why is a double edge weapon. This paper outlines the concept of quality of bank loans of different types like Housing, Agriculture and MSME loans in state Haryana of selected public and private sector banks. This study is highlighting problems associated with the role of commercial bank in financing Small and Medium Scale Enterprises (SME). The overall objective of the research was to assess the effect of the financing provisions existing for the setting up and operations of MSMEs in the country and to generate recommendations for more robust financing mechanisms for successful operation of the MSMEs, in turn understanding the impact of MSME loans on financial institutions due to NPA. There are many research conducted on the topic of Non- Performing Assets (NPA) Management, concerning particular bank, comparative study of public and private banks etc. In this paper the researcher is considering the aggregate data of selected public sector and private sector banks and attempts to compare the NPA of Housing, Agriculture and MSME loans in state Haryana of public and private sector banks. The tools used in the study are average and Anova test and variance. The findings reveal that NPA is common problem for both public and private sector banks and is associated with all types of loans either that is housing loans, agriculture loans and loans to SMES. NPAs of both public and private sector banks show the increasing trend. In 2010-11 GNPA of public and private sector were at same level it was 2% but after 2010-11 it increased in many fold and at present there is GNPA in some more than 15%. It shows the dark area of Indian banking sector.
EXPERIMENTAL STUDY OF MECHANICAL AND TRIBOLOGICAL RELATION OF NYLON/BaSO4 POL...IAEME Publication
An experiment conducted in this study found that BaSO4 changed Nylon 6's mechanical properties. By changing the weight ratios, BaSO4 was used to make Nylon 6. This Researcher looked into how hard Nylon-6/BaSO4 composites are and how well they wear. Experiments were done based on Taguchi design L9. Nylon-6/BaSO4 composites can be tested for their hardness number using a Rockwell hardness testing apparatus. On Nylon/BaSO4, the wear behavior was measured by a wear monitor, pinon-disc friction by varying reinforcement, sliding speed, and sliding distance, and the microstructure of the crack surfaces was observed by SEM. This study provides significant contributions to ultimate strength by increasing BaSO4 content up to 16% in the composites, and sliding speed contributes 72.45% to the wear rate
ROLE OF SOCIAL ENTREPRENEURSHIP IN RURAL DEVELOPMENT OF INDIA - PROBLEMS AND ...IAEME Publication
The majority of the population in India lives in villages. The village is the back bone of the country. Village or rural industries play an important role in the national economy, particularly in the rural development. Developing the rural economy is one of the key indicators towards a country’s success. Whether it be the need to look after the welfare of the farmers or invest in rural infrastructure, Governments have to ensure that rural development isn’t compromised. The economic development of our country largely depends on the progress of rural areas and the standard of living of rural masses. Village or rural industries play an important role in the national economy, particularly in the rural development. Rural entrepreneurship is based on stimulating local entrepreneurial talent and the subsequent growth of indigenous enterprises. It recognizes opportunity in the rural areas and accelerates a unique blend of resources either inside or outside of agriculture. Rural entrepreneurship brings an economic value to the rural sector by creating new methods of production, new markets, new products and generate employment opportunities thereby ensuring continuous rural development. Social Entrepreneurship has the direct and primary objective of serving the society along with the earning profits. So, social entrepreneurship is different from the economic entrepreneurship as its basic objective is not to earn profits but for providing innovative solutions to meet the society needs which are not taken care by majority of the entrepreneurs as they are in the business for profit making as a sole objective. So, the Social Entrepreneurs have the huge growth potential particularly in the developing countries like India where we have huge societal disparities in terms of the financial positions of the population. Still 22 percent of the Indian population is below the poverty line and also there is disparity among the rural & urban population in terms of families living under BPL. 25.7 percent of the rural population & 13.7 percent of the urban population is under BPL which clearly shows the disparity of the poor people in the rural and urban areas. The need to develop social entrepreneurship in agriculture is dictated by a large number of social problems. Such problems include low living standards, unemployment, and social tension. The reasons that led to the emergence of the practice of social entrepreneurship are the above factors. The research problem lays upon disclosing the importance of role of social entrepreneurship in rural development of India. The paper the tendencies of social entrepreneurship in India, to present successful examples of such business for providing recommendations how to improve situation in rural areas in terms of social entrepreneurship development. Indian government has made some steps towards development of social enterprises, social entrepreneurship, and social in- novation, but a lot remains to be improved.
OPTIMAL RECONFIGURATION OF POWER DISTRIBUTION RADIAL NETWORK USING HYBRID MET...IAEME Publication
Distribution system is a critical link between the electric power distributor and the consumers. Most of the distribution networks commonly used by the electric utility is the radial distribution network. However in this type of network, it has technical issues such as enormous power losses which affect the quality of the supply. Nowadays, the introduction of Distributed Generation (DG) units in the system help improve and support the voltage profile of the network as well as the performance of the system components through power loss mitigation. In this study network reconfiguration was done using two meta-heuristic algorithms Particle Swarm Optimization and Gravitational Search Algorithm (PSO-GSA) to enhance power quality and voltage profile in the system when simultaneously applied with the DG units. Backward/Forward Sweep Method was used in the load flow analysis and simulated using the MATLAB program. Five cases were considered in the Reconfiguration based on the contribution of DG units. The proposed method was tested using IEEE 33 bus system. Based on the results, there was a voltage profile improvement in the system from 0.9038 p.u. to 0.9594 p.u.. The integration of DG in the network also reduced power losses from 210.98 kW to 69.3963 kW. Simulated results are drawn to show the performance of each case.
APPLICATION OF FRUGAL APPROACH FOR PRODUCTIVITY IMPROVEMENT - A CASE STUDY OF...IAEME Publication
Manufacturing industries have witnessed an outburst in productivity. For productivity improvement manufacturing industries are taking various initiatives by using lean tools and techniques. However, in different manufacturing industries, frugal approach is applied in product design and services as a tool for improvement. Frugal approach contributed to prove less is more and seems indirectly contributing to improve productivity. Hence, there is need to understand status of frugal approach application in manufacturing industries. All manufacturing industries are trying hard and putting continuous efforts for competitive existence. For productivity improvements, manufacturing industries are coming up with different effective and efficient solutions in manufacturing processes and operations. To overcome current challenges, manufacturing industries have started using frugal approach in product design and services. For this study, methodology adopted with both primary and secondary sources of data. For primary source interview and observation technique is used and for secondary source review has done based on available literatures in website, printed magazines, manual etc. An attempt has made for understanding application of frugal approach with the study of manufacturing industry project. Manufacturing industry selected for this project study is Mahindra and Mahindra Ltd. This paper will help researcher to find the connections between the two concepts productivity improvement and frugal approach. This paper will help to understand significance of frugal approach for productivity improvement in manufacturing industry. This will also help to understand current scenario of frugal approach in manufacturing industry. In manufacturing industries various process are involved to deliver the final product. In the process of converting input in to output through manufacturing process productivity plays very critical role. Hence this study will help to evolve status of frugal approach in productivity improvement programme. The notion of frugal can be viewed as an approach towards productivity improvement in manufacturing industries.
A MULTIPLE – CHANNEL QUEUING MODELS ON FUZZY ENVIRONMENTIAEME Publication
In this paper, we investigated a queuing model of fuzzy environment-based a multiple channel queuing model (M/M/C) ( /FCFS) and study its performance under realistic conditions. It applies a nonagonal fuzzy number to analyse the relevant performance of a multiple channel queuing model (M/M/C) ( /FCFS). Based on the sub interval average ranking method for nonagonal fuzzy number, we convert fuzzy number to crisp one. Numerical results reveal that the efficiency of this method. Intuitively, the fuzzy environment adapts well to a multiple channel queuing models (M/M/C) ( /FCFS) are very well.
About
Indigenized remote control interface card suitable for MAFI system CCR equipment. Compatible for IDM8000 CCR. Backplane mounted serial and TCP/Ethernet communication module for CCR remote access. IDM 8000 CCR remote control on serial and TCP protocol.
• Remote control: Parallel or serial interface.
• Compatible with MAFI CCR system.
• Compatible with IDM8000 CCR.
• Compatible with Backplane mount serial communication.
• Compatible with commercial and Defence aviation CCR system.
• Remote control system for accessing CCR and allied system over serial or TCP.
• Indigenized local Support/presence in India.
• Easy in configuration using DIP switches.
Technical Specifications
Indigenized remote control interface card suitable for MAFI system CCR equipment. Compatible for IDM8000 CCR. Backplane mounted serial and TCP/Ethernet communication module for CCR remote access. IDM 8000 CCR remote control on serial and TCP protocol.
Key Features
Indigenized remote control interface card suitable for MAFI system CCR equipment. Compatible for IDM8000 CCR. Backplane mounted serial and TCP/Ethernet communication module for CCR remote access. IDM 8000 CCR remote control on serial and TCP protocol.
• Remote control: Parallel or serial interface
• Compatible with MAFI CCR system
• Copatiable with IDM8000 CCR
• Compatible with Backplane mount serial communication.
• Compatible with commercial and Defence aviation CCR system.
• Remote control system for accessing CCR and allied system over serial or TCP.
• Indigenized local Support/presence in India.
Application
• Remote control: Parallel or serial interface.
• Compatible with MAFI CCR system.
• Compatible with IDM8000 CCR.
• Compatible with Backplane mount serial communication.
• Compatible with commercial and Defence aviation CCR system.
• Remote control system for accessing CCR and allied system over serial or TCP.
• Indigenized local Support/presence in India.
• Easy in configuration using DIP switches.
Forklift Classes Overview by Intella PartsIntella Parts
Discover the different forklift classes and their specific applications. Learn how to choose the right forklift for your needs to ensure safety, efficiency, and compliance in your operations.
For more technical information, visit our website https://intellaparts.com
Democratizing Fuzzing at Scale by Abhishek Aryaabh.arya
Presented at NUS: Fuzzing and Software Security Summer School 2024
This keynote talks about the democratization of fuzzing at scale, highlighting the collaboration between open source communities, academia, and industry to advance the field of fuzzing. It delves into the history of fuzzing, the development of scalable fuzzing platforms, and the empowerment of community-driven research. The talk will further discuss recent advancements leveraging AI/ML and offer insights into the future evolution of the fuzzing landscape.
Welcome to WIPAC Monthly the magazine brought to you by the LinkedIn Group Water Industry Process Automation & Control.
In this month's edition, along with this month's industry news to celebrate the 13 years since the group was created we have articles including
A case study of the used of Advanced Process Control at the Wastewater Treatment works at Lleida in Spain
A look back on an article on smart wastewater networks in order to see how the industry has measured up in the interim around the adoption of Digital Transformation in the Water Industry.
Immunizing Image Classifiers Against Localized Adversary Attacksgerogepatton
This paper addresses the vulnerability of deep learning models, particularly convolutional neural networks
(CNN)s, to adversarial attacks and presents a proactive training technique designed to counter them. We
introduce a novel volumization algorithm, which transforms 2D images into 3D volumetric representations.
When combined with 3D convolution and deep curriculum learning optimization (CLO), itsignificantly improves
the immunity of models against localized universal attacks by up to 40%. We evaluate our proposed approach
using contemporary CNN architectures and the modified Canadian Institute for Advanced Research (CIFAR-10
and CIFAR-100) and ImageNet Large Scale Visual Recognition Challenge (ILSVRC12) datasets, showcasing
accuracy improvements over previous techniques. The results indicate that the combination of the volumetric
input and curriculum learning holds significant promise for mitigating adversarial attacks without necessitating
adversary training.
Overview of the fundamental roles in Hydropower generation and the components involved in wider Electrical Engineering.
This paper presents the design and construction of hydroelectric dams from the hydrologist’s survey of the valley before construction, all aspects and involved disciplines, fluid dynamics, structural engineering, generation and mains frequency regulation to the very transmission of power through the network in the United Kingdom.
Author: Robbie Edward Sayers
Collaborators and co editors: Charlie Sims and Connor Healey.
(C) 2024 Robbie E. Sayers
Courier management system project report.pdfKamal Acharya
It is now-a-days very important for the people to send or receive articles like imported furniture, electronic items, gifts, business goods and the like. People depend vastly on different transport systems which mostly use the manual way of receiving and delivering the articles. There is no way to track the articles till they are received and there is no way to let the customer know what happened in transit, once he booked some articles. In such a situation, we need a system which completely computerizes the cargo activities including time to time tracking of the articles sent. This need is fulfilled by Courier Management System software which is online software for the cargo management people that enables them to receive the goods from a source and send them to a required destination and track their status from time to time.
Industrial Training at Shahjalal Fertilizer Company Limited (SFCL)MdTanvirMahtab2
This presentation is about the working procedure of Shahjalal Fertilizer Company Limited (SFCL). A Govt. owned Company of Bangladesh Chemical Industries Corporation under Ministry of Industries.
Quality defects in TMT Bars, Possible causes and Potential Solutions.PrashantGoswami42
Maintaining high-quality standards in the production of TMT bars is crucial for ensuring structural integrity in construction. Addressing common defects through careful monitoring, standardized processes, and advanced technology can significantly improve the quality of TMT bars. Continuous training and adherence to quality control measures will also play a pivotal role in minimizing these defects.
COLLEGE BUS MANAGEMENT SYSTEM PROJECT REPORT.pdfKamal Acharya
The College Bus Management system is completely developed by Visual Basic .NET Version. The application is connect with most secured database language MS SQL Server. The application is develop by using best combination of front-end and back-end languages. The application is totally design like flat user interface. This flat user interface is more attractive user interface in 2017. The application is gives more important to the system functionality. The application is to manage the student’s details, driver’s details, bus details, bus route details, bus fees details and more. The application has only one unit for admin. The admin can manage the entire application. The admin can login into the application by using username and password of the admin. The application is develop for big and small colleges. It is more user friendly for non-computer person. Even they can easily learn how to manage the application within hours. The application is more secure by the admin. The system will give an effective output for the VB.Net and SQL Server given as input to the system. The compiled java program given as input to the system, after scanning the program will generate different reports. The application generates the report for users. The admin can view and download the report of the data. The application deliver the excel format reports. Because, excel formatted reports is very easy to understand the income and expense of the college bus. This application is mainly develop for windows operating system users. In 2017, 73% of people enterprises are using windows operating system. So the application will easily install for all the windows operating system users. The application-developed size is very low. The application consumes very low space in disk. Therefore, the user can allocate very minimum local disk space for this application.
Saudi Arabia stands as a titan in the global energy landscape, renowned for its abundant oil and gas resources. It's the largest exporter of petroleum and holds some of the world's most significant reserves. Let's delve into the top 10 oil and gas projects shaping Saudi Arabia's energy future in 2024.
Student information management system project report ii.pdfKamal Acharya
Our project explains about the student management. This project mainly explains the various actions related to student details. This project shows some ease in adding, editing and deleting the student details. It also provides a less time consuming process for viewing, adding, editing and deleting the marks of the students.
2. Elizabeth Amudhini Stephen
http://www.iaeme.com/IJMET/index.asp 417 editor@iaeme.com
Universities: One has to schedule a certain number of examinations in a given number of time
slots in such a way that no student is involved in more than one exam at a ime. The assignment
of exams to days and to time slots within the day is also subject to constraints on availabilities,
fair spreading of the student workload, and room capacities.
Different variants of the timetabling problem have been proposed in the literature, which
differ from each other based on the type of constraints and objectives involved. Constraints
involve room capacity and teacher availability, whereas objectives mainly regard student
workload. In this paper, we present an ongoing research on the development a of solution
algorithm for a set of variants of the Examination timetabling problem using different methods
of optimization.
2. UNIVERSITY EXAM TIME TABLING
Examinations in a university take place five times a year. At the end of each semester and at the
end of every trimester there is a normal four week examination period where all the courses
offered during the semester/trimester are examined. Generally students have complete freedom
in taking the exams at any exam period (in which they are scheduled) within their course of
studies.
In every examination day there are two different periods (9:30 AM– 12:30P.M and 2:00 P.M
– 5:00 P.M).Since students are allowed to have increased flexibility in selecting courses, all the
courses offered by the department must be examined at different periods. Even in its simplest
form this task is not easy. In each department, about 50 courses are offered and therefore atleast
two examinations per dept must be scheduled in each examination day.
The basic exam timetabling problem is to assign examinations to limited number of time
units(periods), normally lasting up to three hours, in such a way that:
1. There are no conflicts., i.e., no students is called to take more than one examination
at a time
2. All the exams are assigned to periods
3. The seating capacity is not exceeded in any period
4. Only one compulsory course from each department must be examined in each
examination day
5. The compulsory course of a university stream must be evenly spread over the
examination period: and
6. The exam period has the smallest possible length
3. THE GENERAL FRAMEWORK
Hertz (1991) stated that approaches developed to solve timetabling problems usually consist of
two phases. Normally, in Phase 1:Sequential Constructive Algorithm, a solution is (or solutions
are) constructed by using a sequential construction algorithm. The constructed solutions can be
feasible or infeasible. If a solution is infeasible, it can be ‘corrected’ during the iterative
improvement phase (Phase 2). In Phase 2: Iterative improvement, the initial solution is modified
in order to improve the solution while ensuring the feasibility of the solution. The improvements
can be implemented by using any search algorithm such as Genetic Algorithms (Holland, 1992),
Tabu Search (Glover,1986), Simulated Annealing (Kirkpatrick et al., 1983) or the Great Deluge
Algorithm (Dueck, 1993) (to name just a few approaches). In the first part of this research, the
focus is on the construction process, as constructing feasible solutions is a difficult task especially
for large, real-world timetabling problems (Hertz, 1991). The use of a sequential constructive
algorithm is amongst the earliest approaches used to tackle the examination timetabling problem
3. A Critical Review on the Optimization Methods in Solving Exam Timetabling and Scheduling
http://www.iaeme.com/IJMET/index.asp 418 editor@iaeme.com
in an automated way (Broder, 1964; Cole, 1964; Foxley and Lockyer, 1968). In this approach,
the concept of ‘failed first’ was implemented.
The basic idea was to first schedule the exams that might cause problems if they were to be
left to later in the scheduling process. By doing so, the overall aim was to avoid the assignment
of exams to time slots which might later lead to an infeasible solution. An infeasible solution is
reached when at least one exam remains unscheduled. In many cases this is because exams placed
earlier have invalidated all the potentially valid time slots. In such a situation, a different ordering
may enable a feasible solution to be found. Approaches which order the events prior to
assignment to a period have been discussed by several authors including Boizumault et al. (1996),
Brailsford et al. (1999), Burke and Newall (2004), Burke, Kingston and de Werra (2004b), Burke
and Petrovic (2002), and Carter et al. (1996). In the context of the exam timetabling benchmark
data sets used in this research, this sequencing strategy has been implemented by Carter et al.
(1996), Burke and Newall (2004), and Burke et al. (2007). Usually, the unscheduled exams are
ordered in a sequence that represents how difficult it is judged that they will be to place in the
timetable (most difficult first). A number of commonly used strategies have been adopted from
the graph colouring problem. Many studies employ graph theory to calculate the ‘difficulty to
schedule an exam’. The following list describes the most common graph colouring based heuristic
orderings used in timetabling research:
Largest Degree (LD) First. Exams are ranked in descending order by the number of exams
in conflict — i.e. priority is given to exams with the greatest number of exams in conflict.
Largest Enrolment (LE) First. Exams are ranked in descending order by the number of
students enroled in each of the exams — i.e. exams with the highest number of students are given
the highest priority.
Least Saturation Degree (SD) First. Exams are ranked in increasing order by the
number of valid time slots remaining in the timetable for each exam — priority is given to
exams with fewer time slots available.
Largest Colored Degree (LCD) First. This heuristic is based on LD. For this heuristic, only
exams which have been already assigned to the schedule are considered as the exams which will
cause conflict.
Weighted Largest Degree (WLD) First. This heuristic is also based on LD. Besides the
number of exams in conflict, the total number of students involved in the conflicts are taken into
account as well. In general, heuristic orderings are divided into two categories: static and
dynamic. Static heuristic orderings are predetermined before the start of the assignment process
and their values remain the same throughout the process. For the heuristic orderings described
above, LD, LE and WLD are categorized as static heuristic orderings. The number of exams in
conflict with each exam and the number of students enrolled for each exam only need to be
calculated once by analysing the specific problem structure. On the other hand, SD and LCD are
considered to be a dynamic heuristic orderings because the number of valid time slots available
for unscheduled exams and the number of exams assigned to time slots may change each time an
exam is assigned to a valid time slot; in which case, the unscheduled exams need to be reordered.
In 1961, Appleby et al. implemented graph colouring techniques in the preparation of school
timetables. Since then, the use of graph based heuristic orderings has been extended to other types
of timetabling problem. LD was the most widely used heuristic ordering in earlier research into
examination timetabling (Broder, 1964; Cole, 1964; Welsh and Powell, 1967). Wood (1968)
utilised the heuristic orderings LE and LD.
In his approach, exams were selected starting with those that require the room with the largest
capacity. These exams were then ordered decreasingly by the number of exams in conflict. The
same process was applied to the second largest room and so on. Johnson (1990) also combined
4. Elizabeth Amudhini Stephen
http://www.iaeme.com/IJMET/index.asp 419 editor@iaeme.com
heuristic orderings LE and LD, but he considered them simultaneously through the simple linear
combination of LD, with LE multiplied by a weighted factor wLE that was varied. The use of
Saturation Degree was first presented by Brˇelaz (1979) for the graph colouring problem. Brˇelaz
suggested that a vertex with the smallest number of colours that can be used to colour the vertex
is the most difficult vertex to be coloured. Mehta (1981) implemented the heuristic SD in order
to satisfy the requirement made by the registrar that all the exams must be scheduled in twelve
time slots. However, in order to satisfy the requirement that no student should have his/her exams
scheduled at the same time, they found that the minimum number of time slots required was
thirteen. Therefore, in order to minimise the number of students who had two exams at the same
time and to spread out each student’s schedule, preprocessing of the collected data (e.g. grouping
several exams as one exam) and adjustment of the sequence of time slots was required. Kiaer and
Yellen (1992) modeled a course timetabling problem as a weighted graph. Weights for edges
were not based on the number of students who registered for the two connected vertices
(conflicting courses), but the edges were assigned weights, 1, n or n2, where n was the number
of courses. Five heuristics based on weighted graph parameters were employed to select which
courses were to be scheduled next. One of the heuristics was similar to the heuristic SD, but they
called the heuristic ‘forbidden degree’. Their heuristic algorithm showed promising results when
tested on randomly generated weighted graphs (80 graphs with 50 and 100 vertices respectively,
and 100 graphs with 20 vertices). They also observed that their heuristic ‘forbidden degree’ was
more efficient for problems with a higher number of average vertices. When applied to real
problems, the solutions produced by applying various heuristics outperformed the solution
generated manually by the administration.
Laporte and Desroches (1984), and Carter et al. (1996) investigated four different types of
graph based heuristic orderings to rank the exams in decreasing/increasing order to estimate how
difficult it was to schedule each of the exams. They considered Largest Degree, Saturation
Degree, Weighted Largest Degree and Largest Enrolment. These heuristics were used
individually to order the exams. Then, the exams were selected sequentially and assigned to a
time slot that satisfied all the specified constraints. In Carter et al.’s approach, their algorithm
first found the maximum clique of conflicting examinations.
A clique of exams is a group of exams in which each exam conflicts with every other exam.
The size of the maximum clique can also be used to determine the minimum number of time slots
required to schedule all the exams for particular problem instances (Gendreau et al., 1993). Exams
grouped in the maximum clique were first assigned to different time slots, and then the heuristic
ordering was applied to the remaining exams. Carter et al. tested the approach on ten random
problems and thirteen real problems. Carter and Johnson (1999, 2001) investigated further the
use of cliques for examination timetabling.
Casey and Thompson (2003) investigated the efficiency of these four heuristic orderings (i.e.
Largest Degree, Saturation Degree, Weighted Largest Degree and Largest Enrolment) in
constructing the initial solutions in the first phase of their Greedy Randomised Adaptive Search
Procedure (GRASP) algorithm. Roulette wheel selection was employed to choose the next exam
to be scheduled from the top n exams in the exam ordering, where the appropriate value for n was
experimentally determined to be between 2 and 6 depending on the total number of exams in the
problem instance. The selected exam was then scheduled into the first time slot that satisfied all
the hard constraints. Foxley and Lockyer (1968) ordered the exams by a ‘priority formula’ that
used all the known facts concerning the examinations. They also allowed a manual special
priority setting to override other soft constraints. For example, they set a special priority for final
year papers. Although the aim of sequentially processing the ordered events (by certain criteria
or heuristics) is to make sure all events can be scheduled by the end of the construction phase of
the timetabling process, it is not always the case that all events are assigned at the first attempt.
5. A Critical Review on the Optimization Methods in Solving Exam Timetabling and Scheduling
http://www.iaeme.com/IJMET/index.asp 420 editor@iaeme.com
In addition to this, there are commonly used strategies to select which time slot an event is to be
assigned to. This can also have a significant effect on the timetable construction process. Some
common strategies mentioned in the literature are as follows:
• Use the first or the last valid time slot.
• Choose a valid time slot at random.
• Use the time slot that will cause the least penalty cost.
• Use the time slot that will minimise the number of unused seats.
In the case where a feasible timetable is not achievable during construction, various
approaches can be applied. Usually, reshuffling the earlier scheduled events is performed.
In Carter et al. (1996) and, Laporte and Desroches (1984), if no clash free time slot wasfound,
‘backtracking’ was implemented. In order to make a time slot available, the time slot with the
minimum number of conflicting scheduled exams that needed to be ‘bumped back’ was chosen.
They used minimum disruption cost (the cost of reshuffling the conflicting exams from the
selected time slot into another valid time slot and inserting the current unscheduled exam into the
selected time slot) to identify which exam was to be moved. All conflicting exams were either
moved to the different time slot with the least penalty cost (while maintaining feasibility) or
returned to the unscheduled exams list. For the purpose of avoiding an infinite loop, the number
of times an exam could be returned in this manner was limited to three. This process was
continued until all the exams were scheduled and a feasible solution produced. A similar
backtracking approach was applied by Casey and Thompson (2003). Another approach proposed
in Burke and Newall (2004) applied an adaptive heuristic technique in which the exam list was
initially ordered by a particular heuristic. This heuristic could then be altered to take into account
the penalty that placed exams imposed upon the timetable. Their work was motivated by the
Squeaky Wheel approach introduced by Joslin and Clements (1999).
Some researchers have implemented heuristic ordering in the process of splitting events into
independent sets. The events are split into groups in such a way that no events in conflict are
grouped together. The groups of event are then assigned to time slots with the objective of
minimising the violation of certain soft constraints. One of the earliest papers that applied this
approach to the graph colouring problem was published by Wood (1969). He presented a
comparison of two grouping approaches for graph colouring problems. The first was based on
the graph heuristic LD, while in the second pairs of objects were grouped based on their
similarity. A similarity matrix was generated based on the information obtained from the conflict
matrix. As defined by Wood, “if vertices i and j are not connected, the similarity is the number
of other vertices k which are connected to both i and j”. Experiments on real timetabling problems
showed that the similarity matrix approach obtained better results in two out of the six problems,
while the results for the remaining four of the problems were equal to the results produced when
the graph based heuristic LD was employed. However, when tested on randomly generated data
sets, it was observed that, overall (about 75% of the cases), the graph based heuristic LD produced
better results compared to the similarity matrix approach.
Desroches et al. (1978) presented an automated examination timetabling system called
HOREX employed by the I’Ecole Polytechnique de Montr´eal. The authors experimented with
five heuristic orderings in the selection of exams to be placed into non conflicted groups. These
heuristic orderings included two random approaches, ordering by Largest Enrolment and two
other approaches that were developed based on the number of exams in conflict (no detailed
description was given). Burke et al. (1994c) used the degree of a vertex (graph based heuristic
LD) to determine which exams could be grouped together in the same time slot. In each group,
exams were ordered increasingly by the number of students enroled. In turn, exams were assigned
6. Elizabeth Amudhini Stephen
http://www.iaeme.com/IJMET/index.asp 421 editor@iaeme.com
to rooms with the aim of minimizing the number of unused seats. It was, of course, possible to
have more than one exam in one room.
In summary, there has been much research into different heuristic orderings. Carter et al.
(1996) indicated that it is not easy to determine which heuristic ordering is the most appropriate
for any given problem in hand. In addition, other work (e.g. Burke and Newall, 2004) has
suggested that adaptively changing the heuristic ordering during construction can produce better
solutions compared to only using one heuristic ordering throughout the process. A study by Burke
et al. (1998b) also suggested that the use of heuristic ordering for creating the initial solutions of
an evolutionary algorithm for timetabling problems could substantially improve performance. A
common theme of these observations is that different heuristics may be beneficial in different
circumstances during construction. This observation lead to the conjecture that considering a
combination of different heuristics simultaneously might lead to a further improvement in
solution quality.
4. DIFFERENT OPTIMIZATION METHODS
4.1. Iterative Improvement Methods
As stated earlier, having constructed a solution in Phase 1, the solution is then often improved in
Phase 2. The process is almost invariably an iterative process in which the solution is modified
at each step in order to (hopefully) improve the quality of the solution. The most common
approach is to utilise metaheuristic optimisation methods for this iterative improvement. An
excellent general review of metaheuristic approaches in combinatorial optimisation can be found
in Blum and Roli (2003). The aim of any heuristic search technique is to provide an efficient way
of iteratively exploring the search space of a given problem. However, most methods will get
trapped in local optima. The main aim of a metaheuristic technique is to escape from local optima
and thus hopefully produce better solutions. Vo_ et al. (1999) defined a metaheuristic as follows:
“A meta-heuristic is an iterative master process that guides and modifies the operations of
subordinate heuristics to efficiently produce high-quality solutions. It may manipulate a complete
(or incomplete) single solution or a collection of solutions at each iteration. The subordinate
heuristics may be high (or low) level procedures, or a simple local search, or just a con struction
method.” Glover and Laguna (1997) defined the term as follows: “A meta-heuristic refers to a
master strategy that guides and modifies other heuristics to produce solutions beyond those that
are normally generated in a quest for local optimality.” While Osman and Kelly (1996) defined
it as: “A meta-heuristic is an iterative generation process which guides a subordinate heuristic ...”
Blum and Roli also quoted several definitions of metaheuristics given by several researchers and
outlined the basic characteristics of metaheuristics. This Section concentrates on the
metaheuristic approaches for educational timetabling.
4.2. Simulated Annealing and the Great Deluge Algorithm
Simulated Annealing (Kirkpatrick et al., 1983) has been successfully applied to the examination
timetabling problem by Thompson and Dowsland (1996, 1998). They focused on developing a
robust Simulated Annealing approach in which the cooling schedule was determined in an
automated way and adapted depending on the problem instances and objective functions defined
for the given problem instances. Bullnheimer (1997) focused on the use of Simulated Annealing
in small scale examination timetabling problems and, particularly, on breaking down one larger
real-world problem instance into several smaller sub-problems. Burke et al. (2004a) also
investigated the use of Simulated Annealing in examination timetabling in a comparison with the
Great Deluge Algorithm . An approach that works in a very similar manner to Simulated
Annealing is known as Great Deluge Algorithm (Dueck, 1993). In comparison with the
7. A Critical Review on the Optimization Methods in Solving Exam Timetabling and Scheduling
http://www.iaeme.com/IJMET/index.asp 422 editor@iaeme.com
temperature parameter used by Simulated Annealing, Great Deluge Algorithm uses two
parameters that are, perhaps, more meaningful to the user, namely the amount of computational
time required and an estimate of the quality of the desired solution. The advantage of the Great
Deluge Algorithm is that, as these parameters are more meaningful, the algorithm is easier for
the inexperienced user to apply and less parameter tuning is required. The application of the Great
Deluge Algorithm in examination timetabling problems has been investigated by Burke et al.
(2004a) and, Burke and Bykov (2006). A comparison of Great Deluge Algorithm and Simulated
Annealing applied to Carter et al.’s examination benchmark data sets, as reported by Burke et al.
(2004a), and Abdullah and Burke (2006), showed that, overall, Great Deluge Algorithm produced
better results than Simulated Annealing, although Great Deluge Algorithm did not produce better
results in all cases.
4.3. Tabu Search
Tabu Search has also been successfully applied to a wide range of educational timetabling
problems. With various problems definitions to deal with, a variant of Tabu Search setups was
employed to solve examination timetabling problems and course timetabling problems. Di
Gaspero and Schaerf (2001) investigated a family of Tabu Search algorithms applied the
algorithms to the examination timetabling benchmark data sets The experimental results showed
that “The most effective algorithm makes use of a shifting penalty mechanism, a variable-size
tabu list, a dynamic neighbourhood selection, and a heuristic initial state.”. In 2003, Di Gaspero
and Schaerf further enhanced the algorithm by incorporating a set of multi-neighbourhood
strategies to improve the performance of a local search method. The algorithm was applied to the
course timetabling problem, and the experimental results demonstrated that the enhanced
algorithm produced much better results compared to the old algorithm. For course timetabling, a
comparison between a combination of constraint logic with Tabu Search, constraint logic alone
and Tabu Search alone was studied by White and Zhang (1998). By employing constraint logic
to construct the initial solution and then applying Tabu Search to improve the initial solutions,
they showed that better solutions were produced compared to using constraint logic alone. They
also showed that the timetable could be constructed in much shorter time compared to employing
tabu search alone. White and Xie (2001) developed a Tabu Search algorithm which they called
OTTABU. Both types of adaptive memory (namely recency-based short term memory and
frequency-based longer term memory) were employed in order to avoid cycling with the aim of
improving the quality of solution(s). They applied a four phase system to construct examination
timetables for the University of Ottawa. It was found that better timetables were produced
compared to the timetable obtained without longer term memory. They also applied the algorithm
to two of Carter’s proximity cost benchmark data sets (namely CAR-F-92 and UTA-S-92 ). It
was observed that the algorithm demonstrated the same improvements (i.e. using longer term
memory produced better timetables) when applied to different problems (i.e. different problem
instances and different penalty cost). Later, White et al. (2004) extended this research by applying
the approach to twelve of Carter’s proximity cost benchmark data sets and comparing the
solutions to the results published by other researchers. The paper states that the performance of
the new algorithm was ‘favourable’.
4.4. Evolutionary Algorithms
Evolutionary Algorithms (EA) are motivated by the process of natural evolution (Holland, 1992).
The main feature of EAs is that they are population based. That is, a number of solutions are
maintained within the algorithm and new solutions are produced by combining or changing the
solutions in the current population with the aim of producing better solutions. Amongst the
popular EAs are Genetic Algorithm, Memetic Algorithm and Ant Colony Optimisation
8. Elizabeth Amudhini Stephen
http://www.iaeme.com/IJMET/index.asp 423 editor@iaeme.com
algorithms. Burke et al. (1994a,b) investigated GAs with a direct representation scheme that
considered both time slot allocations and room assignment for university timetabling. They
considered problems with non-fixed timetable lengths and their method only accepts feasible
timetables. Burke et al. (1995a) used GAs for examination timetabling with the objective of
minimising the number of time slots required. They compared eight selection heuristics for their
uniform crossover operators. Two of the heuristics were based on graph colouring heuristics (LD
and LCD); one was a random heuristic; and the remaining were specially designed heuristics that
highlighted the two constraints that needed to be addressed (i.e. the number of time slots and the
spread of the conflicting exams) either individually or combined. These heuristic crossover
operators were developed with the aim of avoiding infeasible timetables being produced during
the recombination process. The experimental results showed that good quality timetables might
be produced by integrating heuristics in crossover operators. Similar heuristic crossover operators
were successfully implemented by Burke et al. (1995b) for another set of more difficult
timetabling problems. Ross et al. (1998) discussed the effectiveness of direct representation for
GA implementations in exam timetabling problems. They suggested that a GA is more suitable
for finding a good algorithm instead of directly searching for the solutions for a particular
problem. Erben (2001) pointed out that the poor performance of GAs (compared to conventional
heuristic approaches) in graph colouring problems was primarily because of the inappropriate
selection of solution encoding schemes. As an alternative to direct representation, Erben applied
grouping GAs for graph colouring problems and exam timetabling problems. In grouping GAs,
a group of non-connected nodes (for graph colouring problems) or a group of non-conflicting
exams (for exam timetabling problems) is treated as one gene. The chromosome length
represented the graph chromatic number for graph colouring problems or the number of time slots
for exam timetabling problems. In order to generate feasible solutions, the hard and soft
constraints need to be incorporated in the crossover operator and mutation operator. Quite
encouraging results were obtained when this approach was applied to one of the capacitated
problems of Carter et al.’s benchmark data set.
4.5. Memetic Algorithms
The term ‘Memetic Algorithm’ was introduced by Moscato (1989) in a Technical Report which
described a heuristic which used “Simulated Annealing for local search with a competitive and
cooperative game between agents, interspersed with the use of a crossover operator”. Later,
Moscato and Norman (1992) went on to explain a similar approach that utilised local search
within a GA implementation. In Burke et al. (1996b), instead of using a crossover operator, a hill
climbing local search was performed after each mutation operation. Two types of mutation
operator were proposed, termed ‘light’ and ‘heavy’ mutation. A comparison with approaches that
merely relied on multi-start random descent local search showed that this approach obtained
better results for the Nottingham capacitated examination timetabling problem. However, they
also observed that further tests on more highly constrained problems (i.e. Carter et al.’s
capacitated examination timetabling benchmark problems) showed that this approach was
outperformed by their previous approach presented in Burke et al. (1995b). Despite this,
motivated by these quite promising results, an extended version of the approach was outlined by
Burke and Newall (1999). Although the focus of the paper was on heuristic decomposition of the
timetable problem, the results also showed that incorporating GAs with heuristic techniques and
local search approaches obtained better results than using the standard GA alone. More detailed
descriptions on the design of Memetic Algorithms for timetabling problems can be found in
Burke and Landa Silva (2004).
4.6. Ant Colony Optimisation
9. A Critical Review on the Optimization Methods in Solving Exam Timetabling and Scheduling
http://www.iaeme.com/IJMET/index.asp 424 editor@iaeme.com
Ant Colony Optimisation is another population based approach, introduced by Dorigo et al.
(1996). Initially, applications of Ant Colony Optimisation were focused on the Traveling
Salesman Problem (Dorigo and Gambardella, 1997; Dorigo et al., 1996). A study by Costa and
Hertz (1997) investigated the use of Ant Colony Optimisation in graph colouring problems in
which they called their ant system ANTCOL. Costa and Hertz stated that their results are quite
satisfactory although their results did not match the best results reported in the literature. Inspired
by the findings, Socha et al. (2002) used an Ant Colony Optimisation algorithm to construct
course timetables. The Ant Colony Optimisation approach was compared to other local search
techniques and it was found that Ant Colony Optimisation produced the best solutions. The basic
ANTCOL developed by Costa and Hertz (1997) was then modified and improved by Dowsland
and Thompson (2005). Instead of implementing the ant algorithm to random graphs (as
implemented by Costa and Hertz (1997)), Dowsland and Thompson applied their improved
ANTCOL to Carter et al.’s examination timetabling benchmark data sets with the aim of findings
the minimum number of time periods required to produce clash free timetables. Overall, the
improved ANTCOL has produced competitive results compared to the results obtained using the
sequential constructive algorithm developed by Carter et al. (1996) and Merlot et al. (2003) (see
hybrid approach below). Eley (2006) investigated the use of two ant colony approaches namely
MMAS-ET that based on Max-Min Ant System (MMAS) (as applied by Socha et al. (2002) to
examination timetabling) and ANTCOL-ET which is a modified version of ANTCOL (that
originally used by Costa and Hertz (1997) to solve graph colouring problem) to the Carter et al.’s
proximity cost benchmark problems. For both MMAS-ET and ANTCOL ET approaches,
additional hill climber is incorporated. The experimental results show that in average the
ANTCOL-ET with hill climber approach has produced better results compared to ANTCOL-ET
without hill climber, MMAS-ET with hill climber and MMAS-ET without hill climber. In
comparison the best results in literature, Eley’s results are comparable to the results obtained by
other approaches.
4.7. Hybrid Approaches
More recently, there has been much research into hybridised methods which draw on two or more
of the techniques mentioned above. In an implementation of the GRASP algorithm in
examination timetabling, Casey and Thompson (2003) observed that better solutions could be
produced by combining a limited form of Simulated Annealing with Kempe chain
neighbourhoods (Thompson and Dowsland, 1996) and a memory function that avoided exams
sharing the same time slot as in the previous iteration during the improvement phase. Azimi
(2005) developed a hybrid heuristic based on a combination of Tabu Search and Ant Colony
Optimisation. The author selected these two metaheuristic approaches to be combined based on
an earlier analysis comparing four metaheuristic approaches including Simulated Annealing,
Genetic Algorithms, Tabu Search and Ant Colony Optimisation. The analysis was carried out
with ten randomly generated examination timetabling data sets, and the well known proximity
cost penalty function was used to evaluate the timetable solutions. Azimi introduced three
different approaches to combine Tabu Search and Ant Colony Optimisation metaheuristics, and
the results showed that all the three hybrid heuristics outperformed all the metaheuristics applied
individually. The hybrid approach developed by Caramia et al. (2001) has produced several best
known results for the Carter et al.’s proximity cost benchmark problems for several data sets .
Their algorithm start with a greedy constructive heuristic and followed with an optimiser in the
attempts to spread out the students’ schedule. Caramia et al. also applied their algorithm to the
capacitated problem . Merlot et al. (2003) applied three-stage hybrid approach to a real-world
examination timetabling problem (i.e. for University of Melbourne) and the Carter et al.’s
examination timetabling benchmark data sets (graph colouring problem, uncapacitated problem
and capacitated problem). In the first stage, initial feasible solution is constructed using a
10. Elizabeth Amudhini Stephen
http://www.iaeme.com/IJMET/index.asp 425 editor@iaeme.com
constraint programming technique. The initial solution is improved using Simulated Annealing
in stage two, and in the final stage the solution is further improved by implementing a hill
climbing
method. In comparison to the best results in literature for the benchmark data sets, they
obtained competitive results for the graph colouring problem and uncapacitated problem, while
for the the capacitated problem they produced best results for several problem instances. A study
that investigated the hybridisation of large neighbourhood search and Tabu Search was presented
in Abdullah et al. (2006b). Experimental results showed that their solutions for the capacitated
problem were competitive to the best solutions reported in the literature; they obtained best results
for two out of the six data sets. Rahoual and Saad (2006) carried out work in which Genetic
Algorithms and Tabu Search were hybridised in an attempt to produce solutions for benchmark
and real world university course timetabling problems, with quite promising results. They
produced comparable results for the benchmark data sets, while for the real world data sets the
solutions were produced in just one hour compared to the three to four weeks required to prepare
solutions manually.
5. CONCLUSIONS AND FUTURE WORK
We have taken a case study of our University Exam Time tabling and we try to use all the above
methods. We also compare these methods to find out which is the best.
Furthermore, as a longer term goal, we plan to extend our application in the course timetabling
for the entire university which is a very big task. Finally, we are going to consider few other
methods for both exam and course time tabling to optimize the same
REFERENCES
[1] Abdullah, S. and Burke, E.K. (2006). A Multi-start Large Neighbourhood Search Approach
with Local Search Methods for Examination Timetabling. In
[2] Long, S.F. Smith, D. Borrajo and L. McCluskey, eds., The International Conference on
Automated Planning and Scheduling (ICAPS 2006), Cumbria, UK, 6-10 June 2006.,334–337.
[3] Azimi, Z.N. (2005). Hybrid Heuristics for Examination Timetabling Problem. Applied
Mathematics And Computation, 163, 705–733.
[4] Abdullah, S., Ahmadi, S., Burke, E.K., Dror, M. and McCollum, B. (2006b).
[5] Tabu-based Large Neighbourhood Search Methodology for the Capacitated
ExaminationTimetabling Problem. Journal of Operational Research Society, advance online
publication 13 September 2006.
[6] Broder, S. (1964). Final Examination Scheduling. Communications of the ACM, 7,494–498.
[7] Boizumault, P., Delon, Y. and Peridy, L. (1996). Constraint Logic Programming for
Examination Timetabling. The Journal of Logic Programming, 26, 217–233.
[8] Brailsford, S.C., Potts, C.N. and Smith, B.M. (1999). Constraint Satisfaction Problems:
Algorithms and Applications. European Journal of Operational Research, 119, 557–581.
[9] Burke, E.K. and Newall, J.P. (2004). Solving Examination Timetabling Problems through
Adaption of Heuristic Orderings. Annals of Operations Research, 129, 107–134.
[10] Burke, E.K., Kingston, J. and de Werra, D. (2004b). Applications to Timetabling. In J. Yellen
and J. Gross, eds., Handbook of Graph Theory., chap. 5.6,445–474, Chapman Hall,CRC
Press.
[11] Burke, E.K. and Petrovic, S. (2002). Recent Research Directions in Automated
Timetabling. European Journal of Operational Research, 140, 266–280.
[12] Burke, E.K. and Newall, J.P. (2004). Solving Examination Timetabling Problems through
Adaption of Heuristic Orderings. Annals of Operations Research, 129, 107–134.
11. A Critical Review on the Optimization Methods in Solving Exam Timetabling and Scheduling
http://www.iaeme.com/IJMET/index.asp 426 editor@iaeme.com
[13] Broder, S. (1964). Final Examination Scheduling. Communications of the ACM, 7,494–498.
[14] Brˇelaz, D. (1979). New Methods to Color the Vertices of A Graph. Communications of the
ACM, 22, 251–256.
[15] Burke, E.K., Newall, J.P. and Weare, R.F. (1998b). Initialisation Strategies and Diversity in
Evolutionary Timetabling. Evolutionary Computation Journal (special issue on Scheduling),
6, 81–103.
[16] Blum, C. and Roli, A. (2003). Metaheuristics in Combinatorial Optimization:Overview and
Conceptual Comparison. ACM Computing Surveys, 35, 268–308.
[17] Bullnheimer, B. (1997). An Examination Scheduling Model to Maximize Students’ Study
Time. In Burke and Carter (1998), 78–91.
[18] Burke, E. and Landa Silva, J. (2004). The Design of Memetic Algorithms for Scheduling and
Timetabling Problems. In W. Krasnogor N.and Hart and J. Smith,eds., Recent Advances in
Memetic Algorithms, Studies in Fuzziness and Soft Computing, vol. 166, 289–312, Springer.
[19] Burke, E.K. and Newall, J.P. (2004). Solving Examination Timetabling Problems through
Adaption of Heuristic Orderings. Annals of Operations Research, 129, 107–134.
[20] Burke, E.K. and Bykov, Y. (2006). Solving Exam Timetabling Problems with the Flex-
Deluge Algorithm. In Burke and Rudov´a (2006), 370–372.
[21] Burke, E.K., Bykov, Y., Newall, J. and Petrovic, S. (2004a). A Time-Predefined Local Search
Approach to Exam Timetabling Problems. IIE Transactions, 36, 509–528.
[22] Burke, E.K., Elliman, D.G. and Weare, R.F. (1994a). A Genetic Algorithm based University
Timetabling System. In Proceedings of the 2nd East-West
[23] International Conference on Computer Technologies in Education (Crimea, Ukraine, 19th-
23rd Sept 1994), vol. 1, 35–40.
[24] Burke, E.K., Elliman, D.G., Ford, P.H. and Weare, R.F. (1995a). Specialised Recombinative
Operators for the Timetabling Problem. In Proceedings of the AISB (Artificial Intelligence
and Simulation of Behaviour) Workshop on Evolutionary Computing (University of
Sheffield, UK, 3rd-7th April 1995), Lecture Notes in Computer Science, 75–85, Springer.
[25] Burke, E.K., Elliman, D.G. and Weare, R.F. (1995b). A Hybrid Genetic Algorithm for Highly
Constrained Timetabling Problems. In L. Eshelman, ed., Proceedings of the 6th International
Conference on Genetic Algorithms (ICGA’95, Pittsburgh, USA, 15th-19th July 1995), 605–
610, Morgan Kaufmann, San Francisco, CA, USA.
[26] Burke, E.K., Newall, J.P. and Weare, R.F. (1996b). A Memetic Algorithm for University
Exam Timetabling. In Burke and Ross (1996), 241–250.
[27] Cole, A.J. (1964). The Preparation of Examination Time-tables using a Small-store Computer.
The Computer Journal, 7, 117–121.
[28] Carter, M.W. and Laporte, G. (1996). Recent Development in Practical Examination
Timetabling. In Burke and Ross (1996), 3–21.
[29] Carter, M.W. and Johnson, D.G. (1999). The Use of Cliques in Examination Timetabling.
Research Series 1999:9, Loughborough University, Business School. Carter, M.W. and
Johnson, D.G. (2001). Extended Clique Initialisation in Examination Timetabling. Journal of
the Operational Research Society, 52, 538–544.
[30] Casey, S. and Thompson, J. (2003). GRASPing the Examination Scheduling Problem.In
Burke and Causmaecker (2003), 232–244.
[31] Costa, D. and Hertz, A. (1997). Ants Can Colour Graphs. Journal of the Operational Research
Society, 48, 295–305.
[32] Caramia, M., DellOlmo, P. and Italiano, G.F. (2001). New Algorithms for Examination
Timetabling. In S. Naher and D. Wagner, eds., Algorithm Engineering 4th Int. Workshop,
Proc. WAE 2000 (Saarbrucken, Germany, September), vol. 1982 of Lecture Notes in
Computer Science, 230–241, Springer, Berlin.
12. Elizabeth Amudhini Stephen
http://www.iaeme.com/IJMET/index.asp 427 editor@iaeme.com
[33] Dueck, G. (1993). New Optimization Heuristics: The Great Deluge Algorithm and the
Record-to-Record Travel. Journal of Computational Physics, 104, 86– 92.
[34] Dorigo, M. and Gambardella, L. (1997). Ant Colonies for the Traveling Salesman Problem.
Biosystems, 43, 73–81.
[35] Dorigo, M., Maniezzo, V. and Colorni, A. (1996). Ant System: Optimization by a Colony of
Cooperating Agents. IEEE Trans. on Systems, Man, and Cybernetics– Part B, 26, 29–41.
[36] Dowsland, K.A. and Thompson, J.M. (2005). Ant Colony Optimization for the Examination
Scheduling Problem. Journal of the Operational Research Society, 56, 426–438.
[37] Erben, W. (2001). A Grouping Genetic Algorithm for Graph Colouring and Exam
Timetabling. In Burke and Erben (2001), 132–158.
[38] Eley, M. (2006). Ant Algorithms for the Exam Timetabling Problem. In Burke and Rudov´a
(2006), 167–180.
[39] Foxley, E. and Lockyer, K. (1968). The Construction of Examination Timetables by
Computer. The Computer Journal, 11, 264–268.
[40] Glover, F. (1986). Future Paths for Integer Programming and Links to Artificial Intelligence.
Computers and Operations Research, 13, 533–549.
[41] Gendreau, A., Salvail, L. and Soriano, P. (1993). Solving the Maximum Clique Problem
Using a Tabu Search Approach. Annals of Operations Research, 41, 385–403.
[42] Glover, F. and Laguna, M. (1997). Tabu Search. Kluwer, Dordrecht.
[43] Hertz, A. (1991). Tabu Search for Large Scale Timetabling Problems. European Journal of
Operational Research, 54, 39–47. Holland, J.H. (1992). Adaptation in Natural and Artificial
Systems. MIT Press, Cambridge, MA, USA.
[44] Johnson, D. (1990). Timetabling University Examinations. Journal of Operational Research
Society, 41, 39–47.
[45] Joslin, D.E. and Clements, D.P. (1999). Squeaky Wheel Optimization. Journal of Artificial
Intelligence Research, 10, 353–373.
[46] Kirkpatrick, S., Gelatt, C.D. and Vecchi, M.P. (1983). Optimization by Simulated Annealing.
Science, 220, 671–680. Kiaer, L. and Yellen, J. (1992). Weighted Graphs and University
Course Timetabling. Computers and Operations Research, 19, 59–67.
[47] Laporte, G. and Desroches, S. (1984). Examination Timetabling by Computer. Computers
and Operations Research, 11, 351–360.
[48] Mehta, N.K. (1981). The Application of a Graph Coloring Method to an Examination
Scheduling Problem. INTERFACES, 11, 57–65.
[49] Merlot, L.T.G., Boland, N., Hughes, B.D. and Stuckey, P.J. (2003). A Hybrid Algorithm for
Examination Timetabling Problem. In Burke and Causmaecker (2003), 207–231.
[50] Moscato, P. and Norman, M.G. (1992). A Memetic Approach for the Traveling Salesman
Problem Implementation of a Computational Ecology for Combinatorial Optimization on
Message-Passing Systems. In M. Valero, E. Onate, M. Jane, J.L. Larriba and B. Suarez, eds.,
Parallel Computing and Transputer Applications, 177–186, IOS Press, Amsterdam.
[51] Osman, I.H. and Kelly, J.P., eds. (1996). Metaheuristics: Theory and Applications. Kluwer,
Dordrecht. Ross, P., Hart, E. and Corne, D. (1998). Some Observations about GA-Based
Exam Timetabling. In Burke and Carter (1998), 115–129.
[52] Rahoual, M. and Saad, R. (2006). Solving Timetabling Problems by Hybridizing Genetic
Algorithms and Tabu Search. In Burke and Rudov´a (2006), 467–472.
[53] Schaerf, A. and Di Gaspero, L. (2001). Local Search Techniques for Educational Timetabling
Problems. In L. Lenart, L. Stirn Zadnik and S. Drobne, eds., Proceedings of the 6th
International Symposium on Operational Research (SOR-01), Preddvor, Slovenia., 13–23.
[54] Socha, K., Knowles, J. and Sampels, M. (2002). A MAX- MIN Ant System for the University
Timetabling Problem. In M. Dorigo, G. Di Caro and M. Sampels, eds.,Proceedings of ANTS
13. A Critical Review on the Optimization Methods in Solving Exam Timetabling and Scheduling
http://www.iaeme.com/IJMET/index.asp 428 editor@iaeme.com
2002 - Third International Workshop on Ant Algorithms, vol.2463 of Lecture Notes in
Computer Science, 1–13, Springer, Berlin, Germany.
[55] Thompson, J.M. and Dowsland, K.A. (1996). General Cooling Schedules for a Simulated
Annealing Based Timetabling System. In Burke and Ross (1996), 345–363. Thompson, J.M.
and Dowsland, K.A. (1998). A Robust Simulated Annealing Based Examination Timetabling
System. Computers & Operations Research, 25, 637–648.
[56] Vo_, S., Martello, S., Osman, I.H. and Roucairol, C., eds. (1999). Meta-Heuristics: Advances
and Trends in Local Search Paradigms for Optimization. Kluwer, Boston. Wren, A. (1996).
Scheduling, Timetabling and Rostering - A Special Relationship?. In Burke and Ross (1996),
46–75.
[57] Welsh, D.J.A. and Powell, M.B. (1967). An Upper Bound for the Chromatic Number of a
Graph and its Application to Timetabling Problems. The Computer Journal, 10, 85–86.
[58] Wood, D.C. (1968). A System for Computing University Examination Timetables. The
Computer Journal, 11, 41–47.
[59] Wood, D.C. (1969). A Technique for Colouring a Graph Applicable to Large Scale
Timetabling Problems. The Computer Journal, 12, 317–319.
[60] White, G.M. and Zhang, J. (1998). Generating Complete University Timetables by
Combining Tabu Search with Constraint Logic. In Burke and Carter (1998), 187–200. White,
G.M. and Xie, B.S. (2001). Examination Timetables and Tabu Search with Longer-Term
Memory. In Burke and Erben (2001), 85–103.
[61] White, G.M., Xie, B.S. and Zonjic, S. (2004). Using Tabu Search with Longer- Term Memory
and Relaxation to Create Examination Timetables. European Journal of Operational Research,
153, 80–91.