Post-disaster Repair Scheduling in Partially Automated Electricity Distribution Networks

Arindam K. Das; Daniel S. Kirschen; Payman Arabshahi; Yushi Tan

REVIEW

Post-disaster Repair Scheduling in Partially Automated Electricity Distribution Networks

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1906.06461 v1 pith:MK4MZ4A3 submitted 2019-06-15 math.OC cs.SYeess.SY

Yushi Tan , Arindam K. Das , Payman Arabshahi , Daniel S. Kirschen This is my paper · ORCID

classification math.OCcs.SYeess.SY

keywords schedulingalgorithmdistributionelectricityminimizenetworksnumberrepair

verification ladder T0 review T1 audit T2 compute T3 formal

0 comments

read the original 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.

Discussion (0). Continue with ORCID to comment.

Pith tools