A multi-objective sustainable hub location-scheduling problem for perishable food supply chain MM Musavi, A Bozorgi-Amiri Computers & Industrial Engineering 113, 766-778, 2017 | 234 | 2017 |
The vehicle routing and scheduling problem with cross-docking for perishable products under uncertainty: Two robust bi-objective models A Rahbari, MM Nasiri, F Werner, MM Musavi, F Jolai Applied Mathematical Modelling 70, 605-625, 2019 | 114 | 2019 |
Bi-objective reliable location-inventory-routing problem with partial backordering under disruption risks: A modified AMOSA approach F Rayat, MM Musavi, A Bozorgi-Amiri Applied Soft Computing 59, 622-643, 2017 | 89 | 2017 |
Scheduling elective patients based on sequence-dependent setup times in an open-heart surgical department using an optimization and simulation approach M Hamid, M Hamid, MM Musavi, A Azadeh Simulation 95 (12), 1141-1164, 2019 | 38 | 2019 |
Pricing decisions of organic and conventional products in a dual-channel competitive food supply chain MM Musavi, AA Taleizadeh, A Bozorgi-Amiri, MS Moshtagh Annals of Operations Research, 1-37, 2022 | 6 | 2022 |
A Bi-Objective Green Truck Routing and Scheduling Problem in a Cross Dock with the Learning Effect MM Musavi, R Tavakkoli-Moghaddam, F Rayat IORS 8 (1), 2018 | 6 | 2018 |
Uncapacitated phub center problem under uncertainty J Nematian, MM Musavi Journal of industrial and systems engineering (jise.ir) 9 (special issue on …, 2016 | 4 | 2016 |
A bi-objective vehicle-routing problem for optimization of a bioenergy supply chain by using NSGA-II algorithm M Rabbani, N Akbarian-Saravi, M Ansari, MM Musavi Journal of Quality Engineering and Production Optimization 5 (1), 87-102, 2020 | 3 | 2020 |
Data-driven robust optimization for hub location-routing problem under uncertain environment. MM Musavi, A Bozorgi-Amiri Journal of Industrial and Systems Engineering 15 (2), 109-129, 2024 | | 2024 |
Deep Reinforcement Learning for a Multi-Objective Sustainable Hub Location-Routing Problem MM Musavi, A Bozorgi Amiri Available at SSRN 4682366, 0 | | |