“…Proof Let n = 6, and let the resource requirements of the jobs be (ω j ) 6 j=1 = (6, 6, 6, 5, 5, 2). Let the resource availability be described by a function Ω(t) given by the sequence (6,12,6,7,7,11,6,6,6,6,6,6). An optimal schedule of length 8 is presented in Fig.…”