SOME RESULTS OF SCHEDULING WITH MULTI-PHASE MAINTENANCES ON TWO IDENTICAL MACHINES

Two types of machine maintenance were investigated in this paper.One was periodic maintenance,and the other was decision maintenance.For the make-span minimization problem on two machines with periodic maintenance,it was shown that FFD algorithm was an efficient algorithm.For the total completion time minimization problem on two machines with decision maintenance,the worst-case analysis of SPT algorithm was given.For a single machine,if the SPT schedule had three batches,it was pointed out that the worst-case bound was not larger than 11/9.