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 2020-09-01 to 2024-09-01.)
ArticleCitations
Exact and metaheuristic approaches for unrelated parallel machine scheduling20
Optimization of scheduling problems with deterioration effects and an optional maintenance activity17
Algorithm selection and instance space analysis for curriculum-based course timetabling16
Minimizing the total tardiness and job rejection cost in a proportionate flow shop with generalized due dates12
A mixed-integer programming approach for solving university course timetabling problems12
Tabu search for a parallel-machine scheduling problem with periodic maintenance, job rejection and weighted sum of completion times12
Stand-alone renewable power system scheduling for a green data center using integer linear programming12
A joint order acceptance and scheduling problem with earliness and tardiness penalties considering overtime10
Multi-neighborhood simulated annealing for the sports timetabling competition ITC202110
A graph-based MIP formulation of the International Timetabling Competition 20199
Simulated annealing with penalization for university course timetabling8
Aircraft landing planning under uncertain conditions8
Column generation for minimizing total completion time in a parallel-batching environment7
Twin-crane scheduling during seaside workload peaks with a dedicated handshake area7
A hybrid evolutionary approach to job-shop scheduling with generic time lags7
New results for scheduling to minimize tardiness on one machine with rejection and related problems6
Optimal work-conserving scheduler synthesis for real-time sporadic tasks using supervisory control of timed discrete-event systems5
A memetic algorithm to address the multi-node resource-constrained project scheduling problem5
Plant shutdown maintenance workforce team assignment and job scheduling5
A parallelized matheuristic for the International Timetabling Competition 20195
Coupled task scheduling with time-dependent processing times5
Scheduling for multi-robot routing with blocking and enabling constraints5
Optimizing rest times and differences in games played: an iterative two-phase approach4
Introducing UniCorT: an iterative university course timetabling tool with MaxSAT4
Scheduling periodic I/O access with bi-colored chains: models and algorithms4
Scheduling to maximize the weighted number of on-time jobs on parallel machines with bounded job-rejection4
Bi-criteria simulated annealing for the curriculum-based course timetabling problem with robustness approximation4
Scheduling coupled tasks with exact delays for minimum total job completion time4
Local search approaches for the test laboratory scheduling problem with variable task grouping4
Project scheduling in a lean environment to maximize value and minimize overruns4
Optimally rescheduling jobs with a Last-In-First-Out buffer4
A new algorithm for the two-machine open shop and the polynomial solvability of a scheduling problem with routing4
Automatically evolving preference-based dispatching rules for multi-objective job shop scheduling4
An analysis of the parameterized complexity of periodic timetabling4
A reinforcement learning algorithm for rescheduling preempted tasks in fog nodes4
A flexible mixed integer programming-based system for real-world nurse rostering4
Parallel solutions for preemptive makespan scheduling on two identical machines4
A tight approximation ratio of a list scheduling algorithm for a single-machine scheduling problem with a non-renewable resource3
Disruptions in timetables: a case study at Universidade de Lisboa3
More on ordered open end bin packing3
A large neighborhood search approach for the paint shop scheduling problem3
Makespan minimization with OR-precedence constraints3
A general scheme for solving a large set of scheduling problems with rejection in FPT time3
Single-machine scheduling with resource-dependent processing times and multiple unavailability periods3
Complexity and algorithms for min cost and max profit scheduling under time-of-use electricity tariffs3
Routing two stacking cranes with predetermined container sequences3
Competitive two-agent scheduling with release dates and preemption on a single machine3
Integrated break and carryover effect minimization3
Quantifying and enforcing robustness in staff rostering2
The flexibility of home away pattern sets2
Scheduling a proportionate flow shop of batching machines2
On the tractability of hard scheduling problems with generalized due-dates with respect to the number of different due-dates2
Robust finite-horizon scheduling/rescheduling of operating rooms with elective and emergency surgeries under resource constraints2
Joint replenishment meets scheduling2
Preemptive scheduling of parallel jobs of two sizes with controllable processing times2
A fix-and-optimize heuristic for the ITC2021 sports timetabling problem2
Approximation algorithms for batch scheduling with processing set restrictions2
Exact algorithms and approximation schemes for proportionate flow shop scheduling with step-deteriorating processing times2
Solving the nuclear dismantling project scheduling problem by combining mixed-integer and constraint programming techniques and metaheuristics2
Exact and metaheuristic methods for a real-world examination timetabling problem2
A complexity analysis and algorithms for two-machine shop scheduling problems under linear constraints2
Moderate worst-case complexity bounds for the permutation flowshop scheduling problem using Inclusion–Exclusion2
Packing-based branch-and-bound for discrete malleable task scheduling2
Pseudo-Boolean optimisation for RobinX sports timetabling2
Scheduling computations with provably low synchronization overheads2
Algorithms for rescheduling jobs with a LIFO buffer to minimize the weighted number of late jobs2
Fixed-parameter tractability of scheduling dependent typed tasks subject to release times and deadlines2
How to charge while driving: scheduling point-to-point deliveries of an electric vehicle under overhead wiring2
Three-machine open shop with a bottleneck machine revisited2
Multi-neighbourhood simulated annealing for the ITC-2007 capacitated examination timetabling problem2
A constructive branch-and-bound algorithm for the project duration problem with partially renewable resources and general temporal constraints2
Approximate and robust bounded job start scheduling for Royal Mail delivery offices1
New Perspectives in Scheduling Theory1
A quest for a fair schedule: The International Young Physicists’ Tournament1
Scheduling a pick and place packaging line1
Preemptive and non-preemptive scheduling on two unrelated parallel machines1
An efficient model-based branch-and-price algorithm for unrelated-parallel machine batching and scheduling problems1
Optimal energy scheduling of micro-grids considering the uncertainty of solar and wind renewable resources1
Scheduling with periodic availability constraints to minimize makespan1
Online scheduling to minimize total weighted (modified) earliness and tardiness cost1
The preemptive resource allocation problem1
Competitive algorithms for demand response management in a smart grid1
Approximation algorithms for scheduling monotonic moldable tasks on multiple platforms1
Online algorithms to schedule a proportionate flexible flow shop of batching machines1
Real-world university course timetabling at the International Timetabling Competition 20191
Exact and meta-heuristic approaches for the production leveling problem1
Approximating weighted completion time via stronger negative correlation1
Further connections between contract-scheduling and ray-searching problems1
A new LP rounding algorithm for the active time problem1
Single machine scheduling with step-learning1
Minimizing the makespan on a single machine subject to modular setups1
Malleable scheduling beyond identical machines1
Block-based state-expanded network models for multi-activity shift scheduling1
Minimizing the expected waiting time of emergency jobs1
Graph representation of the fixed route dial-a-ride problem1
On the complexity of open shop scheduling with time lags1
Scheduling with gaps: new models and algorithms1
Mathematical challenges in scheduling theory1
Lot streaming for a two-stage assembly system in the presence of handling costs1
Bicriteria two-machine flowshop scheduling: approximation algorithms and their limits1
Mixed-model moving assembly line material placement optimization for a shorter time-dependent worker walking time1
Equitable scheduling on a single machine1
A note on a single-shift days-off scheduling problem with sequence-dependent labor costs1
Solving the medical student scheduling problem using simulated annealing1
On the complexity of constructing a minmax regret solution for the two-machine flow shop problem under the interval uncertainty1
A two-stage robust approach for minimizing the weighted number of tardy jobs with objective uncertainty1
0.06655216217041