Problem Solving – A server has to serve n customers(labelled 1 through n)…


A server has to serve n customers(labelled 1 through n). The service time required to serve ith customer is t(i) and is known in advance and there is no parallelism. If the customers are served in order, i.e., i1, i2,….in, the waiting time for customer i1 is t(i1), for customer i2 is t(i1)+t(i2), and so on.

What strategy should be used to serve all the customers in a minimum total time?

Related Posts

Close Bitnami banner
Bitnami