Seguir
Bahman Naderi
Bahman Naderi
Senior research scientist at Amazon Web Services (aws)
Dirección de correo verificada de amazon.com
Título
Citado por
Citado por
Año
The distributed permutation flowshop scheduling problem
B Naderi, R Ruiz
Computers & operations research 37 (4), 754-768, 2010
5012010
Iterated Greedy methods for the distributed permutation flowshop scheduling problem
R Ruiz, QK Pan, B Naderi
Omega 83, 213-222, 2019
3402019
A scatter search algorithm for the distributed permutation flowshop scheduling problem
B Naderi, R Ruiz
European Journal of Operational Research 239 (2), 323-334, 2014
2772014
An improved simulated annealing for hybrid flowshops with sequence-dependent setup and transportation times to minimize total completion time and total tardiness
B Naderi, M Zandieh, AKG Balagh, V Roshanaei
Expert systems with Applications 36 (6), 9625-9633, 2009
2352009
Modelling and solving the integrated inventory-location-routing problem in a multi-period and multi-perishable product supply chain with uncertainty: Lagrangian relaxation …
Z Rafie-Majd, SHR Pasandideh, B Naderi
Computers & chemical engineering 109, 9-22, 2018
1562018
Scheduling flexible job-shops with transportation times: Mathematical models and a hybrid imperialist competitive algorithm
S Karimi, Z Ardalan, B Naderi, M Mohammadi
Applied mathematical modellíng 41, 667-682, 2017
1522017
Algorithms for a realistic variant of flowshop scheduling
B Naderi, R Ruiz, M Zandieh
Computers & Operations Research 37 (2), 236-246, 2010
1422010
A hybrid multi-population genetic algorithm for the dynamic facility layout problem
H Pourvaziri, B Naderi
Applied Soft Computing 24, 457-469, 2014
1412014
Electromagnetism-like mechanism and simulated annealing algorithms for flowshop scheduling problems minimizing the total weighted tardiness and makespan
B Naderi, R Tavakkoli-Moghaddam, M Khalili
Knowledge-Based Systems 23 (2), 77-85, 2010
1402010
Scheduling hybrid flowshops with sequence dependent setup times to minimize makespan and maximum tardiness
B Naderi, M Zandieh, V Roshanaei
The International Journal of Advanced Manufacturing Technology 41, 1186-1198, 2009
1372009
A variable neighborhood search for job shop scheduling with set-up times to minimize makespan
V Roshanaei, B Naderi, F Jolai, M Khalili
Future Generation Computer Systems 25 (6), 654-661, 2009
1292009
Hybrid flexible flowshop problems: Models and solution methods
B Naderi, S Gohari, M Yazdani
Applied mathematical modelling 38 (24), 5767-5780, 2014
1112014
Scheduling sequence-dependent setup time job shops with preventive maintenance
B Naderi, M Zandieh, SMT Fatemi Ghomi
The International Journal of Advanced Manufacturing Technology 43, 170-181, 2009
1072009
Modeling and heuristics for scheduling of distributed job shops
B Naderi, A Azab
Expert Systems with Applications 41 (17), 7754-7763, 2014
1012014
A preemptive fuzzy goal programming model for generalized supplier selection and order allocation with incremental discount
H Mirzaee, B Naderi, SHR Pasandideh
Computers & Industrial Engineering 122, 292-302, 2018
1002018
A novel imperialist competitive algorithm for generalized traveling salesman problems
Z Ardalan, S Karimi, O Poursabzi, B Naderi
Applied Soft Computing 26, 546-555, 2015
942015
Modeling and solving the project selection and scheduling
AA Tofighian, B Naderi
Computers & Industrial Engineering 83, 30-38, 2015
882015
Scheduling open shops with parallel machines to minimize total completion time
B Naderi, SMTF Ghomi, M Aminnayeri, M Zandieh
Journal of Computational and Applied Mathematics 235 (5), 1275-1287, 2011
882011
Clustering and ranking university majors using data mining and AHP algorithms: A case study in Iran
A Rad, B Naderi, M Soltani
Expert Systems with Applications 38 (1), 755-763, 2011
832011
New robust optimization models for closed-loop supply chain of durable products: Towards a circular economy
MS Atabaki, M Mohammadi, B Naderi
Computers & industrial engineering 146, 106520, 2020
812020
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–20