Pourya Pourhejazy

Orcid: 0000-0002-1207-3587

According to our database1, Pourya Pourhejazy authored at least 22 papers between 2019 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Correction: N-list-enhanced heuristic for distributed three-stage assembly permutation flow shop scheduling.
Ann. Oper. Res., January, 2024

2023
Tailored Iterated Greedy metaheuristic for a scheduling problem in metal 3D printing.
Adv. Eng. Softw., December, 2023

Meta-Lamarckian-based iterated greedy for optimizing distributed two-stage assembly flowshops with mixed setups.
Ann. Oper. Res., March, 2023

Supply chain-oriented permutation flowshop scheduling considering flexible assembly and setup times.
Int. J. Prod. Res., 2023

An Integrated Approach for Assessing Suppliers Considering Economic Sustainability Innovation.
IEEE Access, 2023

Delving Into the Interdependencies in the Network of Economic Sustainability Innovations.
IEEE Access, 2023

2022
Adjusted Iterated Greedy for the optimization of additive manufacturing scheduling problems.
Expert Syst. Appl., 2022

Variable neighborhood-based Cuckoo Search for production routing with time window and setup times.
Appl. Soft Comput., 2022

Exploring the mutual influence among the social innovation factors amid the COVID-19 pandemic.
Appl. Soft Comput., 2022

2021
Smart Monitoring of Manufacturing Systems for Automated Decision-Making: A Multi-Method Framework.
Sensors, 2021

New benchmark algorithm for hybrid flowshop scheduling with identical machines.
Expert Syst. Appl., 2021

Multi-temperature simulated annealing for optimizing mixed-blocking permutation flowshop scheduling problems.
Expert Syst. Appl., 2021

Deep learning-based optimization for motion planning of dual-arm assembly robots.
Comput. Ind. Eng., 2021

New benchmark algorithms for No-wait Flowshop Group Scheduling Problem with Sequence-Dependent Setup Times.
Appl. Soft Comput., 2021

Unsupervised Learning-based Artificial Bee Colony for minimizing non-value-adding operations.
Appl. Soft Comput., 2021

New Benchmark Algorithm for Minimizing Total Completion Time in blocking flowshops with sequence-dependent setup times.
Appl. Soft Comput., 2021

2020
Product deletion as an operational strategic decision: Exploring the sequential effect of prominent criteria on decision-making.
Comput. Ind. Eng., 2020

Improved Beam Search for Optimizing No-Wait Flowshops With Release Times.
IEEE Access, 2020

Learning-Based Metaheuristic for Scheduling Unrelated Parallel Machines With Uncertain Setup Times.
IEEE Access, 2020

Minimizing Total Completion Time in Mixed-Blocking Permutation Flowshops.
IEEE Access, 2020

Greedy-Based Non-Dominated Sorting Genetic Algorithm III for Optimizing Single-Machine Scheduling Problem With Interfering Jobs.
IEEE Access, 2020

2019
A fuzzy-based decision aid method for product deletion of fast moving consumer goods.
Expert Syst. Appl., 2019


  Loading...