Consider m machines and n>=m jobs, each of which is specifiedby a start time and a finish time. Each job can be assigned to anymachine, but each machine can serve at most one job at any time.The objective is is to schedule a largest number of given jobs tothe m machines. Please develop a polynomial time algorithm andwrite program to implement it.
Expert Answer
An answer will be send to you shortly. . . . .