Cooperation scheme for plural work stations

Abstract: In knowledge information processing and especially in a plan making system such as a system for generating schedule diagrams of trains and personnel, it becomes necessary to make or modify a plan by using a plurality of work stations (10, 20) when the plan becomes large-sized. At this time, the work stations are provided with equal plan making function. Thus, the work stations can take partial charge of making a plan. Further, work stations are provided with priorities. Thus, management of competition among a plurality of work stations is facilitated and overhead caused by communi­ cation among a plurality of devices is reduced.

Description: BACKGROUND OF THE INVENTION The present invention relates to making a plan such as train schedule diagram and personnel arrangement schedule. In a plan making system for solving a complicated problem such as generation of train schedule diagram or personnel arrangement schedule, fine man-machine controllability is important. If a problem becomes complicated and large-sized, however, its processing using a single work station as in the conventional technique becomes impossible. Therefore, making a plan using a plurality of work stations becomes necessary. Since the number of operations conducted by operators is large at the time of plan making, however, it is indispensable that management of operation competition among a plurality of work stations is performed rapidly. In conventional master-slave type dual systems, the output of the subsidiary system (slave) is not reflected onto the system in the normal state. Thus, the output of the subsidiary system is not reflected onto the system until switching from the main system (master) to the subsidiary system is performed in case of failure of the main system. For example, it is known from "Genoa Railway District Control Centre: An Advanced Computer System For Rail Automation" by G. Bocassi et al. in "International Conference on Railways in the Electronic Age", 17-20 November 1981, London, GB, pages 207-212 a train schedule system comprising such a master-slave system. From the master system, the slave system is constantly updated, so that in case of failure of the master system it may be automatically and instantly switched over to the slave system, which is provided for redundancy. When the scale of the plan becomes large, it becomes impossible to display the whole plan on one screen to make and modify the plan. Therefore, it becomes necessary to divide the plan to make it. Simultaneously at this time, it becomes necessary that plans of allotted ranges can be made at a plurality of work stations. In addition, management of mutual competition among operations becomes necessary in case plan making is to be performed at a plurality of work stations. In the above described prior art, however, the output of the subsidiary system is not reflected onto the main system, and hence a plan cannot be made between them at the same time. Since plan making is not performed at the same time, therefore, management of mutual competition between the main system and the subsidiary system has not been performed. Further, in case portions of plan making are allotted to a plurality of work stations belonging to the main system or the subsidiary system, priority relations do not exist among those work stations. In competition management at the time of data access, therefore, mutual monitoring is always necessary and constant overhead is always applied at the time of operation. Further, in case a plurality of operators jointly make or modify the same plan, contradiction is caused by conflict in opinion among those operators, resulting in a problem. SUMMARY OF THE INVENTION An object of the present invention is to readily allow a plurality of work stations or terminal equipments, hereinafter described with the work station only to take partial charge of making a plan, facilitate the management of competition caused by a plurality of work stations, and make it possible to make or modify a plan having small overhead at the time of operation and having no contradiction. The above described object is achieved by providing a plurality of work stations with equal plan making function, providing one of plurality of work stations having the plan making function with priority, making work station take partial charge of a plan, reflecting unconditionally operation applied to a work station having priority by an operator onto work stations having no priority, storing operation conducted at the work station having priority by an operator, judging whether operation conducted at a work station having no priority by an operator competes with operations conducted at the work station having priority by an operator which are not yet transmitted to work stations having no priority, and making only operations which do not compete effective. In the cooperation scheme of a plurality of work stations, the plurality of work stations take partial charge of a plan. Even for a large-sized plan, it becomes possible to make a plan without being restricted by the screen size. Further, since respective work stations have equal plan making function, division of mutual partial charge can be easily changed. Further, since there are priority relations among work stations, competition management becomes easy by giving preference to operation of the work station having priority when competition among operations conducted by a plurality of operators has occurred. As a result, the overhead caused at the time of operation by competition management can be made small. Further, even when conflict in opinion among a plurality of operators is caused, it becomes possible to prevent occurrence of contradiction by giving preference to the operation of the work station having priority. In addition, since operation conducted at the work station is stored, operation conducted at a work station having no priority can also be easily reflected onto the work station having priority by checking its competition with the operation of the work station having priority thus stored. BRIEF DESCRIPTION OF THE DRAWINGS Fig. 1 is a general configuration diagram showing a cooperation scheme of a plurality of work stations according to the present invention; Fig. 2 is a data configuration diagram of a work station having priority according to the present invention; Fig. 3 is a data configuration diagram of a work station having no priority according to the present invention; Fig. 4 shows contents of a partial charge table; Fig. 5 shows contents of a untransmitted modification queue according to the present invention; Fig. 6 shows contents of running information according to the present invention; Fig. 7 shows contents of station information according to the present invention; Fig. 8 shows contents of traveling information according to the present invention; Fig. 9 shows contents of delay information according to the present invention; Fig. 10 shows contents of predicted running information; Figs. 11, 12 and 13 show examples of screen according to the present invention; and Figs. 14 and 15 are processing flow charts of competition management according to the present invention; DESCRIPTION OF THE PREFERRED EMBODIMENTS An embodiment of train schedule diagram generation according to the present invention will hereafter be described by referring to drawings. Fig. 1 is a general configuration diagram of a system according to the present invention. It is now assumed in the following description that a train schedule diagram is to be generated by using two work stations. Numerals 10 and 20 denote work stations for giving instructions to generate a train schedule diagram, 1 a central processing unit of the work station 10, and 2 a display device for displaying the situation of schedule diagram generation in the work station 10. Numerals 3 and 4 respectively denote a keyboard and a mouse for inputting instructions of an operator at the work station 10 when a schedule diagram is to be generated. Numeral 5 denotes a storage device for storing the situation of schedule diagram generation and schedule diagram data of the work station 10. Details of contents stored in the storage device 5 are shown in Fig. 2. Further, numeral 11 denotes a central processing unit of the work station 20, and numeral 12 denotes a display device for displaying the situation of schedule diagram generation in the work station 20. Numerals 13 and 14 respectively denote a keyboard and a mouse for inputting instructions of an operator at the work station 20 when a schedule diagram is to be generated. Numeral 15 denotes a storage device for storing the situation of schedule diagram generation and schedule diagram data of the work station 20. Details of contents stored in the storage device 15 are shown in Fig. 3. Numeral 6 denotes a communication cable for connecting two work stations 10 and 20 together. Fig. 2 shows contents of data stored in the storage device 5. Numeral 21 denotes a planned schedule diagram table for storing a schedule diagram planned beforehand. Numerals 211 and 214 denote contents of data stored in the planned schedule diagram 21. Numeral 211 denotes business start time of trains, 212 business and time, and 213 train running plan information. Details of the running plan information are shown in Fig. 6. Numeral 214 denotes station information for storing station information required for train schedule diagram generation. Details of the station information are shown in Fig. 7. Numeral 22 denotes a results schedule diagram table for storing results of actual train running. Numerals 221 to 223 denote data stored in the results schedule diagram 22. Numeral 221 denotes current time indicating the results data sampling execution time. Numeral 222 denotes traveling information for storing the current traveling situation of trains. Details of the traveling information are shown in Fig. 8. Numeral 223 denotes delay information for storing the delay situation of trains. Details of this delay information are shown in Fig. 9. Numeral 23 denotes a predicted schedule diagram table for storing the planned schedule diagram 21 modified at the work station 10 on the basis of the results schedule diagram 22. Numeral 231 denotes data stored in the predicted schedule diagram table 23 and denotes predicted running information for storing the situation of modification of train running plan information. Details of the predicted running information are shown in Fig. 10. Numeral 24 denotes a partial charge table for storing the partial charge range of the work station 10. Details of this partial charge table are shown in Fig. 4. Numeral 25 denotes untransmitted modification queue for storing contents of schedule diagram modification performed at the work station 10 which are not transmitted to the work station 20 yet into a transmission area 25a. Details of the untransmitted modification queue are shown in Fig. 5. This untransmitted modification queue is a first-in first-out table. Fig. 3 shows contents of data stored in the storage device 15. Numeral 31 denotes a planned schedule diagram table for storing a schedule diagram planned beforehand. Numerals 311 to 314 denote contents of data stored in the planned schedule diagram table 31. Numeral 311 denotes business start time of trains, 312 busienss end time, and 313 running plan information of trains. details of the train running plan information are shown in Fig. 6. Numeral 314 denotes station information for storing station information required for train schedule diagram generation. Details of the station information are shown in Fig. 7. Numeral 32 denotes a results schedule diagram table. Numerals 321 to 323 denote data stored in the results schedule diagram table 32. Numeral 321 indicates current time indicating the results data sampling execution time. Numeral 322 denotes traveling information for storing the current traveling situation of trains. Details of the traveling information are shown in Fig. 8. Numeral 323 denotes delay information for storing the delay situation of trains. Details of this delay information are shown in Fig. 9. Numeral 33 denotes a predicted schedule diagram table for storing the planned schedule diagram 31 modified at the work station 20 on the basis of the results schedule diagram 32. Numeral 331 denotes data stored in the predicted schedule diagram table 33 and indicates predicted running information for storing the situation of modification of train running plan information. Details of the predicted running information are shown in Fig. 10., Numeral 34 denotes a partial charge table for storing the partial charge range of the work station 20. Details of this partial charge table are shown in Fig. 4. The planned schedule diagram tables 21 and 31 have the same contents. The results schedule diagram tables 22 and 32 have the same contents. Fig. 4 shows contents of the partial charge tables 24 and 34. The contents comprise partial charge lead time 41, partial charge last time 42, partial charge lead station 43 and partial charge last station 44. These contents represent information of ranges of routes that respective work stations 10 and 20 take partial charge. Fig. 5 shows contents of the untransmitted modification queue 25 in the work station 10. Numeral 51 denotes an operation division, 52 running information of trains to be operated, and 53 to 55 data required when operation is executed. Fig. 6 shows contents of the running information 213 and 313. Numeral 61 denotes an area for storing the number of runnings, 62 an area for storing information of each running, 63 an area for storing the starting station of running, 64 an area for storing the destination station, 65 an area for storing departure and arrival information at each station, 66 an area for storing station arrival time at each station, 67 an area for storing station departure time, 68 an area for storing track No. for arrival, and 69 an area for storing track No. for departure. Fig. 7 shows contents of station information 214 and 314. Among them, numeral 71 denotes an area for storing the number of station, 72 an area for storing the information of each station, 73 an area for storing whether trains can turn back from the pertinent station or not, 74 an area for storing the minimum time required for turn-back operation, 75 an area for storing the track No. whereat up trains stop, 76 an area for storing the track No. whereat down trains stop. Fig. 8 shows contents of the traveling information 222 and 322. Among them, numeral 81 denotes an area for storing the traveling situation of each running, and numeral 82 denotes an area for storing a station passed by the train at time closest to the results data sampling time, which is also stored in the current time 221 shown in Fig. 2. Numeral 83 denotes an area for storing whether delay from each running plan is present or not. Fig. 9 shows contents of the delay information 223 and 323. Among them, numeral 91 denotes an area for storing the delay situation of each running, 92 an area for storing delay situation of the pertinent running at respective stations, 93 an area for storing delay time caused when a train has arrived at the pertinent station, and 94 an area for storing delay time caused when a train has departed from the pertinent station. Fig. 10 shows contents of the predicted running information 231. Among them, numeral 101 denotes an area for storing predicted information of each running after modification of the plan, 102 an area for storing predicted information of the pertinent running at respective stations, 103 an area for storing predicted time of arrival at the pertinent station, 104 an area for storing predicted time of departure from the pertinent station, 105 an area for storing alteration time of station arrival from the plan, and 106 an area for storing alteration time of station departure from the plan. Fig. 11 shows an example of screen of the display device 2. Numeral 111 denotes an operation menu whereby an operator gives instructions at the time of schedule diagram generation, 112 an area for displaying a schedule diagram, and 113 a station name. Numerals 114 and 117 denote train running schedules (hereafter referred to as plan lines) displayed on the basis of the planned schedule diagram stored in the planned schedule diagram table 21 (Fig. 2). A thick solid line 115 indicates a result line displayed on the basis of actual train running results stored in the results schedule diagram 22 (Fig. 2). A broken line 116 denotes train running prediction (hereafter referred to as prediction line) predicted on the basis of the result line. Numeral 118 denotes moving time setting submenu for setting the moving time when moving the train running plan line back and forth. Fig. 12 shows an example of the screen of the display device 2 when partial charge is taken. Numerals 121 to 123 denote train plan lines. Fig. 13 shows an example of the screen of the display device 12 when partial charge is taken. Numerals 131 and 132 denote train plan lines. Fig. 14 is a flow chart showing the processing performed when an operator conducts operation at the work station 10 having priority. Numeral 141 denotes a flow chart showing the processing of a schedule diagram generation program performed when an operator conducts operation at the work station 10. Numeral 142 denotes a processing flow chart of a program for transmitting contents of operation from the work station 10 to the work station 20. Numeral 143 denotes a processing flow chart of a program for receiving data from the work station 10 and reflecting the received contents onto the schedule diagram at the work station 20. Numeral 149 denotes an example of contents read from the untransmitted modification queue and transmitted to the work station 20. Fig. 15 is a flow chart showing the processing performed when an operator conducts operation at the work station 20 having no priority. Numeral 151 denotes a processing flow chart of a schedule diagram generation program performed when an operator has conducted operation at the work station 20. Numeral 152 denotes a processing flow charge of a program for receiving data from the work station 20 and reflecting the received contents onto the schedule diagram at the work station 10. Numeral 159 denotes an example of contents of an operation request issued from the work station 20 to the work station 10. Assuming now that the work station 10 has priority over the work station 20, operation of the cooperation scheme using a plurality of work stations according to the present invention will hereafter be described. First of all, in the normal state, operators monitor whether trains run as planned or not by using the work stations 10 and 20. If the result line 115 is 20 seconds behind the plan line 114 at a station X in Fig. 11, for example, the prediction line 116 becomes 20 seconds behind the plan line 114. Therefore, the space with respect to the preceding plan line 117 is prolonged. Each line represents train running. If the spacing between lines becomes long, therefore, passengers waiting for a train at the station increase. As a result, crowdedness occurs in the train, and the time required for getting on and off is prolonged, the train being further delayed. In order to prevent this, the operator alters the plan beforehand, so that spaces between lines may become equivalent as far as possible. By keeping the plan line 117 waiting at station N for ten seconds, for example, the space between the plan line 117 and the prediction line 116 becomes equal to the space between the plan line 117 and a train immediately preceding it. This operation for keeping the plan line 117 waiting at the station N for ten seconds is conducted in accordance with the following procedure. (1) Pick "running movement" in the operation menu 111 with the mouse 4. (2) Pick the section wherein the line is to be delayed with the mouse 4. In case the line is to be delayed in the section between the stations N and A, for example, pick the stations N and A with the mouse 4. (3) Pick the line to be delayed, i.e., the plan line 117 with the mouse 4. (4) Pick 10 (meaning 10 seconds) in the moving time setting submenu 118 as the moving time with the mouse 4. If a right button of the mouse 4 is pressed at this time, right movement (i.e., delay request) is performed. If a left button is picked, left movement (i.e., advanced departure request) is performed. As a result of the operation (1) to (4) described above, running information of the plan line 117, i.e., the station departure time and the station arrival time ranging from the station N to the station A are updated. The updated result is displayed again. As heretofore described, the operator monitors whether the train is run as planned and alters the plan. In case a large number of lines are subject to plan alteration or a large section is subject to plan alteration, plan alteration is performed from both the work stations 10 and 20. At this time, it becomes necessary to perform competition management to alter the plan of the same schedule diagram from a plurality of work stations. It is now assumed that the work stations 10 and 20 respectively take charge of stations A to N and stations N to Z shown in Fig. 11. Figs. 12 and 13 show examples of the screen obtained when partial charges are taken. As for the contents of the partial charge table 24 (Fig. 4) of the work station 10 at this time, the partial charge lead time 41 is the screen display start time t 0 and the partial charge last time 42 is the screen display last time t 1 whereas the partial charge lead station 43 is the station A and the partial charge last station 44 is the station N. Contents of the partial charge table 34 of the work station 20 become t 1 , station N and station Z, respectively. It is now assumed that the plan line 121 of Fig. 12 and the plan line 131 of Fig. 13 are the same lines as the plan line 122 of Fig. 12 and the plan line 132 of Fig. 13 connected at the station N, respectively. First of all, the procedure of competition management in case the operator conducts operation at the work station 10 such as the case where the plan line 121 is moved to the right by ten seconds in Fig. 12 will now be described along the flow of Fig. 14. If the operator requests operation, the program 141 operates in accordance with the following procedure. (1) At step 14110, operation request of the operator at the work station 10 is inputted from the mouse 4. Details of operation contents are similar to those in "running movement" described before. First of all, the "running movement" menu is picked with the mouse 4. Thereafter, station names in the movement range, i.e., stations A and Z as well as the plan line are picked with the mouse 4. Movement time of ten seconds is picked by the right button of the mouse. (2) Since the work station 10 has priority, its operation is executed unconditionally at step 14120. That is to say, moving the plan lines 121 and 131 is registered in the alteration time of station arrival 105 (Fig. 10) and the alteration time of station departure 106 (Fig.10) of the predicted schedule diagram table 23 (Fig. 2) of the work station 10. In Fig. 12, the plan line 121 moves to the right by 10 seconds. (3) At step 14130, the contents of operation of moving the plan line 121 to the right by 10 seconds are put into the untransmitted modification queue 25 (Fig. 2) for transmission to the work station 20. As for the contents of the untransmitted modification queue 25 at this time, "running movement" is set into the operation division 51 of Fig. 5 and "plan line 121" is set into the train running information 52 whereas movement section "station A" and "section Z" as well as movement time "10 seconds" are set into the data 53. Since the untransmitted modification queue 25 is a first-in first-out table, contents thus set are registered into the rear end of the untransmitted modification queue 25. (4) The above described operation (1) to (3) is repeated until the operator completes the processing. With reference to Fig. 14, the program 142 always monitors whether data is present in the untransmitted modification queue 25 or not. In case data is present, operation is conducted in accordance with the following procedure. (1) At step 14210, contents of operation at the work station 10 are read from the top of the untransmitted modification queue 25. (2) At step 14220, the contents 149 of operation (Fig. 14) thus read are transmitted to the work station 20. (3) Since the untransmitted modification queue 25 is a first-in first-out table, contents of the untransmitted modification queue 25 read at the step 14210 are deleted at step 14230. (4) The above described operation (1) to (3) is repeated until the untransmitted modification queue 25 becomes empty. If contents of operation are transmitted from the work station 10, the program 143 functions at the work station 20 in accordance with the following procedure. (1) At step 14310, the contents of operation 149 transmitted from the works tation 10 are received. (2) Since the work station 20 has no priority, results of this operation are reflected unconditionally onto the work station 20. That is to say, moving the plan line 121 (i.e., the plan line 131) is registered into the alteration time of station arrival 105 (Fig. 10) and the alteration time of station departure 106 (Fig. 10) of the predicted schedule diagram table 33 (Fig. 3) of the work statio 20. In Fig. 13, the plan line 131 moves to the right by 10 seconds. The procedure of competition management in case the operator conducts operation at the work station 20 having no priority such as the case where the plan line 132 is moved to the left by ten seconds in Fig. 13 will now be described along the flow of Fig. 15. The competition management means that a contradictory operation is prevented two work stations from being simultaneously operated for the same line. First of all, the program 151 functions in the work station 20 in accordance with the following procedure. (1) At step 15110, contents of operation request of the operator at the work station 20 are inputted from the mouse 14. Details of operation contents are similar to those of "running movement" described above. First of all, "running movement" menu is picked with the mouse 4. Thereafter, station names of the movement range, i.e., stations A and Z as well as the plan line are picked with the mouse 4. Movement time of 10 secodns is picked by the left button of the mouse. (2) At Step 15120, contents of operation request 159 at the work station 20 are transmitted to the work station 10. (3) At step 15130, answer from the work station 10 is received. (4) Upon receiving operation OK, the alteration time of station arrival 105 (Fig. 10) and the alteration time of station departure 106 (Fig. 10) of the predicted schedule diagram table 33 (Fig. 3) are updated at step 15150, and the plan line on the screen is moved. (5) Upon receiving operation NG, the request of the operation is rejected in the work station 10, then, the invalid operation message is displayed to report on the operation at step 15160. Upon receiving the operation request from the work station 20, the program 152 functions in the work station 10 in accordance with the following procedure. (1) At step 15210, the contents of the operation request 159 from the work station 20 are received. (2) At step 15220, it is checked whether or not the line stored in the content of operation request 159 (that is, the plan line 132) coincides with the line stored in the content of operation (this is already executed in the work station 10, but not transmitted to the work station 20 yet) in the untransmitted modification queue of the work station 10 (i.e., whether there is untransmitted operation for the work station 20 stored in the untransmitted modification queue 25 and relating to the plan line 132, that is plan line 122 (Fig. 12) or not). It is noted that the plan line 132 in the work station 20 is equal to the plan line 122 in the work station 10. (3) In case of noncoincidence at step 15220, the operation request at the work station 20 is made valid to update the predicted schedule diagram table 23 (Fig. 2) and more and display the plan line 122 (Fig. 12) at step 15230. At step 15240, the operation request at the work station 20 is made valid and the operation result 158 of operation OK is transmitted to the work station 20 as answer. (4) In case of coincidence at step 15220, the operation request at the work station 20 is made invalid and the operation NG is returned as answer at step 15250. Data is not updated. In the present embodiment, there is little overhead in case the work station 10 is used. In case of the work station 20 as well, only search of the untransmitted modification queue 25 is involved with the exception of communication overhead, resulting in an effect of small overhead. Further, the partial charge range can be easily changed only by changing the contents of the partial charge tables 24 and 34 when partial charge is taken, for example, by changing the partial charge lead time 41 in Fig. 4. Therefore, flexible partial charge of a plan according to the state of the plan and the number of operators becomes possible. Further, by mutually monitoring the answer time among work stations and automatically expanding the partial charge range to the whole in case there is no answer for a predetermined time or longer, backup becomes possible. As a result, the reliability of the whole system can be made high. The present embodiment has been described with reference to the case of train schedule diagram generation. As a matter of fact, however, the present embodiment can be easily applied to other fields. In case scheduling of nurse arrangement is performed in a hospital, for example, nurses can take partial change of work stations according to on-duty hours if the number of nurses is large. The present invention brings about the following effects. (1) Competition management for a plurality of work stations is facilitated. (2) Overhead at the time of operation is small. (3) Since operation at a work station having priority takes precedence, occurrence of contradiction caused by conflict in opinion among a plurality of operators is prevented. (4) Even if a plan has a large scale, it is possible to make the plan without being restricted by the size of the display device. (5) Since a plurality of work stations back up each other, the reliability of the system can be improved. In the present embodiment, the work station 10 is shown in Fig. 14 has the untransmitted modification queue 25. By transmitting the contents of the untransmitted modification queue 25 to the work station 20 as the contents 149 of operation, the work station 10 takes precedence in processing over the work station 20. On the contrary, however, the work station 20 may have the untransmitted modification queue 25 and its contents may be transmitted to the work station 10 as the operation request contents 159. In this case, the work station 20 has priority. Further, both work stations 10 and 20 may have untransmitted modification queues. In this case, contents of both untransmitted modification queues can be mutually transmitted by providing the work station 20 with the same program as the data transmission program 142 shown in Fig. 14. Further, in the present embodiment, two work stations 10 and 20 comprising storage devices 5 and 15 as well as central processing units 1 and 11 are used. Even in a typical system comprising one computer and two terminal devices, however, the present invention can be easily implemented.

Claims: An information processing system for making a plan, comprising: a plurality of operation sections (10, 20) that are connected to one another, each of the operation sections taking partial charge of said plan; wherein each of said plurality of operation sections (10, 20) has at least a central processing unit (1, 11) and a storage device (5, 15) to store information (21-23, 31-33) for making said plan, the information processing system being characterized in that each of said plurality of operation sections (10, 20) is able to receive and handle operation requests; and that one of said plurality of operation sections (10, 20) is provided with priority for the plan making function, this one operation section (10) including an untransmitted modification queue (25) for storing contents of modifications performed at this one operation section (10) which are not yet transmitted to the others of said plurality of operation sections (20). An information processing system according to claim 1, wherein said untransmitted modification queue (25) is included in said storage device (5) of said operation section (10) having priority. An information processing system according to claim 1 for use in scheduling and rescheduling, wherein each of said operation sections (10, 20) further comprises: an input device (3, 4, 13, 14); a display device (2, 12); planned schedule diagram table means (21, 31) for storing a schedule diagram; and predicted schedule diagram table means (23, 33) for storing a modified schedule. An information processing system according to claim 3 for use in train scheduling and rescheduling, wherein said system further comprises: a partial charge table (24, 34) for allotting the partial charge ranges of the operation of each operation section (10, 20); wherein said display device (2, 12) in each operation section (10, 20) displays the train time-table within the ranges specified in each of said partial charge tables (24, 34); and wherein said planned schedule diagram table (21, 31) and said predicted schedule diagram table (23, 33) are updated in accordance with said displayed allotted ranges and the actual performance of each of the operational functions within said ranges allotted for each operation section. An information processing method for making a plan in a processing system comprising a plurality of operation sections (10, 20) that are connected to one another, wherein one of said plurality of operation sections (10) is provided with priority for the plan making function and includes an untransmitted modification queue (25) for storing contents of modifications performed at this one operation section (10) which are not yet transmitted to the others of said plurality of operation sections (20), said information processing method comprising the steps of: inputting operating data (51-53) at any of said operation sections (10, 20); transmitting operating data inputted at an operation section (20) other than said operation section (10) having priority to said operation section (10) having priority; rejecting and deleting operating data already existing in said untransmitted modification queue (25) at said operation section (10) having priority; otherwise, saving said operating data in said queue (25) at said operation section (10) having priority; updating the operation data of said operation section (10) having priority in accordance with said received operating data (51-53); and transmitting said operating data (51-53) to every one of said plurality of operation sections (20). An information processing method according to claim 5 for use in scheduling and rescheduling, said operating data comprising copies of a scheduling diagram table (21, 31) and a rescheduling diagram table (23, 33).

Inventors: KISHI KIYOMI, MATSUMOTO KUNIAKI, TSURUTA SETSUO, KISHI, KIYOMI, MATSUMOTO, KUNIAKI, TSURUTA, SETSUO
Applicants: HITACHI INF & CONTROL SYST, HITACHI LTD, HITACHI INFORMATION & CONTROL SYSTEMS, INC., HITACHI, LTD.
Application year: 1990
Main classification: B61L27
IPC codes: B61L25, G06F15, B61L27