The paper discusses the organization of the International Timetabling Competition (ITC 2019), which intends to motivate further research on complex university course timetabling problems coming from practice. Thanks to the UniTime timetabling …

Spatiotemporal scheduling of the block assembly process in shipbuilding is to determine temporal information including a time period when each block is under assembly and spatial information including an assigned bay and the placement of the block …

We consider the medical student scheduling (MSS) problem, which consists of assigning medical students to internships of different disciplines in various hospitals during the academic year to fulfill their educational and clinical training. The …

Examination timetabling is a problem well known to the scheduling community. Its simplest version, which is the uncapacitated examination timetabling problem, is easily described and comprehended. Nevertheless, proof of optimality is notoriously …

This work addresses a home health care scheduling problem faced by home care agencies. In home health care scheduling, there is a desire to retain consistency with respect to the home health aide servicing each patient; this consistency is …

We propose a multi-neighbourhood simulated annealing algorithm for the ITC-2007 version of the capacitated examination timetabling problem. The proposed solver is based on a combination of existing as well as newly proposed neighbourhoods that …

Automated guided vehicles (AGVs) are driverless robotic vehicles that pick up and deliver materials. Finding ways to improve efficiency while preventing deadlocks is a core issue in designing AGV systems. In this paper, we propose an approach to …

We study the single-machine primary–secondary scheduling problems in which the total tardiness is the primary criterion and the secondary criteria are the maximum lateness, the (weighted) number of tardy jobs, and the total weighted tardiness …

Car mass production commonly involves a moving assembly line that mixes several car models. This requires plenty of material supplies at the line side, but available space is scarce. Thus, material is placed apart from ideal positions. Then …

We study scheduling problems with periodic availability constraints. Each machine is periodically unavailable due to routine arrangements or regular maintenance. The availability periods and unavailability periods, each with the same duration …

This paper presents new mixed-integer linear programming formulations for multi-activity shift scheduling problems (MASSP). In these formulations, the rules governing shift feasibility are encoded in block-based state-expanded networks in which …

We present an improved analysis of the running time of a dynamic program for the routing flow shop problem with two machines on an asymmetric network. Our analysis is based on structural properties of optimal schedules and significantly improves …

Minimizing the weighted completion time of jobs in the unrelated parallel machines model is a fundamental scheduling problem. The first $$(3/2 - c)$$ ( 3 / 2 - c ) –approximation algorithm for this problem, for some constant $$c > 0$$ c > 0 , was …

In this paper, we study scheduling with step-learning, i.e., a setting where the processing times of the jobs started after their job-dependent learning-dates are reduced. The goal is to minimize makespan on a single machine. We focus first on the …

We study two scheduling problems in a proportionate flow shop environment, where job processing times are machine independent. In contrast to classical proportionate flow shop models, we assume (in both problems) that processing times are …