Vahid Roshanaei

Orcid: 0000-0002-9825-5743

According to our database1, Vahid Roshanaei authored at least 13 papers between 2009 and 2022.

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

2022
Critical-Path-Search Logic-Based Benders Decomposition Approaches for Flexible Job Shop Scheduling.
INFORMS J. Optim., January, 2022

Solving the Type-2 Assembly Line Balancing with Setups Using Logic-Based Benders Decomposition.
INFORMS J. Comput., 2022

2021
Solving integrated operating room planning and scheduling: Logic-based Benders decomposition versus Branch-Price-and-Cut.
Eur. J. Oper. Res., 2021

2020
Branch-Relax-and-Check: A tractable decomposition method for order acceptance and identical parallel machine scheduling.
Eur. J. Oper. Res., 2020

2019
A mixed-integer program and a Lagrangian-based decomposition algorithm for the supply chain network design with quantity discount and transportation modes.
Expert Syst. Appl., 2019

Almost Robust Discrete Optimization.
Eur. J. Oper. Res., 2019

Reformulation, linearization, and a hybrid iterated local search algorithm for economic lot-sizing and sequencing in hybrid flow shop problems.
Comput. Oper. Res., 2019

2017
Collaborative Operating Room Planning and Scheduling.
INFORMS J. Comput., 2017

Propagating logic-based Benders' decomposition approaches for distributed operating room scheduling.
Eur. J. Oper. Res., 2017

2010
Integrating non-preemptive open shops scheduling with sequence-dependent setup times using advanced metaheuristics.
Expert Syst. Appl., 2010

An integrated eigenvector-DEA-TOPSIS methodology for portfolio risk evaluation in the FOREX spot market.
Expert Syst. Appl., 2010

2009
A variable neighborhood search for job shop scheduling with set-up times to minimize makespan.
Future Gener. Comput. Syst., 2009

An improved simulated annealing for hybrid flowshops with sequence-dependent setup and transportation times to minimize total completion time and total tardiness.
Expert Syst. Appl., 2009


  Loading...