Isra Natheer Alkallak

@uomosul.edu.iq

University of Mosul

4

Scopus Publications

Scopus Publications

  • Establishing a cyclic schedule for nurse in the health unit
    Isra Natheer Alkallak, Ruqaya Sha’ban
    International Journal of Electrical and Computer Engineering, 2022
    <p><span>This research presents the interleaving two approaches. These are intelligence's ideas as well as heuristic ‎technique as 8-puzzle and sudoku grid to solve the nurse rostering. The research proposed algorithm ‎to assign shifts cyclically. It is considered by three shifts in one day to 9 nurses, each nurse has 8 days work with ‎a holiday in the cyclically scheduling. The task appeared the allocation of nursing staff in health unit management ‎theoretically. There are three shifts which cover 24 hours. The shifts are early, late, and night. This algorithm ‎simulated the shifts through the directions of blank’s move in 8-puzzle with the methodology of sudoku grid with ‎hard constraints should be met at all times. In our solution do on two goals first, we create a ‎schedule that meets all the tough constraints and guarantees fairness. The second objective is to try to verify as many ‎of the soft constraints as possible, by shifting and rotating while maintaining the soft constraints. The approach ‎was implemented as a simulation, and a satisfactory result was demonstrated. experimental effects are extremely ‎convenient and versatile to find appropriate nursing rostering schedule, rather than using manual techniques. The code developed to simulate it in MATLAB.‎</span></p>
  • Intelligent university timetable scheduling system using sudoku grid with magic square
    Isra Natheer Alkallak, Ruqaya Zedan Shaban, Yazen Hudhaifa Shakir Alnema
    Bulletin of Electrical Engineering and Informatics, 2022
    Examination timetabling is problem faced by many academic educational institutions. The situation formulated as artificial intelligence problems as Sudoku grid with Magic square. Problem assigning a set of examinations to a fixed number of examination periods so that no student is required to take more than one examination at a time. The research describes two proposed heuristic algorithms to create university examination timetabling and avoiding the overlapping of exams. We proposed two algorithms, the first algorithm is based on Sudoku grid, a number of hard constraints as well as a number of soft constraints are proposed. We assigned exams as 9 to period as 27 slot times and to 3 rooms, with 3 classes. Each student in each class takes 9 exams While, the second algorithm simulates the classic manual methods while observing the hard and soft constraints of the problem. The heuristic approach used to further optimize the result to include hard constraints with soft. The proposed methodology for creating the Exam timetabling problem has been implemented in Matlab and closing the gap between classical methods and intelligent methods. The results obtained with very less computational effort through two algorithms.
  • Organizing sports matches with a hybrid monkey search algorithm
    Ruqaya Zedan Shaban, Isra Natheer Alkallak
    Indonesian Journal of Electrical Engineering and Computer Science, 2021
    This academic piece of the paper illustrates an approach of organizing sports matches to be as a tool of sports schedule maker via a proposed hybrid Monkey search algorithm by doubles elimination tournament. Input are a set of teams represented by monkeys. It states that the natural behavior of monkeys and its climbing to obtain (solution) through uphill (climbing), watch-jumping, and somersault process. The parameters in the climb were represented by whether or not sports team won. The distribution of the teams, whether in the upper or the lower half, represented in the watch-jumping by mathematical equations, in addition to representing the variables in somersault process. The consequences behind the suggested algorithm used have tackled steps to reach an optimal schedule for a variety of teams for the same championship. The team cannot play more than two consecutive matches with the condition of starting with a random population of feasible solutions. The performance of the presented algorithm was very well through providing a flexible and easy organization of sports matches without using classic or manual routine. Furthermore, the search space reduced so that can give a guarantee to achieve a globally optimum solution. The software platform was MATLAB m-files.
  • A proposed hybrid algorithm for constructing knight tour problem by sudoku grid
    Journal of Advanced Research in Dynamical and Control Systems, 2018