Остановите войну!
for scientists:
default search action
Ghasem Moslehi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j33]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
- [j32]Alireza Nikoubin, Mehdi Mahnam, Ghasem Moslehi:
A relax-and-fix Pareto-based algorithm for a bi-objective vaccine distribution network considering a mix-and-match strategy in pandemics. Appl. Soft Comput. 132: 109862 (2023) - [j31]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) - [j30]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
- [j29]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) - [j28]Danial Khorasanian, Franklin Dexter, Erik Demeulemeester, Ghasem Moslehi:
Minimising the number of cancellations at the time of a severe lack of postanesthesia care unit beds or nurses. Int. J. Prod. Res. 60(11): 3383-3396 (2022) - [j27]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
- [j26]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
- [j25]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
- [j24]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
- [j23]Danial Khorasanian, Ghasem Moslehi:
Two-machine flow shop scheduling problem with blocking, multi-task flexibility of the first machine, and preemption. Comput. Oper. Res. 79: 94-108 (2017) - [j22]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) - 2016
- [j21]S. Alimoradi, Milad Hematian, Ghasem Moslehi:
Robust scheduling of parallel machines considering total flow time. Comput. Ind. Eng. 93: 152-161 (2016) - [j20]O. Mashkani, Ghasem Moslehi:
Minimising the total completion time in a single machine scheduling problem under bimodal flexible periodic availability constraints. Int. J. Comput. Integr. Manuf. 29(3): 323-341 (2016) - [j19]Saeed Emami, Mohammad Sabbagh, Ghasem Moslehi:
A Lagrangian relaxation algorithm for order acceptance and scheduling problem: a globalised robust optimisation approach. Int. J. Comput. Integr. Manuf. 29(5): 535-560 (2016) - 2015
- [j18]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) - [j17]Kamran Kianfar, Ghasem Moslehi, Ramin Yahyapour:
A novel metaheuristic algorithm and utility function for QoS based scheduling in user-centric grid systems. J. Supercomput. 71(3): 1143-1162 (2015) - 2014
- [j16]Ghasem Moslehi, Danial Khorasanian:
A hybrid variable neighborhood search algorithm for solving the limited-buffer permutation flow shop scheduling problem with the makespan criterion. Comput. Oper. Res. 52: 260-268 (2014) - [j15]Ghasem Moslehi, Kamran Kianfar:
Approximation Algorithms and an FPTAS for the Single Machine Problem with Biased Tardiness Penalty. J. Appl. Math. 2014: 679702:1-679702:10 (2014) - 2013
- [j14]Danial Khorasanian, Seyyed Reza Hejazi, Ghasem Moslehi:
Two-sided assembly line balancing considering the relationships between tasks. Comput. Ind. Eng. 66(4): 1096-1105 (2013) - [j13]Abbas Ebadi, Ghasem Moslehi:
An optimal method for the preemptive job shop scheduling problem. Comput. Oper. Res. 40(5): 1314-1327 (2013) - [j12]Ghasem Moslehi, Danial Khorasanian:
Optimizing blocking flow shop scheduling problem with total completion time criterion. Comput. Oper. Res. 40(7): 1874-1883 (2013) - [j11]Kamran Kianfar, Ghasem Moslehi:
A note on "Fully polynomial time approximation scheme for the total weighted tardiness minimization with a common due date". Discret. Appl. Math. 161(13-14): 2205-2206 (2013) - [j10]Mehdi Mahnam, Ghasem Moslehi, Seyyed Mohammad Taghi Fatemi Ghomi:
Single machine scheduling with unequal release times and idle insert for minimizing the sum of maximum earliness and tardiness. Math. Comput. Model. 57(9-10): 2549-2563 (2013) - 2012
- [j9]Abbas Ebadi, Ghasem Moslehi:
Mathematical models for preemptive shop scheduling problems. Comput. Oper. Res. 39(7): 1605-1614 (2012) - [j8]Kamran Kianfar, Ghasem Moslehi:
A branch-and-bound algorithm for single machine scheduling with quadratic earliness and tardiness penalties. Comput. Oper. Res. 39(12): 2978-2990 (2012) - [j7]Abbasali Jafari, Ghasem Moslehi:
Scheduling linear deteriorating jobs to minimize the number of tardy jobs. J. Glob. Optim. 54(2): 389-404 (2012) - 2011
- [j6]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) - [j5]N. Nekoiemehr, Ghasem Moslehi:
Minimizing the sum of maximum earliness and maximum tardiness in the single-machine scheduling problem with sequence-dependent setup time. J. Oper. Res. Soc. 62(7): 1403-1412 (2011) - 2010
- [j4]Ghasem Moslehi, Abbasali Jafari:
Minimizing the number of tardy jobs under piecewise-linear deterioration. Comput. Ind. Eng. 59(4): 573-584 (2010) - [j3]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)
2000 – 2009
- 2006
- [j2]Reza Tavakkoli-Moghaddam, Ghasem Moslehi, M. Vasei, Amir Azaron:
A branch-and-bound algorithm for a single machine sequencing to minimize the sum of maximum earliness and tardiness with idle insert. Appl. Math. Comput. 174(1): 388-408 (2006) - 2005
- [j1]Reza Tavakkoli-Moghaddam, Ghasem Moslehi, M. Vasei, Amir Azaron:
Optimal scheduling for a single machine to minimize the sum of maximum earliness and tardiness considering idle insert. Appl. Math. Comput. 167(2): 1430-1450 (2005)
Coauthor Index
aka: Mohammad Reisi-Nafchi
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-04-25 05:49 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint