Question

Job scheduling Consider the problem of scheduling $n$ jobs of known durations $t_1, t_2, \ldots, t_n$ for execution by a single processor. The jobs can be executed in any order, one job at a time. You want to find a schedule that minimizes the total time spent by all the jobs in the system. (The time spent by one job in the system is the sum of the time spent by this job in waiting plus the time spent on its execution.) Design a greedy algorithm for this problem. Does the greedy algorithm always yield an optimal solution?

   Job scheduling Consider the problem of scheduling $n$ jobs of known durations $t_1, t_2, \ldots, t_n$ for execution by a single processor. The jobs can be executed in any order, one job at a time. You want to find a schedule that minimizes the total time spent by all the jobs in the system. (The time spent by one job in the system is the sum of the time spent by this job in waiting plus the time spent on its execution.)
Design a greedy algorithm for this problem. Does the greedy algorithm always yield an optimal solution?

Introduction to the Design and Analysis of Algorithms

Anany Levitin 3rd Edition

Chapter 9, Problem 3

Instant Answer

Step 1

We have $ n $ jobs with known durations $ t_1, t_2, \ldots, t_n $. We need to schedule these jobs on a single processor such that the total time spent by all jobs in the system is minimized. The time spent by a job in the system is the sum of its waiting time Show more…

Show all steps

Thanks for your feedback!

Job scheduling Consider the problem of scheduling $n$ jobs of known durations $t_1, t_2, \ldots, t_n$ for execution by a single processor. The jobs can be executed in any order, one job at a time. You want to find a schedule that minimizes the total time spent by all the jobs in the system. (The time spent by one job in the system is the sum of the time spent by this job in waiting plus the time spent on its execution.) Design a greedy algorithm for this problem. Does the greedy algorithm always yield an optimal solution?

Play audio

Feedback

Ace is your personal tutor. It breaks down any question with clear steps so you can learn.

Start Using Ace

Continue solving this problem

Create a free account to:

View full step-by-step solution
Ask follow-up questions with Ace AI
Save progress and study later

Please give Ace some feedback