default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMohammad Reisi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j13]Maryam Rajaei
, Ghasem Moslehi, Mohammad Reisi-Nafchi:
The multiple container loading problem with loading docks. Int. Trans. Oper. Res. 31(3): 1671-1698 (2024)- 2023
- [j12]Hemen Sanati, Ghasem Moslehi, Mohammad Reisi-Nafchi:
Unrelated parallel machine energy-efficient scheduling considering sequence-dependent setup times and time-of-use electricity tariffs. EURO J. Comput. Optim. 11: 100052 (2023) - [j11]Pouria Arsalani, Mohammad Reisi-Nafchi, Vahid Dardashti, Ghasem Moslehi:
Two new mixed-integer programming models for the integrated train formation and shipment path optimization problem. Networks 81(3): 359-377 (2023) - 2022
- [j10]Maryam Rajaei, Ghasem Moslehi, Mohammad Reisi-Nafchi:
The split heterogeneous vehicle routing problem with three-dimensional loading constraints on a large scale. Eur. J. Oper. Res. 299(2): 706-721 (2022) - [j9]Vahid Nasrollahi, Ghasem Moslehi, Mohammad Reisi-Nafchi:
Minimizing the weighted sum of maximum earliness and maximum tardiness in a single-agent and two-agent form of a two-machine flow shop scheduling problem. Oper. Res. 22(2): 1403-1442 (2022) - 2021
- [j8]Parvaneh Eghbalpor, Mohammad Reisi-Nafchi, Ghasem Moslehi:
Single machine scheduling problem of minimising weighted sum of maximum weighted earliness and weighted number of tardy jobs. Int. J. Manuf. Res. 16(2): 154-186 (2021) - 2020
- [j7]Babak Akbarzadeh, Ghasem Moslehi, Mohammad Reisi-Nafchi, Broos Maenhout:
A diving heuristic for planning and scheduling surgical cases in the operating room department with nurse re-rostering. J. Sched. 23(2): 265-288 (2020)
2010 – 2019
- 2019
- [j6]Haidar Samet, Mohammad Reisi, Fatemeh Marzbani:
Evaluation of neural network-based methodologies for wind speed forecasting. Comput. Electr. Eng. 78: 356-372 (2019) - [j5]Babak Akbarzadeh, Ghasem Moslehi, Mohammad Reisi-Nafchi, Broos Maenhout:
The re-planning and scheduling of surgical cases in the operating room department after block release time with resource rescheduling. Eur. J. Oper. Res. 278(2): 596-614 (2019) - 2017
- [j4]Somaye Geramipour, Ghasem Moslehi, Mohammad Reisi-Nafchi:
Maximizing the profit in customer's order acceptance and scheduling problem with weighted tardiness penalty. J. Oper. Res. Soc. 68(1): 89-101 (2017) - 2015
- [j3]Mohammad Reisi-Nafchi, Ghasem Moslehi:
A hybrid genetic and linear programming algorithm for two-agent order acceptance and scheduling problem. Appl. Soft Comput. 33: 37-47 (2015) - 2011
- [j2]Ehsan Molaee, Ghasem Moslehi, Mohammad Reisi:
Minimizing maximum earliness and number of tardy jobs in the single machine scheduling problem with availability constraint. Comput. Math. Appl. 62(9): 3622-3641 (2011) - 2010
- [j1]Ehsan Molaee, Ghasem Moslehi, Mohammad Reisi:
Minimizing maximum earliness and number of tardy jobs in the single machine scheduling problem. Comput. Math. Appl. 60(11): 2909-2919 (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-06-10 20:30 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:
