Ghasem Moslehi

Orcid: 0000-0001-6727-2578

According to our database1, Ghasem Moslehi authored at least 33 papers between 2005 and 2024.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
The multiple container loading problem with loading docks.
Int. Trans. Oper. Res., May, 2024

2023
Two new mixed-integer programming models for the integrated train formation and shipment path optimization problem.
Networks, April, 2023

Unrelated parallel machine energy-efficient scheduling considering sequence-dependent setup times and time-of-use electricity tariffs.
EURO J. Comput. Optim., January, 2023

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., 2023

2022
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., 2022

Minimising the number of cancellations at the time of a severe lack of postanesthesia care unit beds or nurses.
Int. J. Prod. Res., 2022

The split heterogeneous vehicle routing problem with three-dimensional loading constraints on a large scale.
Eur. J. Oper. Res., 2022

2021
Single machine scheduling problem of minimising weighted sum of maximum weighted earliness and weighted number of tardy jobs.
Int. J. Manuf. Res., 2021

2020
A diving heuristic for planning and scheduling surgical cases in the operating room department with nurse re-rostering.
J. Sched., 2020

2019
The re-planning and scheduling of surgical cases in the operating room department after block release time with resource rescheduling.
Eur. J. Oper. Res., 2019

2017
Maximizing the profit in customer's order acceptance and scheduling problem with weighted tardiness penalty.
J. Oper. Res. Soc., 2017

Two-machine flow shop scheduling problem with blocking, multi-task flexibility of the first machine, and preemption.
Comput. Oper. Res., 2017

2016
Minimising the total completion time in a single machine scheduling problem under bimodal flexible periodic availability constraints.
Int. J. Comput. Integr. Manuf., 2016

A Lagrangian relaxation algorithm for order acceptance and scheduling problem: a globalised robust optimisation approach.
Int. J. Comput. Integr. Manuf., 2016

Robust scheduling of parallel machines considering total flow time.
Comput. Ind. Eng., 2016

2015
A novel metaheuristic algorithm and utility function for QoS based scheduling in user-centric grid systems.
J. Supercomput., 2015

A hybrid genetic and linear programming algorithm for two-agent order acceptance and scheduling problem.
Appl. Soft Comput., 2015

2014
Approximation Algorithms and an FPTAS for the Single Machine Problem with Biased Tardiness Penalty.
J. Appl. Math., 2014

A hybrid variable neighborhood search algorithm for solving the limited-buffer permutation flow shop scheduling problem with the makespan criterion.
Comput. Oper. Res., 2014

2013
Single machine scheduling with unequal release times and idle insert for minimizing the sum of maximum earliness and tardiness.
Math. Comput. Model., 2013

A note on "Fully polynomial time approximation scheme for the total weighted tardiness minimization with a common due date".
Discret. Appl. Math., 2013

Optimizing blocking flow shop scheduling problem with total completion time criterion.
Comput. Oper. Res., 2013

An optimal method for the preemptive job shop scheduling problem.
Comput. Oper. Res., 2013

Two-sided assembly line balancing considering the relationships between tasks.
Comput. Ind. Eng., 2013

2012
Scheduling linear deteriorating jobs to minimize the number of tardy jobs.
J. Glob. Optim., 2012

A branch-and-bound algorithm for single machine scheduling with quadratic earliness and tardiness penalties.
Comput. Oper. Res., 2012

Mathematical models for preemptive shop scheduling problems.
Comput. Oper. Res., 2012

2011
Minimizing the sum of maximum earliness and maximum tardiness in the single-machine scheduling problem with sequence-dependent setup time.
J. Oper. Res. Soc., 2011

Minimizing maximum earliness and number of tardy jobs in the single machine scheduling problem with availability constraint.
Comput. Math. Appl., 2011

2010
Minimizing maximum earliness and number of tardy jobs in the single machine scheduling problem.
Comput. Math. Appl., 2010

Minimizing the number of tardy jobs under piecewise-linear deterioration.
Comput. Ind. Eng., 2010

2006
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., 2006

2005
Optimal scheduling for a single machine to minimize the sum of maximum earliness and tardiness considering idle insert.
Appl. Math. Comput., 2005


  Loading...