Question

Problem 1. [Category: Greedy Algorithms: Scheduling] There are n customers are waiting for a service together (started to wait at the same time). The service time needed by Customer i is $t_i$, i = 1, 2, 3, ..., n. Time starts at 0. If the service for Customer i starts at time t, then the waiting time of Customer i is t. How to schedule the order of the customers in order to minimize the total waiting time (sum of each customer's waiting time)? 1. Give and describe a greedy algorithm to solve it. [10 points] 2. Suppose there are 7 customers and the service time is {1,3,2,15,10,6,12}, respectively. Use your algorithm to find a scheduling. [10 points]

          Problem 1. [Category: Greedy Algorithms: Scheduling] There are n customers are waiting for a service together (started to wait at the same time). The service time needed by Customer i is $t_i$, i = 1, 2, 3, ..., n. Time starts at 0. If the service for Customer i starts at time t, then the waiting time of Customer i is t. How to schedule the order of the customers in order to minimize the total waiting time (sum of each customer's waiting time)?

1. Give and describe a greedy algorithm to solve it.
[10 points]

2. Suppose there are 7 customers and the service time is {1,3,2,15,10,6,12}, respectively. Use your algorithm to find a scheduling.
[10 points]

Problem 1. [Category: Greedy Algorithms: Scheduling] There are n customers are waiting for a service together (started to wait at the same time). The service time needed by Customer i is ti, i = 1, 2, 3, ..., n. Time starts at 0. If the service for Customer i starts at time t, then the waiting time of Customer i is t. How to schedule the order of the customers in order to minimize the total waiting time (sum of each customer's waiting time)?

1. Give and describe a greedy algorithm to solve it.
[10 points]

2. Suppose there are 7 customers and the service time is 1,3,2,15,10,6,12, respectively. Use your algorithm to find a scheduling.
[10 points]

Added by Jaime W.

Question

Please give Ace some feedback