JOURNAL OF SCHEDULING

JOURNAL OF SCHEDULING

J SCHEDULING
影响因子:1.8
是否综述期刊:
是否预警:不在预警名单内
是否OA:
出版国家/地区:NETHERLANDS
出版社:Springer US
发刊时间:2003
发刊频率:Bimonthly
收录数据库:SCIE/Scopus收录
ISSN:1094-6136

期刊介绍

The Journal of Scheduling provides a recognized global forum for the publication of all forms of scheduling research. First published in June 1998, Journal of Scheduling covers advances in scheduling research, such as the latest techniques, applications, theoretical issues and novel approaches to problems. The journal is of direct relevance to the areas of Computer Science, Discrete Mathematics, Operational Research, Engineering, Management, Artificial Intelligence, Construction, Distribution, Manufacturing, Transport, Aerospace and Retail and Service Industries. These disciplines face complex scheduling needs and all stand to gain from advances in scheduling technology and understanding.
《调度杂志》为各种形式的调度研究的出版提供了一个公认的全球论坛。1998年6月首次出版的《调度杂志》涵盖了调度研究的进展,如最新技术、应用、理论问题和解决问题的新方法。该杂志与计算机科学、离散数学、运筹学、工程、管理、人工智能、建筑、分销、制造、运输、航空航天、零售和服务业等领域直接相关。这些学科面临着复杂的调度需求,并且都将从调度技术和理解的进步中获益。
年发文量 30
国人发稿量 7.5
国人发文占比 0.25%
自引率 -
平均录取率0
平均审稿周期 较慢,6-12周
版面费 US$2780
偏重研究方向 工程技术-工程:制造
期刊官网 https://www.springer.com/10951
投稿链接 https://www.editorialmanager.com/josh/

期刊高被引文献

The proactive and reactive resource-constrained project scheduling problem
来源期刊:Journal of SchedulingDOI:10.1007/S10951-017-0553-X
A unified heuristic and an annotated bibliography for a large class of earliness–tardiness scheduling problems
来源期刊:Journal of SchedulingDOI:10.1007/s10951-017-0549-6
A multi-mode resource-constrained project scheduling reformulation for the waterway ship scheduling problem
来源期刊:Journal of SchedulingDOI:10.1007/S10951-018-0578-9
Two-agent scheduling on unrelated parallel machines with total completion time and weighted number of tardy jobs criteria
来源期刊:Journal of SchedulingDOI:10.1007/S10951-018-0583-Z
An efficient train scheduling algorithm on a single-track railway system
来源期刊:Journal of SchedulingDOI:10.1007/S10951-018-0558-0
The complexity of CO-agent scheduling to minimize the total completion time and total number of tardy jobs
来源期刊:Journal of SchedulingDOI:10.1007/S10951-018-0598-5
Scheduling recurring radiotherapy appointments in an ion beam facility
来源期刊:Journal of SchedulingDOI:10.1007/S10951-018-0574-0
Inductive $$k$$k-independent graphs and c-colorable subgraphs in scheduling: a review
来源期刊:Journal of SchedulingDOI:10.1007/s10951-018-0595-8
Parameterized complexity of a coupled-task scheduling problem
来源期刊:Journal of SchedulingDOI:10.1007/S10951-018-0581-1
The evolution of schematic representations of flow shop scheduling problems
来源期刊:Journal of SchedulingDOI:10.1007/S10951-018-0594-9
Stochastic project management: multiple projects with multi-skilled human resources
来源期刊:Journal of SchedulingDOI:10.1007/s10951-018-0592-y
The single-processor scheduling problem with time restrictions: complexity and related problems
来源期刊:Journal of SchedulingDOI:10.1007/S10951-018-0579-8
Minimizing total weighted completion time on a single machine subject to non-renewable resource constraints
来源期刊:Journal of SchedulingDOI:10.1007/S10951-019-00601-1
ILP models for the allocation of recurrent workloads upon heterogeneous multiprocessors
来源期刊:Journal of SchedulingDOI:10.1007/S10951-018-0593-X
Risk-averse single machine scheduling: complexity and approximation
来源期刊:Journal of SchedulingDOI:10.1007/s10951-019-00599-6
Shop scheduling problems with pliable jobs
来源期刊:Journal of SchedulingDOI:10.1007/S10951-019-00607-9
Preemptive parallel-machine scheduling problem of maximizing the number of on-time jobs
来源期刊:Journal of SchedulingDOI:10.1007/S10951-018-0584-Y
Quality of strong equilibria for selfish bin packing with uniform cost sharing
来源期刊:Journal of SchedulingDOI:10.1007/S10951-018-0587-8
Unbounded parallel-batch scheduling with drop-line tasks
来源期刊:Journal of SchedulingDOI:10.1007/S10951-018-0586-9
A polynomial-time approximation scheme for the airplane refueling problem
来源期刊:Journal of SchedulingDOI:10.1007/s10951-018-0569-x
Daily course pattern formulation and valid inequalities for the curriculum-based course timetabling problem
来源期刊:Journal of SchedulingDOI:10.1007/S10951-018-0582-0
Parallel machine makespan minimization subject to machine availability and total completion time constraints
来源期刊:Journal of SchedulingDOI:10.1007/S10951-017-0551-Z
Scheduling parallel batching machines in a sequence
来源期刊:Journal of SchedulingDOI:10.1007/S10951-018-0560-6
Scheduling and rescheduling elective patients in operating rooms to minimise the percentage of tardy patients
来源期刊:Journal of SchedulingDOI:10.1007/S10951-018-0570-4
Single-machine common due date total earliness/tardiness scheduling with machine unavailability
来源期刊:Journal of SchedulingDOI:10.1007/S10951-018-0585-X
Lower bounds for online bin covering-type problems
来源期刊:Journal of SchedulingDOI:10.1007/S10951-018-0590-0
A unified view of parallel machine scheduling with interdependent processing rates
来源期刊:Journal of SchedulingDOI:10.1007/S10951-019-00605-X
The Complexity of Parallel Machine Scheduling of Unit-Processing-Time Jobs under Level-Order Precedence Constraints
来源期刊:Journal of SchedulingDOI:10.1007/S10951-018-0596-7
The venue management problem: setting staffing levels, shifts and shift schedules at concession stands
来源期刊:Journal of SchedulingDOI:10.1007/S10951-018-0577-X
Single machine scheduling with stochastically dependent times
来源期刊:Journal of SchedulingDOI:10.1007/S10951-019-00600-2
An approximation scheme for the bi-scenario sum of completion times trade-off problem
来源期刊:Journal of SchedulingDOI:10.1007/S10951-018-0588-7
A note on minimizing total weighted completion time with an unexpected machine unavailable interval
来源期刊:Journal of SchedulingDOI:10.1007/S10951-018-0573-1
A complexity analysis of parallel scheduling unit-time jobs with in-tree precedence constraints while minimizing the mean flow time
来源期刊:Journal of SchedulingDOI:10.1007/S10951-019-00602-0
Scheduling problems over a network of machines
来源期刊:Journal of SchedulingDOI:10.1007/S10951-018-0591-Z
Two-agent scheduling with deteriorating jobs on a single parallel-batching machine: refining computational complexity
来源期刊:Journal of SchedulingDOI:10.1007/s10951-019-00613-x
Malleable scheduling for flows of jobs and applications to MapReduce
来源期刊:Journal of SchedulingDOI:10.1007/S10951-018-0576-Y
Scheduling divisible loads with time and cost constraints
来源期刊:Journal of SchedulingDOI:10.1007/s10951-019-00626-6
Correction to: Online pulse interleaving task scheduling for multifunction radar
来源期刊:Journal of SchedulingDOI:10.1007/s10951-019-00609-7
Sequencing assembly lines to facilitate synchronized just-in-time part supply
来源期刊:Journal of SchedulingDOI:10.1007/S10951-019-00606-W
Multistage interval scheduling games
来源期刊:Journal of SchedulingDOI:10.1007/S10951-018-0568-Y

质量指标占比

研究类文章占比 OA被引用占比 撤稿占比 出版后修正文章占比
100.00%36.45%--

相关指数

影响因子
影响因子
年发文量
自引率
Cite Score

预警情况

查看说明
时间 预警情况
2025年03月发布的2025版不在预警名单中
2024年02月发布的2024版不在预警名单中
2023年01月发布的2023版不在预警名单中
2021年12月发布的2021版不在预警名单中
2020年12月发布的2020版不在预警名单中
*来源:中科院《 国际期刊预警名单》

JCR分区

WOS分区等级:Q4区
版本 按学科 分区
WOS期刊SCI分区
WOS期刊SCI分区
WOS期刊SCI分区是指SCI官方(Web of Science)为每个学科内的期刊按照IF数值排 序,将期刊按照四等分的方法划分的Q1-Q4等级,Q1代表质量最高,即常说的1区期刊。
(2024-2025年最新版)
ENGINEERING, MANUFACTURING
Q4

中科院分区

查看说明
版本 大类学科 小类学科 Top期刊 综述期刊
2025年3月最新升级版
工程技术4区
ENGINEERING, MANUFACTURING 工程:制造
4区
OPERATIONS RESEARCH & MANAGEMENT SCIENCE 运筹学与管理科学
4区
2023年12月升级版
工程技术4区
ENGINEERING, MANUFACTURING 工程:制造
4区
OPERATIONS RESEARCH & MANAGEMENT SCIENCE 运筹学与管理科学
4区
2022年12月旧的升级版
工程技术4区
ENGINEERING, MANUFACTURING 工程:制造
4区
OPERATIONS RESEARCH & MANAGEMENT SCIENCE 运筹学与管理科学
4区