Mohammad Reisi

Orcid: 0000-0003-1680-3644

According to our database1, Mohammad Reisi authored at least 13 papers between 2010 and 2024.

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

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

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

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

Evaluation of neural network-based methodologies for wind speed forecasting.
Comput. Electr. Eng., 2019

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

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

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


  Loading...