OOIR: Observatory of International Research

Papers

(The TQCC of Journal of Scheduling is 3. 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-11-01 to 2024-11-01.)

Article	Citations
Optimization of scheduling problems with deterioration effects and an optional maintenance activity	20
Exact and metaheuristic approaches for unrelated parallel machine scheduling	20
Algorithm selection and instance space analysis for curriculum-based course timetabling	16
Minimizing the total tardiness and job rejection cost in a proportionate flow shop with generalized due dates	14
Stand-alone renewable power system scheduling for a green data center using integer linear programming	12
Tabu search for a parallel-machine scheduling problem with periodic maintenance, job rejection and weighted sum of completion times	12
A mixed-integer programming approach for solving university course timetabling problems	12
Multi-neighborhood simulated annealing for the sports timetabling competition ITC2021	10
A graph-based MIP formulation of the International Timetabling Competition 2019	9
Simulated annealing with penalization for university course timetabling	8
Aircraft landing planning under uncertain conditions	8
Column generation for minimizing total completion time in a parallel-batching environment	7
Twin-crane scheduling during seaside workload peaks with a dedicated handshake area	7
A hybrid evolutionary approach to job-shop scheduling with generic time lags	7
A reinforcement learning algorithm for rescheduling preempted tasks in fog nodes	5
Plant shutdown maintenance workforce team assignment and job scheduling	5
Coupled task scheduling with time-dependent processing times	5
A parallelized matheuristic for the International Timetabling Competition 2019	5
An analysis of the parameterized complexity of periodic timetabling	5
Scheduling for multi-robot routing with blocking and enabling constraints	5
A memetic algorithm to address the multi-node resource-constrained project scheduling problem	5
Optimizing rest times and differences in games played: an iterative two-phase approach	4
Local search approaches for the test laboratory scheduling problem with variable task grouping	4
A flexible mixed integer programming-based system for real-world nurse rostering	4
Scheduling periodic I/O access with bi-colored chains: models and algorithms	4

Parallel solutions for preemptive makespan scheduling on two identical machines	4
Scheduling coupled tasks with exact delays for minimum total job completion time	4
Introducing UniCorT: an iterative university course timetabling tool with MaxSAT	4
Optimally rescheduling jobs with a Last-In-First-Out buffer	4
Scheduling to maximize the weighted number of on-time jobs on parallel machines with bounded job-rejection	4
Bi-criteria simulated annealing for the curriculum-based course timetabling problem with robustness approximation	4
Automatically evolving preference-based dispatching rules for multi-objective job shop scheduling	4
Project scheduling in a lean environment to maximize value and minimize overruns	4
Competitive two-agent scheduling with release dates and preemption on a single machine	4
A new algorithm for the two-machine open shop and the polynomial solvability of a scheduling problem with routing	4
Makespan minimization with OR-precedence constraints	3
A general scheme for solving a large set of scheduling problems with rejection in FPT time	3
Integrated break and carryover effect minimization	3
On the tractability of hard scheduling problems with generalized due-dates with respect to the number of different due-dates	3
Routing two stacking cranes with predetermined container sequences	3
More on ordered open end bin packing	3
A large neighborhood search approach for the paint shop scheduling problem	3
Complexity and algorithms for min cost and max profit scheduling under time-of-use electricity tariffs	3
A tight approximation ratio of a list scheduling algorithm for a single-machine scheduling problem with a non-renewable resource	3
Single-machine scheduling with resource-dependent processing times and multiple unavailability periods	3