- Leah Epstein, Asaf Levin. Semi-online models for cardinality constrained bin packing. J. Scheduling, 29(1):51-66, February 2026.
- Martina Doneda, Pieter Smet, Giuliana Carello, Ettore Lanzarone, Greet Vanden Berghe. Robust personnel rostering: How accurate should absenteeism predictions be?. J. Scheduling, 29(1):67-82, February 2026.
- Maciej Koszykowski, Witold Orzeszko. Machine learning in project schedule creation: a systematic literature review. J. Scheduling, 29(1):21-38, February 2026.
- Elín Björk Böðvarsdóttir, Thomas J. R. Stidsen. A review of multi-objective optimization methods for personnel rostering problems. J. Scheduling, 29(1):1-19, February 2026.
- Nicholas G. Hall, Marc E. Posner. Resource leveling with subcontracting: algorithms and complexity. J. Scheduling, 29(1):39-50, February 2026.
- Tessa Borgonjon, Broos Maenhout. A study of different preemption types to facilitate the recovery of personnel task schedules. J. Scheduling, 29(1):83-109, February 2026.
- Jakob Snauwaert, Mario Vanhoucke. A solution framework for multi-skilled project scheduling problems with hierarchical skills. J. Scheduling, 28(3):289-310, June 2025.
- Fangfang Cao, Tom Servranckx, Zhengwen He, Mario Vanhoucke. A buffer allocation evolutionary algorithm for resource-constrained projects with activity clusters. J. Scheduling, 28(5):483-511, October 2025.
- Pasquale Avella, Maurizio Boccia, Carlo Mannino, Michele Mele, Sandro Viglione. A cut-and-branch algorithm for the external candidates examination scheduling problem. J. Scheduling, 28(6):577-584, December 2025.
- Angelos Dimitsas, Christos Gogos, Christos Valouxis, Vasileios Nastos, Panayiotis Alefragis. A proven optimal result for a benchmark instance of the uncapacitated examination timetabling problem. J. Scheduling, 28(2):183-194, April 2025.