priority queue implementing time slicing on each job

[unkn00wn]

I am assigned this assignment to be submitted few days later. but i cant fully understand the problem. Can anyone help me to understand this problem or provide any reference/solution ? any help would be appreciated.

There is priority queue of jobs (j) (the jobs are given with required time t(j) for execution). Implement CPU scheduling (execution) with time slicing (let t unit of time for each job) and job priority based on maximum remaining time to execute a CPU. The process will continue until the queue is empty.
Print status of queue for each enqueue and dequeue operations.

[ne555]

¿What you don't get?