Behdin Vahedi-Nouri

Behdin Vahedi-Nouri

Auto-generated profile, based on publicly available information

Behdin Vahedi-Nouri

University of Tehran

Research Focus & Metrics

Academic Career Length

7Years (2020-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications

9 February 2023 in International Journal of Production Research
Verified
Journal Article
Closed access
BVBehdin Vahedi-Nouri
Behdin Vahedi-Nouri
RTReza Tavakkoli-Moghaddam
Reza Tavakkoli-Moghaddam
ZHZdenek Hanzalek
Zdenek Hanzalek
Alexandre DolguiAlexandre Dolgui
Alexandre Dolgui
Nowadays, the manufacturing sector needs higher levels of flexibility to confront the extremely volatile market. Accordingly, exploiting both machine and workforce reconfigurability as two critical sources of flexibility is advantageous. In this regard, for the first time, this paper explores an integrated production scheduling and workforce planning problem in a Reconfigurable Manufacturing System (RMS) benefiting from reconfigurable machines and human-robot collaboration. A new Mixed-Integer Linear Programming (MILP) model and an efficient Constraint Programming (CP) model are developed to formulate the problem, minimising the makespan as the performance metric. Due to the high complexity of the problem, the MILP model cannot handle large-sized instances. Hence, to evaluate the performance of the CP model in large-sized instances, a lower bound is derived based on the relaxation of the problem. Finally, extensive computational experiments are carried out to assess the performance of the devised MILP and CP models and provide general recommendations for managers dealing with such a complex problem. The results reveal the superiority of the CP model over the MILP model in small- and medium-sized instances. Moreover, the CP model can find high-quality solutions for large-sized instances within a reasonable computational time.

18 October 2021 in International Journal of Production Research
Verified
Journal Article
Closed access
MRMohammad Rohaninejad
Mohammad Rohaninejad
RTReza Tavakkoli-Moghaddam
Reza Tavakkoli-Moghaddam
BVBehdin Vahedi-Nouri
Behdin Vahedi-Nouri
ZHZdenek Hanzalek
Zdenek Hanzalek
SSShadi Shirazian
Shadi Shirazian
Additive manufacturing (AM) has been recognised as a promising technology under the context of Industry 4.0, which is reshaping manufacturing paradigms. A prominent type of AM machine is the selective laser melting (SLM) machine, in which several parts may form a job and be produced concurrently. This paper aims to investigate a scheduling problem in an AM system with non-identical parallel SLM machines. Since, in this system, there might be differences in the material types of parts, the required setup time between two consecutive jobs on the relevant machine is dependent on their material types. Accordingly, a bi-objective mathematical model is extended for the problem, considering the makespan and the total tardiness penalty as two objective functions. Due to the high complexity of the problem, an efficient hybrid meta-heuristic algorithm is developed by combining the non-dominated sorting genetic algorithm (NSGA-II) with a novel learning-based local search founded on the k-means clustering algorithm and a regression neural network. The local search enhances the exploitation ability of the NSGA-II while intelligently being taught during the solving procedure. Finally, the superiority of the proposed hybrid algorithm is demonstrated through a computational experiment.

17 August 2020 in International Journal of Production Research
Verified
Journal Article
Closed access
BVBehdin Vahedi-Nouri
Behdin Vahedi-Nouri
RTReza Tavakkoli-Moghaddam
Reza Tavakkoli-Moghaddam
ZHZdenek Hanzalek
Zdenek Hanzalek
HAHamidreza Arbabi
Hamidreza Arbabi
MRMohammad Rohaninejad
Mohammad Rohaninejad
Rooted from the Industry 4.0 principles, Cloud Manufacturing (CMfg) is a novel customer-oriented manufacturing norm, which can assist enterprises to withstand in the nowadays highly volatile and competitive market. CMfg systems comprise two separate parties, namely, customers and factories, with independent individuals. In this regard, considering the utilities of both customers and factories and establishing the equity amongst their individuals are of particular importance for the survival and flourishment of CMfg systems. Furthermore, due to the limited capacity of resources, tightness of due dates, and customers’ cost expectations, all orders may not be accepted in CMfg systems. Accordingly, this paper aims to explore a scheduling problem in a CMfg system. A multi-objective mathematical model is presented for the problem, which can determine the acceptance or rejection of orders, set prices, and schedule them in an integrated manner to maximise the customers and factories’ utilities, and enhance the equity among their members. Due to the high complexity of the problem, two matheuristic methods based on the Multi-Objective Grey Wolf Optimizer (MOGWO) and Non-dominated Sorting Genetic Algorithm II (NSGA-II) are developed. An extensive computational experiment is carried out to validate the proposed matheuristic methods and evaluate their performance. Moreover, some guidance is presented for managers by conducting a sensitivity analysis.

1 June 2020 in Applied Soft Computing
Verified
Journal Article
Closed access
YDY. Dorfeshan
Y. Dorfeshan
RTReza Tavakkoli-Moghaddam
Reza Tavakkoli-Moghaddam
SMS.M. Mousavi
S.M. Mousavi
BVB. Vahedi-Nouri
B. Vahedi-Nouri

18 November 2020 in International Journal of Production Research
Verified
Journal Article
Closed access
SFSoroush Fatemi-Anaraki
Soroush Fatemi-Anaraki
RTReza Tavakkoli-Moghaddam
Reza Tavakkoli-Moghaddam
DADorsa Abdolhamidi
Dorsa Abdolhamidi
BVBehdin Vahedi-Nouri
Behdin Vahedi-Nouri
Maritime shipment plays a pivotal role in goods transportation worldwide. Ships intending to load/unload a cargo should visit a port. Three main steps are taken during this process. Firstly, ships go through a waterway to reach the berthing area. Secondly, they are allocated to eligible wharves, and quay cranes are assigned to them. At last, ships leave the port area through the waterway. In this paper, the three mentioned stages are considered and solved in an integrated manner. A two-way waterway is deemed with the width limitation for ships moving in opposite directions. Furthermore, ships may arrive during the planning horizon. Tidal impacts, draft limit, and safety distance between ships are prominent maritime limitations included in this paper. As the three stages take place consecutively, the problem appears to resemble a hybrid flow shop scheduling problem with unrelated parallel machines, machine eligibility constraint, and shared resources. Following this attitude, a mathematical model is developed. Due to the problem complexity, three distinct matheuristic approaches are developed by combining the genetic algorithm, discrete differential evolution, and grey wolf optimiser with a mathematical model and tested using randomly-generated numerical instances. At last, developed matheuristics are compared, and some managerial insights are provided.