The problem is to determine the sequence in which the roads need to be restored and identify the crew

that will work on the restoration process for each road. The objective is to minimize the maximum make-

span of the restoration process.

𝒵 = Schedule (ℛ ′′ , 𝒟 ′′ , ℱ ′′ , 𝒞, ℐ𝒸 , 𝒩𝑟𝑟 ′ )

𝑟 = (1, … , 𝑛) set of all jobs (roads) that need to be scheduled ∈ ℛ′′. (𝑟 is not a node, but a road)

𝑠 = (1, … , 𝑛) set of all positions in the sequence of the schedule

𝑖 ′ initial job of crew 𝑐

𝒞 = (1, … , 𝑙)

𝑐∈ 𝒞

𝒫𝑟 Time for doing the job 𝑟 ∈ ℛ′′. The information of this vector is extracted from 𝒟′′𝒾𝒿

Decision variables
1 if job 𝑟 is scheduled in position 𝑠 with crew 𝑐
𝒵𝑟𝑠𝑐 = {
0 otherwise

𝒴 is the maximum completion time

Model

Minimize 𝒴 (1)

∑𝑐=𝑙 𝑠=𝓃
𝑐=1 ∑𝑠=1 𝒵𝑟𝑠𝑐 = 1 ∀𝑟 (2)

𝒵𝑟1𝑐 = 1 𝑟 = 𝑖 ′ ∀𝑐 (3)

∑𝑟=𝓃 𝑟=𝓃
𝑟=1 𝒵𝑟𝑠𝑐 ≤ ∑𝑟=1 𝒵𝑟(𝑠−1)𝑐 ∀𝑠 = 2 … 𝓃 ∀𝑐 (4)

∑𝑐=ℓ 𝑐=𝑙 𝑟′=𝓃 ′ 𝑟′=𝓃

𝑐=1 𝒵𝑟𝑠𝑐 ≤ ∑𝑐=1 ∑𝑟′=1 𝒵𝑟′(𝑠−1)𝑐 ∗ 𝑁𝑟𝑟′ ∀𝑠 > 1, ∀𝑟 𝑟 ≠ 𝒾 and ∑𝑟′=1 𝑁𝑟𝑟′ > 0 (5)
 𝒴 − ∑𝑟=𝓃 𝑠=𝓃
𝑟=1 ∑𝑠=1 𝒵𝑟𝑠𝑐 ∗ 𝒫𝒾 ≥ 0 ∀𝑐 (6)

𝒵𝑟𝑠𝑐 ∈ {0,1} ∀𝑟, 𝑠, 𝑐 (7)

𝒴≥0 (8)

Return 𝒵

Objective function (1) minimizes the maximum make-span by crew of the restoration process. Constraint

(2) ensures that every job has been scheduled. Constraint (3) indicates the initial location of each crew.

Constraint (4) restricts that each crew’s schedule has a sequence defined by integer positive numbers.

Constraint (5) requires the restrictions in the sequence by job. Constraint (6) specifies the completion time

by crew. Constraint (7) indicates that there is a binary variable for each job that is in each crew’s

schedule. Finally, constraint (8) indicates a positive variable that defines each crew’s completion time.