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:
The Permutation Flow Shop Scheduling Problem with Human Resources: MILP Models, Decoding Procedures, NEH-Based Heuristics, and an Iterated Greedy Algorithm
Victor Fernández-Viagas, Luis Sanchez-Mediano, Alvaro Angulo-Cortes, et al.
Mathematics (2022) Vol. 10, Iss. 19, pp. 3446-3446
Open Access | Times Cited: 6
Victor Fernández-Viagas, Luis Sanchez-Mediano, Alvaro Angulo-Cortes, et al.
Mathematics (2022) Vol. 10, Iss. 19, pp. 3446-3446
Open Access | Times Cited: 6
Showing 6 citing articles:
Distributed Permutation Flow Shop Scheduling Problem with Worker flexibility: Review, trends and model proposition
Tasnim Mraihi, Olfa Belkahla Driss, Hind Bril El-Haouzi
Expert Systems with Applications (2023) Vol. 238, pp. 121947-121947
Closed Access | Times Cited: 26
Tasnim Mraihi, Olfa Belkahla Driss, Hind Bril El-Haouzi
Expert Systems with Applications (2023) Vol. 238, pp. 121947-121947
Closed Access | Times Cited: 26
Resilient Heuristics for Permutation FS Scheduling : A Comparative Study of NEH And CDS Techniques with Priority and Tie-Breaking Rules
Nameet Kumar Sethy, Dhiren Kumar Behera
SSRN Electronic Journal (2025)
Closed Access
Nameet Kumar Sethy, Dhiren Kumar Behera
SSRN Electronic Journal (2025)
Closed Access
Deterministic Method for Input Sequence Modification in NEH-Based Algorithms
Radosław Puka, Iwona Skalna, Bartosz Łamasz, et al.
IEEE Access (2024) Vol. 12, pp. 68940-68953
Open Access | Times Cited: 2
Radosław Puka, Iwona Skalna, Bartosz Łamasz, et al.
IEEE Access (2024) Vol. 12, pp. 68940-68953
Open Access | Times Cited: 2
Pixelation of time matrices for solving permutation flowshop scheduling problem
Shahriar Farahmand Rad
International Journal of Production Research (2024) Vol. 62, Iss. 23, pp. 8505-8517
Closed Access
Shahriar Farahmand Rad
International Journal of Production Research (2024) Vol. 62, Iss. 23, pp. 8505-8517
Closed Access
Transportation and delivery in flow-shop scheduling problems: A systematic review
Victor Fernández-Viagas
European Journal of Operational Research (2024)
Open Access
Victor Fernández-Viagas
European Journal of Operational Research (2024)
Open Access
Applying Iterative Algorithms to the Permutation Flow Shop Problem with Random Processing Times
Bruna Carvalho Silva, Marco Aurélio de Mesquita
(2023)
Closed Access
Bruna Carvalho Silva, Marco Aurélio de Mesquita
(2023)
Closed Access
