JP4319026B2 - Schedule creation method, schedule creation system, and program - Google Patents

Description

  The present invention relates to a schedule creation method, a schedule creation system, and a program for creating a production schedule by a computer in a production process such as a factory.

  Conventionally, a schedule creation system using a computer is used to process a plurality of orders in a production process composed of a plurality of processes represented by a production process of a material processing system such as steel, aluminum and copper. . In this schedule creation system, the processing start time and processing end time, occupied resources, etc. are determined for an order or task (one process for one order). In addition, the schedule creation system has different operating conditions and other constraints (time constraints, etc.) for each process, and develops a more desirable schedule (optimum solution) for factories and companies while keeping such constraints as much as possible. Is required.

  In order to create a more desirable schedule for the schedule automatically created by the schedule creation system, an operator manually corrects the schedule. In this method, it is necessary to eliminate the problems caused in the schedule by correction and to make the schedule executable.

  As such a conventional technique, for example, there is a technique disclosed in Patent Document 1. In the technique shown in Patent Literature 1, a schedule is displayed in a Gantt chart by drawing on the display one tile having a horizontal width from the processing start time to the processing end time for each task (part) or order (job). is doing. When the operator corrects the schedule, the tile to be corrected is selected from these tiles with the mouse or the keyboard, and the tile to be corrected is moved in the time axis direction or between transferable resources. Then, by referring to the schedule result after the movement, the problem with respect to time constraints with other processes (processing does not overlap, there is no time reversal in the processes before and after the same order, etc.) is solved. .

Japanese Patent Laid-Open No. 5-28161

  By the way, in an actual manufacturing site, there are a plurality of tasks having the same processing conditions, and they are often collected as a lot and processed in lot units. However, according to the technology of the conventional schedule creation system, tiles are displayed for each task or order unit as a process Gantt chart on a display device such as a display, and a plurality of tasks having the same processing conditions are aggregated and displayed as a lot. Since there is no concept of performing, there is a problem that it is difficult to grasp under what processing conditions a task is processed from a schedule in an actual manufacturing site.

  Further, according to the technology of the conventional schedule creation system, the schedule must be corrected in units of tasks or orders, and a plurality of tasks having the same processing conditions aggregated as a lot cannot be corrected simultaneously. Therefore, there is a problem that the efficiency of schedule correction is deteriorated. In other words, when multiple tasks with the same processing conditions for a schedule are aggregated as a lot, in order to make corrections while keeping the lots, all tasks that are aggregated as lots must be individually corrected. In other words, the number of tiles to be moved by the operator with respect to the process Gantt chart increases, and the efficiency of schedule correction becomes worse. Also, when multiple tasks with the same processing conditions for a schedule are aggregated as a lot, modification of a certain task causes lot splitting or interruption, and switching of extra processing (steps) in the actual manufacturing process. (Replacement) occurs.

  Furthermore, according to the technology of the conventional schedule creation system, in a display device such as a display, tiles are displayed in units of tasks or orders as a process Gantt chart, and the entire time width in which the processing time of one task is displayed If it is significantly shorter than the character string, there is a problem that it is difficult to see the character string (manufacture number, product type, etc.) displayed in the tile.

  The present invention has been made in view of the above problems, and provides a schedule creation method, a schedule creation system, and a program capable of creating a schedule suitable for a manufacturing site where lot consolidation operation is performed.

Means and effects for solving the problems

In order to solve the above-described problems, a schedule creation method according to the present invention can process a process executed by a CPU in a computer having a CPU, a storage device, an input device, and an output device. Lot condition registration step for registering, in the storage device, a condition for collectively processing a plurality of tasks, which are combinations of a plurality of orders and processes necessary for manufacturing a product of the order, for each resource, and the task In the schedule information storage step of assigning the resource to the resource while keeping the constraint conditions, creating an initial schedule and storing it in the storage device, and a task having the same condition as the lot for the schedule in units of tasks Collectively, lot conversion step to convert to lot unit schedule, and output the lot unit schedule And schedule result display step of displaying the location, the display schedule of the batches to an output device, and lot moving step of designating a change of assignment time for a particular lot that is input by the input device, the modified When the schedule of the lot unit after the execution violates the constraint condition, the schedule of the lot unit after the change is converted into the schedule of the task unit, and the task belonging to the specific lot is assigned to the allocation time. And a schedule correction step of correcting a task belonging to a lot other than the specific lot in a fixed state by allocating the task to a resource that can be processed while keeping the constraint condition .

For each resource that can be processed, the program according to the present invention sets a condition for collectively processing a plurality of tasks, which are a combination of a plurality of orders and a process necessary for manufacturing a product of the order, as a lot. Lot condition registration step for registering in a storage device, assigning the task to the resource while observing the constraint conditions, creating a first schedule, and storing the schedule information in the storage device; A lot conversion step for collecting the tasks having the same condition as a lot and converting the same into a lot unit schedule, a schedule result display step for displaying the lot unit schedule on an output device, and the lot unit displayed on the output device. Allocate specific lots entered by the input device to the schedule Lot move step to specify the change between, if the lot unit schedule after making the change violates the constraints, convert the lot unit schedule after the change to a task unit schedule In a state in which tasks belonging to the specific lot are fixed at an allocation time, a task belonging to a lot other than the specific lot is allocated to a resource that can be processed and the correction is performed while observing the constraints. correction steps, and a CPU, a storage device in a computer having an input device and an output device, and installed in the storage device, characterized in that to execute processing of each step is read by the CPU.

A schedule creation system according to the present invention is a schedule creation system that creates a schedule by a computer having a CPU, a storage device, an input device, and an output device, and the storage device can process the schedule creation system. Lot condition registration means for registering conditions for batch processing multiple tasks, which are combinations of multiple orders and processes necessary to manufacture products of the order, for each resource, and the result of the created schedule Schedule information storage means for storing, the CPU assigns the task to the resource while observing the constraint condition, and creates an initial schedule creating means for each task, For schedules, tasks with the same conditions are grouped as a lot, and a lot-by-lot schedule Lots converting means for converting Lumpur, and schedule result display means for displaying on the output device a schedule for the lot unit, the display schedule of the batches to an output device, the specific input by the input device If the lot moving means for specifying the change of the allocation time for the lot and the schedule of the lot unit after the change violates the constraint condition, the schedule of the lot unit after the change is set as the task unit In the state where the task belonging to the specific lot is fixed to the allocation time, the task belonging to the lot other than the specific lot is allocated to a resource that can be processed while complying with the constraint conditions. And a schedule correction means for performing correction .

According to this, the schedule created for each task is converted as a schedule for each lot, and the schedule for each lot is displayed on the output device. Accordingly, it is possible to easily grasp the transition of the lot summarizing conditions that are the constraint conditions, and to easily determine whether the schedule is good or bad. Further, since the tile area of the Gantt chart becomes wide, it is easy to confirm information useful for operation such as lot summarizing conditions and processing specifications. Here, the tile refers to a rectangle displayed as a task on the Gantt chart. Note that when converting to a lot-by-lot schedule, tasks that cannot be collected as a lot are left as they are. Then, based on the display of the schedule in units of lots, it is instructed to move the tile, which is the allocation time of a specific lot, and on the basis of the result, the schedule is corrected in units of tasks. Therefore, since it is possible to instruct and move the allocation time for a group of tasks having the same lot grouping conditions as a lot, it is possible to efficiently change the schedule allocation time at the manufacturing site where the lot grouping operation is performed. . Further, since the constraint condition violation associated with the change in the schedule allocation time is performed in units of tasks, fine correction can be made and an optimal schedule can be obtained. Furthermore, the schedule of the modified task unit is converted into the lot unit and displayed again, thereby making it easy to grasp the schedule.

Also, the schedule creation method according to the present invention, the schedule information storing step, and schedule the task units, it is preferable to store the schedule of the batches, the storage area of the separately storage.

Similarly, the program according to the present invention, the schedule information storing step, and schedule the task units, it is preferable to store the schedule of the batches, the storage area of the separately storage.

Similarly, scheduling system according to the present invention, the schedule information storage means, and scheduling of the task units, it is preferable to store the schedule of the batches, the separately stored area.

  According to this, in addition to the schedule for each task, data is exchanged with the database regarding the schedule for each lot. Accordingly, even when the number of tasks in the schedule is large, when the schedule in lot units is displayed, the data exchanged with the database can be compressed, and the time for displaying the schedule can be shortened.

  In the schedule creation method according to the present invention, the schedule correction step converts the lot unit schedule after the change into a task unit schedule, and the task unit schedule subjected to the conversion. The step of eliminating the overlap of the allocation time of each task belonging to a lot other than the specific lot in the resource to which the specific lot is allocated, and the specific lot in the resource to which the specific lot is allocated A step to check whether the upper or lower task of each task belonging to a lot other than the lot violates the time constraint, and if it is determined by the above confirmation that the violation is confirmed After the assigned task allocation time has been moved within the lot to which the task belongs, time constraints The step of reconfirming whether the violation has occurred and, if it is determined that the violation has occurred by the reconfirmation, the allocation time of the task for which the violation has been confirmed is set for any lot in the resource to which the task is allocated. Preferably moving to an unassigned time.

Similarly, in the program according to the present invention, the schedule correction step converts the lot unit schedule after the change into a task unit schedule, the task unit schedule subjected to the conversion, A step of eliminating an overlap of allocation times of tasks belonging to lots other than the specific lot in the resource to which the specific lot is allocated; a lot other than the specific lot in the resource to which the specific lot is allocated A step of confirming whether the upper or lower task of each task belonging to is violating the time constraint, and if it is determined by the confirmation that the violation has been confirmed, After moving the allocation time within the lot to which the task belongs, the time constraint is violated. The step of reconfirming, if it is determined that the violation is found by the reconfirmation, the allocation time of the task for which the violation has been confirmed is not allocated to any lot in the resource to which the task is allocated the step of moving the time, it is preferably provided with a.

  Similarly, in the schedule creation system according to the present invention, the schedule correction unit converts the lot unit schedule after the change into a task unit schedule, and the task unit for which the conversion has been performed. A means for resolving overlapping of allocation times of tasks belonging to lots other than the specific lot in the resource to which the specific lot is allocated; and the specific in the resource to which the specific lot is allocated If it is determined that the upper or lower task of each task belonging to a lot other than a lot violates the time constraints, and if it is determined that the violation After the confirmed task allocation time is moved within the lot to which the task belongs, the time constraint is violated. If it is determined that there is a violation by the reconfirmation, the allocation time of the task for which the violation has been confirmed is allocated to any lot in the resource to which the task is allocated. And means for moving at a time not being used.

  According to this, for each task allocated to the resource whose allocation time has been changed, a constraint violation on the time axis with the task in the preceding / following process is confirmed. If there is a constraint violation, the constraint violation is resolved by moving the tasks in the preceding and following processes in which the constraint violation is confirmed. At this time, first, it is checked whether or not the constraint violation can be resolved by moving the tasks in the preceding and following processes in which the constraint violation is confirmed within the lot to which the task belongs. Next, it is checked whether the constraint violation can be resolved by moving the tasks in the preceding and following processes in which the constraint violation is confirmed, including the lot to which the task belongs, to a time when the lot is not allocated. Therefore, it is possible to correct the schedule while minimizing the task correction amount and avoiding the splitting of the lot and interruption of tasks with different lot grouping conditions into the lot. That is, the schedule can be corrected while maintaining the group as an important lot as much as possible at the production site where the lot operation is performed.

  The program according to the present invention includes a removable recording medium such as a CD-ROM (Compact Disc Read Only Memory), FD (Floppy (registered trademark) Disk), and MO (Magneto-Optic), and a fixed recording medium such as a hard disk. In addition to being able to be recorded and distributed, it can be distributed via a communication network such as the Internet by wired or wireless telecommunication means.

  Hereinafter, the best mode for carrying out the schedule creation method and schedule creation system and the program according to the present invention will be described with reference to a specific example, with reference to the drawings.

  First, the schedule creation system according to the present embodiment will be described with reference to FIG. FIG. 1 is a block diagram of a schedule creation system according to the present embodiment.

  As shown in FIG. 1, the schedule creation system 1 includes an initial schedule creation unit 10, a schedule information storage unit 20, a lot conversion unit 30, a schedule result display unit 40, a movement information storage unit 50, and a schedule correction unit. 60.

  The initial schedule creation unit 10 determines an initial plan of task allocation time (processing start time and processing end time), which is a combination of orders and processes, based on the order information 11, process information 12, and lot summary condition 13 information. Is to do. The schedule creation method is assumed to be performed by the prior art, and the description thereof is omitted.

  The order information 11 stores in advance information on products to be produced by ordering (product number, product type, weight, delivery date, etc.). In the present embodiment, eight products with serial numbers 1 to 8 are registered as orders.

The process information 12 stores in advance a process procedure (specification equipment, processing order, processing time, etc.) for manufacturing a product. For example, it is a database in which process procedures are assigned using the type of order information as a key. In the present embodiment, a processing line for an aluminum plate is assumed, and it is composed of four steps of “sintering”, “correction (tension leveler)”, “cleaning”, and “slitter (stripping)”. Each product passes through the processes in the following order.
Manufacturing number 1: Sintering → Correction → Cleaning → Slitter Manufacturing number 2: Sintering → Cleaning → Slitter Manufacturing number 3: Sintering → Correction → Cleaning → Slitter Manufacturing number 4: Sintering → Cleaning → Slitter Manufacturing number 5: Sintering → Cleaning → Slitter Manufacturing number 6: Sintered → Straightening → Slitter Manufacturing number 7: Sintered → Cleaning → Slitter Manufacturing number 8: Sintered → Straightening → Slitting

  The lot summarizing condition (lot condition registering means) 13 registers under what conditions lot summarization is performed for each resource such as equipment and people, that is, whether the same kind of task summarization processing is performed in an operational manner. . In the present embodiment, there are four types of resources: incinerator equipment, straightening equipment, cleaning equipment, and slitter equipment, the form of the smelting temperature in the smelting furnace equipment, the type of cleaning liquid in the cleaning equipment, and the product plate width in the slitter equipment. It is made into a table.

  The schedule information storage unit (schedule information storage means) 20 is for storing the result of the created schedule. Task information (schedule for each task) 21 that is the minimum unit of processing and group information (schedule for each lot) 22 that is a result of collecting tasks into lots are stored in a form that can be referred to each other. Here, FIG. 2 shows an example of the task information 21 and the group information 22 in the present embodiment. In FIG. 2, tasks 1-A (first process with production number 1), 2-A (first process with production number 2), and 3-A (first process with production number 3) are incinerated in the furnace. It shows that lots are collected at a tempering temperature of “400 ° C.” and configured as a lot L (1). At this time, the processing start time of the lot L (1) is the start time of the first task (task 1-A), and the processing end time of the lot L (1) is the processing end time of the last task (task 3-A). Become.

  The lot conversion unit (lot conversion means) 30 configures a lot in which tasks to be processed of the same type are grouped based on the information on the lot summary condition 13 and the task information 21 stored in the schedule information storage unit 20. This is a program for storing the converted schedule in the group information 22 of the schedule information storage unit 20.

  The schedule result display unit (schedule result display means) 40 is an output device (for example, a display) for displaying a schedule result as a Gantt chart via the output interface 41. The output interface 41 is a program or hardware that performs data conversion and communication for outputting the data in the schedule information storage unit 20 to a display, a printer, or the like including the schedule result display unit 40.

  The movement information storage unit (lot movement means) 50 is for storing lot movement information input by an input device (for example, a mouse 52) via the input interface 51. For example, the lot movement information is stored in the form of a lot number and a processing start time after movement. Note that the input interface 51 is a program for converting lot movement information for a lot that is instructed to be changed by the mouse 52 to the Gantt chart displayed on the schedule result display unit 40 into data in the system. It is hardware.

  The schedule correction unit (schedule correction means) 60 starts processing of each lot or task of the lot movement information stored in the movement information storage unit 50, the task information 21 and the group information 22 stored in the schedule information storage unit 20, This program corrects the entire schedule after lot movement for each task based on the end time. Details of the processing procedure of the schedule correction program will be described later. The corrected schedule result is stored again in the task information 21 of the schedule information storage unit 20.

Next, the procedure of the process of the schedule creation method according to the present embodiment will be described based on FIG. FIG. 3 is a flowchart illustrating the processing procedure of the schedule creation method according to the present embodiment.
Note that the process of the schedule creation method according to the present embodiment described below can be similarly read and executed by the CPU as a program in a computer. Further, this program can be installed in various computer storage devices by recording it in a removable storage medium such as a CD-ROM, FD, or MO.

  As shown in FIG. 3, first, basic data registered in advance is read (step S1: lot condition registration step). In the present embodiment, basic data of order information 11, process information 12 and lot summary information 13 is registered in advance, and basic data is read as the schedule creation process starts.

  Then, an initial schedule is created (step S2: schedule information storage step). That is, the initial schedule creation unit 10 creates the first schedule for the order information. The created schedule is stored in the task information 21 of the schedule information storage unit 20. An example of an initial schedule for each task stored in the task information 21 in the present embodiment is shown in FIG. In the Gantt chart of FIG. 4, a plurality of connected rectangles (tiles) indicate tasks having the same processing conditions.

  Next, the created task unit schedule is converted into a lot unit schedule (step S3: lot conversion step). That is, the task information 21 in the schedule information storage unit 20 is converted into lot information that is a set of tasks having the same lot grouping condition value in the lot grouping condition 13, that is, a lot unit schedule. In the present embodiment, a conversion method is adopted in which a task is searched in order from the task with the earliest processing order for each facility, and a task having the same lot summary condition value is taken as one lot. For example, as shown in FIG. 4, tasks 2-C, 1-C, and 4-C in the cleaning facility are “pickling” having the same cleaning type, and are collected as one lot. The converted schedule is stored in the group information 22 of the schedule information storage unit 20.

  And the result of the schedule of the lot unit after conversion is displayed on a Gantt chart (step S4: schedule result display step). In the present embodiment, the initial schedule for each lot shown in FIG. 5 is read from the group information 22 and displayed on the schedule result display unit 40. FIG. 5 is a Gantt chart obtained by converting the initial schedule for each task shown in FIG. 4 into a schedule for each lot. In FIG. 5, one rectangle (tile) in the Gantt chart represents one lot, and the condition values for lot grouping are displayed in text in the tile. For example, in the slitter equipment, lots are grouped by the product plate width, so that the product plate width [mm] is displayed so that the operation flow is easy to understand. Further, in the correction equipment, since the lot summarizing condition is not specified, the lot summarization is not performed, and the task unit is displayed.

  Then, it is determined whether or not to end the schedule creation (step S5). The determination as to whether or not to end is given from the outside of the schedule creation system 1, for example, via the mouse 52 by the operator. If it is determined that the schedule creation is to be terminated (step S5: YES), the schedule creation process is terminated.

  On the other hand, when it is determined that the creation of the schedule is not finished (step S5: NO), a part of the lot is changed for the schedule displayed on the Gantt chart (step S6: lot movement step). In the present embodiment, a part of the schedule is changed by moving the tile corresponding to the lot with the mouse 52 with respect to the result of the schedule in units of lots displayed in the Gantt chart on the schedule result display unit 40. To do. For example, as shown in the Gantt chart of FIG. 6, the first lot (pickling) of the cleaning equipment is moved after the subsequent lot (hot water washing).

  Then, the correction data is read (step S7). In the present embodiment, the movement information storage unit 50 stores the lot movement information input by the mouse 52.

Next, a schedule is corrected in order to eliminate a constraint condition violation accompanying a change in a part of the lot (step S8: schedule correction step). In the present embodiment, for example, the schedule correction unit 60 corrects the schedule in order to eliminate the violation of the constraint condition such as the reverse of the time of the task before and after the same manufacturing number.
The schedule is corrected in units of tasks, not in units of lots. This is because one lot is temporally dependent on a plurality of lots, and if the schedule is corrected in units of lots, there is a high probability that the schedule after the correction will be significantly deteriorated. However, if correction is performed in units of tasks, it is conceivable that the group as a lot is destroyed. Therefore, in the present invention, the schedule is corrected based on the procedure of schedule correction processing described below.

  Here, the procedure of schedule correction processing will be described with reference to FIGS. FIG. 7 is a flowchart illustrating the procedure of schedule correction processing. FIG. 8 is a Gantt chart showing the state of the task after the schedule is corrected.

  As shown in FIG. 7, after the lot unit schedule is first converted into the task unit schedule, in the facility that processes the schedule transfer source process (the process in which the lot is moved by the mouse in step S6), after the lot movement The task is corrected so that no overlap occurs in the processing time zone of the task (step S801). In this modification, the processing start time of the original lot and the moved lot are compared, and the processing time is processed in order from the earliest time. Calculate the time. Based on the calculation result, the processing start / end times of the tasks belonging to the lot are corrected.

  Then, one task assigned to the facility that processes the movement source process is taken out from the order of the processing order (step S802). This is task N. In the present embodiment, selection is made in the order of 3-C, 5-C, 7-C, 2-C, 1-C, and 4-C.

For the extracted task, it is checked whether or not there is a time reversal with the task of the other process (the task of the upper and lower processes) (step S803). In the present embodiment, for task N, it is checked whether there is a time reversal with the task of another process having the same serial number. The task in the other process is designated as task N *.
If there is no time reversal for the task in the other process (step S803: NO), an end determination is made (step S807).

  On the other hand, if there is a time reversal for the task N * in the other process (step S804), the task N * with the time reversal is moved (reordered) within the lot to which the task N * belongs. In this way, lots are not split by changing the order of tasks within a lot. Then, it is checked whether or not the reverse of the time of the task N * can be eliminated (step S805). In the present embodiment, as shown in FIG. 6, all the tasks included in the “pickling” lot in the cleaning facility are time-reversed with the task of the slitter facility in the lower process. For example, as shown in FIG. 8, the task 4-D (task N *) is moved within the same lot (480 mm), thereby eliminating the time reverse of the task 4-C (task N).

If it is determined that the time reversal of task N * has been resolved (step S805: YES), an end determination is made (step S807).
On the other hand, if it is determined that the time reversal of task N * cannot be resolved (step S805: NO), task N * is moved between lots (the time zone between lots where lots are not assigned to equipment). By doing so, the reverse of the time is eliminated (step S806). In this manner, lots are not split by moving tasks between lots. In the present embodiment, for example, as shown in FIG. 8, by moving tasks 2-D, 1-D (task N *) between lots (after 480 mm), tasks 2-C, 1- The reverse of the time of C (task N) is eliminated.

  Then, an end determination is made (step S807). In the end determination, it is determined whether the processes in steps S802 to S806 described above have been repeated for all tasks assigned to the facility that processes the movement source process. If it is determined not to end due to the end determination (step S807: NO), the process returns to step S802. If it is determined that the process is to be ended (step S807: YES), the process ends.

  The result of the schedule correction is stored in the task information 21 of the schedule information storage unit 20, converted to a lot unit schedule by the lot conversion unit 30, and stored in the group information 22 of the schedule information storage unit 20. . Further, the group information 22 is displayed again as a Gantt chart on the schedule result display unit 40. The result of the end of the schedule in this embodiment is shown in FIG.

  Finally, it is determined whether or not to end the schedule creation (step S5). The determination as to whether or not to end is given from the outside of the schedule creation system 1, for example, via the mouse 52 by the operator. If the schedule creation is not completed and correction is continued (step S5: NO), the process proceeds to step S6. On the other hand, when it is determined that the creation of the schedule is to be terminated (step S5: YES), the schedule creation process is terminated.

Thus, according to the schedule creation method, schedule creation system, and program of the present embodiment, the schedule created in units of tasks in the initial schedule creation unit 10 is converted as a schedule in units of lots in the lot conversion unit 30, The schedule for each lot is displayed on the schedule house or the display unit 40.
As a result, it is possible to easily grasp the transition of the lot summarizing conditions that are the constraint conditions, and to easily determine whether the schedule is good or bad. Further, since the tile area of the Gantt chart becomes wide, it is easy to confirm information useful for operation such as lot summarizing conditions and processing specifications.

In addition to the task information (schedule by task) 21 stored in the schedule information storage unit 22, data is exchanged with a database for the group information (schedule by lot) 22.
As a result, even when the number of tasks in the schedule is large, when displaying a lot-by-lot schedule, the data exchanged with the database can be compressed, and the time for displaying the schedule in the schedule result display section 40 can be shortened. be able to.

Further, based on the display of the group information (lot unit schedule) 22 displayed on the schedule result display unit 40, the mouse 52 instructs the movement of a tile of a specific lot and is stored in the movement information storage unit 50. Based on the result, the schedule correction unit 60 corrects the schedule in units of tasks.
As a result, since a group of tasks having the same lot grouping conditions can be instructed to move together as a lot, the schedule can be efficiently changed at the manufacturing site where the lot grouping operation is performed. Further, since the constraint condition violation associated with the schedule change is performed on a task basis, fine correction is possible, and an optimal schedule can be obtained. Furthermore, the schedule of the modified task unit is converted into the lot unit and displayed again, thereby making it easy to grasp the schedule.

Further, for each task assigned to the facility that processes the movement source process (the process in which the lot is first moved by the mouse 52), a constraint violation on the time axis with the task in the preceding and following processes is confirmed. If there is a constraint violation, the constraint violation is resolved by moving the tasks in the preceding and following processes in which the constraint violation is confirmed. At this time, first, it is checked whether or not the constraint violation can be resolved by moving the tasks in the preceding and following processes in which the constraint violation is confirmed within the lot to which the task belongs (steps S803 and S804 in FIG. 7). Next, it is checked whether or not the constraint violation can be resolved by moving the tasks in the preceding and following processes in which the constraint violation is confirmed, including the lot to which the task belongs, to a time when the lot is not allocated (step S805 in FIG. 7). , S806).
As a result, it is possible to correct the schedule while minimizing the task correction amount and avoiding the splitting of the lot and interruption of tasks with different lot grouping conditions into the lot. That is, the schedule can be corrected while maintaining the group as an important lot as much as possible at the production site where the lot operation is performed.

  The preferred embodiments of the present invention have been described above. However, the present invention is not limited to the above-described embodiments, and various modifications can be made as long as they are described in the claims.

  In the above-described embodiment, the mouse 52 is used as an input device for an operator to instruct a task change with respect to the initial schedule. However, the present invention is not limited to this, and a keyboard or the like may be used.

It is a block diagram of the schedule creation system which concerns on this Embodiment. It is a figure which shows an example of the relationship between the task information in this embodiment, and group information. It is the flowchart explaining the procedure of the process of the schedule preparation method which concerns on this Embodiment. It is a Gantt chart which shows an example of the initial schedule of the task unit stored in the task information in this Embodiment. 5 is a Gantt chart obtained by converting an initial schedule for each task shown in FIG. 4 into a schedule for each lot. It is a Gantt chart after changing a part of the lot of the schedule. It is the flowchart explaining the procedure of the process of schedule correction. It is a Gantt chart which shows the state of the task after correction of a schedule. It is a Gantt chart which shows the result of the end of the schedule in this Embodiment.

Explanation of symbols

1 Schedule creation system 13 Lot summary condition (lot condition registration means)
20 Schedule information storage unit (schedule information storage means)
21 Task information (schedule for each task)
22 Group information (schedule by lot)
30 Lot conversion part (lot conversion means)
40 Schedule result display section (schedule result display means)
50 Movement information storage unit (lot movement means)
60 Schedule correction part (schedule correction means)

Claims (9)

In a computer having a CPU, a storage device, an input device, and an output device,
The process executed by the CPU is
For each resource that can be processed, a lot condition for registering in the storage device a condition for collectively processing a plurality of tasks, which are a combination of a plurality of orders and a process necessary for manufacturing the product of the order, as a lot Registration step;
A schedule information storage step of allocating the task to the resource while keeping the constraints, creating an initial schedule, and storing the schedule in a storage device;
A lot conversion step for collecting tasks having the same condition as a lot and converting the same into a lot unit schedule for the task unit schedule,
A schedule result display step for displaying the schedule of the lot unit on an output device;
Lot move step for designating change of allocation time for a specific lot input by the input device with respect to the schedule of the lot unit displayed on the output device;
If the schedule of the lot unit after the change violates the constraint condition, the schedule of the lot unit after the change is converted into a schedule of the task unit, and the tasks belonging to the specific lot are changed. A schedule correction step for allocating and correcting tasks belonging to lots other than the specific lot to resources that can be processed while keeping the constraint conditions in a state where the allocation time is fixed;
A schedule creation method comprising: The schedule information storing step includes:
The schedule creation method according to claim 1, wherein the task unit schedule and the lot unit schedule are separately stored in a storage area of a storage device. The schedule correction step includes:
Converting the lot unit schedule after the change into a task unit schedule; and
About the task unit schedule for which the conversion has been performed,
Eliminating overlapping of allocation times of tasks belonging to lots other than the specific lot in the resource to which the specific lot is allocated;
Checking whether the upper process or the lower process task of each task belonging to a lot other than the specific lot in the resource to which the specific lot is allocated violates a time constraint;
If it is determined by the above confirmation that the violation has occurred, the allocation time of the task for which the violation has been confirmed is moved within the lot to which the task belongs, and then it is reconfirmed whether the time constraint is violated. Steps,
When it is determined that the violation is confirmed by the reconfirmation, the allocation time of the task whose violation is confirmed is moved to a time when none of the lots is allocated in the resource to which the task is allocated;
The schedule creation method according to claim 1, further comprising : For each resource that can be processed, a lot condition for registering in the storage device a condition for collectively processing a plurality of tasks, which are a combination of a plurality of orders and a process necessary for manufacturing the product of the order, as a lot Registration steps,
A schedule information storage step of allocating the task to the resource while keeping the constraints, creating an initial schedule, and storing the schedule in a storage device;
Lot conversion step for collecting tasks with the same condition as a lot for a task unit schedule and converting it into a lot unit schedule,
A schedule result display step for displaying the lot-by-lot schedule on an output device;
Lot movement step for designating change of allocation time for a specific lot input by the input device with respect to the schedule of the lot unit displayed on the output device;
If the schedule of the lot unit after the change violates the constraint condition, the schedule of the lot unit after the change is converted into a schedule of the task unit, and the tasks belonging to the specific lot are changed. A schedule correction step for allocating and correcting tasks belonging to lots other than the specific lot to resources that can be processed while maintaining the constraint conditions in a state where the allocation time is fixed,
And a computer having a CPU, a storage device, an input device, and an output device, installed in the storage device, read by the CPU, and executed in steps. The schedule information storing step includes:
5. The program according to claim 4 , wherein the task unit schedule and the lot unit schedule are separately stored in a storage area of a storage device. The schedule correction step includes:
Converting the lot unit schedule after the change into a task unit schedule;
About the task unit schedule for which the conversion has been performed,
Eliminating overlapping of allocation time of each task belonging to a lot other than the specific lot in the resource to which the specific lot is allocated;
Confirming whether the upper process or the lower process task of each task belonging to a lot other than the specific lot in the resource to which the specific lot is allocated violates a time constraint,
If it is determined by the above confirmation that the violation has occurred, the allocation time of the task for which the violation has been confirmed is moved within the lot to which the task belongs, and then it is reconfirmed whether the time constraint is violated. Step,
If it is determined that the violation is confirmed by the reconfirmation, a step of moving the allocation time of the task whose violation is confirmed to a time when none of the lots is allocated in the resource to which the task is allocated;
The program according to claim 4, further comprising: A schedule creation system for creating a schedule by a computer having a CPU, a storage device, an input device, and an output device,
The storage device
Lot condition registration means for registering conditions for collectively processing a plurality of tasks, which are combinations of a plurality of orders and processes necessary for manufacturing a product of the order, for each resource that can be processed; ,
Schedule information storage means for storing the result of the created schedule;
Configured with
The CPU
An initial schedule creating means for creating the first schedule by allocating the task to the resource while observing the constraint condition;
Batch conversion means for collecting tasks with the same conditions as a lot for a schedule in a task unit and converting it into a schedule in a lot unit;
A schedule result display means for displaying the lot unit schedule on an output device;
Lot moving means for designating a change in allocation time for a specific lot input by the input device with respect to the lot unit schedule displayed on the output device;
If the schedule of the lot unit after the change violates the constraint condition, the schedule of the lot unit after the change is converted into a schedule of the task unit, and the tasks belonging to the specific lot are changed. Schedule fixing means for allocating and correcting tasks belonging to lots other than the specific lot to resources that can be processed while keeping the constraint conditions in a state where the allocation time is fixed;
A schedule creation system comprising: The schedule information storage means includes
The schedule creation system according to claim 7 , wherein the task unit schedule and the lot unit schedule are separately stored in a storage area. The schedule correction means includes
Means for converting the schedule of a lot unit after the change into a schedule of a task unit;
About the task unit schedule for which the conversion has been performed,
Means for eliminating an overlap of allocation time of each task belonging to a lot other than the specific lot in the resource to which the specific lot is allocated;
Means for confirming whether the upper process or the lower process task of each task belonging to a lot other than the specific lot in the resource to which the specific lot is allocated violates time constraints;
If it is determined by the above confirmation that the violation has occurred, the allocation time of the task for which the violation has been confirmed is moved within the lot to which the task belongs, and then it is reconfirmed whether the time constraint is violated. Means,
A means for moving the allocation time of a task for which the violation has been confirmed to a time in which none of the lots is allocated in the resource to which the task is allocated, when it is determined that the violation is confirmed by the reconfirmation;
The schedule creation system according to claim 7 or 8 , further comprising:

Images