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 no-tardiness job shop scheduling problem with overtime consideration and the solution approaches
Shuangyuan Shi, Hegen Xiong, Gongfa Li
Computers & Industrial Engineering (2023) Vol. 178, pp. 109115-109115
Closed Access | Times Cited: 13

Showing 13 citing articles:

A Learning-Driven Multi-Objective cooperative artificial bee colony algorithm for distributed flexible job shop scheduling problems with preventive maintenance and transportation operations
Zhengpei Zhang, Yaping Fu, Kaizhou Gao, et al.
Computers & Industrial Engineering (2024) Vol. 196, pp. 110484-110484
Closed Access | Times Cited: 18
KSIPF: an effective noise filtering oversampling method based on k-means and iterative-partitioning filter
Pengfei Sun, Zhiping Wang, Liyan Jia, et al.
The Journal of Supercomputing (2025) Vol. 81, Iss. 4
Closed Access
An oversampling technique based on noise detection and geometry
Pengfei Sun, Zhiping Wang, Liyan Jia, et al.
Applied Soft Computing (2025), pp. 112718-112718
Closed Access
Two-stage graph attention networks and Q-learning based maintenance tasks scheduling
Xiaoyong Gao, Peng Diao, Yuning Yang, et al.
Applied Intelligence (2025) Vol. 55, Iss. 5
Closed Access
HGDO: An oversampling technique based on hypergraph recognition and Gaussian distribution
Liyan Jia, Zhiping Wang, Pengfei Sun, et al.
Information Sciences (2024) Vol. 679, pp. 120891-120891
Closed Access | Times Cited: 2
TDMO: Dynamic multi-dimensional oversampling for exploring data distribution based on extreme gradient boosting learning
Liyan Jia, Zhiping Wang, Pengfei Sun, et al.
Information Sciences (2023) Vol. 649, pp. 119621-119621
Closed Access | Times Cited: 6
Investigation of Flexible Job Shop with Machine Availability Constraints
Nurul Izah Anuar, Muhammad Hafidz Fazli Md Fauadi, Adi Saptari
Journal of Engineering Technology and Applied Physics (2024) Vol. 6, Iss. 1, pp. 55-66
Open Access
Automated mobile robots routing and job assignment in automated factory
Huiyuan Pang, Lu Zhen
Computers & Industrial Engineering (2024) Vol. 195, pp. 110420-110420
Closed Access
The Generalized Energy-Aware Flexible Job Shop Scheduling Model: A Constraint Programming Approach
Hajo Terbrack, Thorsten Claus
(2024)
Closed Access
A synthetic minority oversampling method with Elastic Net Hypergraph
Pengfei Sun, Zhiping Wang, Peiwen Wang, et al.
Engineering Applications of Artificial Intelligence (2024) Vol. 142, pp. 109885-109885
Closed Access
Worker Scheduling Based on Elite Non-Dominant Sorting Whale Optimization Algorithm (Ens-Woa) in C2m Model
Hongying Shan, Mengyao Qin, Libin Zhang, et al.
(2023)
Closed Access
A stochastic bi-objective cybersecurity analyst scheduling problem with preferential days off and upskilling decisions
Mayank Shukla, S.P. Sarmah, Manoj Kumar Tiwari
Computers & Industrial Engineering (2023) Vol. 183, pp. 109551-109551
Closed Access
Stick to the Plan or Adjust Dynamically? Combining Order Release and Overtime Planning for Varying Demand and Process Uncertainty
Julian Fodor, Stefan Haeussler
2018 Winter Simulation Conference (WSC) (2023), pp. 2100-2111
Closed Access
Page 1

Scroll to top