Scheduling in a multi-processor environment with deteriorating job processing times and decreasing values: the case of forest fires

Authors:
C. P. Pappis;N. P. Rachaniotis
Affiliations:
Department of Industrial Management and Technology, University of Piraeus, Piraeus, Greece 185 34;Department of Industrial Management and Technology, University of Piraeus, Piraeus, Greece 185 34
Venue:
Journal of Heuristics
Year:
2010

Citing 6
Cited 1

Worst case bound of an LRF schedule for the mean weighted flow-time problem

SIAM Journal on Computing
Scheduling jobs with step-deterioration; minimizing makespan on a single- and multi-machine

Computers and Industrial Engineering
Real-time scheduling of linear speedup parallel tasks

Information Processing Letters
Parallel machine scheduling with time dependent processing times

Discrete Applied Mathematics
Erratum to “Parallel machine scheduling with time dependent processing times” [Discrete Appl. Math. 70 (1996) 81–93]

Discrete Applied Mathematics
Scheduling linearly deteriorating jobs on multiple machines

Computers and Industrial Engineering - Special issue: new advances in analysis of manufacturing systems

Single-machine scheduling with deteriorating jobs and setup times to minimize the maximum tardiness

Computers and Operations Research

Quantified Score

Hi-index	0.01

Visualization

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.