default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPourya Pourhejazy
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j23]Kuo-Ching Ying, Pourya Pourhejazy
, Po-Jui Fu:
Correction: N-list-enhanced heuristic for distributed three-stage assembly permutation flow shop scheduling. Ann. Oper. Res. 332(1): 1311-1312 (2024)- [j22]Kuo-Ching Ying, Pourya Pourhejazy, Xin-Yi Huang:
Revisiting the development trajectory of parallel machine scheduling. Comput. Oper. Res. 168: 106709 (2024) - 2023
- [j21]Hadi Badri Ahmadi, Pourya Pourhejazy, Md. Abdul Moktadir, Ashish Dwivedi, James Jiann-Haw Liou:
Delving Into the Interdependencies in the Network of Economic Sustainability Innovations. IEEE Access 11: 29138-29148 (2023) - [j20]Hadi Badri Ahmadi, Dragan Pamucar, Pourya Pourhejazy, Sema Kayapinar Kaya, James Jiann-Haw Liou:
An Integrated Approach for Assessing Suppliers Considering Economic Sustainability Innovation. IEEE Access 11: 39675-39694 (2023) - [j19]Kuo-Ching Ying, Pourya Pourhejazy, Ya-Hsuan Huang:
Tailored Iterated Greedy metaheuristic for a scheduling problem in metal 3D printing. Adv. Eng. Softw. 186: 103546 (2023) - [j18]Pourya Pourhejazy, Chen-Yang Cheng, Kuo-Ching Ying, Nguyen Hoai Nam:
Meta-Lamarckian-based iterated greedy for optimizing distributed two-stage assembly flowshops with mixed setups. Ann. Oper. Res. 322(1): 125-146 (2023) - [j17]Kuo-Ching Ying, Pourya Pourhejazy, Chen-Yang Cheng, Ren-Siou Syu:
Supply chain-oriented permutation flowshop scheduling considering flexible assembly and setup times. Int. J. Prod. Res. 61(1): 258-281 (2023) - 2022
- [j16]Hadi Badri Ahmadi, Huai-Wei Lo, Pourya Pourhejazy, Himanshu Gupta, James Jiann-Haw Liou:
Exploring the mutual influence among the social innovation factors amid the COVID-19 pandemic. Appl. Soft Comput. 125: 109157 (2022) - [j15]Gen-Han Wu, Chen-Yang Cheng, Pourya Pourhejazy, Bai-Lyn Fang:
Variable neighborhood-based Cuckoo Search for production routing with time window and setup times. Appl. Soft Comput. 125: 109191 (2022) - [j14]Kuo-Ching Ying, Fabio Fruggiero, Pourya Pourhejazy, Bo-Yun Lee:
Adjusted Iterated Greedy for the optimization of additive manufacturing scheduling problems. Expert Syst. Appl. 198: 116908 (2022) - 2021
- [j13]Chen-Yang Cheng, Pourya Pourhejazy, Kuo-Ching Ying, Shi-Yao Huang:
New Benchmark Algorithm for Minimizing Total Completion Time in blocking flowshops with sequence-dependent setup times. Appl. Soft Comput. 104: 107229 (2021) - [j12]Chen-Yang Cheng, Pourya Pourhejazy, Kuo-Ching Ying, Chen-Fang Lin:
Unsupervised Learning-based Artificial Bee Colony for minimizing non-value-adding operations. Appl. Soft Comput. 105: 107280 (2021) - [j11]Chen-Yang Cheng, Pourya Pourhejazy, Kuo-Ching Ying, Yi-Hsiu Liao:
New benchmark algorithms for No-wait Flowshop Group Scheduling Problem with Sequence-Dependent Setup Times. Appl. Soft Comput. 111: 107705 (2021) - [j10]Kuo-Ching Ying, Pourya Pourhejazy, Chen-Yang Cheng, Zong-Ying Cai:
Deep learning-based optimization for motion planning of dual-arm assembly robots. Comput. Ind. Eng. 160: 107603 (2021) - [j9]Shih-Wei Lin, Chen-Yang Cheng, Pourya Pourhejazy, Kuo-Ching Ying:
Multi-temperature simulated annealing for optimizing mixed-blocking permutation flowshop scheduling problems. Expert Syst. Appl. 165: 113837 (2021) - [j8]Shih-Wei Lin, Chen-Yang Cheng, Pourya Pourhejazy, Kuo-Ching Ying, Chia-Hui Lee:
New benchmark algorithm for hybrid flowshop scheduling with identical machines. Expert Syst. Appl. 183: 115422 (2021) - [j7]Chen-Yang Cheng, Pourya Pourhejazy, Chia-Yu Hung, Chumpol Yuangyai:
Smart Monitoring of Manufacturing Systems for Automated Decision-Making: A Multi-Method Framework. Sensors 21(20): 6860 (2021) - 2020
- [j6]Chen-Yang Cheng, Pourya Pourhejazy, Kuo-Ching Ying, Shu-Fen Li, Chieh-Wen Chang:
Learning-Based Metaheuristic for Scheduling Unrelated Parallel Machines With Uncertain Setup Times. IEEE Access 8: 74065-74082 (2020) - [j5]Chen-Yang Cheng, Shih-Wei Lin, Pourya Pourhejazy, Kuo-Ching Ying, Jia-Wen Zheng:
Minimizing Total Completion Time in Mixed-Blocking Permutation Flowshops. IEEE Access 8: 142065-142075 (2020) - [j4]Chen-Yang Cheng, Shih-Wei Lin, Pourya Pourhejazy, Kuo-Ching Ying, Shu-Fen Li, Ying-Chun Liu:
Greedy-Based Non-Dominated Sorting Genetic Algorithm III for Optimizing Single-Machine Scheduling Problem With Interfering Jobs. IEEE Access 8: 142543-142556 (2020) - [j3]Pourya Pourhejazy, Shih-Wei Lin, Chen-Yang Cheng, Kuo-Ching Ying, Pei-Yu Lin:
Improved Beam Search for Optimizing No-Wait Flowshops With Release Times. IEEE Access 8: 148100-148124 (2020) - [j2]Pourya Pourhejazy, Joseph Sarkis, Qinghua Zhu:
Product deletion as an operational strategic decision: Exploring the sequential effect of prominent criteria on decision-making. Comput. Ind. Eng. 140: 106274 (2020)
2010 – 2019
- 2019
- [j1]Pourya Pourhejazy, Joseph Sarkis, Qinghua Zhu:
A fuzzy-based decision aid method for product deletion of fast moving consumer goods. Expert Syst. Appl. 119: 272-288 (2019)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-03 20:17 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
