Job queue scheduling

A media box transcodes uploads on one worker that hands out its time in fixed slices. job_ids names each upload, arrival_seconds[i] is the second job i lands in the queue, and burst_seconds[i] is the work it needs, at least one second. The worker takes the job at the front of the ready queue and runs it for quantum seconds, at least one, or for whatever work it has left if that is less. A job with work still left goes to the back of the queue. Jobs that arrive at the exact second a slice ends join the queue before the preempted job returns to it, and jobs arriving in the same second join in the order they are listed. While the queue is empty the worker idles until the next arrival. Return the job ids in the order they finish, and an empty list for no jobs. Ids are distinct.