Suivre
Mohammad Saber Fallah Nezhad
Mohammad Saber Fallah Nezhad
Professor, Yazd University
Adresse e-mail validée de yazd.ac.ir - Page d'accueil
Titre
Citée par
Citée par
Année
Design of a reliable hierarchical location-allocation model under disruptions for health service networks: A two-stage robust approach
N Zarrinpoor, MS Fallahnezhad, MS Pishvaee
Computers & Industrial Engineering 109, 130-150, 2017
942017
Software effort estimation based on the optimal Bayesian belief network
F Zare, HK Zare, MS Fallahnezhad
Applied Soft Computing 49, 968-980, 2016
772016
A joint supplier selection and order allocation model with disruption risks in centralized supply chain
E Esmaeili-Najafabadi, MSF Nezhad, H Pourmohammadi, M Honarvar, ...
Computers & Industrial Engineering 127, 734-748, 2019
692019
A new monitoring design for uni-variate statistical quality control charts
MSF Nezhad, STA Niaki
Information Sciences 180 (6), 1051-1059, 2010
642010
The design of a reliable and robust hierarchical health service network using an accelerated Benders decomposition algorithm
N Zarrinpoor, MS Fallahnezhad, MS Pishvaee
European journal of operational research 265 (3), 1013-1032, 2018
632018
Decision rule of repetitive acceptance sampling plans assuring percentile life
M Aslam, STA Niaki, M Rasool, MS Fallahnezhad
Scientia Iranica 19 (3), 879-884, 2012
612012
Risk-averse supplier selection and order allocation in the centralized supply chains under disruption risks
E Esmaeili-Najafabadi, N Azad, MSF Nezhad
Expert Systems with Applications 175, 114691, 2021
492021
Repetitive group sampling plan based on the process capability index for the lot acceptance problem
MS Fallah Nezhad, S Seifi
Journal of Statistical Computation and Simulation 87 (1), 29-41, 2017
392017
A new economical design of acceptance sampling models using Bayesian inference
MS Fallahnezhad, M Aslam
Accreditation and Quality Assurance 18, 187-195, 2013
362013
Designing an optimum acceptance plan using Bayesian inference and stochastic dynamic programming
STA Niaki, MS Fallahnezhad
Scientia Iranica 16 (1), 19-25, 2009
35*2009
Absorbing Markov Chain Models to Determine Optimum Process Target Levels in Production Systems with Rework and Scrapping
NSTA Fallahnezhad MS
Journal of Industrial Engineering, Qazvin Islamic Azad University 4 (6), 1-6, 2011
34*2011
Variable sampling plan for resubmitted lots based on process capability index and Bayesian approach
S Seifi, MSF Nezhad
The International Journal of Advanced Manufacturing Technology 88, 2547-2555, 2017
332017
A new acceptance sampling policy based on number of successive conforming items
MS Fallahnezhad, STA Niaki
appear in Communications in Statistics-Theory and Methods, 2012
332012
A New Acceptance Sampling Design Using Bayesian Modeling and Backwards Induction
VZMA Fallahnezhad MS, Niaki STA
International Journal of Engineering, Islamic Republic of Iran 25 (1), 45-54, 2012
33*2012
A new acceptance sampling plan based on cumulative sums of conforming run-lengths
MS Fallah Nezhad, ST Akhavan Niaki, MH Abooie
Journal of Industrial and systems engineering 4 (4), 256-264, 2011
332011
Designing a single stage acceptance sampling plan based on the control threshold policy
NMS FALLAH, NH HOSSEINI
INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING AND PRODUCTION RESEARCH …, 2011
322011
An integrated model for economic design of chi-square control chart and maintenance planning
H Rasay, MS Fallahnezhad, Y Zare Mehrjerdi
Communications in Statistics-Theory and Methods 47 (12), 2892-2907, 2018
292018
A joint optimal policy for a multiple-suppliers multiple-manufacturers multiple-retailers system
MS Sajadieh, MS Fallahnezhad, M Khosravi
International Journal of Production Economics 146 (2), 738-744, 2013
292013
A new Bayesian acceptance sampling plan considering inspection errors
MSF Nezhad, HH Nasab
Scientia Iranica 19 (6), 1865-1869, 2012
282012
Cost analysis of fuzzy queuing systems
S Barak, MS Fallahnezhad
INTERNATIONAL JOURNAL OF APPLIED OPERATIONAL RESEARCH 2 (2), 25-36, 2012
272012
Le système ne peut pas réaliser cette opération maintenant. Veuillez réessayer plus tard.
Articles 1–20