Abstract
In forest fire fighting, time and effort required to control a fire increase if fire containment effort is delayed. The problem of scheduling multiple resources employed as parallel identical or non-identical processors in order to contain N?2 fires may be tackled using the concept of deteriorating jobs. In this paper, the above problem is stated and a model is formulated, the criterion being to maximize the total remaining value of the burnt areas and a real-time synchronous heuristic algorithm is proposed. The heuristic algorithm's efficiency was compared to real data provided by Greek Fire Corps from a severe wildfire near Athens in June-July, 2007.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
