最优服务次序问题 问题描述: 设有n 个顾客同时等待一项服务。顾客i需要的服务时间为t(i),i=1,…,n 。...个顾客等待服务时间的 总和除以n。 编程任务: 对于给定的n个顾客需要的服务时间,编程计算最优服务次序。-Order of the issue of optimal service Descr iption: n months customers have to wait for a service at the same time. I need to service customers time t (i), i = 1, ..., n. ... A customer waiting for service time divided by the sum of n. Programming tasks: n for a given customer service needs, programming calculated optimal service order.