Journal of Scheduling

Papers
(The median citation count of Journal of Scheduling is 2. 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-08-01 to 2026-08-01.)
ArticleCitations
A faster fully polynomial time approximation scheme for proportionate flow shop scheduling with step-deteriorating processing times43
Robust personnel rostering: How accurate should absenteeism predictions be?18
Correction: Computational complexity and exact techniques for scheduling problems with job prohibitions12
A quest for a fair schedule: The International Young Physicists’ Tournament12
Optimal energy scheduling under time-of-use tariffs11
A graphical evaluation and review technique for scheduling construction projects11
Real-world university course timetabling at the International Timetabling Competition 201911
Flow shops with reentry: The total weighted completion time objective10
Preface: the practice and theory of automated timetabling (2022)10
Single-machine scheduling with rejection and controllable processing times to maximize profit under a makespan constraint9
Designing a long-term master surgical timetable: a case study in balancing post-operative ward bed demand and minimizing changes in surgical schedules9
Approximation algorithms for scheduling monotonic moldable tasks on multiple platforms9
Complexity of scheduling few types of jobs on related and unrelated machines8
Scheduling of Earth observing satellites using distributed constraint optimization8
Resource leveling with subcontracting: algorithms and complexity7
Scheduling with non-renewable resources: minimizing the sum of completion times7
An improved approximation algorithm for a scheduling problem with transporter coordination7
Task assignments with rotations and flexible shift starts to improve demand coverage and staff satisfaction in healthcare7
Well-behaved online load balancing against strategic jobs7
In memoriam Gerhard Woeginger7
A cut-and-branch algorithm for the external candidates examination scheduling problem7
An exact solution with an improved running time for the routing flow shop problem with two machines6
Scheduling cool jobs when processing heats them6
Hybrid-sched: a QoS adaptive offline–online scheduler for real-time tasks on multi-cores6
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 problem6
On variants of a load-balancing problem with unit-load jobs5
Serial batching to minimize the weighted number of tardy jobs5
Launching drones from a vessel: routing unmanned aerial vehicles from a linearly moving depot5
A study of different preemption types to facilitate the recovery of personnel task schedules5
Continuity of care in home health care scheduling: a rolling horizon approach5
Minimizing the expected waiting time of emergency jobs5
Reentrant permutation flow shop problems: definitions and heuristics5
A hybrid approach for the dynamic flexible job shop scheduling problem considering machine failures5
The price of anarchy for a berth allocation game4
Online integrated production–transportation in a make-to-order environment4
Semi-online models for cardinality constrained bin packing4
A note on the shifting bottleneck procedure for job shop scheduling4
Mixed-model moving assembly line material placement optimization for a shorter time-dependent worker walking time4
A parallel ruin and recreate heuristic for personnel scheduling in a flexible working environment4
Minimizing maximum late work with optional job rejection on a single machine4
Equitable scheduling on a single machine4
Scheduling of e-commerce packaging machines: blocking machines and their impact on the performance–waste tradeoff4
A Tepid-Aware container scheduler for serverless computing environments targeting throughput and energy efficiency3
Scheduling web banner advertisements with conflicts and time windows: a column generation-based solution approach3
A multivariate complexity analysis of the material consumption scheduling problem3
Recoverable robust single machine scheduling with polyhedral uncertainty3
Network routing on regular digraphs and their line graphs3
Optimally designing chemotherapy scheduling with discrete dosing3
Joint replenishment meets scheduling3
Scheduling periodic messages on a shared link without buffering3
A buffer allocation evolutionary algorithm for resource-constrained projects with activity clusters3
Exact methods for the time frame rostering problem in the context of tram driver rostering3
Scheduling to maximize the weighted number of on-time jobs on parallel machines with bounded job-rejection3
A Mission planning algorithm inspired by temporal difference learning for minimizing Makespan3
Limited integrated production scheduling and vehicle routing in the steel industry3
Sustainable scheduling for a flexible job shop considering batch processing and batch transportation strategies3
Single-machine two-agent scheduling with a rate-modifying activity and weighted due-date-related functions2
Single-machine and flow-shop scheduling with supporting tasks in a nested structure2
Single machine rescheduling for new orders with maximum and total time disruption constraints2
Correction to: Exact methods for the time frame rostering problem in the context of tram driver rostering2
Scheduling a pick and place packaging line2
Resource leveling: complexity of a unit execution time two-processor scheduling variant and related problems2
Scheduling with periodic availability constraints to minimize makespan2
A polynomial-time dynamic programming algorithm for an optimal picking problem in automated warehouses2
Preemptive scheduling of parallel jobs of two sizes with controllable processing times2
Exact algorithms and approximation schemes for proportionate flow shop scheduling with step-deteriorating processing times2
Scheduling the repair and replacement of individual components in operating systems: a bi-objective mathematical optimization model2
Polynomial-time solutions for minimizing total load on unrelated machines with position-dependent processing times and rate-modifying activities2
Mathematical challenges in scheduling theory2
0.2296040058136