SCHEDULE ARRANGEMENT AND OPTIMIZATION OF THE FILE TRANSFER NETWORK

ＳＣＨＥＤＵＬＥＡＲＲＡＮＧＥＭＥＮＴＡＮＤＯＰＴＩＭＩＺＡＴＩＯＮＯＦＴＨＥＦＩＬＥＴＲＡＮＳＦＥＲＮＥＴＷＯＲＫ（潘建平）；ＸｉｅＪｕｎｑｉｎｇ（谢俊清）；ＺｈａｎｇＸｕｅｍｅｉ（张雪梅）ＦａｃｕｌｔｙＡｄｖｉｓｏｒ：ＤｅｎｇＪｉａｎｍｉｎｇ（邓...

SCHEDULE WhNGEMENT ro OPTIMIZATIONOF THE FILE TRANSFER NETWORK

This project was designated as Meritorious of Mathematical Contest inModeling (MCM'94). We have been required tu solve a problem of findins thebest schedule of a file transfer network in order to niake the niaktispan the smallestone. Three situations with ascending difficulty are considered. Two nietheds inpractical network, packet switching and virtual circuit have been taken into account in our niodel. We have tried to solve the problem by graph theory. Ourmodeling starts from a bipartite graph to which we can find the theoretically opti-mal solution, and it solvee the first situation perfectly. Then we discuss a moregeneral model, a sraph with no self loops, we call it a meta model. Based onweights, we classify them into the meta model with weishts and the nieta modelwithout weights. Froni them, we have deduced some useful conclusions and soniealsorithms , with which the other two situations are solved. After that i we employvarious methods to test our niedel's reliability and stability. In addition, we prcapose a schenie to iniprove its makespan without increasing any investtnent in thelast situation.