default search action
Amir Salehipour
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j24]Alireza Etminaniesfahani
, Hanyu Gu
An efficient relax-and-solve method for the multi-mode resource constrained project scheduling problem. Ann. Oper. Res. 338(1): 41-68 (2024) - [j23]Amir Salehipour
An optimization method for characterizing two groups of data. Int. Trans. Oper. Res. 31(2): 1004-1020 (2024) - [j22]Mostafa Khatami
The coupled task scheduling problem: an improved mathematical program and a new solution algorithm. Int. Trans. Oper. Res. 31(4): 2399-2426 (2024) - [j21]Mostafa Khatami
Scheduling coupled tasks on parallel identical machines. Optim. Lett. 18(4): 991-1003 (2024) - [c8]Alireza Etminaniesfahani
An Efficient Approximate Dynamic Programming Approach for Resource-Constrained Project Scheduling with Uncertain Task Duration. ICORES 2024: 261-268 - 2023
- [j20]Mostafa Khatami
Flow-shop scheduling with exact delays to minimize makespan. Comput. Ind. Eng. 183: 109456 (2023) - [j19]Mostafa Khatami
The gradual minimum covering location problem. J. Oper. Res. Soc. 74(4): 1092-1104 (2023) - [j18]Alireza Etminaniesfahani
A Forward-Backward Relax-and-Solve Algorithm for the Resource-Constrained Project Scheduling Problem. SN Comput. Sci. 4(2): 104 (2023) - 2022
- [j17]Mohammad Mahdi Ahmadian
Heuristics for flights arrival scheduling at airports. Int. Trans. Oper. Res. 29(4): 2316-2345 (2022) - [j16]Alireza Etminaniesfahani
ABFIA: A hybrid algorithm based on artificial bee colony and Fibonacci indicator algorithm. J. Comput. Sci. 61: 101651 (2022) - [c7]Alireza Etminaniesfahani
An Efficient Relax-and-Solve Algorithm for the Resource-Constrained Project Scheduling Problem. ICORES 2022: 271-277 - 2021
- [j15]Mostafa Khatami
A binary search algorithm for the general coupled task scheduling problem. 4OR 19(4): 593-611 (2021) - [j14]Gur Mosheiov, Daniel Oron, Amir Salehipour
Coupled task scheduling with convex resource consumption functions. Discret. Appl. Math. 293: 128-133 (2021) - [j13]Mohammad Mahdi Ahmadian
A meta-heuristic to solve the just-in-time job-shop scheduling problem. Eur. J. Oper. Res. 288(1): 14-29 (2021) - [j12]Mohammad Mahdi Ahmadian
Four decades of research on the open-shop scheduling problem to minimize the makespan. Eur. J. Oper. Res. 295(2): 399-426 (2021) - [j11]Mohammad Mahdi Ahmadian
The just-in-time job-shop scheduling problem with distinct due-dates for operations. J. Heuristics 27(1-2): 175-204 (2021) - [j10]Mostafa Khatami
Coupled task scheduling with time-dependent processing times. J. Sched. 24(2): 223-236 (2021) - [c6]Hanyu Gu
A Bayesian Optimisation Approach for Multidimensional Knapsack Problem. OLA 2021: 86-97 - 2020
- [j9]Mostafa Khatami
Coupled task scheduling with exact delays: Literature review and models. Eur. J. Oper. Res. 282(1): 19-39 (2020) - [j8]Amir Salehipour
An algorithm for single- and multiple-runway aircraft landing problem. Math. Comput. Simul. 175: 179-191 (2020) - [c5]Mostafa Khatami
A Relax-and-Solve Algorithm for the Ordered Flow-Shop Scheduling Problem. IEEM 2020: 1147-1151 - [c4]Mohammad Mahdi Ahmadian
A Matheuristic for Practical Flights Arrival and Departure Scheduling. IEEM 2020: 1162-1166 - [c3]Amir Salehipour
A Heuristic Algorithm for the Set k-Cover Problem. OLA 2020: 98-112
2010 – 2019
- 2019
- [j7]Mostafa Khatami
Makespan minimization for the m-machine ordered flow shop scheduling problem. Comput. Oper. Res. 111: 400-414 (2019) - [c2]Leila Moslemi Naeni
Investigating a Breast Cancer Gene Expression Data Using a Novel Clustering Approach. IEEM 2019: 1038-1042 - [c1]Leila Moslemi Naeni
A New Mathematical Model for the Traveling Repairman Problem. IEEM 2019: 1384-1387 - 2018
- [j6]Somayeh Nazari, Mohammad Fallah
A fuzzy inference- fuzzy analytic hierarchy process-based clinical decision support system for diagnosis of heart diseases. Expert Syst. Appl. 95: 261-271 (2018) - 2013
- [j5]Amir Salehipour
An efficient hybrid meta-heuristic for aircraft landing problem. Comput. Oper. Res. 40(1): 207-213 (2013) - 2012
- [j4]Amir Salehipour
Exact and Heuristic Solutions to Minimize Total Waiting Time in the Blood Products Distribution Problem. Adv. Oper. Res. 2012: 393890:1-393890:25 (2012) - [j3]Asghar Aini, Amir Salehipour
Speeding up the Floyd-Warshall algorithm for the cycled shortest path problem. Appl. Math. Lett. 25(1): 1-5 (2012) - 2011
- [j2]Amir Salehipour
Efficient GRASP+VND and GRASP+VNS metaheuristics for the traveling repairman problem. 4OR 9(2): 189-209 (2011) - [j1]Leila Moslemi Naeni
Evaluating fuzzy earned value indices and estimates by applying alpha cuts. Expert Syst. Appl. 38(7): 8193-8198 (2011)
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-10-07 21:17 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: