机器维修的排序问题

The scheduling problem of machine maintenance

研究了机器维修的排序问题,假设第i台机器的维修起始日期为第ai天(i=1,2,…,n).n台机器的维修起始日期简记为〈a1,a2,…,an〉.得到一系列〈a1,a2,…,an〉存在的充分或必要条件.

In this paper,a machine maintenance problem,in which n machines are to be served on a regular,periodic basis,is studied.Suppose the initiation of the maintenance cycle for machine i is on the a\-i th day,and these n days can be denoted by 〈a\-1,a\-2,…,a\-n〉. A series of necessary or sufficient conditions of the existence of 〈a\-1,a\-2,…,a\-n〉 are obtained.