Academic Journal
Q1Journal of Scheduling
About Journal of Scheduling
Journal of Scheduling is a scholarly journal published by Springer. SCImago 2025 lists it in Q1, with an SJR of 0.671 and H-index of 72.
Coverage: 1998-2026. Research categories: Engineering (miscellaneous) (Q1); Artificial Intelligence (Q2); Management Science and Operations Research (Q2); Software (Q2).
Source-backed journal facts
Topics in published research
Scheduling and Optimization Algorithms; Optimization and Search Problems; Advanced Manufacturing and Logistics Optimization; Optimization and Packing Problems; Assembly Line Balancing Optimization; Scheduling and Timetabling Solutions.
OpenAlex classifies topics from published works. These topics are not the publisher’s official aims and scope.
Reported open-access list prices
2,990.00 USD; 2,390.00 EUR; 2,090.00 GBP
APC list prices reported by OpenAlex, which obtains this information from DOAJ. Confirm current charges, taxes, waivers and eligibility with the publisher; this is not a fee quotation.
Source: OpenAlex source record. Retrieved 2026-10-03. Source record updated 2026-10-02. OpenAlex metrics are different from SCImago metrics and the Clarivate Journal Impact Factor.
Journal Metrics
Quartile, SJR and the listed SCImago H-index use the 2025 imported SCImago dataset. A quartile may vary by subject category. Values without a source or reporting year are unverified historical entries. Verify the current Journal Impact Factor with Clarivate or the publisher before using it.
Aims & Scope
The publisher’s official aims and scope have not yet been verified for this profile. Use the journal website to check subject fit and accepted article types before submitting.
Recent Research Articles
Latest publications matched automatically by ISSN.
The effects of congestion in horizontal transport on integrated optimization at an automated container terminal
Yao-Zong Wang, Zhi-Hua Hu, Yue-He Wei, Xi-Dan Tian et al.
2026-09-29 · DOI: 10.1007/s10951-026-00885-0Multi-periodic scheduling with release times and deadlines minimizing the number of machine periods
Sandra Gutiérrez, Fernando Jiménez, Fernanda Salazar, Luis M. Torres et al.
2026-09-08 · DOI: 10.1007/s10951-026-00884-1Multi-neighborhood simulated annealing for the multi-activity multi-day shift scheduling problem
László Kálmán Trautsch, Bence Kovari
2026-08-27 · DOI: 10.1007/s10951-026-00886-zLaunching drones from a vessel: routing unmanned aerial vehicles from a linearly moving depot
Nils Boysen, Helmut Sedding
2026-07-30 · DOI: 10.1007/s10951-026-00879-yOptimally designing chemotherapy scheduling with discrete dosing
Ismail Abdulrashid
2026-06-26 · DOI: 10.1007/s10951-026-00877-0Branching list scheduling algorithms for the identical parallel machine scheduling problem
Hakim Hadj-Djilani, Louis-Claude Canon, Laurent Philippe, Julien Bernard et al.
2026-08 · DOI: 10.1007/s10951-026-00875-2Minimizing maximum late work with optional job rejection on a single machine
Baruch Mor, Gur Mosheiov
2026-06-26 · DOI: 10.1007/s10951-026-00881-4Prof. Chris Potts, 1949–2026
Bo Chen, Nicholas G. Hall, Steef L. van de Velde
2026-08 · DOI: 10.1007/s10951-026-00883-2A Tepid-Aware container scheduler for serverless computing environments targeting throughput and energy efficiency
Mahrad Hanaforoosh, Mehrdad Ashtiani, Mohammad Abdollahi Azgomi
2026-08 · DOI: 10.1007/s10951-026-00882-3Correction: Computational complexity and exact techniques for scheduling problems with job prohibitions
Yulia Zakharova
2026-08 · DOI: 10.1007/s10951-025-00864-xBranch-cut-and-price for open-shop scheduling problems with any regular minsum objective
Simon Emde, Jens Lysgaard
2026-08 · DOI: 10.1007/s10951-026-00874-3Just-in-time scheduling with battery constraints
Byung-Cheon Choi, Myoung-Ju Park, Jibok Chung, Kyung-Min Kim et al.
2026-08 · DOI: 10.1007/s10951-026-00876-1Correction to: Exact methods for the time frame rostering problem in the context of tram driver rostering
Lukas Frühwirth, Nysret Musliu
2026-05-21 · DOI: 10.1007/s10951-026-00880-5Single-machine scheduling with rejection and controllable processing times to maximize profit under a makespan constraint
Yanjie Guo, Wenchang Luo
2026-05-20 · DOI: 10.1007/s10951-026-00878-zReentrant permutation flow shop problems: definitions and heuristics
Itamar Segal, Tal Grinshpoun, Hagai Ilani, Elad Shufan et al.
2026-05-13 · DOI: 10.1007/s10951-026-00873-4Exact methods for the time frame rostering problem in the context of tram driver rostering
Lukas Frühwirth, Nysret Musliu
2026-03-04 · DOI: 10.1007/s10951-026-00871-6Optimal energy scheduling under time-of-use tariffs
Nicholas G. Hall, Marc E. Posner
2026-04 · DOI: 10.1007/s10951-026-00872-5Scheduling cool jobs when processing heats them
Roel Lambers, Rudi Pendavingh, Frits C. R. Spieksma, Céline M. F. Swennenhuis et al.
2026-04 · DOI: 10.1007/s10951-025-00870-zLocal search and trajectory metaheuristics for the flexible job shop scheduling problem with nonlinear routes and position-based learning
K. A. G. Araujo, E. G. Birgin, D. P. Ronconi
2026-02-09 · DOI: 10.1007/s10951-025-00869-6The (a)social exam invigilator assignment problem
Hannah Verplancke, David Van Bulck, Veronique Limère, Nico André Schmid et al.
2026-06 · DOI: 10.1007/s10951-025-00868-7Reviews
Community Reviews
Version History
October 2, 2026 at 9:08 pm
October 2, 2026