Bi-objective multi-resource scheduling problem for emergency relief operations |
| |
Authors: | Behrooz Bodaghi Ekambaram Palaneeswaran Babak Abbasi |
| |
Institution: | 1. Faculty of Science, Engineering and Technology, Swinburne University of Technology, Hawthorn, Victoria, Australia;2. bbodaghi@swin.edu.au;4. School of Business IT and Logistics, RMIT University, Melbourne, Victoria, Australiahttps://orcid.org/0000-0002-4332-2662 |
| |
Abstract: | AbstractResource scheduling for emergency relief operations is complex as it has many constraints. However, an effective allocation and sequencing of resources are crucial for the minimization of the completion times in emergency relief operations. Despite the importance of such decisions, only a few mathematical models of emergency relief operations have been studied. This article presents a bi-objective mixed integer programming (MIP) that helps to minimize both the total weighted time of completion of the demand points and the makespan of the total emergency relief operation. A two-phase method is developed to solve the bi-objective MIP problem. Additionally, a case study of hospital network in the Melbourne metropolitan area is used to evaluate the model. The results indicate that the model can successfully support the decisions required in the optimal resource scheduling of emergency relief operations. |
| |
Keywords: | Emergency relief operation resource scheduling mathematical programming bi-objective optimization disaster management |
|
|