A note on network repair crew scheduling and routing for emergency relief distribution problem

Huai-Che Hong; Bertrand M. T. Lin

doi:10.3934/jimo.2018119

Article Contents

2019, Volume 15, Issue 4: 1729-1731. Doi: 10.3934/jimo.2018119

This issue Previous Article Coordinating the supplier-retailer supply chain under noise effect with bundling and inventory strategies Next Article A savings analysis of horizontal collaboration among VMI suppliers

A note on network repair crew scheduling and routing for emergency relief distribution problem

Huai-Che Hong and
Bertrand M. T. Lin^,

Institute of Information Management, Department of Information Management and Finance, National Chiao Tung University, Hsinchu 300, Taiwan

* Corresponding author: Bertrand M.T. Lin
* Corresponding author: Bertrand M.T. Lin

Received: May 2017

Revised: November 2017

Early access: August 2018

Published: July 2019

Abstract Full Text(HTML) Related Papers Cited by

Abstract

This paper proposes a dynamic programming algorithm for the NRCSRP with multiple crews. This algorithm also improves the existing algorithm for the problem with a single crew.

Keywords:

Repair crew scheduling,
dynamic programming.

Mathematics Subject Classification: Primary: 58F15, 58F17; Secondary: 53C35.

Citation:

Full Text(HTML)

Related Papers

Cited by

References

[1]	T. H. Cormen, C. E. Leiserson, R. L. Rivest and C. Stein, Introduction to Algorithms, 3^rd edition, the MIT Press, 2009, M. A.
[2]	P. A. Duque, I. S. Dolinskaya and K. Sörensen, Network repair crew scheduling and routing for emergency relief distribution problem, European Journal of Operational Research, 248 (2016), 272-285. doi: 10.1016/j.ejor.2015.06.026.