Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDB. Naderi 0001
Person information
- affiliation: University of Windsor, Faculty of Engineering, Production & Operations Management Research Lab, Windsor, Canada
- affiliation: Kharazmi University, Tehran, Iran
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j60]Bahman Naderi
, Rubén Ruiz, Vahid Roshanaei:
Mixed-Integer Programming vs. Constraint Programming for Shop Scheduling Problems: New Results and Outlook. INFORMS J. Comput. 35(4): 817-843 (2023)- 2022
- [j59]Bahman Naderi, Mehmet A. Begen, Gregory S. Zaric:
Type-2 integrated process-planning and scheduling problem: Reformulation and solution algorithms. Comput. Oper. Res. 142: 105728 (2022) - [j58]S. Fateme Attar, Mohammad Mohammadi, Seyed Hamid Reza Pasandideh, Bahman Naderi:
Formulation and exact algorithms for electric vehicle production routing problem. Expert Syst. Appl. 204: 117292 (2022) - [j57]Hassan Zohali, Bahman Naderi, Vahid Roshanaei:
Solving the Type-2 Assembly Line Balancing with Setups Using Logic-Based Benders Decomposition. INFORMS J. Comput. 34(1): 315-332 (2022) - [j56]Bahman Naderi, Vahid Roshanaei:
Critical-Path-Search Logic-Based Benders Decomposition Approaches for Flexible Job Shop Scheduling. INFORMS J. Optim. 4(1): 1-28 (2022) - [j55]Mohamadreza Dabiri, Mehdi Yazdani, Bahman Naderi, Hassan Haleh:
Modeling and solution methods for hybrid flow shop scheduling problem with job rejection. Oper. Res. 22(3): 2721-2765 (2022) - 2021
- [j54]Bahman Naderi, Ahmed Azab:
Production scheduling for reconfigurable assembly systems: Mathematical modeling and algorithms. Comput. Ind. Eng. 162: 107741 (2021) - [j53]Vahid Roshanaei, Bahman Naderi:
Solving integrated operating room planning and scheduling: Logic-based Benders decomposition versus Branch-Price-and-Cut. Eur. J. Oper. Res. 293(1): 65-78 (2021) - 2020
- [j52]Bahman Naderi, Kannan Govindan, Hamed Soleimani:
A Benders decomposition approach for a real case supply chain network design with capacity acquisition and transporter planning: wheat distribution network. Ann. Oper. Res. 291(1): 685-705 (2020) - [j51]Mohammad Saeid Atabaki, Mohammad Mohammadi, Bahman Naderi:
New robust optimization models for closed-loop supply chain of durable products: Towards a circular economy. Comput. Ind. Eng. 146: 106520 (2020) - [j50]Bahman Naderi, Vahid Roshanaei:
Branch-Relax-and-Check: A tractable decomposition method for order acceptance and identical parallel machine scheduling. Eur. J. Oper. Res. 286(3): 811-827 (2020) - [j49]Mostafa Dastmardi, Mohammad Mohammadi, Bahman Naderi:
Maximal covering salesman problems with average travelling cost constrains. Int. J. Math. Oper. Res. 17(2): 153-169 (2020) - [j48]Soheyl Khalilpourazari, Bahman Naderi, Saman Khalilpourazary:
Multi-Objective Stochastic Fractal Search: a powerful algorithm for solving complex multi-objective optimization problems. Soft Comput. 24(4): 3037-3066 (2020)
2010 – 2019
- 2019
- [j47]Hassan Zohali, Bahman Naderi, Mohammad Mohammadi:
The economic lot scheduling problem in limited-buffer flexible flow shops: Mathematical models and a discrete fruit fly algorithm. Appl. Soft Comput. 80: 904-919 (2019) - [j46]Alireza Sepahi Chavoshlou, Alireza Arshadi Khamseh, Bahman Naderi:
An optimization model of three-player payoff based on fuzzy game theory in green supply chain. Comput. Ind. Eng. 128: 782-794 (2019) - [j45]Hassan Zohali, Bahman Naderi, Mohammad Mohammadi, Vahid Roshanaei:
Reformulation, linearization, and a hybrid iterated local search algorithm for economic lot-sizing and sequencing in hybrid flow shop problems. Comput. Oper. Res. 104: 127-138 (2019) - [j44]M. Kheirabadi, B. Naderi, A. Arshadikhamseh, Vahid Roshanaei:
A mixed-integer program and a Lagrangian-based decomposition algorithm for the supply chain network design with quantity discount and transportation modes. Expert Syst. Appl. 137: 504-516 (2019) - [j43]Bahman Naderi, Ahmed Azab, Katayoun Borooshan:
A realistic multi-manned five-sided mixed-model assembly line balancing and scheduling problem with moving workers and limited workspace. Int. J. Prod. Res. 57(3): 643-661 (2019) - [j42]Bahman Naderia, Sheida Goharib:
The cycle shop scheduling: mathematical model, properties and solution algorithms. RAIRO Oper. Res. 53(1): 111-128 (2019) - [j41]Mohamadreza Fazli-Khalaf, Karo Fathollahzadeh, Amir Mollaei, Bahman Naderi, Mohammad Mohammadi:
A robust possibilistic programming model for water allocation problem. RAIRO Oper. Res. 53(1): 323-338 (2019) - 2018
- [j40]Arash Khayamim, Abolfazl Mirzazadeh, Bahman Naderi:
Portfolio rebalancing with respect to market psychology in a fuzzy environment: A case study in Tehran Stock Exchange. Appl. Soft Comput. 64: 244-259 (2018) - [j39]Hossein Mirzaee, B. Naderi, Seyed Hamid Reza Pasandideh:
A preemptive fuzzy goal programming model for generalized supplier selection and order allocation with incremental discount. Comput. Ind. Eng. 122: 292-302 (2018) - [j38]Zahra Rafie-Majd, Seyed Hamid Reza Pasandideh, Bahman Naderi:
Modelling and solving the integrated inventory-location-routing problem in a multi-period and multi-perishable product supply chain with uncertainty: Lagrangian relaxation algorithm. Comput. Chem. Eng. 109: 9-22 (2018) - [j37]Behzad Karimi, Seyed Taghi Akhavan Niaki, Hassan Haleh, Bahman Naderi:
Bi-objective optimization of a job shop with two types of failures for the operating machines that use automated guided vehicles. Reliab. Eng. Syst. Saf. 175: 92-104 (2018) - 2017
- [j36]Mohammad Saeid Atabaki, Mohammad Mohammadi, Bahman Naderi:
Hybrid Genetic Algorithm and Invasive Weed Optimization via Priority Based Encoding for Location-Allocation Decisions in a Three-Stage Supply Chain. Asia Pac. J. Oper. Res. 34(2): 1750008:1-1750008:44 (2017) - [j35]M. Torkashvand, B. Naderi, Seyyed Abbas Hosseini:
Modelling and scheduling multi-objective flow shop problems with interfering jobs. Appl. Soft Comput. 54: 221-228 (2017) - [j34]Sasan Khalifehzadeh, Mehdi Seifbarghy, Bahman Naderi:
Solving a fuzzy multi objective model of a production-distribution system using meta-heuristic based approaches. J. Intell. Manuf. 28(1): 95-109 (2017) - [j33]Mehdi Yazdani, Bahman Naderi, Shabnam Rahmani, Shadi Rahmani:
Truck routing and scheduling for cross-docking in the supply chain: model and solution method. RAIRO Oper. Res. 51(3): 833-856 (2017) - [j32]Mohammad Hossein Zavvar Sabegh, Mohammad Mohammadi, Bahman Naderi:
Multi-objective optimization considering quality concepts in a green healthcare supply chain for natural disaster response: neural network approaches. Int. J. Syst. Assur. Eng. Manag. 8(2s): 1689-1703 (2017) - 2016
- [j31]Fariba Soleimani, Alireza Arshadi Khamseh, Bahman Naderi:
Optimal decisions in a dual-channel supply chain under simultaneous demand and production cost disruptions. Ann. Oper. Res. 243(1-2): 301-321 (2016) - [j30]M. Keshtzari, B. Naderi, Esmaeil Mehdizadeh:
An improved mathematical model and a hybrid metaheuristic for truck scheduling in cross-dock problems. Comput. Ind. Eng. 91: 197-204 (2016) - [j29]Zaniar Ardalan, Sajad Karimi, B. Naderi, Alireza Arshadi Khamseh:
Supply chain networks design with multi-mode demand satisfaction policy. Comput. Ind. Eng. 96: 108-117 (2016) - [j28]Rasul Esmaeilbeigi, Bahman Naderi, Parisa Charkhgard:
New formulations for the setup assembly line balancing and scheduling problem. OR Spectr. 38(2): 493-518 (2016) - 2015
- [j27]Zaniar Ardalan, Sajad Karimi, Omid Poursabzi, B. Naderi:
A novel imperialist competitive algorithm for generalized traveling salesman problems. Appl. Soft Comput. 26: 546-555 (2015) - [j26]Mehdi Yazdani, Sheida Gohari, B. Naderi:
Multi-factory parallel machine problems: Improved mathematical models and artificial bee colony algorithm. Comput. Ind. Eng. 81: 36-45 (2015) - [j25]Ali Asghar Tofighian, B. Naderi:
Modeling and solving the project selection and scheduling. Comput. Ind. Eng. 83: 30-38 (2015) - [j24]Rasul Esmaeilbeigi, Bahman Naderi, Parisa Charkhgard:
The type E simple assembly line balancing problem: A mixed integer linear programming formulation. Comput. Oper. Res. 64: 168-177 (2015) - [j23]Mehdi Yazdani, B. Naderi, M. Mousakhani:
A Model and Metaheuristic for Truck Scheduling in Multi-door Cross-dock Problems. Intell. Autom. Soft Comput. 21(4): 633-644 (2015) - [j22]Ahmad Mortazavi, Alireza Arshadi Khamseh, Bahman Naderi:
A novel chaotic imperialist competitive algorithm for production and air transportation scheduling problems. Neural Comput. Appl. 26(7): 1709-1723 (2015) - 2014
- [j21]Hani Pourvaziri, B. Naderi:
A hybrid multi-population genetic algorithm for the dynamic facility layout problem. Appl. Soft Comput. 24: 457-469 (2014) - [j20]Mansooreh Madani-Isfahani, Reza Tavakkoli-Moghaddam, Bahman Naderi:
Multiple cross-docks scheduling using two meta-heuristic algorithms. Comput. Ind. Eng. 74: 129-138 (2014) - [j19]Bahman Naderi, Rubén Ruiz:
A scatter search algorithm for the distributed permutation flowshop scheduling problem. Eur. J. Oper. Res. 239(2): 323-334 (2014) - [j18]B. Naderi, Ahmed Azab:
Modeling and heuristics for scheduling of distributed job shops. Expert Syst. Appl. 41(17): 7754-7763 (2014) - [j17]Majid Khalili, Bahman Naderi:
Multi-objective job shop scheduling problem with sequence dependent setup times using a novel metaheuristic. Int. J. Intell. Eng. Informatics 2(4): 243-258 (2014) - [j16]B. Naderi, Mostafa Zandieh, Mehdi Yazdani:
Polynomial time approximation algorithms for proportionate open-shop scheduling. Int. Trans. Oper. Res. 21(6): 1031-1044 (2014) - [j15]Alireza Arshadi Khamseh, Fariba Soleimani, Bahman Naderi:
Pricing decisions for complementary products with firm's different market powers in fuzzy environments. J. Intell. Fuzzy Syst. 27(5): 2327-2340 (2014) - 2011
- [j14]B. Naderi, Mostafa Zandieh, Majid Aminnayeri:
Incorporating periodic preventive maintenance into flexible flowshop scheduling problems. Appl. Soft Comput. 11(2): 2094-2101 (2011) - [j13]A. Rad, Bahman Naderi, Mohammad Soltani:
Clustering and ranking university majors using data mining and AHP algorithms: A case study in Iran. Expert Syst. Appl. 38(1): 755-763 (2011) - [j12]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) - 2010
- [j11]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) - [j10]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) - [j9]B. Naderi, Rubén Ruiz, Mostafa Zandieh:
Algorithms for a realistic variant of flowshop scheduling. Comput. Oper. Res. 37(2): 236-246 (2010) - [j8]B. Naderi, Rubén Ruiz:
The distributed permutation flowshop scheduling problem. Comput. Oper. Res. 37(4): 754-768 (2010) - [j7]B. Naderi, Reza Tavakkoli-Moghaddam, M. Khalili:
Electromagnetism-like mechanism and simulated annealing algorithms for flowshop scheduling problems minimizing the total weighted tardiness and makespan. Knowl. Based Syst. 23(2): 77-85 (2010) - [c2]Bahman Naderi, Masoud Jenabi, S. M. T. Fatemi Ghomi, Davoud Talebi:
An electromagnetism-like metaheuristic for sequence dependent open shop scheduling. BIC-TA 2010: 489-497 - [c1]Masoud Jenabi, Bahman Naderi, S. M. T. Fatemi Ghomi:
A bi-objective case of no-wait flowshops. BIC-TA 2010: 1048-1056
2000 – 2009
- 2009
- [j6]B. Naderi, M. Khalili, Reza Tavakkoli-Moghaddam:
A hybrid artificial immune algorithm for a realistic variant of job shops to minimize the total completion time. Comput. Ind. Eng. 56(4): 1494-1501 (2009) - [j5]B. Naderi, Mostafa Zandieh, M. A. H. A. Shirazi:
Modeling and scheduling a case of flexible flowshops: Total weighted tardiness minimization. Comput. Ind. Eng. 57(4): 1258-1267 (2009) - [j4]B. Naderi, Mostafa Zandieh, A. Khaleghi Ghoshe Balagh, Vahid Roshanaei:
An improved simulated annealing for hybrid flowshops with sequence-dependent setup and transportation times to minimize total completion time and total tardiness. Expert Syst. Appl. 36(6): 9625-9633 (2009) - [j3]Vahid Roshanaei, B. Naderi, Fariborz Jolai, M. Khalili:
A variable neighborhood search for job shop scheduling with set-up times to minimize makespan. Future Gener. Comput. Syst. 25(6): 654-661 (2009) - [j2]Bahman Naderi, Mostafa Zandieh, Seyyed M. T. Fatemi Ghomi:
A study on integrating sequence dependent setup time flexible flow lines and preventive maintenance scheduling. J. Intell. Manuf. 20(6): 683-694 (2009) - [j1]Reza Tavakkoli-Moghaddam, M. Khalili, B. Naderi:
A hybridization of simulated annealing and electromagnetic-like mechanism for job shop problems with machine availability and sequence-dependent setup times to minimize total weighted tardiness. Soft Comput. 13(10): 995-1006 (2009)
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-07-08 21:24 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:
