期刊审稿周期图谱
JOURNAL OF SCHEDULING 期刊封面
← 返回期刊列表

Review Cycle Records

JOURNAL OF SCHEDULING

Springer 非OA 2026新锐 3区2025中科院 4区 已自动采集 最新完整样本 10 篇 平均 530.7 天

数据更新 2026-07-16 · 完整周期 10 篇 · 日期来源可逐条复核

JOURNAL OF SCHEDULING已收录10篇完整论文周期样本,平均审稿530.7 天,中位审稿401 天。2025中科院4区,非OA,2025发文量34。页面含论文收到日期、录用日期、PDF、DOI和出版社网页溯源入口。

530.7平均天数
401中位天数
68最短天数
1,638最长天数
10最新论文
342025发文量

Latest Papers

最新发表论文审稿周期

审稿天数=录用日期-收到日期;保留 PDF/DOI/网页源链接

267

Minimizing maximum late work with optional job rejection on a single machine

作者Baruch Mor; Gur Mosheiov

作者单位1. The Department of Economics and Business Administration, Ariel University, Ariel, Israel; 2. School of Business Administration, The Hebrew University, Jerusalem, Israel; 3. Lev Academic Center, Jerusalem, Israel

PDF源文件 DOI 网页
438

Optimally designing chemotherapy scheduling with discrete dosing

作者Ismail Abdulrashid

作者单位1. School of Finance and Operations Management, Collins College of Business, The University of Tulsa, Tulsa, USA

PDF源文件 DOI 网页
779

Branching list scheduling algorithms for the identical parallel machine scheduling problem

作者Hakim Hadj-Djilani; Louis-Claude Canon; Laurent Philippe; Julien Bernard

作者单位1. Institut FEMTO-ST, CNRS, Université Marie et Louis Pasteur, Besançon, France

PDF源文件 DOI 网页
68

Prof. Chris Potts, 1949–2026

作者Bo Chen; Nicholas G. Hall; Steef L. van de Velde

作者单位1. Warwick Business School, University of Warwick, Coventry, UK; 2. Fisher College of Business, The Ohio State University, Columbus, USA; 3. Rotterdam School of Management, Erasmus University, Rotterdam, Netherlands

PDF源文件 DOI 网页
383

A Tepid-Aware container scheduler for serverless computing environments targeting throughput and energy efficiency

作者Mahrad Hanaforoosh; Mehrdad Ashtiani; Mohammad Abdollahi Azgomi

作者单位1. School of Computer Engineering, Iran University of Science and Technology, Tehran, Iran

PDF源文件 DOI 网页
585

Just-in-time scheduling with battery constraints

作者Byung-Cheon Choi; Myoung-Ju Park; Jibok Chung; Kyung-Min Kim

作者单位1. School of Business, Chungnam National University, Daejeon, Korea; 2. Department of Industrial Engineering, Seoul National University, Seoul, Korea; 3. Department of Retail Management, Kongju National University, Yesan-gun, Korea; 4. Department of Industrial Management and Engineering, Myongji University, Yongin-si, Korea

PDF源文件 DOI 网页
1,638

Branch-cut-and-price for open-shop scheduling problems with any regular minsum objective

作者Simon Emde; Jens Lysgaard

作者单位1. Chair of Business Intelligence, Friedrich-Schiller-Universität Jena, Jena, Germany; 2. CORAL - Cluster for Operations Research, Analytics, and Logistics, Department of Economics and Business Economics, Aarhus University, Aarhus V, Denmark

PDF源文件 DOI 网页
419

Single-machine scheduling with rejection and controllable processing times to maximize profit under a makespan constraint

作者Yanjie Guo; Wenchang Luo

作者单位1. School of Mathematics and Statistics, Ningbo University, Ningbo, China

PDF源文件 DOI 网页
373

Reentrant permutation flow shop problems: definitions and heuristics

作者Itamar Segal; Tal Grinshpoun; Hagai Ilani; Elad Shufan

作者单位1. Ariel University, Ariel, Israel; 2. Shamoon College of Engineering, Ashdod, Israel

PDF源文件 DOI 网页
357

Exact methods for the time frame rostering problem in the context of tram driver rostering

作者Lukas Frühwirth; Nysret Musliu

作者单位1. Christian Doppler Laboratory for Artificial Intelligence and Optimization for Planning and Scheduling, DBAI, TU Wien, Vienna, Austria

PDF源文件 DOI 网页