{"publication":"European Journal of Operational Research","date_updated":"2022-01-06T07:02:28Z","type":"journal_article","language":[{"iso":"eng"}],"citation":{"apa":"Rauchecker, G., &#38; Schryen, G. (2019). An Exact Branch-and-Price Algorithm for Scheduling Rescue Units during Disaster Response. <i>European Journal of Operational Research</i>, <i>272</i>(1), 352–363.","ieee":"G. Rauchecker and G. Schryen, “An Exact Branch-and-Price Algorithm for Scheduling Rescue Units during Disaster Response,” <i>European Journal of Operational Research</i>, vol. 272, no. 1, pp. 352–363, 2019.","ama":"Rauchecker G, Schryen G. An Exact Branch-and-Price Algorithm for Scheduling Rescue Units during Disaster Response. <i>European Journal of Operational Research</i>. 2019;272(1):352-363.","mla":"Rauchecker, Gerhard, and Guido Schryen. “An Exact Branch-and-Price Algorithm for Scheduling Rescue Units during Disaster Response.” <i>European Journal of Operational Research</i>, vol. 272, no. 1, Elsevier, 2019, pp. 352–63.","chicago":"Rauchecker, Gerhard, and Guido Schryen. “An Exact Branch-and-Price Algorithm for Scheduling Rescue Units during Disaster Response.” <i>European Journal of Operational Research</i> 272, no. 1 (2019): 352–63.","short":"G. Rauchecker, G. Schryen, European Journal of Operational Research 272 (2019) 352–363.","bibtex":"@article{Rauchecker_Schryen_2019, title={An Exact Branch-and-Price Algorithm for Scheduling Rescue Units during Disaster Response}, volume={272}, number={1}, journal={European Journal of Operational Research}, publisher={Elsevier}, author={Rauchecker, Gerhard and Schryen, Guido}, year={2019}, pages={352–363} }"},"user_id":"61579","volume":272,"department":[{"_id":"277"}],"_id":"5674","title":"An Exact Branch-and-Price Algorithm for Scheduling Rescue Units during Disaster Response","publisher":"Elsevier","author":[{"first_name":"Gerhard","full_name":"Rauchecker, Gerhard","last_name":"Rauchecker"},{"id":"72850","last_name":"Schryen","full_name":"Schryen, Guido","first_name":"Guido"}],"year":"2019","intvolume":"       272","status":"public","file":[{"date_updated":"2018-12-13T15:16:37Z","date_created":"2018-12-07T11:13:12Z","creator":"hsiemes","file_size":1470310,"content_type":"application/pdf","access_level":"open_access","relation":"main_file","file_id":"6019","file_name":"JOURNAL VERSION.pdf"}],"page":"352 - 363","issue":"1","ddc":["000"],"date_created":"2018-11-14T15:35:27Z","file_date_updated":"2018-12-13T15:16:37Z","keyword":["OR in disaster relief","disaster operations management","scheduling","branch-and-price"],"abstract":[{"text":"In disaster operations management, a challenging task for rescue organizations occurs when they have to assign and schedule their rescue units to emerging incidents under time pressure in order to reduce the overall resulting harm. Of particular importance in practical scenarios is the need to consider collaboration of rescue units. This task has hardly been addressed in the literature. We contribute to both modeling and solving this problem by (1) conceptualizing the situation as a type of scheduling problem, (2) modeling it as a binary linear minimization problem, (3) suggesting a branch-and-price algorithm, which can serve as both an exact and heuristic solution procedure, and (4) conducting computational experiments - including a sensitivity analysis of the effects of exogenous model parameters on execution times and objective value improvements over a heuristic suggested in the literature - for different practical disaster scenarios. The results of our computational experiments show that most problem instances of practically feasible size can be solved to optimality within ten minutes. Furthermore, even when our algorithm is terminated once the first feasible solution has been found, this solution is in almost all cases competitive to the optimal solution and substantially better than the solution obtained by the best known algorithm from the literature. This performance of our branch-and-price algorithm enables rescue organizations to apply our procedure in practice, even when the time for decision making is limited to a few minutes. By addressing a very general type of scheduling problem, our approach applies to various scheduling situations.","lang":"eng"}],"oa":"1","has_accepted_license":"1"}