送交者: steven 于 2006-4-07, 14:37:32:

In a terminal people come in according to the Poisson distribution. Everyone waits inside the terminal until getting in a train. The train goes out every t seconds, and suppost the time to get into the train can be neglacted, and if train is filled up, people cannot get to the train, they will line up in a queue and wait for the next train. Question what is the capacity of the train in terms of probability distribution?

• 你不给出单位时间进站人数的概率分布的话没法算 - deadmeat (187 bytes) 2006-4-07, 22:32:11
  • 采用batch处理有什么实际意义吗 - deadmeat (499 bytes) 2006-4-07, 23:07:40
    • TDMA. - steven (0 bytes) 2006-4-08, 02:11:51
• The problem makes good sense only if - gyro (325 bytes) 2006-4-07, 15:37:38
• I am confused - xinku (131 bytes) 2006-4-07, 15:27:47
  • precise expression should be: the number of people arriving per time unit - 炎阳 (125 bytes) 2006-4-07, 15:35:04
• You didn't have any requirement on how much time people spend on waiting - 008 (109 bytes) 2006-4-07, 15:13:28
• There is an area called queueing theory - Enlighten (451 bytes) 2006-4-07, 14:49:54
  • it is something like that. Both 炎阳 and you are in the right track. - steven (351 bytes) 2006-4-07, 15:49:52
• sounds like a typical Marchovian process problem - 炎阳 (222 bytes) 2006-4-07, 14:43:35

加跟贴