Paper Review Records
All Paper Review Records
10 valid samples · Newest publication first
Review days = acceptance date − received date. PDF, DOI, and publisher-page sources are retained.
Minimizing maximum late work with optional job rejection on a single machine
AuthorsBaruch Mor; Gur Mosheiov
Affiliations1. 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
Optimally designing chemotherapy scheduling with discrete dosing
AuthorsIsmail Abdulrashid
Affiliations1. School of Finance and Operations Management, Collins College of Business, The University of Tulsa, Tulsa, USA
Branching list scheduling algorithms for the identical parallel machine scheduling problem
AuthorsHakim Hadj-Djilani; Louis-Claude Canon; Laurent Philippe; Julien Bernard
Affiliations1. Institut FEMTO-ST, CNRS, Université Marie et Louis Pasteur, Besançon, France
Prof. Chris Potts, 1949–2026
AuthorsBo Chen; Nicholas G. Hall; Steef L. van de Velde
Affiliations1. 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
A Tepid-Aware container scheduler for serverless computing environments targeting throughput and energy efficiency
AuthorsMahrad Hanaforoosh; Mehrdad Ashtiani; Mohammad Abdollahi Azgomi
Affiliations1. School of Computer Engineering, Iran University of Science and Technology, Tehran, Iran
Just-in-time scheduling with battery constraints
AuthorsByung-Cheon Choi; Myoung-Ju Park; Jibok Chung; Kyung-Min Kim
Affiliations1. 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
Branch-cut-and-price for open-shop scheduling problems with any regular minsum objective
AuthorsSimon Emde; Jens Lysgaard
Affiliations1. 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
Single-machine scheduling with rejection and controllable processing times to maximize profit under a makespan constraint
AuthorsYanjie Guo; Wenchang Luo
Affiliations1. School of Mathematics and Statistics, Ningbo University, Ningbo, China
Reentrant permutation flow shop problems: definitions and heuristics
AuthorsItamar Segal; Tal Grinshpoun; Hagai Ilani; Elad Shufan
Affiliations1. Ariel University, Ariel, Israel; 2. Shamoon College of Engineering, Ashdod, Israel
Exact methods for the time frame rostering problem in the context of tram driver rostering
AuthorsLukas Frühwirth; Nysret Musliu
Affiliations1. Christian Doppler Laboratory for Artificial Intelligence and Optimization for Planning and Scheduling, DBAI, TU Wien, Vienna, Austria
Expert Matching · Case Demo
Turn Your Submission Goalsinto a Verifiable Journal Plan
Share your field, deadline, and author profile. CrushSCI uses real review records to suggest a title direction, shortlist journals, and estimate timelines.
