Abstract
In scheduling fire fighting resource problems, increasing time is required to control a fire if the beginning of the containment effort is delayed. A fire has escaped initial attack if its containment time exceeds a specific “containment escape time limit”, which can be calculated at its ignition time. These times can be considered as due dates. The problem of scheduling a single fire fighting resource when there are multiple forest fires to be suppressed is considered in this paper, in the case where the objective is to minimize the total weighted tardiness in wildfire suppression. A model of the problem is presented, one fast to calculate lower bound for the problem tackled is shown and a heuristic algorithm is used for the extraction of an upper bound of the solution.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Chen Z-L (1995) A note on single-processor scheduling with time dependent execution times. Oper Res Lett 17:127–129
Cheng TC, Ding Q (1998) The complexity of scheduling starting time dependent tasks with release times. Inf Process Lett 65:75–79
Cheng TCE, Ding Q (2001) Single machine scheduling with step-deteriorating processing times. Eur J Oper Res 134(3):623–630
Ho KI-J, Leung JY-T, Wei W-D (1993) Complexity of scheduling tasks with time-dependent execution times. Inf process Lett 48:315–320
Jeng AAK, Lin BMT (2005) Minimizing the total completion time in single-machine scheduling with step-deteriorating jobs. Comput Oper Res 32(3):521–536
Kanet JJ, Li X (2004) A weighted modified due date rule for sequencing to minimize weighted tardiness. J Sched 7(4):261–276
Martin-Fernandez S, Martinez-Falero E, Perez-Gonzalez JM (2002) Optimization of the resources management in fighting wildfires. Environ Manage 30(3):352–364
McAlpine RS, Wakimoto RH (1991) The acceleration of fire from point source to equilibrium spread. For Sci 37(5):1314–1317
Mosheiov G (1994) Scheduling jobs under simple linear deterioration. Comput Oper Res 21:653–659
Pappis CP, Rachaniotis NP (2009a) Scheduling a single fire fighting resource with deteriorating fire suppression times and set-up times. Oper Res Int J. doi:10.1007/s12351-009-0038-6
Pappis CP, Rachaniotis NP (2009b) Scheduling in a multi-processor environment with deteriorating job processing times and decreasing values: the case of forest fires. J Heuristics. doi:10.1007/s10732-009-9110-x
Rachaniotis NP, Pappis CP (2006) Scheduling fire fighting tasks using the concept of ‘deteriorating jobs’. Can J For Res 43(7):652–658
Rinnooy Kan AHG (1976) Machine scheduling problems. Classification, complexity and computations. Martinus Nijhoff, The Hague
Sundararaghavan PS, Kunnathur A (1994) Single machine scheduling with start time dependent processing times: some solvable cases. Eur J Oper Res 78:394–403
Woeginger GJ (1995) Scheduling with time-dependent execution times. Inf Process Lett 54:155–156
Acknowledgments
Dr. Nikos P. Rachaniotis’ contribution to this research work has been supported by the Greek State Scholarships Foundation under grant number 851.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Rachaniotis, N.P., Pappis, C.P. Minimizing the total weighted tardiness in wildfire suppression. Oper Res Int J 11, 113–120 (2011). https://doi.org/10.1007/s12351-010-0079-x
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s12351-010-0079-x