- Felipe de la Rosa-Rivera, José I. Nuñez-Varela, César Augusto Puente Montejano, Sandra Edith Nava-Muñoz. Measuring the complexity of university timetabling instances. J. Scheduling, 24(1):103-121, 2021.
- Xin Li, José A. Ventura, Kevin A. Bunn. A joint order acceptance and scheduling problem with earliness and tardiness penalties considering overtime. J. Scheduling, 24(1):49-68, 2021.
- Christos Koulamas, George Steiner. New results for scheduling to minimize tardiness on one machine with rejection and related problems. J. Scheduling, 24(1):27-34, 2021.
- Alexandre Lemos, Pedro T. Monteiro, Inês Lynce. Disruptions in timetables: a case study at Universidade de Lisboa. J. Scheduling, 24(1):35-48, 2021.
- Inna G. Drobouchevitch. Three-machine open shop with a bottleneck machine revisited. J. Scheduling, 24(2):197-208, 2021.
- Mostafa Khatami, Amir Salehipour. Coupled task scheduling with time-dependent processing times. J. Scheduling, 24(2):223-236, 2021.
- Michal Penn, Tal Raviv. Complexity and algorithms for min cost and max profit scheduling under time-of-use electricity tariffs. J. Scheduling, 24(1):83-102, 2021.
- Dimitrios Letsios, Jeremy T. Bradley, Suraj G, Ruth Misener, Natasha Page. Approximate and robust bounded job start scheduling for Royal Mail delivery offices. J. Scheduling, 24(2):237-258, 2021.
- Alexander Grigoriev, Vincent J. C. Kreuzen, Tim Oosterwijk. Cyclic lot-sizing problems with sequencing costs. J. Scheduling, 24(2):123-135, 2021.
- Edmund K. Burke. Editorial: Journal of Scheduling (2020). J. Scheduling, 24(1):1-2, 2021.