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:

Improved MILP formulation equipped with valid inequalities for scheduling a batch processing machine with non-identical job sizes
Ali Husseinzadeh Kashan, Onur Öztürk
Omega (2022) Vol. 112, pp. 102673-102673
Closed Access | Times Cited: 15

Showing 15 citing articles:

Single batch-processing machine scheduling problem with interval grey processing time
Naiming Xie, Yihang Qin, Nanlei Chen, et al.
Applied Soft Computing (2025), pp. 112661-112661
Closed Access
An exact approach for bi-objective non-identical batch processing machines scheduling
Shaoxiang Zheng, Naiming Xie, Qiao Wu
Annals of Operations Research (2025)
Closed Access
Wasserstein distance‐based distributionally robust parallel‐machine scheduling
Yunqiang Yin, Zunhao Luo, Dujuan Wang, et al.
Omega (2023) Vol. 120, pp. 102896-102896
Closed Access | Times Cited: 9
Scheduling a set of jobs with convex piecewise linear cost functions on a single-batch-processing machine
Hongbin Zhang, Yang Yu, Feng Wu
Omega (2023) Vol. 122, pp. 102958-102958
Closed Access | Times Cited: 9
Online scheduling on parallel-batch machines with periodic availability constraints and job delivery
Ran Lin, Junqiang Wang, Ammar Oulamara
Omega (2022) Vol. 116, pp. 102804-102804
Closed Access | Times Cited: 15
An improved deep Q-learning algorithm for a trade-off between energy consumption and productivity in batch scheduling
Xu Zheng, Zhen Chen
Computers & Industrial Engineering (2024) Vol. 188, pp. 109925-109925
Closed Access | Times Cited: 2
Non-identical parallel machines batch processing problem to minimize the makespan: Models and algorithms
Pedram Beldar, Maria Battarra, Gilbert Laporte
Computers & Operations Research (2024) Vol. 168, pp. 106708-106708
Open Access | Times Cited: 2
Single machine parallel-batch scheduling under time-of-use electricity prices: New formulations and optimisation approaches
Zheng Tian, Li Zheng
European Journal of Operational Research (2023) Vol. 312, Iss. 2, pp. 512-524
Closed Access | Times Cited: 6
Scheduling for additive manufacturing with two-dimensional packing and incompatible items
Benedikt Zipfel, Rym M’Hallah, Udo Buscher
Omega (2024) Vol. 129, pp. 103139-103139
Open Access | Times Cited: 1
Novel mathematical formulations for parallel-batching processing machine scheduling problems
Shaoxiang Zheng, Naiming Xie, Qiao Wu, et al.
Computers & Operations Research (2024), pp. 106859-106859
Closed Access | Times Cited: 1
A Mixed Integer Linear Formulation and a Grouping League Championship Algorithm for a Multiperiod‐Multitrip Order Picking System with Product Replenishment to Minimize Total Tardiness
Morteza Farhadi Sartangi, Ali Husseinzadeh Kashan, Hassan Haleh, et al.
Complexity (2022) Vol. 2022, Iss. 1
Open Access | Times Cited: 5
A real-world case of autoclave loading and scheduling problems in aerospace composite material production
Volkan Haskilic, Aydın Ulucan, Kazım Barış Atici, et al.
Omega (2023) Vol. 120, pp. 102918-102918
Closed Access | Times Cited: 2
Robust possibilistic programming-based three-way decision approach to product inspection strategy
Jing Zhou, Decui Liang, Yu Liu, et al.
Information Sciences (2023) Vol. 646, pp. 119373-119373
Closed Access | Times Cited: 2
Bounded scheduling two-component jobs simultaneously or hierarchically
Yijie Li
RAIRO - Operations Research (2024) Vol. 58, Iss. 2, pp. 1115-1130
Open Access
An Exact Method for the Multi-Product P-Batch Processing Time Maximization Problem
Tatiana Balbi Fraga, Ítalo Ruan Barbosa de Aquino, Regilda da Costa e Silva Menêzes
(2023)
Closed Access
Page 1

Scroll to top