default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMajid Aminnayeri
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j12]Maryam Safarnezhad, Majid Aminnayeri, R. Ghasemy Yaghin
:
Joint pricing and lot sizing model with statistical inspection and stochastic lead time. INFOR Inf. Syst. Oper. Res. 59(1): 111-144 (2021)
2010 – 2019
- 2019
- [j11]Fatemeh Sogandi, Majid Aminnayeri, Adel Mohammadpour, Amirhossein Amiri:
Risk-adjusted Bernoulli chart in multi-stage healthcare processes based on state-space model with a latent risk variable and dynamic probability control limits. Comput. Ind. Eng. 130: 699-713 (2019) - 2018
- [j10]Reza Sheikhrabori, Majid Aminnayeri, Mona Ayoubi:
Maximum likelihood estimation of change point from stationary to nonstationary in autoregressive models using dynamic linear model. Qual. Reliab. Eng. Int. 34(1): 27-36 (2018) - 2016
- [j9]Hamed Davari-Ardakani, Majid Aminnayeri, Abbas Seifi:
Multistage portfolio optimization with stocks and options. Int. Trans. Oper. Res. 23(3): 593-622 (2016) - [j8]Mina Rezaye Abbasi Charkhi, Majid Aminnayeri, Amirhossein Amiri:
Process Capability Indices for Logistic Regression Profile. Qual. Reliab. Eng. Int. 32(5): 1655-1661 (2016) - 2014
- [j7]Mostafa Hajiaghaei-Keshteli, Majid Aminnayeri:
Solving the integrated scheduling of production and rail transportation problem by Keshtel algorithm. Appl. Soft Comput. 25: 184-203 (2014) - [j6]Mostafa Hajiaghaei-Keshteli, Majid Aminnayeri, S. M. T. Fatemi Ghomi:
Integrated scheduling of production and rail transportation. Comput. Ind. Eng. 74: 240-256 (2014) - 2012
- [j5]Meysam Alizadeh, Fariborz Jolai, Majid Aminnayeri, Roy Rada:
Comparison of different input selection algorithms in neuro-fuzzy modeling. Expert Syst. Appl. 39(1): 1536-1544 (2012) - 2011
- [j4]B. Naderi, Mostafa Zandieh, Majid Aminnayeri:
Incorporating periodic preventive maintenance into flexible flowshop scheduling problems. Appl. Soft Comput. 11(2): 2094-2101 (2011) - [j3]B. Naderi, S. M. T. Fatemi Ghomi, Majid Aminnayeri, Mostafa Zandieh:
Scheduling open shops with parallel machines to minimize total completion time. J. Comput. Appl. Math. 235(5): 1275-1287 (2011) - [c1]Zahra Pourali, Majid Aminnayeri:
A Novel Discrete League Championship Algorithm for Minimizing Earliness/Tardiness Penalties with Distinct Due Dates and Batch Delivery Consideration. ICIC (1) 2011: 139-146 - 2010
- [j2]B. Naderi, S. M. T. Fatemi Ghomi, Majid Aminnayeri:
A high performing metaheuristic for job shop scheduling with sequence-dependent setup times. Appl. Soft Comput. 10(3): 703-710 (2010) - [j1]B. Naderi, S. M. T. Fatemi Ghomi, Majid Aminnayeri, Mostafa Zandieh:
A contribution and new heuristics for open shop scheduling. Comput. Oper. Res. 37(1): 213-221 (2010)
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-04-25 05:56 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:
