| 摘要 |
PURPOSE: To select an optimum combination of a refuse collecting region and a refuse collecting facility by using a specific linear programming during scheduling for obtaining a combination between a refuse collecting region and a refuse collecting facility with the use of a vacuum refuse conveying system. CONSTITUTION: A dust collection scheduling facility comprises memory means 22, 25, 27, 30 for storing received data from a refuse collecting region data input means 21, a refuse collecting facility data input means 24, a refuse collecting time data input means 26, and a change-over device connecting condition data input means 29, a memory means 31 for storing therein combinations of a refuse collecting facility and a refuse collecting region, which can be made by a change-over device for changing over conveyer pipe lines, a memory means 31 for storing therein necessary but minimum times each of which is obtained by accumulating refuse collection times of a refuse storing device in the associated refuse collecting region, a coefficient formula creating means 23 for selecting a combination of a refuse collecting facility and a refuse collecting region and for creating a coefficient formula for a relationship between the selected combination and the refuse collection time, thereby, it is possible to determine an optimum refuse collection time which is displayed as a result. |
