 multiprogram schedul part 1 2 introduct theori in order exploit fulli fast comput possess simultan process abil larg extent schedul workload the schedul routin capabl extrem rapid execut prove self-defeat the construct schedul entail determin program concurr sequenti respect a concis schedul algorithm describ minim time execut entir pend workload subset subject extern constraint preced urgenc the algorithm applic wide class machin 