Mohsen Mosayebi

Papers

Total Citations

H-Index

About

Mohsen Mosayebi is a researcher whose work lies at the intersection of operations research, combinatorial optimization, and scheduling theory. His most cited paper, "The Traveling Salesman Problem with Job-times (TSPJ)" (2021), has garnered 28 citations, establishing a novel variant of the classic TSP that integrates job-processing times into routing decisions—a critical contribution for logistics and manufacturing systems where travel and task durations are interdependent. This work introduces new complexity insights and solution approaches, bridging a gap between vehicle routing and machine scheduling. Mosayebi’s research is characterized by its practical relevance, offering algorithms that improve efficiency in real-world supply chains and production planning. His contributions are particularly notable for their clarity in modeling realistic constraints, making them accessible to both theorists and practitioners. With a growing citation footprint, Mosayebi is emerging as a thoughtful voice in optimization, and his TSPJ framework continues to inspire further studies on integrated routing-scheduling problems. For students and researchers, his work exemplifies how classic problems can be reimagined to address modern operational challenges.