default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMorteza Rasti Barzoki
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j20]Parisa Assarzadegan, Seyed Reza Hejazi, Morteza Rasti Barzoki
:
A stackelberg differential game theoretic approach for analyzing coordination strategies in a supply chain with retailer's premium store brand. Ann. Oper. Res. 336(3): 1519-1549 (2024)- 2023
- [j19]Mohammed Mubarkoot, Jörn Altmann, Morteza Rasti Barzoki, Bernhard Egger, Hyejin Lee:
Software Compliance Requirements, Factors, and Policies: A Systematic Literature Review. Comput. Secur. 124: 102985 (2023) - 2022
- [j18]Hamid Zarei, Morteza Rasti Barzoki, Ilkyeong Moon:
A Game Theoretic Approach to the Selection, Mentorship, and Investment Decisions of Start-Up Accelerators. IEEE Trans. Engineering Management 69(4): 1753-1768 (2022) - [c2]Amir Mohammad Alaei, Morteza Rasti Barzoki, Jörn Altmann, Bernhard Egger:
A Game-Theoretic Approach for Pricing and Determining Virtual Reality Investment and Cybersecurity Level in a Dual-Channel Supply Chain. GECON 2022: 62-71 - [c1]Morteza Rasti Barzoki, Jörn Altmann, Bernhard Egger:
A Game-Theoretic Approach for Pricing and Determining Quality Levels of Cybersecurity Products Under an Exogenous Information-Sharing Program. GECON 2022: 153-157
2010 – 2019
- 2019
- [j17]Hossein Khorrami Sarvestani, Alborz Zadeh, Majid Seyfi, Morteza Rasti Barzoki:
Integrated order acceptance and supply chain scheduling problem with supplier selection and due date assignment. Appl. Soft Comput. 75: 72-83 (2019) - [j16]Mohammad Tamannaei, Morteza Rasti Barzoki:
Mathematical programming and solution approaches for minimizing tardiness and transportation costs in the supply chain scheduling problem. Comput. Ind. Eng. 127: 643-656 (2019) - [j15]Sajede Aminzadegan, Mohammad Tamannaei, Morteza Rasti Barzoki:
Multi-agent supply chain scheduling problem by considering resource allocation and transportation. Comput. Ind. Eng. 137 (2019) - [j14]Reza Mahmoudi, Ali Emrouznejad, Morteza Rasti Barzoki:
A bargaining game model for performance assessment in network DEA considering sub-networks: a real case study in banking. Neural Comput. Appl. 31(10): 6429-6447 (2019) - [j13]Hamid Zarei, Morteza Rasti Barzoki:
Mathematical programming and three metaheuristic algorithms for a bi-objective supply chain scheduling problem. Neural Comput. Appl. 31(12): 9073-9093 (2019) - 2018
- [j12]Reza Mahmoudi, Morteza Rasti Barzoki:
Sustainable supply chains under government intervention with a real-world case study: An evolutionary game theoretic approach. Comput. Ind. Eng. 116: 130-143 (2018) - [j11]Soroush Safarzadeh, Saba Khansefid, Morteza Rasti Barzoki:
A group multi-criteria decision-making based on best-worst method. Comput. Ind. Eng. 126: 111-121 (2018) - [j10]Soroush Safarzadeh, Morteza Rasti Barzoki:
A modified lexicographic semi-order model using the best-worst method. J. Decis. Syst. 27(2): 78-91 (2018) - 2017
- [j9]Alborz Hassanzadeh, Morteza Rasti Barzoki:
Minimizing total resource consumption and total tardiness penalty in a resource allocation supply chain scheduling and vehicle routing problem. Appl. Soft Comput. 58: 307-323 (2017) - [j8]Seyed Reza Madani, Morteza Rasti Barzoki:
Sustainable supply chain management with pricing, greening and governmental tariffs determining strategies: A game-theoretic approach. Comput. Ind. Eng. 105: 287-298 (2017) - [j7]Hamed Jafari, Seyed Reza Hejazi, Morteza Rasti Barzoki:
Pricing decisions in dual-channel supply chain with one manufacturer and multiple retailers: A game-theoretic approach. RAIRO Oper. Res. 51(4): 1269-1287 (2017) - 2016
- [j6]Parisa Assarzadegan, Morteza Rasti Barzoki:
Minimizing sum of the due date assignment costs, maximum tardiness and distribution costs in a supply chain scheduling problem. Appl. Soft Comput. 47: 343-356 (2016) - [j5]Alborz Hassanzadeh, Morteza Rasti Barzoki, Hossein Khosroshahi:
Two new meta-heuristics for a bi-objective supply chain scheduling problem in flow-shop environment. Appl. Soft Comput. 49: 335-351 (2016) - [j4]Jafar Chaab, Morteza Rasti Barzoki:
Cooperative advertising and pricing in a manufacturer-retailer supply chain with a general demand function; A game-theoretic approach. Comput. Ind. Eng. 99: 112-123 (2016) - 2013
- [j3]Morteza Rasti Barzoki, Seyed Reza Hejazi:
Minimizing the weighted number of tardy jobs with due date assignment and capacity-constrained deliveries for multiple customers in supply chains. Eur. J. Oper. Res. 228(2): 345-357 (2013) - 2012
- [j2]Jia-Chi Tsou, Seyed Reza Hejazi, Morteza Rasti Barzoki:
Economic production quantity model for items with continuous quality characteristic, rework and reject. Int. J. Syst. Sci. 43(12): 2261-2267 (2012) - 2011
- [j1]Morteza Rasti Barzoki, Morteza Jahanbazi, Mehdi Bijari:
Effects of imperfect products on lot sizing with work in process inventory. Appl. Math. Comput. 217(21): 8328-8336 (2011)
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-16 00:44 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:
