Post-disaster Repair Scheduling in Partially Automated Electricity Distribution Networks
Abstract
Natural disasters require repairing all damaged components in electricity distribution networks. Optimal scheduling repair crews to minimize the aggregate duration of interruptions reduces the harm. We consider the fact that the number of switches is much smaller than the number of edges. The problem is modeled by a parallel identical machine scheduling with group soft precedence constraints to minimize the total weighted energization time. We propose an LP-based list scheduling algorithm and a conversion algorithm and analyze their theoretical performances.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.