My friend has a factory with two identical machines that each may process the same types of job.As such, my friend can schedule as many as two jobs during any given time interval. in addition,he always has a selection of jobs he may choose to run, but each of these jobs has acorresponding fixed time interval in which it may run, that is, each job has a fixed start time and afixed finish time. He tells me he knows a greedy algorithm that will produce an optimal schedulefor this interval scheduling variant (i.e. at most two jobs may be scheduled at any point in time)lf .J is the set of all fixed job intervals that may be processed, we run the following algorithm