By the definition of N 0, z and Step 4(a) and Step 4(b) of Algorithm NF, we see that R 0, z is a set of early orders delivered at time T z with the maximum total processing time among all schedules.
Proof We first prove that ⋃ j = j k z R k, j has not only exactly k late orders but also the maximum total processing time among all schedules for k = 0, 1, …, t − 1.
This, along with (iii) in Lemma 1, p l 0 = max { p i | J i ∈ J ∖ ⋃ j = j 0 z R 0, j }, and ⋃ j = j 0 z R 0, j being a set of early orders with the maximum total processing time among all schedules, implies that ⋃ j = j 0 z R 1, j does not only have exactly a late order but also the maximum total processing time among all schedules.
Similarly, we see that ⋃ j = m z R 0, j is a set of early orders with the maximum total processing time among all schedules for m = z − 1, …, j 0, where the orders in R 0, j are delivered at time T j.
Further, by Step 4(a) and Step 4(b) of Algorithm NF, we see that ⋃ j = m z R 1, j does not only exactly have a late order but also the maximum total processing time among all schedules for m = j 0 − 1, …, j 1.
The maximum total scan time was approximately 60 to 75 minutes per patient.
Because of possible discomfort, a maximum total transport time of 2 to 4 hours is suggested.
Maximum total examination time (from arrival of one participant in the MRI suite until the next) was initially set at 45 min, in order to accommodate the MRI acquisition into the generic workflow of the Rotterdam Study.
