Journal of Scheduling

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 2021-06-01 to 2025-06-01.)
ArticleCitations
Scheduling computations with provably low synchronization overheads27
The flexibility of home away pattern sets26
An efficient model-based branch-and-price algorithm for unrelated-parallel machine batching and scheduling problems21
A graphical evaluation and review technique for scheduling construction projects19
A quest for a fair schedule: The International Young Physicists’ Tournament18
Single-machine scheduling with resource-dependent processing times and multiple unavailability periods17
Real-world university course timetabling at the International Timetabling Competition 201917
Complexity of scheduling few types of jobs on related and unrelated machines13
Scheduling of Earth observing satellites using distributed constraint optimization13
Preface: the practice and theory of automated timetabling (2022)12
Task assignments with rotations and flexible shift starts to improve demand coverage and staff satisfaction in healthcare10
Approximation algorithms for scheduling monotonic moldable tasks on multiple platforms10
In memoriam Gerhard Woeginger8
An improved approximation algorithm for a scheduling problem with transporter coordination8
Scheduling with non-renewable resources: minimizing the sum of completion times8
Well-behaved online load balancing against strategic jobs7
A hybrid local search algorithm for the continuous energy-constrained scheduling problem7
Hybrid-sched: a QoS adaptive offline–online scheduler for real-time tasks on multi-cores7
An exact solution with an improved running time for the routing flow shop problem with two machines7
Introducing UniCorT: an iterative university course timetabling tool with MaxSAT7
A cut-and-branch algorithm for the external candidates examination scheduling problem7
Selection hyper-heuristics and job shop scheduling problems: How does instance size influence performance?7
A fix-and-optimize heuristic for the ITC2021 sports timetabling problem6
Plant shutdown maintenance workforce team assignment and job scheduling6
Serial batching to minimize the weighted number of tardy jobs6
On variants of a load-balancing problem with unit-load jobs5
Minimizing the expected waiting time of emergency jobs5
Routing two stacking cranes with predetermined container sequences5
Project scheduling in a lean environment to maximize value and minimize overruns5
A reinforcement learning algorithm for rescheduling preempted tasks in fog nodes5
A general scheme for solving a large set of scheduling problems with rejection in FPT time5
Continuity of care in home health care scheduling: a rolling horizon approach5
A note on the shifting bottleneck procedure for job shop scheduling5
Online scheduling to minimize total weighted (modified) earliness and tardiness cost5
Simulated annealing with penalization for university course timetabling4
Joint replenishment meets scheduling4
Equitable scheduling on a single machine4
Tabu search for a parallel-machine scheduling problem with periodic maintenance, job rejection and weighted sum of completion times4
Calibrations scheduling with arbitrary lengths and activation length4
A parallel ruin and recreate heuristic for personnel scheduling in a flexible working environment4
Scheduling of e-commerce packaging machines: blocking machines and their impact on the performance–waste tradeoff4
The price of anarchy for a berth allocation game4
A multivariate complexity analysis of the material consumption scheduling problem4
Scheduling to maximize the weighted number of on-time jobs on parallel machines with bounded job-rejection4
Mixed-model moving assembly line material placement optimization for a shorter time-dependent worker walking time4
Optimizing rest times and differences in games played: an iterative two-phase approach4
Advances in the practice and theory of automated timetabling3
Scheduling periodic messages on a shared link without buffering3
Local search approaches for the test laboratory scheduling problem with variable task grouping3
Scheduling the repair and replacement of individual components in operating systems: a bi-objective mathematical optimization model3
An analysis of the parameterized complexity of periodic timetabling3
Maximizing barrier coverage lifetime with static sensors3
Recoverable robust single machine scheduling with polyhedral uncertainty3
Scheduling with periodic availability constraints to minimize makespan3
A polynomial-time dynamic programming algorithm for an optimal picking problem in automated warehouses3
Network routing on regular digraphs and their line graphs3
A buffer allocation evolutionary algorithm for resource-constrained projects with activity clusters3
Single machine rescheduling for new orders with maximum and total time disruption constraints3
Resource leveling: complexity of a unit execution time two-processor scheduling variant and related problems3
A memetic algorithm to address the multi-node resource-constrained project scheduling problem2
Approximation algorithms for batch scheduling with processing set restrictions2
Graph representation of the fixed route dial-a-ride problem2
More on ordered open end bin packing2
A constructive branch-and-bound algorithm for the project duration problem with partially renewable resources and general temporal constraints2
Mathematical challenges in scheduling theory2
Preemptive scheduling of parallel jobs of two sizes with controllable processing times2
New Perspectives in Scheduling Theory2
Online algorithms to schedule a proportionate flexible flow shop of batching machines2
A large neighborhood search approach for the paint shop scheduling problem2
Scheduling a pick and place packaging line2
Exact algorithms and approximation schemes for proportionate flow shop scheduling with step-deteriorating processing times2
Quick and situ-aware spatiotemporal scheduling for shipbuilding manufacturing2
Correction to: Broadcasting a file in a communication network2
Block-based state-expanded network models for multi-activity shift scheduling1
A review and classification of scheduling objectives in unpaced flow shops for discrete manufacturing1
Competitive algorithms for demand response management in a smart grid1
The preemptive resource allocation problem1
Exact and metaheuristic methods for a real-world examination timetabling problem1
Investigating constraint programming and hybrid methods for real world industrial test laboratory scheduling1
Bi-criteria simulated annealing for the curriculum-based course timetabling problem with robustness approximation1
Integrated break and carryover effect minimization1
Further connections between contract-scheduling and ray-searching problems1
A solution framework for multi-skilled project scheduling problems with hierarchical skills1
Theoretical and practical issues in single-machine scheduling with two job release and delivery times1
Lower bounds for online scheduling on four processors1
Twin-crane scheduling during seaside workload peaks with a dedicated handshake area1
Minimizing the earliness–tardiness for the customer order scheduling problem in a dedicated machine environment1
Exact and meta-heuristic approaches for the production leveling problem1
Scheduling a single machine with multiple due dates per job1
A parallelized matheuristic for the International Timetabling Competition 20191
Fixed-parameter tractability of scheduling dependent typed tasks subject to release times and deadlines1
Minimizing the total tardiness and job rejection cost in a proportionate flow shop with generalized due dates1
Special Issue on papers from the 2019 Workshop on Models and Algorithms for Planning and Scheduling Problems1
Learning to enumerate shifts for large-scale flexible personnel scheduling problems1
A mixed-integer programming approach for solving university course timetabling problems1
Tight approximation bounds for the LPT rule applied to identical parallel machines with small jobs1
Quantifying and enforcing robustness in staff rostering1
Editorial: Journal of Scheduling (2023)1
Three notes on scheduling unit-length jobs with precedence constraints to minimize the total completion time1
Approximating weighted completion time via stronger negative correlation1
0.092459917068481