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-11-01 to 2025-11-01.)
ArticleCitations
An efficient model-based branch-and-price algorithm for unrelated-parallel machine batching and scheduling problems30
The flexibility of home away pattern sets30
A graphical evaluation and review technique for scheduling construction projects29
Single-machine scheduling with resource-dependent processing times and multiple unavailability periods20
A quest for a fair schedule: The International Young Physicists’ Tournament15
Flow shops with reentry: The total weighted completion time objective13
Real-world university course timetabling at the International Timetabling Competition 201913
Complexity of scheduling few types of jobs on related and unrelated machines9
Preface: the practice and theory of automated timetabling (2022)9
Designing a long-term master surgical timetable: a case study in balancing post-operative ward bed demand and minimizing changes in surgical schedules8
In memoriam Gerhard Woeginger8
Scheduling with non-renewable resources: minimizing the sum of completion times8
Task assignments with rotations and flexible shift starts to improve demand coverage and staff satisfaction in healthcare8
Scheduling of Earth observing satellites using distributed constraint optimization8
Approximation algorithms for scheduling monotonic moldable tasks on multiple platforms8
Well-behaved online load balancing against strategic jobs7
An improved approximation algorithm for a scheduling problem with transporter coordination7
A cut-and-branch algorithm for the external candidates examination scheduling problem7
A hybrid local search algorithm for the continuous energy-constrained scheduling problem6
Plant shutdown maintenance workforce team assignment and job scheduling6
Selection hyper-heuristics and job shop scheduling problems: How does instance size influence performance?6
An exact solution with an improved running time for the routing flow shop problem with two machines6
Hybrid-sched: a QoS adaptive offline–online scheduler for real-time tasks on multi-cores6
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
Minimizing the expected waiting time of emergency jobs5
A hybrid approach for the dynamic flexible job shop scheduling problem considering machine failures5
Serial batching to minimize the weighted number of tardy jobs5
Project scheduling in a lean environment to maximize value and minimize overruns5
On variants of a load-balancing problem with unit-load jobs5
A fix-and-optimize heuristic for the ITC2021 sports timetabling problem5
A reinforcement learning algorithm for rescheduling preempted tasks in fog nodes4
A note on the shifting bottleneck procedure for job shop scheduling4
Optimizing rest times and differences in games played: an iterative two-phase approach4
Scheduling to maximize the weighted number of on-time jobs on parallel machines with bounded job-rejection4
The price of anarchy for a berth allocation game4
Equitable scheduling on a single machine4
Scheduling of e-commerce packaging machines: blocking machines and their impact on the performance–waste tradeoff4
Scheduling web banner advertisements with conflicts and time windows: a column generation-based solution approach4
Semi-online models for cardinality constrained bin packing4
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
A multivariate complexity analysis of the material consumption scheduling problem4
Simulated annealing with penalization for university course timetabling4
Joint replenishment meets scheduling3
Network routing on regular digraphs and their line graphs3
A buffer allocation evolutionary algorithm for resource-constrained projects with activity clusters3
Sustainable scheduling for a flexible job shop considering batch processing and batch transportation strategies3
Advances in the practice and theory of automated timetabling3
Limited integrated production scheduling and vehicle routing in the steel industry3
Scheduling with periodic availability constraints to minimize makespan3
Recoverable robust single machine scheduling with polyhedral uncertainty3
Maximizing barrier coverage lifetime with static sensors3
Scheduling periodic messages on a shared link without buffering3
An analysis of the parameterized complexity of periodic timetabling3
A large neighborhood search approach for the paint shop scheduling problem2
Approximation algorithms for batch scheduling with processing set restrictions2
Mathematical challenges in scheduling theory2
A polynomial-time dynamic programming algorithm for an optimal picking problem in automated warehouses2
Scheduling a pick and place packaging line2
Preemptive scheduling of parallel jobs of two sizes with controllable processing times2
A constructive branch-and-bound algorithm for the project duration problem with partially renewable resources and general temporal constraints2
Scheduling the repair and replacement of individual components in operating systems: a bi-objective mathematical optimization model2
Single-machine and flow-shop scheduling with supporting tasks in a nested structure2
Resource leveling: complexity of a unit execution time two-processor scheduling variant and related problems2
Single-machine two-agent scheduling with a rate-modifying activity and weighted due-date-related functions2
Exact algorithms and approximation schemes for proportionate flow shop scheduling with step-deteriorating processing times2
Single machine rescheduling for new orders with maximum and total time disruption constraints2
Polynomial-time solutions for minimizing total load on unrelated machines with position-dependent processing times and rate-modifying activities2
Correction to: Broadcasting a file in a communication network1
More on ordered open end bin packing1
Block-based state-expanded network models for multi-activity shift scheduling1
Learning to enumerate shifts for large-scale flexible personnel scheduling problems1
Scheduling a single machine with multiple due dates per job1
Tight approximation bounds for the LPT rule applied to identical parallel machines with small jobs1
Exact and metaheuristic methods for a real-world examination timetabling problem1
Graph representation of the fixed route dial-a-ride problem1
Lower bounds for online scheduling on four processors1
Minimizing the earliness–tardiness for the customer order scheduling problem in a dedicated machine environment1
Multiprocessor scheduling with testing: improved online algorithms and numerical experiments1
Fixed-parameter tractability of scheduling dependent typed tasks subject to release times and deadlines1
Approximating weighted completion time via stronger negative correlation1
The preemptive resource allocation problem1
A review and classification of scheduling objectives in unpaced flow shops for discrete manufacturing1
Quick and situ-aware spatiotemporal scheduling for shipbuilding manufacturing1
Online algorithms to schedule a proportionate flexible flow shop of batching machines1
A mixed-integer programming approach for solving university course timetabling problems1
Special Issue on papers from the 2019 Workshop on Models and Algorithms for Planning and Scheduling Problems1
Bi-criteria simulated annealing for the curriculum-based course timetabling problem with robustness approximation1
A solution framework for multi-skilled project scheduling problems with hierarchical skills1
Editorial: Journal of Scheduling (2023)1
Further connections between contract-scheduling and ray-searching problems1
0.057656049728394