Scheduling and Timetabling Solutions

In this work, we address a real-life course timetabling problem that incorporates several practical academic requirements, including the chronological precedence of theoretical sessions over practical ones, the enforcement of rest periods for lecturers, and the simultaneous assignment of lecturers and teaching assista…

In this work, we address a real-life course timetabling problem that incorporates several practical academic requirements, including the chronological precedence of theoretical sessions over practical ones, the enforcement of rest periods for lecturers, and the simultaneous assignment of lecturers and teaching assista…

The Job Shop Scheduling Problem (JSSP) is commonly represented as a disjunctive graph in which nodes denote operations, while edges encode technological precedence constraints and machine‐sharing conflicts. Most existing deep reinforcement learning (DRL) approaches model this graph as homogeneous by merging precedence…

Özet henüz yok.

This paper presents a three-stage mixed-integer programming (MIP) model for addressing the complex examination timetabling problem faced by 12 departments within a faculty. The first stage focuses on assigning days and time slots, the second stage allocates rooms, and the third stage assigns invigilators. Unlike tradi…

Özet henüz yok.

Bibliometric analysis results evaluate the development of a field by examining publications, citations, and other metrics in scientific literature. Trends in the literature, important authors and the general development of the relevant field can be understood from the analysis results. In this research, all fuzzy job…

Healthcare staff scheduling is a complex combinatorial optimisation problem involving conflicting operational and workforce sustainability objectives. Traditional models typically enforce meeting managerial requirements with hard constraints while treating employee-related considerations such as fairness, workload bal…

Özet henüz yok.

One of the key drivers for the attractiveness of a football match or tournament is the level of competitiveness, as spectator interest increases when the outcome is unpredictable. In this study, we introduce a new metric, competitive difference, to quantify this attractiveness and propose a new scheduling model for ro…

This research is the first to introduce a mathematical model for hybrid workforce scheduling with a focus on enhancing in-person interaction. By integrating organizational requirements and individual preferences, it provides a framework that can be tailored to different institutional needs, offering a valuable tool to…

University examination timetabling is NP-hard and is usually studied under two assumptions that fail here: fixed time slots and one exam per room. Exams last 60, 120, or 180 minutes, rooms host several back-to-back within a working day, and about half the dataset outgrows any single room. We reformulate it as interval…

• MUSTAFA KAYA