Open Access Helper

OpenAlex Citation Counts

OpenAlex Citations Logo

OpenAlex is a bibliographic catalogue of scientific papers, authors and institutions accessible in open access mode, named after the Library of Alexandria. It's citation coverage is excellent and I hope you will find utility in this listing of citing articles!

If you click the article title, you'll navigate to the article, as listed in CrossRef. If you click the Open Access links, you'll navigate to the "best Open Access location". Clicking the citation count will open this listing for that article. Lastly at the bottom of the page, you'll find basic pagination options.

Requested Article:

A state-of-the-art survey on multi-scenario scheduling
Dvir Shabtay, Miri Gilenson
European Journal of Operational Research (2022) Vol. 310, Iss. 1, pp. 3-23
Closed Access | Times Cited: 21

Showing 21 citing articles:

Scheduling in services: a review and bibliometric analysis
Setareh Boshrouei Shargh, M. Zandieh, Ashkan Ayough, et al.
Operations Management Research (2024) Vol. 17, Iss. 2, pp. 754-783
Closed Access | Times Cited: 2
Three-way decision based island harmony search algorithm for robust flow-shop scheduling with uncertain processing times depicted by big data
Bing Wang, Pengfei Zhang, Xiaozhi Wang, et al.
Applied Soft Computing (2024) Vol. 162, pp. 111842-111842
Closed Access | Times Cited: 2
Robust job-sequencing with an uncertain flexible maintenance activity
Paolo Detti, Gaia Nicosia, Andrea Pacifici
Computers & Industrial Engineering (2023) Vol. 185, pp. 109610-109610
Open Access | Times Cited: 2
Fair Repetitive Interval Scheduling
Klaus Heeger, Danny Hermelin, Yuval Itzhaki, et al.
Research Square (Research Square) (2024)
Open Access
Minimizing total completion time and makespan for a multi-scenario bi-criteria parallel machine scheduling problem
X.M. Zhang, Éric Angel, Feng Chu, et al.
European Journal of Operational Research (2024)
Closed Access
A Two-stage Genetic Algorithm-Based Robust Scheduling Approach for Multi-factory Production with Uncertain Shipping Lead-time: Optimizing On-Time Delivery and Cost
Yingying Chen, He Luo, Zhiming Cai, et al.
Applied Soft Computing (2024), pp. 112670-112670
Closed Access
Approach to integrate the learning and fatigue effect into the flow shop scheduling problem
Yenny A. Paredes-Astudillo, Valérie Botta‐Genoulaz, Jairo R. Montoya‐Torres, et al.
(2023), pp. 81-88
Open Access | Times Cited: 1
Total Completion Time Scheduling Under Scenarios
Thomas Bosman, Martijn van Ee, Ekin Ergen, et al.
Lecture notes in computer science (2023), pp. 104-118
Open Access
Lot sizing and scheduling of injection molding machines with setup resources and demand uncertainty
Helmut A. Sedding, Maxim Seidel
(2023), pp. 95-100
Open Access
Single-machine scheduling with two competing agents and a rate-modifying activity with weighted due-date related functions
Johnson Phosavanh, Daniel Oron
(2023), pp. 89-94
Open Access
Scheduling data gathering with variable communication speed and startup times
Joanna Berlińska
(2023), pp. 25-30
Open Access
New results on scheduling time-dependent jobs under precedence constraints
Stanisław Gawiejnowicz
(2023), pp. 39-44
Open Access
The Fourth International Workshop on Dynamic Scheduling Problems, Zurich University of Applied Sciences (ZHAW) School of Engineering, June 5th–6th, 2023, Winterthur, Switzerland

(2023)
Open Access
A faster FPTAS for proportionate flow shop scheduling with step-deteriorating processing times
Nir Halman
(2023), pp. 53-60
Open Access
A scenario-based planning approach for dynamically scheduled patients
Arthur Kramer, Thiago Alves de Queiroz, Manuel Iori, et al.
(2023), pp. 61-67
Open Access
Single machine lot scheduling with fixed maintenance activity
Baruch Mor, Gur Mosheiov, Dana Shapira
(2023), pp. 69-74
Open Access
An FPTAS and an SFPTAS for maximizing the weighted number of just-in-time jobs in a proportionate flow shop system
Stanisław Gawiejnowicz, Nir Halman
(2023), pp. 45-51
Open Access
Polynomial-time solutions for minimizing total load on unrelated machines with position-dependent processing times and rate-modifying activities
Baruch Mor, Gur Mosheiov, Dvir Shabtay
(2023), pp. 75-79
Open Access
Scheduling with a limited testing budget
Christoph Damerius, Peter Kling, Minming Li, et al.
(2023), pp. 31-37
Open Access
Scheduling over scenarios
Leen Stougie
(2023), pp. 21-22
Open Access
Minimizing the total operations rejection cost plus makespan value in a two-machine flow shop scheduling problem
Enrique Gerstl, Dvir Shabtay
(2023), pp. 101-108
Open Access
Page 1

Scroll to top