Patent ID: 8494971

Claim:
A method for editing a production schedule, comprising the steps of: receiving production schedule master data; duplicating the production schedule master data to generate production schedule editing data; editing items in the production schedule editing data in response to an inputted editing command to generate production schedule preliminarily-edited data; identifying an edited item corresponding to the production schedule preliminarily-edited data and the production schedule master data; determining whether the inputted editing command is valid or invalid when, among items in the production schedule master data, tag information is appended to an item that is the same as the edited production schedule; and updating the production schedule master data by using the generated production schedule preliminarily-edited data in which the editing command determined to be valid is reflected and to which the tag information is appended, thereby producing an edited production schedule, wherein the identifying step further comprises the steps of: using an identification table in which grids are arranged in a checkerboard pattern, and in which a group of the items shown by the production schedule master data and a group of the items shown by the production schedule preliminarily-edited data are arranged on item-arrangement grids to be perpendicular to each other with a reference grid being set as a starting grid and the item-arrangement grids being arranged on the outer periphery of the checkerboard pattern; drawing a diagonal line in the grid when items on perpendicular lines extending respectively to the production schedule master data and the production schedule preliminarily-edited data from one of the grids coincide with each other and the diagonal line is drawn in parallel with a line extending from a reference point to a vertex point located at a position opposite to the reference point on the diagonal line of the checkerboard pattern; obtaining a shortest path from the reference point to the vertex point by performing a shortest path algorithm for obtaining the shortest path; and tracing the obtained shortest path from the reference point to the vertex point so as to find a grid having a horizontal or a vertical part of the shortest path and identifies the item corresponding to the grid thus found in the production schedule preliminarily-edited data as having been edited with respect to the production schedule master data; and identifying whether the corresponding item is inserted or deleted in accordance with whether the shortest path extends in the horizontal direction or the vertical direction; and wherein at least one of the steps is carried out by using a computer device.