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-03-01 to 2024-03-01.)
ArticleCitations
Resource-constrained multi-project scheduling: benchmark datasets and decoupled scheduling30
Exact and metaheuristic approaches for unrelated parallel machine scheduling17
Stochastic programming approach for unidirectional quay crane scheduling problem with uncertainty15
Single machine scheduling to maximize the number of on-time jobs with generalized due-dates13
A periodic optimization approach to dynamic pickup and delivery problems with time windows13
Algorithm selection and instance space analysis for curriculum-based course timetabling12
Stand-alone renewable power system scheduling for a green data center using integer linear programming11
A decomposition heuristic for rotational workforce scheduling10
Serial-batching scheduling with two agents to minimize makespan and maximum cost10
Minimizing the total tardiness and job rejection cost in a proportionate flow shop with generalized due dates9
A mixed-integer programming approach for solving university course timetabling problems8
Multiple dispatching rules allocation in real time using data mining, genetic algorithms, and simulation8
Tabu search for a parallel-machine scheduling problem with periodic maintenance, job rejection and weighted sum of completion times8
Column generation for minimizing total completion time in a parallel-batching environment7
An approach to reduce energy consumption and performance losses on heterogeneous servers using power capping7
A joint order acceptance and scheduling problem with earliness and tardiness penalties considering overtime7
A hybrid evolutionary approach to job-shop scheduling with generic time lags7
A graph-based MIP formulation of the International Timetabling Competition 20197
Twin-crane scheduling during seaside workload peaks with a dedicated handshake area6
Dynamic speed scaling minimizing expected energy consumption for real-time tasks6
Multi-neighborhood simulated annealing for the sports timetabling competition ITC20216
New results for scheduling to minimize tardiness on one machine with rejection and related problems6
Optimization of scheduling problems with deterioration effects and an optional maintenance activity5
Optimal work-conserving scheduler synthesis for real-time sporadic tasks using supervisory control of timed discrete-event systems5
An integrated rolling horizon approach to increase operating theatre efficiency5
The extended roster quality staffing problem: addressing roster quality variation within a staffing planning period5
Simulated annealing with penalization for university course timetabling5
Coupled task scheduling with time-dependent processing times5
Scheduling coupled tasks with exact delays for minimum total job completion time4
Approximation algorithms for energy-efficient scheduling of parallel jobs4
Plant shutdown maintenance workforce team assignment and job scheduling4
Bi-criteria simulated annealing for the curriculum-based course timetabling problem with robustness approximation4
An analysis of the parameterized complexity of periodic timetabling4
Scheduling periodic I/O access with bi-colored chains: models and algorithms4
Scheduling for multi-robot routing with blocking and enabling constraints4
A parallelized matheuristic for the International Timetabling Competition 20194
A reinforcement learning algorithm for rescheduling preempted tasks in fog nodes4
A new algorithm for the two-machine open shop and the polynomial solvability of a scheduling problem with routing4
New results for an open time-dependent scheduling problem4
Automatically evolving preference-based dispatching rules for multi-objective job shop scheduling3
Makespan minimization with OR-precedence constraints3
Scheduling two projects with controllable processing times in a single-machine environment3
A flexible mixed integer programming-based system for real-world nurse rostering3
Scheduling jobs with a V-shaped time-dependent processing time3
The flexibility of home away pattern sets3
Optimizing rest times and differences in games played: an iterative two-phase approach3
Local search approaches for the test laboratory scheduling problem with variable task grouping3
Disruptions in timetables: a case study at Universidade de Lisboa3
Aircraft landing planning under uncertain conditions3
Parallel solutions for preemptive makespan scheduling on two identical machines3
A memetic algorithm to address the multi-node resource-constrained project scheduling problem3
Complexity and algorithms for min cost and max profit scheduling under time-of-use electricity tariffs3
Routing two stacking cranes with predetermined container sequences3
Introducing UniCorT: an iterative university course timetabling tool with MaxSAT3
Project scheduling in a lean environment to maximize value and minimize overruns3
More on ordered open end bin packing3
Single-machine scheduling with resource-dependent processing times and multiple unavailability periods3
Robust finite-horizon scheduling/rescheduling of operating rooms with elective and emergency surgeries under resource constraints2
Optimally rescheduling jobs with a Last-In-First-Out buffer2
Scheduling computations with provably low synchronization overheads2
Integrated break and carryover effect minimization2
On the tractability of hard scheduling problems with generalized due-dates with respect to the number of different due-dates2
A tight approximation ratio of a list scheduling algorithm for a single-machine scheduling problem with a non-renewable resource2
Scheduling to maximize the weighted number of on-time jobs on parallel machines with bounded job-rejection2
Exact algorithms and approximation schemes for proportionate flow shop scheduling with step-deteriorating processing times2
A large neighborhood search approach for the paint shop scheduling problem2
Scheduling a proportionate flow shop of batching machines2
Three-machine open shop with a bottleneck machine revisited2
Approximation algorithms for batch scheduling with processing set restrictions2
Near-linear-time approximation algorithms for scheduling a batch-processing machine with setups and job rejection2
A new LP rounding algorithm for the active time problem1
Equitable scheduling on a single machine1
A complexity analysis and algorithms for two-machine shop scheduling problems under linear constraints1
Block-based state-expanded network models for multi-activity shift scheduling1
A two-stage robust approach for minimizing the weighted number of tardy jobs with objective uncertainty1
Joint replenishment meets scheduling1
Preemptive scheduling of parallel jobs of two sizes with controllable processing times1
Pseudo-Boolean optimisation for RobinX sports timetabling1
A quest for a fair schedule: The International Young Physicists’ Tournament1
Moderate worst-case complexity bounds for the permutation flowshop scheduling problem using Inclusion–Exclusion1
Bicriteria two-machine flowshop scheduling: approximation algorithms and their limits1
Minimizing the makespan on a single machine subject to modular setups1
Minimizing the expected waiting time of emergency jobs1
A general scheme for solving a large set of scheduling problems with rejection in FPT time1
Approximation algorithms for scheduling monotonic moldable tasks on multiple platforms1
Approximate and robust bounded job start scheduling for Royal Mail delivery offices1
Exact and meta-heuristic approaches for the production leveling problem1
A fix-and-optimize heuristic for the ITC2021 sports timetabling problem1
Packing-based branch-and-bound for discrete malleable task scheduling1
An efficient model-based branch-and-price algorithm for unrelated-parallel machine batching and scheduling problems1
Fixed-parameter tractability of scheduling dependent typed tasks subject to release times and deadlines1
Online scheduling to minimize total weighted (modified) earliness and tardiness cost1
On the complexity of constructing a minmax regret solution for the two-machine flow shop problem under the interval uncertainty1
On the complexity of open shop scheduling with time lags1
Graph representation of the fixed route dial-a-ride problem1
New Perspectives in Scheduling Theory1
A constructive branch-and-bound algorithm for the project duration problem with partially renewable resources and general temporal constraints1
Scheduling with gaps: new models and algorithms1
Quantifying and enforcing robustness in staff rostering1
Solving the nuclear dismantling project scheduling problem by combining mixed-integer and constraint programming techniques and metaheuristics1
0.01742696762085