In the following scenario: There are C servers providing service for a number of customers. The ideally required server of the customer is M. That is,
1. if there are more than M idle servers upon the customer arrival, then M server is assigned for the customer. 2. If the number of free server is less than M, then all these free channels are assigned to the customer. 3. As all server are occupied upon the arrival, one server will be drawn from a specific customer, which is currently using more than 2 servers. Then, assign the freed server for the new customer arrival and the specific customer's speed is lowered. I am wondering how to determine the specific customer to minimize the number of rejected customers (or minimize the average service time). Which math tools should be used? Any comments are greatly appreciated. Plz give some tips or links or the technique to solve this. Thanks and Best Regards -- ZHANG Yan http://www.ntu.edu.sg/home5/pg01308021 . . ================================================================= Instructions for joining and leaving this list, remarks about the problem of INAPPROPRIATE MESSAGES, and archives are available at: . http://jse.stat.ncsu.edu/ . =================================================================
