default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMohammad Rohaninejad
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
2020 – today
- 2025
[j11]Behdin Vahedi Nouri
, Mohammad Rohaninejad, Zdenek Hanzálek, Mehdi Foumani:
A batch production scheduling problem in a reconfigurable hybrid manufacturing-remanufacturing system. Comput. Ind. Eng. 204: 111099 (2025)- [j10]Mohammad Rohaninejad, Behdin Vahedi Nouri, Reza Tavakkoli-Moghaddam, Zdenek Hanzálek:
A matheuristic approach for an integrated lot-sizing and scheduling problem with a period-based learning effect. Expert Syst. Appl. 269: 126234 (2025) - [j9]Farnaz Sohrabi, Mohammad Rohaninejad, Mohammad Reza Hesamzadeh, Július Bems:
Optimal Trading of a Charging-Station Company in Auction Markets for Electricity. IEEE Trans. Intell. Transp. Syst. 26(5): 6545-6555 (2025) - [c6]Andrii Nyporko, Matyás Svadlenka, Nikolai Antonov, Mohammad Rohaninejad, Lukás Chrpa:
Centralised Urban Traffic Routing Using Mixed-Integer Programming. ICAART (2) 2025: 176-187 - [i4]Farnaz Sohrabi, Mohammad Rohaninejad, Mohammad Reza Hesamzadeh, Július Bems:
Optimal Trading of a Charging-Station Company in Auction Markets for Electricity. CoRR abs/2501.04647 (2025) - [i3]Behdin Vahedi Nouri, Mohammad Rohaninejad, Zdenek Hanzálek, Mehdi Foumani:
A batch production scheduling problem in a reconfigurable hybrid manufacturing-remanufacturing system. CoRR abs/2504.00605 (2025) - 2024
- [j8]Mohammad Rohaninejad, Behdin Vahedi Nouri, Zdenek Hanzálek, Reza Tavakkoli-Moghaddam:
An integrated lot-sizing and scheduling problem in a reconfigurable manufacturing system under workforce constraints. Int. J. Prod. Res. 62(11): 3994-4013 (2024) - [i2]Farnaz Sohrabi, Mohammad Rohaninejad, Július Bems, Zdenek Hanzálek:
Electrification of Transportation: A Hybrid Benders/SDDP Algorithm for Optimal Charging Station Trading. CoRR abs/2410.03763 (2024) - [i1]Reza Shahabi-Shahmiri, Reza Tavakkoli-Moghaddam, Zdenek Hanzálek, Mohammad Ghasemi, Seyed Ali Mirnezami, Mohammad Rohaninejad:
Optimizing Perishable and Non-Perishable Product Assignment to packaging lines in a Sustainable Manufacturing System: An AUGMECON2VIKOR Algorithm. CoRR abs/2410.21844 (2024) - 2023
- [j7]Mohammad Rohaninejad, Mikolás Janota, Zdenek Hanzálek:
Integrated lot-sizing and scheduling: Mitigation of uncertainty in demand and processing time by machine learning. Eng. Appl. Artif. Intell. 118: 105676 (2023) - [c5]Zahra Mehdizadeh-Somarin, Reza Tavakkoli-Moghaddam, Mohammad Rohaninejad, Zdenek Hanzálek, Behdin Vahedi Nouri:
A Constraint Programming Model for a Reconfigurable Job Shop Scheduling Problem with Machine Availability. APMS (3) 2023: 477-490 - [c4]Hamed Nozari, Reza Tavakkoli-Moghaddam, Mohammad Rohaninejad, Zdenek Hanzálek:
Artificial Intelligence of Things (AIoT) Strategies for a Smart Sustainable-Resilient Supply Chain. APMS (3) 2023: 805-816 - 2022
- [j6]Mohammad Rohaninejad, Reza Tavakkoli-Moghaddam, Behdin Vahedi Nouri, Zdenek Hanzálek, Shadi Shirazian:
A hybrid learning-based meta-heuristic algorithm for scheduling of an additive manufacturing system consisting of parallel SLM machines. Int. J. Prod. Res. 60(20): 6205-6225 (2022) - [c3]Farnaz Sohrabi, Mohammad Rohaninejad, Mohammad Reza Hesamzadeh, Július Bems:
Optimal Trading of a Hybrid Electric, Hydrogen and Gas Fueling Station in Day-Ahead and Intra-day Markets: Modeling Aspect. OR 2022: 289-295 - 2021
- [j5]Behdin Vahedi Nouri, Reza Tavakkoli-Moghaddam, Zdenek Hanzálek, Hamidreza Arbabi, Mohammad Rohaninejad:
Incorporating order acceptance, pricing and equity considerations in the scheduling of cloud manufacturing systems: matheuristic methods. Int. J. Prod. Res. 59(7): 2009-2027 (2021) - [c2]Mohammad Rohaninejad, Zdenek Hanzálek, Reza Tavakkoli-Moghaddam:
Scheduling of Parallel 3D-Printing Machines with Incompatible Job Families: A Matheuristic Algorithm. APMS (1) 2021: 51-61
2010 – 2019
- 2018
- [j4]Mohammad Rohaninejad, Rashed Sahraeian, Reza Tavakkoli-Moghaddam:
An accelerated Benders decomposition algorithm for reliable facility location problems in multi-echelon networks. Comput. Ind. Eng. 124: 523-534 (2018) - 2017
- [j3]Mohammad Rohaninejad, Hamidreza Navidi, Behdin Vahedi Nouri, Reza Kamranrad:
A new approach to cooperative competition in facility location problems: Mathematical formulations and an approximation algorithm. Comput. Oper. Res. 83: 45-53 (2017) - 2016
- [j2]Mohammad Rohaninejad, Rashed Sahraeian, Behdin Vahedi Nouri:
Multi-objective optimization of integrated lot-sizing and scheduling problem in flexible job shops. RAIRO Oper. Res. 50(3): 587-609 (2016) - 2015
- [j1]Mohammad Rohaninejad, Amir Saman Kheirkhah, Behdin Vahedi Nouri, Parviz Fattahi:
Two hybrid tabu search-firefly algorithms for the capacitated job shop scheduling problem with sequence-dependent setup cost. Int. J. Comput. Integr. Manuf. 28(5): 470-487 (2015) - [c1]Mohammad Rohaninejad, Reza Tavakkoli-Moghaddam, Behdin Vahedi Nouri:
Redundancy Resource Allocation for Reliable Project Scheduling: A Game-theoretical Approach. CENTERIS/ProjMAN/HCist 2015: 265-273
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 2025-11-04 00:44 CET 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:
