No abstract

No abstract

Course scheduling problem (CSP) is concerned with developing a timetable that illustrates a number of courses assigned to the classrooms. In this study, a hybrid algorithm composed of a heuristic graph node coloring (GNC) algorithm and artificial bee colony (ABC) algorithm is proposed to solve CSP. The study is one of the few applications of ABC on discrete optimization problems and to our best knowledge it is the first application on CSP. A basic heuristic algorithm of node coloring problem takes part initially to develop some feasible solutions of CSP. Those feasible solutions correspond to the food sources in ABC algorithm. The ABC is then is used to improve the feasible solutions. The employed and onlooker bees are directed or controlled in a specific manner in order to avoid the conflicts in the course timetable. Proposed solution procedure is tested using real data from a university in Turkey. The experimental results demonstrate that the proposed hybrid algorithm yields efficient solutions.

In industrialization, to be able to make cheap and fast production, assembly lines are one of the most basic elements in serial production systems. It is important to balance the assembly line to continue production smoothly. By assembly line balancing is created, each work step is grouped, stations are created and each station time is brought close to the station cycle times. In this study, a refrigerator top panel pressing line is analysed. The study's aim is balancing the line for increase production rate. Firstly, the line is observed and some studies are planned. A time study is done to analyse the current situation of the line. Time study data are calculated by using Excel. Ranked Positional Weight Method is used as an intuitive method for single model U type assembly line balancing problem and mathematical modelling method is applied. The methods are used to balance the line using time study data. The solution of mathematical modelling is obtained by using Lingo. Results are compared and they are observed that results have almost the same. In conclusion, an assembly line balancing problem is mentioned in this study. Various programs related to the applied methods were used, and the data obtained as a result of current and final calculations were compared. First and last calculations and results are verified with each other. It was seen that the data obtained as a result of the study provided improvement.

No abstract