论文部分内容阅读
一、问题的提出 —个修理作业组负责n台机器,并当机器发故障给予修理。因此,存在着一个需要修理作业组在任何时间加以安排的,可能发生作业的有限最大数n。进入修理作业组的作业的到达率,将部分地取决于安排给修理作业组的机器数n,以及其中等待修理和正在修理中的机器数r。问题的基本矛盾在于当n增加时,修理作业组将更加忙碌,因而每台机器修理费用将下降,由于发生故障的机器在能够得到修理之前要排队
First, the question is raised - a repair team is responsible for n machines, and when the machine fails to repair. Therefore, there is a limited number of jobs that can be scheduled at any time, and the maximum number of jobs that may occur. The arrival rate of the work entering the repair work group will depend in part on the number of machines n assigned to the repair work group, and the number r of machines awaiting repair and being repaired. The basic contradiction of the problem is that when n increases, the repair group will be more busy, and thus the cost of repairs per machine will decrease, because the malfunctioning machine must queue up before it can be repaired.