OOIR: Observatory of International Research

Papers

(The TQCC of Journal of Scheduling is 4. The table below lists those papers that are above that threshold based on CrossRef citation counts [max. 250 papers]. The publications cover those that have been published in the past four years, i.e., from 2022-06-01 to 2026-06-01.)

Article	Citations
A faster fully polynomial time approximation scheme for proportionate flow shop scheduling with step-deteriorating processing times	42
Robust personnel rostering: How accurate should absenteeism predictions be?	25
Correction: Computational complexity and exact techniques for scheduling problems with job prohibitions	16
A quest for a fair schedule: The International Young Physicists’ Tournament	13
A graphical evaluation and review technique for scheduling construction projects	11
Optimal energy scheduling under time-of-use tariffs	11
Flow shops with reentry: The total weighted completion time objective	10
Real-world university course timetabling at the International Timetabling Competition 2019	9
Approximation algorithms for scheduling monotonic moldable tasks on multiple platforms	9
Preface: the practice and theory of automated timetabling (2022)	9
Single-machine scheduling with rejection and controllable processing times to maximize profit under a makespan constraint	8
Designing a long-term master surgical timetable: a case study in balancing post-operative ward bed demand and minimizing changes in surgical schedules	8
Complexity of scheduling few types of jobs on related and unrelated machines	8
Scheduling with non-renewable resources: minimizing the sum of completion times	8
Scheduling of Earth observing satellites using distributed constraint optimization	8
Task assignments with rotations and flexible shift starts to improve demand coverage and staff satisfaction in healthcare	7
An improved approximation algorithm for a scheduling problem with transporter coordination	7
Resource leveling with subcontracting: algorithms and complexity	7
Well-behaved online load balancing against strategic jobs	7
In memoriam Gerhard Woeginger	7
Hybrid-sched: a QoS adaptive offline–online scheduler for real-time tasks on multi-cores	6
Selection hyper-heuristics and job shop scheduling problems: How does instance size influence performance?	6
A hybrid local search algorithm for the continuous energy-constrained scheduling problem	6
An exact solution with an improved running time for the routing flow shop problem with two machines	6
A cut-and-branch algorithm for the external candidates examination scheduling problem	6

A study of different preemption types to facilitate the recovery of personnel task schedules	5
Reentrant permutation flow shop problems: definitions and heuristics	5
Minimizing the expected waiting time of emergency jobs	5
On variants of a load-balancing problem with unit-load jobs	5
A fix-and-optimize heuristic for the ITC2021 sports timetabling problem	5
A note on the shifting bottleneck procedure for job shop scheduling	5
Scheduling cool jobs when processing heats them	5
A hybrid approach for the dynamic flexible job shop scheduling problem considering machine failures	5
Continuity of care in home health care scheduling: a rolling horizon approach	5
Serial batching to minimize the weighted number of tardy jobs	5
The price of anarchy for a berth allocation game	4
A parallel ruin and recreate heuristic for personnel scheduling in a flexible working environment	4
Equitable scheduling on a single machine	4
Online integrated production–transportation in a make-to-order environment	4
Scheduling of e-commerce packaging machines: blocking machines and their impact on the performance–waste tradeoff	4
Mixed-model moving assembly line material placement optimization for a shorter time-dependent worker walking time	4
Semi-online models for cardinality constrained bin packing	4