OOIR: Observatory of International Research

Papers

(The median citation count of Journal of Scheduling is 1. 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
Optimal energy scheduling under time-of-use tariffs	11
A graphical evaluation and review technique for scheduling construction projects	11
Flow shops with reentry: The total weighted completion time objective	10
Preface: the practice and theory of automated timetabling (2022)	9
Real-world university course timetabling at the International Timetabling Competition 2019	9
Approximation algorithms for scheduling monotonic moldable tasks on multiple platforms	9
Scheduling with non-renewable resources: minimizing the sum of completion times	8
Scheduling of Earth observing satellites using distributed constraint optimization	8
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
In memoriam Gerhard Woeginger	7
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
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
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

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
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
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
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
A multivariate complexity analysis of the material consumption scheduling problem	3
Joint replenishment meets scheduling	3
Network routing on regular digraphs and their line graphs	3
Scheduling with periodic availability constraints to minimize makespan	3
Scheduling the repair and replacement of individual components in operating systems: a bi-objective mathematical optimization model	3
Simulated annealing with penalization for university course timetabling	3
Scheduling web banner advertisements with conflicts and time windows: a column generation-based solution approach	3
A Mission planning algorithm inspired by temporal difference learning for minimizing Makespan	3
Scheduling periodic messages on a shared link without buffering	3
Sustainable scheduling for a flexible job shop considering batch processing and batch transportation strategies	3
Limited integrated production scheduling and vehicle routing in the steel industry	3
Exact methods for the time frame rostering problem in the context of tram driver rostering	3
Scheduling to maximize the weighted number of on-time jobs on parallel machines with bounded job-rejection	3
Advances in the practice and theory of automated timetabling	3
Recoverable robust single machine scheduling with polyhedral uncertainty	3
A buffer allocation evolutionary algorithm for resource-constrained projects with activity clusters	3
Mathematical challenges in scheduling theory	2
Single-machine and flow-shop scheduling with supporting tasks in a nested structure	2
A polynomial-time dynamic programming algorithm for an optimal picking problem in automated warehouses	2
Single-machine two-agent scheduling with a rate-modifying activity and weighted due-date-related functions	2
Polynomial-time solutions for minimizing total load on unrelated machines with position-dependent processing times and rate-modifying activities	2
Resource leveling: complexity of a unit execution time two-processor scheduling variant and related problems	2
Scheduling a pick and place packaging line	2
Preemptive scheduling of parallel jobs of two sizes with controllable processing times	2
Single machine rescheduling for new orders with maximum and total time disruption constraints	2
Correction to: Exact methods for the time frame rostering problem in the context of tram driver rostering	2
Exact algorithms and approximation schemes for proportionate flow shop scheduling with step-deteriorating processing times	2
A constructive branch-and-bound algorithm for the project duration problem with partially renewable resources and general temporal constraints	1
Local search and trajectory metaheuristics for the flexible job shop scheduling problem with nonlinear routes and position-based learning	1
A solution framework for multi-skilled project scheduling problems with hierarchical skills	1
Quick and situ-aware spatiotemporal scheduling for shipbuilding manufacturing	1
Packing-based branch-and-bound for discrete malleable task scheduling	1
Approximating weighted completion time via stronger negative correlation	1

Fixed-parameter tractability of scheduling dependent typed tasks subject to release times and deadlines	1
A scheduling game on parallel batch machines with setup cost	1
Special Issue on papers from the 2019 Workshop on Models and Algorithms for Planning and Scheduling Problems	1
Block-based state-expanded network models for multi-activity shift scheduling	1
Learning to enumerate shifts for large-scale flexible personnel scheduling problems	1
Lower bounds for online scheduling on four processors	1
Exact and metaheuristic methods for a real-world examination timetabling problem	1
The preemptive resource allocation problem	1
Investigating constraint programming and hybrid methods for real world industrial test laboratory scheduling	1
Tight approximation bounds for the LPT rule applied to identical parallel machines with small jobs	1
A review and classification of scheduling objectives in unpaced flow shops for discrete manufacturing	1
Branch-cut-and-price for open-shop scheduling problems with any regular minsum objective	1
Graph representation of the fixed route dial-a-ride problem	1
Multiprocessor scheduling with testing: improved online algorithms and numerical experiments	1
The (a)social exam invigilator assignment problem	1
Integrated break and carryover effect minimization	1
Scheduling a single machine with multiple due dates per job	1
Editorial: Journal of Scheduling (2023)	1
Minimizing the earliness–tardiness for the customer order scheduling problem in a dedicated machine environment	1