Amir Salehipour

Orcid: 0000-0003-4866-1396

According to our database1, Amir Salehipour authored at least 31 papers between 2011 and 2024.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
The coupled task scheduling problem: an improved mathematical program and a new solution algorithm.
Int. Trans. Oper. Res., July, 2024

Scheduling coupled tasks on parallel identical machines.
Optim. Lett., May, 2024

An optimization method for characterizing two groups of data.
Int. Trans. Oper. Res., March, 2024

An Efficient Approximate Dynamic Programming Approach for Resource-Constrained Project Scheduling with Uncertain Task Duration.
Proceedings of the 13th International Conference on Operations Research and Enterprise Systems, 2024

2023
Flow-shop scheduling with exact delays to minimize makespan.
Comput. Ind. Eng., September, 2023

The gradual minimum covering location problem.
J. Oper. Res. Soc., April, 2023

A Forward-Backward Relax-and-Solve Algorithm for the Resource-Constrained Project Scheduling Problem.
SN Comput. Sci., March, 2023

2022
ABFIA: A hybrid algorithm based on artificial bee colony and Fibonacci indicator algorithm.
J. Comput. Sci., 2022

Heuristics for flights arrival scheduling at airports.
Int. Trans. Oper. Res., 2022

An Efficient Relax-and-Solve Algorithm for the Resource-Constrained Project Scheduling Problem.
Proceedings of the 11th International Conference on Operations Research and Enterprise Systems, 2022

2021
Coupled task scheduling with time-dependent processing times.
J. Sched., 2021

The just-in-time job-shop scheduling problem with distinct due-dates for operations.
J. Heuristics, 2021

A meta-heuristic to solve the just-in-time job-shop scheduling problem.
Eur. J. Oper. Res., 2021

Four decades of research on the open-shop scheduling problem to minimize the makespan.
Eur. J. Oper. Res., 2021

Coupled task scheduling with convex resource consumption functions.
Discret. Appl. Math., 2021

A binary search algorithm for the general coupled task scheduling problem.
4OR, 2021

A Bayesian Optimisation Approach for Multidimensional Knapsack Problem.
Proceedings of the Optimization and Learning - 4th International Conference, 2021

2020
An algorithm for single- and multiple-runway aircraft landing problem.
Math. Comput. Simul., 2020

Coupled task scheduling with exact delays: Literature review and models.
Eur. J. Oper. Res., 2020

A Heuristic Algorithm for the Set k-Cover Problem.
Proceedings of the Optimization and Learning - Third International Conference, 2020

A Relax-and-Solve Algorithm for the Ordered Flow-Shop Scheduling Problem.
Proceedings of the IEEE International Conference on Industrial Engineering and Engineering Management, 2020

A Matheuristic for Practical Flights Arrival and Departure Scheduling.
Proceedings of the IEEE International Conference on Industrial Engineering and Engineering Management, 2020

2019
Makespan minimization for the <i>m</i>-machine ordered flow shop scheduling problem.
Comput. Oper. Res., 2019

A New Mathematical Model for the Traveling Repairman Problem.
Proceedings of the 2019 IEEE International Conference on Industrial Engineering and Engineering Management, 2019

Investigating a Breast Cancer Gene Expression Data Using a Novel Clustering Approach.
Proceedings of the 2019 IEEE International Conference on Industrial Engineering and Engineering Management, 2019

2018
A fuzzy inference- fuzzy analytic hierarchy process-based clinical decision support system for diagnosis of heart diseases.
Expert Syst. Appl., 2018

2013
An efficient hybrid meta-heuristic for aircraft landing problem.
Comput. Oper. Res., 2013

2012
Speeding up the Floyd-Warshall algorithm for the cycled shortest path problem.
Appl. Math. Lett., 2012

Exact and Heuristic Solutions to Minimize Total Waiting Time in the Blood Products Distribution Problem.
Adv. Oper. Res., 2012

2011
Evaluating fuzzy earned value indices and estimates by applying alpha cuts.
Expert Syst. Appl., 2011

Efficient GRASP+VND and GRASP+VNS metaheuristics for the traveling repairman problem.
4OR, 2011


  Loading...