A simple solution to it is is a first-in first-out method.
One class of this type of problem is the so-called open shop problems. One major approach to handling this uses a multi-layer feedback queue. An important consideration when doing this is the burst rate; some methods for doing it require defining time quanta. Real-time operating systems have been known to run into priority inversion problems involving this which can make preemption hazardous. Common criteria for systems to do this include fairness, responsiveness, and throughput, the last of which is maximized by a shortest-job-first method. A simple solution to it is is a first-in first-out method. For 10 points, name this problem of finding an optimal order for a series of events or processes.
One class of this type of problem is the so-called open shop problems.
{scheduling} (accept pretty much anything that indicates that making a {schedule} is involved)