Academic Integrity: tutoring, explanations, and feedback — we don’t complete graded work or submit on a student’s behalf.

There is a dynamic programming question. I have no idea how to get started with.

ID: 3588151 • Letter: T

Question

There is a dynamic programming question. I have no idea how to get started with. I would appreciate if anyone could give some advice on how to divide this problem into subproblem.

The problem is:

There are n jobs. Any number of jobs can be run at the same time on one server and the server charged per minute. Each job i is given by a release time s(i), a deadline f(i), and a duration d(i) with di fi - si (all integers). This job needs to be scheduled for an interval of di consecutive minutes between time si and fi. Solve this scheduling problem by giving a dynamic program that minimizes the number of seconds where one or more jobs is scheduled.

Explanation / Answer

There is a dynamic programming question. I have no idea how to get started with. I would appreciate if anyone could give some advice on how to divide this problem into subproblem.

The problem is:

There are n jobs. Any number of jobs can be run at the same time on one server and the server charged per minute. Each job i is given by a release time s(i), a deadline f(i), and a duration d(i) with di fi - si (all integers). This job needs to be scheduled for an interval of di consecutive minutes between time si and fi. Solve this scheduling problem by giving a dynamic program that minimizes the number of seconds where one or more jobs is scheduled.


down votefavorite

There is a dynamic programming question. I have no idea how to get started with. I would appreciate if anyone could give some advice on how to divide this problem into subproblem.

The problem is:

There are n jobs. Any number of jobs can be run at the same time on one server and the server charged per minute. Each job i is given by a release time s(i), a deadline f(i), and a duration d(i) with di fi - si (all integers). This job needs to be scheduled for an interval of di consecutive minutes between time si and fi. Solve this scheduling problem by giving a dynamic program that minimizes the number of seconds where one or more jobs is scheduled.

Hire Me For All Your Tutoring Needs
Integrity-first tutoring: clear explanations, guidance, and feedback.
Drop an Email at
drjack9650@gmail.com
Chat Now And Get Quote