Mehdi Hosseinabadi Farahani
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Mehdi Hosseinabadi Farahani has a total of 38 co-authors. Here are the top co-authors by number of shared publications:
- Ali Azadeh
School of Industrial and Systems Engineering, Center of Excellence for Intelligent Based Experimental Mechanic and Department of Engineering Optimization Research, College of Engineering, University of Tehran, Tehran, Iran
5 shared publications A. Azadeh
4 shared publications- Ganesh Janakiraman
Naveen Jindal School of Management, The University of Texas at Dallas, Richardson, Texas 75080
3 shared publications - Leila Hosseini
Department of Industrial Engineering, University of Kurdistan, Sanandaj, Iran
3 shared publications Fardin Ahmadizar
2 shared publications- Jamal Arkat
Department of Industrial Engineering, University of Kurdistan, Sanandaj, Iran
2 shared publications
Latest Publications
- 11 February 2026
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Management Science
- Vol. 72  (10) , 8831-8854
Is Multicloud the Future? Desirability of Compatibility in Cloud Computing Market
Leading online service providers, as major customers of cloud computing services, are increasingly adopting a multicloud strategy to enhance service delivery across different locations. However, compatibility issues among various cloud platforms complicate the implementation of this strategy. To address this challenge, cloud providers can offer a multicloud management platform that acts as a bridge between distinct cloud environments. Although such a platform can enhance customers’ multicloud experience, it also entails additional costs for the cloud providers. Our paper examines cloud providers’ compatibility decisions and the impact of compatibility on competing cloud providers and their customers. Our findings reveal that, when compatibility is established in equilibrium, cloud providers consistently set higher prices for their resources than when compatibility is absent. Additionally, we find that a cloud provider with greater market dominance always attracts more demand, whereas the rival with smaller market dominance may experience a demand decrease. Interestingly, when a cloud provider establishes compatibility in equilibrium, the competitor’s profit always increases, although customer welfare can decline under compatibility. These insights, along with other findings presented in the paper, can support cloud providers in deciding when to establish compatibility and how to price their resources effectively. Furthermore, we provide guidelines for policymakers on when compatibility could enhance customer welfare, supporting effective implementation of compatibility strategies. This paper was accepted by D. J. Wu, information systems. Funding: S. Kumar thanks Temple Center for International Business Education and Research for partially supporting this research. Supplemental Material: The online appendix is available at https://doi.org/10.1287/mnsc.2023.01359 .
- 11 February 2026
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Management Science
- Vol. 72  (10) , 8831-8854
Is Multicloud the Future? Desirability of Compatibility in Cloud Computing Market
Leading online service providers, as major customers of cloud computing services, are increasingly adopting a multicloud strategy to enhance service delivery across different locations. However, compatibility issues among various cloud platforms complicate the implementation of this strategy. To address this challenge, cloud providers can offer a multicloud management platform that acts as a bridge between distinct cloud environments. Although such a platform can enhance customers’ multicloud experience, it also entails additional costs for the cloud providers. Our paper examines cloud providers’ compatibility decisions and the impact of compatibility on competing cloud providers and their customers. Our findings reveal that, when compatibility is established in equilibrium, cloud providers consistently set higher prices for their resources than when compatibility is absent. Additionally, we find that a cloud provider with greater market dominance always attracts more demand, whereas the rival with smaller market dominance may experience a demand decrease. Interestingly, when a cloud provider establishes compatibility in equilibrium, the competitor’s profit always increases, although customer welfare can decline under compatibility. These insights, along with other findings presented in the paper, can support cloud providers in deciding when to establish compatibility and how to price their resources effectively. Furthermore, we provide guidelines for policymakers on when compatibility could enhance customer welfare, supporting effective implementation of compatibility strategies. This paper was accepted by D. J. Wu, information systems. Funding: S. Kumar thanks Temple Center for International Business Education and Research for partially supporting this research. Supplemental Material: The online appendix is available at https://doi.org/10.1287/mnsc.2023.01359 .
- 15 November 2024
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Management Science
Avoiding Fields on Fire: Information Dissemination Policies for Environmentally Safe Crop-Residue Management
Agricultural open burning, that is, the practice of burning crop residue in harvested fields to prepare land for sowing a new crop, is well recognized as a significant contributor to CO2 and black-carbon emissions, and long-term climate change. Low-soil-tillage practices using an agricultural machine called the Happy Seeder, which can sow the new seed without removing the previous crop residue, have emerged as the most effective alternative to open burning. However, given the limited supply of Happy Seeders from the government, and the fact that farmers incur a significant yield loss if they delay sowing the new crop, farmers are often unwilling to wait to be processed by the Happy Seeder and, instead, burn their crop residue. We study how the government can use effective information-disclosure policies in the operation of Happy Seeders to minimize open burning. A Happy Seeder is assigned to process a group of farms. The government knows, but does not necessarily disclose, the Happy Seeder’s schedule at the start of the sowing season. We propose a class of information-disclosure policies, called dilatory policies, that provide no information to the farmers about the schedule until a prespecified switch period and then reveal the entire schedule afterward. We show that an optimal dilatory policy can significantly lower the number of farms burnt compared with that under the full-disclosure and the no-disclosure policies. Using data from the rice-wheat crop system in northwestern India, we demonstrate that the optimal dilatory policy can reduce CO2 and black-carbon emissions by 17% on average. We also examine the impact of the government’s policy on the trade-off between environmental damage and farmers’ welfare. This paper was accepted by Jayashankar Swaminathan, operations management. Supplemental Material: The online appendix and data files are available at https://doi.org/10.1287/mnsc.2021.03030 .
- 15 November 2024
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Management Science
Avoiding Fields on Fire: Information Dissemination Policies for Environmentally Safe Crop-Residue Management
Agricultural open burning, that is, the practice of burning crop residue in harvested fields to prepare land for sowing a new crop, is well recognized as a significant contributor to CO2 and black-carbon emissions, and long-term climate change. Low-soil-tillage practices using an agricultural machine called the Happy Seeder, which can sow the new seed without removing the previous crop residue, have emerged as the most effective alternative to open burning. However, given the limited supply of Happy Seeders from the government, and the fact that farmers incur a significant yield loss if they delay sowing the new crop, farmers are often unwilling to wait to be processed by the Happy Seeder and, instead, burn their crop residue. We study how the government can use effective information-disclosure policies in the operation of Happy Seeders to minimize open burning. A Happy Seeder is assigned to process a group of farms. The government knows, but does not necessarily disclose, the Happy Seeder’s schedule at the start of the sowing season. We propose a class of information-disclosure policies, called dilatory policies, that provide no information to the farmers about the schedule until a prespecified switch period and then reveal the entire schedule afterward. We show that an optimal dilatory policy can significantly lower the number of farms burnt compared with that under the full-disclosure and the no-disclosure policies. Using data from the rice-wheat crop system in northwestern India, we demonstrate that the optimal dilatory policy can reduce CO2 and black-carbon emissions by 17% on average. We also examine the impact of the government’s policy on the trade-off between environmental damage and farmers’ welfare. This paper was accepted by Jayashankar Swaminathan, operations management. Supplemental Material: The online appendix and data files are available at https://doi.org/10.1287/mnsc.2021.03030 .
- 1 July 2022
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Operations Research
- Vol. 70  (4) , 2013-2031
Order Now, Pickup in 30 Minutes: Managing Queues with Static Delivery Guarantees
The shift in the restaurant industry toward digital ordering argues for major changes in how orders are managed. The main difficulty in managing queues in online food-ordering services arises from the fact that, as opposed to dine-in customers, online customers are promised a pick-up time; customers are dissatisfied if the order is not completed by that time and are also dissatisfied if the order is completed much ahead of time because the food loses freshness. In “Order Now, Pickup in 30 Minutes: Managing Queues with Static Delivery Guarantees,” Farahani, Dawande, and Janakiraman propose and analyze strategies for managing queues in online food-ordering services with the goal of keeping customer satisfaction as high as possible.
- 1 July 2022
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Operations Research
- Vol. 70  (4) , 2013-2031
Order Now, Pickup in 30 Minutes: Managing Queues with Static Delivery Guarantees
The shift in the restaurant industry toward digital ordering argues for major changes in how orders are managed. The main difficulty in managing queues in online food-ordering services arises from the fact that, as opposed to dine-in customers, online customers are promised a pick-up time; customers are dissatisfied if the order is not completed by that time and are also dissatisfied if the order is completed much ahead of time because the food loses freshness. In “Order Now, Pickup in 30 Minutes: Managing Queues with Static Delivery Guarantees,” Farahani, Dawande, and Janakiraman propose and analyze strategies for managing queues in online food-ordering services with the goal of keeping customer satisfaction as high as possible.
- 1 September 2021
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Manufacturing & Service Operations Management
- Vol. 23  (5) , 1257-1274
Better to Bend than to Break: Sharing Supply Risk Using the Supply-Flexibility Contract
Problem definition : We analyze a contract in which a supplier who is exposed to disruption risk offers a supply-flexibility contract comprising of a wholesale price and a minimum-delivery fraction (“flexibility” fraction) to a buyer facing random demand. The supplier is allowed to deviate below the order quantity by at most the flexibility fraction. The supplier’s regular production is subject to random disruption, but she has access to a reliable expedited supply source at a higher marginal cost. Academic/practical relevance : Despite the prevalence of supply-flexibility contracts in practice, to the best of our knowledge, there is no previous academic literature examining the optimal design of supply-flexibility contracts. As such, the level of flexibility in practice is usually set on an ad-hoc basis, with buyers typically reluctant to share risk with suppliers. Our analysis of supply-flexibility contracts informs practice in two ways: First, using analytically supported arguments, it educates managers on the effects of their decisions on the economic outcomes. Second, it shows that the supply-flexibility contract benefits both the supplier and the buyer, regardless of which player chooses how supply risk is allocated in the supply chain. Methodology : Non-cooperative game theory, non-convex optimization. Results : We derive the supplier-led optimal contract and show that supply chain efficiency improves relative to the price-only contract. More interestingly, even though the buyer lets the supplier decide how the two share supply risk, profits of both the players increase by the introduction of flexibility into the contract. Further, supply flexibility may be even more valuable for the buyer compared with the supplier. Interestingly, the flexibility fraction is not monotone in supplier reliability and a more reliable supplier may even prefer to transfer more risk to the buyer. The robustness of these findings is established on two extensions: one where we study a buyer-led contract (i.e., the buyer chooses the flexibility fraction) and the other where the expedited supply option is available to both the supplier and the buyer. Managerial implications : The supply-flexibility contract is mutually beneficial for both players and yet retains all the advantages of the price-only contract—it is easy to implement, it requires minimal operational and administrative burden, and there is evidence of the use of such contracts in practice. While our focus is not on supply chain coordination, we note that the combination of two mechanisms—the supply-flexibility contract derived in this paper to share supply risk and a buyback contract to share demand risk—yields a coordinating contract.
- 1 September 2021
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Manufacturing & Service Operations Management
- Vol. 23  (5) , 1257-1274
Better to Bend than to Break: Sharing Supply Risk Using the Supply-Flexibility Contract
Problem definition : We analyze a contract in which a supplier who is exposed to disruption risk offers a supply-flexibility contract comprising of a wholesale price and a minimum-delivery fraction (“flexibility” fraction) to a buyer facing random demand. The supplier is allowed to deviate below the order quantity by at most the flexibility fraction. The supplier’s regular production is subject to random disruption, but she has access to a reliable expedited supply source at a higher marginal cost. Academic/practical relevance : Despite the prevalence of supply-flexibility contracts in practice, to the best of our knowledge, there is no previous academic literature examining the optimal design of supply-flexibility contracts. As such, the level of flexibility in practice is usually set on an ad-hoc basis, with buyers typically reluctant to share risk with suppliers. Our analysis of supply-flexibility contracts informs practice in two ways: First, using analytically supported arguments, it educates managers on the effects of their decisions on the economic outcomes. Second, it shows that the supply-flexibility contract benefits both the supplier and the buyer, regardless of which player chooses how supply risk is allocated in the supply chain. Methodology : Non-cooperative game theory, non-convex optimization. Results : We derive the supplier-led optimal contract and show that supply chain efficiency improves relative to the price-only contract. More interestingly, even though the buyer lets the supplier decide how the two share supply risk, profits of both the players increase by the introduction of flexibility into the contract. Further, supply flexibility may be even more valuable for the buyer compared with the supplier. Interestingly, the flexibility fraction is not monotone in supplier reliability and a more reliable supplier may even prefer to transfer more risk to the buyer. The robustness of these findings is established on two extensions: one where we study a buyer-led contract (i.e., the buyer chooses the flexibility fraction) and the other where the expedited supply option is available to both the supplier and the buyer. Managerial implications : The supply-flexibility contract is mutually beneficial for both players and yet retains all the advantages of the price-only contract—it is easy to implement, it requires minimal operational and administrative burden, and there is evidence of the use of such contracts in practice. While our focus is not on supply chain coordination, we note that the combination of two mechanisms—the supply-flexibility contract derived in this paper to share supply risk and a buyback contract to share demand risk—yields a coordinating contract.
- 1 February 2017
- Published by Elsevier in Computers & Industrial Engineering
- Vol. 104, 124-133
A genetic algorithm-Taguchi based approach to inventory routing problem of a single perishable product with transshipment
- 1 February 2017
- Published by Elsevier in Computers & Industrial Engineering
- Vol. 104, 124-133
A genetic algorithm-Taguchi based approach to inventory routing problem of a single perishable product with transshipment
- 16 February 2016
- Published by Taylor & Francis in International Journal of Computer Integrated Manufacturing
- Vol. 30  (2-3) , 292-304
A single-machine scheduling problem with learning effect, deterioration and non-monotonic time-dependent processing times
One of the most common objectives in single-machine scheduling problems is the minimisation of total tardiness. Due to the non-deterministic polynomial-time hard nature of this problem, different heuristic and metaheuristic algorithms have been employed to solve it. In this article, an integer programming model with non-monotonic time-dependent job processing times is developed in which deterioration and learning considerations are incorporated simultaneously. A hybrid genetic algorithm-tabu search (GA-TS) approach is employed to solve the problem. Also, to improve the performance of the GA, Taguchi method is used for parameter tuning. Lastly, in an attempt to validate the proposed model, different test problems are generated randomly and solved by both the hybrid GA-TS and an optimisation software, and thereafter a comparison is performed between the results obtained by them. According to the results, the developed approach has potential to yield near-optimum solutions in large-sized problems. To the best of our knowledge, this is the first study that considers non-monotonic time-dependent processing times, deterioration and learning effect simultaneously in a single-machine scheduling problem with the objective of total tardiness minimisation.
- 16 February 2016
- Published by Taylor & Francis in International Journal of Computer Integrated Manufacturing
- Vol. 30  (2-3) , 292-304
A single-machine scheduling problem with learning effect, deterioration and non-monotonic time-dependent processing times
One of the most common objectives in single-machine scheduling problems is the minimisation of total tardiness. Due to the non-deterministic polynomial-time hard nature of this problem, different heuristic and metaheuristic algorithms have been employed to solve it. In this article, an integer programming model with non-monotonic time-dependent job processing times is developed in which deterioration and learning considerations are incorporated simultaneously. A hybrid genetic algorithm-tabu search (GA-TS) approach is employed to solve the problem. Also, to improve the performance of the GA, Taguchi method is used for parameter tuning. Lastly, in an attempt to validate the proposed model, different test problems are generated randomly and solved by both the hybrid GA-TS and an optimisation software, and thereafter a comparison is performed between the results obtained by them. According to the results, the developed approach has potential to yield near-optimum solutions in large-sized problems. To the best of our knowledge, this is the first study that considers non-monotonic time-dependent processing times, deterioration and learning effect simultaneously in a single-machine scheduling problem with the objective of total tardiness minimisation.
- 8 February 2016
- Published by Emerald Publishing in World Journal of Engineering
- Vol. 13  (1) , 82-90
Impact of integrated HSE management system on power generation in Iran by a unique mathematical programming approach
Purpose: Concern for health, safety and environment (HSE) is increasing in many developing countries, especially in energy industries. Improving power plants efficiencies in terms of HSE issues requires considering these issues in performance assessment of power generation units. This study aims to discuss the use of data envelopment analysis methodology for the performance assessment of electrical power plants in Iran by considering HSE and conventional indicators. Design/methodology/approach: Installed capacity, fuel consumption, labor cost, internal power, forced outage hours, operating hours and total power generation along with HSE indices are taken into consideration for determining the efficiency of 20 electric power plants or decision-making units (DMUs). Moreover, DMUs are ranked based on their relative efficiency scores. Findings: Results show that HSE factors are significant in performance assessment of the power plants studied in this research, and among HSE factors, health has the most powerful impact on the efficiency of the power plants. Originality/value: The approach of this study could be used for continuous improvement of combined HSE and conventional factors. It would also help managers to have better comprehension of key shaping factors in terms of HSE.
- 8 February 2016
- Published by Emerald Publishing in World Journal of Engineering
- Vol. 13  (1) , 82-90
Impact of integrated HSE management system on power generation in Iran by a unique mathematical programming approach
Purpose: Concern for health, safety and environment (HSE) is increasing in many developing countries, especially in energy industries. Improving power plants efficiencies in terms of HSE issues requires considering these issues in performance assessment of power generation units. This study aims to discuss the use of data envelopment analysis methodology for the performance assessment of electrical power plants in Iran by considering HSE and conventional indicators. Design/methodology/approach: Installed capacity, fuel consumption, labor cost, internal power, forced outage hours, operating hours and total power generation along with HSE indices are taken into consideration for determining the efficiency of 20 electric power plants or decision-making units (DMUs). Moreover, DMUs are ranked based on their relative efficiency scores. Findings: Results show that HSE factors are significant in performance assessment of the power plants studied in this research, and among HSE factors, health has the most powerful impact on the efficiency of the power plants. Originality/value: The approach of this study could be used for continuous improvement of combined HSE and conventional factors. It would also help managers to have better comprehension of key shaping factors in terms of HSE.
- 30 September 2015
- Published by SAGE Publications in SIMULATION
- Vol. 91  (10) , 925-941
Simulation–optimization of complex tandem queue systems with reneging and server breakdowns considering budget constraints
This paper presents a simulation–optimization model for tandem G/G/K queuing systems with infinite capacity considering reneging and server breakdowns. In this problem, the entities that enter each queue after a certain amount of waiting time renege from the queue. Moreover, each of the servers may break down based on the failure rates and will be repaired immediately according to the repair rates. Owing to the complexity of these systems, the OptQuest approach that combines the scatter search (SS) and tabu search (TS) algorithms is employed to determine the optimal number of servers in each queue according to the capacity of resources as well as budget constraints. The main objective of this optimization is to minimize the total time in the system by keeping the average waiting time in each queue below the allowable waiting time. Finally, 20 distinct samples of tandem G/G/K queuing systems are used to evaluate the validity of the proposed simulation model and the optimization algorithm. To the best of our knowledge, this is the first study that both simulates and optimizes tandem G/G/K queuing systems by simultaneously considering reneging and server breakdowns such that budget constraints are satisfied.
- 30 September 2015
- Published by SAGE Publications in SIMULATION
- Vol. 91  (10) , 925-941
Simulation–optimization of complex tandem queue systems with reneging and server breakdowns considering budget constraints
This paper presents a simulation–optimization model for tandem G/G/K queuing systems with infinite capacity considering reneging and server breakdowns. In this problem, the entities that enter each queue after a certain amount of waiting time renege from the queue. Moreover, each of the servers may break down based on the failure rates and will be repaired immediately according to the repair rates. Owing to the complexity of these systems, the OptQuest approach that combines the scatter search (SS) and tabu search (TS) algorithms is employed to determine the optimal number of servers in each queue according to the capacity of resources as well as budget constraints. The main objective of this optimization is to minimize the total time in the system by keeping the average waiting time in each queue below the allowable waiting time. Finally, 20 distinct samples of tandem G/G/K queuing systems are used to evaluate the validity of the proposed simulation model and the optimization algorithm. To the best of our knowledge, this is the first study that both simulates and optimizes tandem G/G/K queuing systems by simultaneously considering reneging and server breakdowns such that budget constraints are satisfied.
- 1 July 2015
- Published by Elsevier in Artificial Intelligence in Medicine
- Vol. 64  (3) , 217-226
Semi-online patient scheduling in pathology laboratories
- 1 July 2015
- Published by Elsevier in Artificial Intelligence in Medicine
- Vol. 64  (3) , 217-226
Semi-online patient scheduling in pathology laboratories
- 13 December 2014
- Published by Springer Nature in The International Journal of Advanced Manufacturing Technology
- Vol. 78  (5-8) , 707-722
Solving a multi-objective open shop problem for multi-processors under preventive maintenance
- 13 December 2014
- Published by Springer Nature in The International Journal of Advanced Manufacturing Technology
- Vol. 78  (5-8) , 707-722
Solving a multi-objective open shop problem for multi-processors under preventive maintenance