A system and method for rapidly adjusting and generating scheduling schemes

Abstract

This invention provides a system for rapidly adjusting and generating scheduling plans, including an order database, a process template library, a database of existing workshop resource arrangements, and a human-machine interaction task adjustment triggering device. Utilizing the human-machine interaction task adjustment triggering device, the system senses and collects interactive operation information, triggering modules for adding, deleting, modifying, and updating scheduling plans for designed task items. These modules perform corresponding data processing operations on resource scheduling plan task information and order product planning information, achieving efficient updating and rapid generation of scheduling plans. This invention enables the rapid generation and adjustment of existing scheduling plans, meeting the needs for rapid adjustment and constraint checks in scenarios such as single-task resource switching, time adjustment, single-task addition, single-task deletion, batch removal of associated tasks, and batch shifting of associated tasks after deviations from the effective scheduling plan occur.

Description

Technical Field

[0001] This invention relates to the field of resource scheduling in "linear machining" (different processes for the same product cannot be performed simultaneously), with machining as a typical example, and particularly to a system and method for rapidly adjusting and generating planned scheduling schemes. Background Technology

[0002] The orderly management and efficient production of manufacturing enterprises rely heavily on planning and scheduling schemes that guide actual production on-site. As a technology for generating plans that ensure the right production tasks are arranged at the right time and the right resources are utilized, the implementation process of planning and scheduling scheme generation technology mainly involves: first, designing corresponding production processes based on the product task requirements of production orders, and constructing a representation model of the production process using a suitable data structure; second, setting resource constraints for process task execution based on on-site resource conditions, and setting the processing and production time of process tasks through simulation or historical data; and finally, generating the planning and scheduling scheme through the constructed algorithm / strategy.

[0003] Currently, much research on generating planning and scheduling schemes focuses on static scheme generation using rule-based, heuristic, and metaheuristic methods, yielding significant results. However, numerous uncertainties and disturbances exist in the field, such as frequent production rework, equipment failures, order insertions, and task suspensions / cancellations. These disturbances inevitably lead to deviations between the scheduling scheme and actual production execution. Researchers have gradually adopted dynamic scheduling, rescheduling, and pre-reactive scheduling methods to generate scheduling schemes that consider disturbances, improving the applicability of the schemes. However, rescheduling and dynamic scheduling methods not only suffer from problems such as inducing significant adjustments to previous schemes and long computation times, but also often involve a large amount of subjective human decision-making in the context of disturbances. Fixed optimization indicators cannot accurately quantify subjective decision preferences that dynamically change with market conditions and resources, lacking interactive flexibility. Therefore, in addition to the current fixed-optimization-indicator scheduling scheme generation, a rapid adjustment and generation system for planning and scheduling schemes with good interactivity is needed.

[0004] This invention proposes a method and key elements for constructing a rapid adjustment system for planning and scheduling schemes. It enables the rapid generation of new schemes after adjustments to existing scheduling schemes. It can adapt to conflict-free scheduling schemes that conform to process resource constraints after disturbances such as deletion, addition, time adjustment, execution resource adjustment, batch cancellation, and batch adjustment of tasks that deviate from the effective scheduling scheme. It also updates the expected start and completion times of order production tasks after information aggregation. Furthermore, it enables the management of product process-level task recovery after cancellation / pause of published schemes. This supports the precise process-level management of semi-finished products to be arranged and the process-level measurement of the total number of production tasks to be scheduled during the scheduling and production execution process. Summary of the Invention

[0005] The purpose of this invention is to provide a system and method for rapidly adjusting and generating scheduling schemes. This system enables the rapid generation of new schemes after adjustments to existing scheduling schemes, as well as task management. It can adapt to conflict-free scheduling schemes that comply with process resource constraints after disturbances such as task deletion, addition, time adjustment, execution resource adjustment, batch task cancellation, and batch task adjustment occur, thereby meeting the requirements of the deviating scheduling scheme. Furthermore, it updates the expected start and finish times of order production tasks and achieves process-level management of production tasks.

[0006] To achieve the above-mentioned technical effects, the technical solution of the present invention is as follows: A system for rapidly adjusting and generating planning and scheduling schemes is provided, comprising an order database, a process template library, a workshop resource existing arrangement information database, and a human-computer interaction task adjustment triggering device. The human-computer interaction task adjustment triggering device is used to perceive and collect interactive operation information, triggering the addition, deletion, modification, and scheduling scheme update processing modules of the designed task items. The corresponding modules implement corresponding data processing operations for resource scheduling scheme task information and order product planning arrangement information, thereby achieving the purpose of efficient updating and rapid generation of planning and scheduling schemes.

[0007] The order database includes data record fields such as order name, order identifier, order quantity, batch number identifier of products included in the order, process information of the batch number products, and process details of the order associated instance; each order corresponds to one record in the order database;

[0008] The process template library includes process identifier, process number, process name, process content, process time, process responsible person, process scheduling generation sequence, and process optional equipment tag, which fully describe the process, process time, and process processing resource information record fields within the process; complete the complete description of process information; and are used for the rapid generation of process details for order-related instances;

[0009] The existing workshop resource arrangement database includes fields for resource identifier, resource name, resource work shift system, resource work week system, non-working days and holidays caused by faults and anomalies, and existing task arrangement information records for resources; and a complete description of the completed resource tasks.

[0010] Furthermore, the human-computer interaction task adjustment triggering device consists of a hardware module and a functional module;

[0011] The hardware module includes a PC, a display screen, and a mouse and keyboard.

[0012] The functional modules include a task item addition processing module, a task item time adjustment processing module, a task item task resource switching processing module, a task item batch deletion processing module for associated tasks, and a task item batch adjustment processing module for associated tasks.

[0013] Furthermore, the task item adds a processing module, including a resource task time conflict detection submodule, an earliest valid time length search submodule, and a start / end time calculation submodule.

[0014] The task time adjustment processing module includes a resource task time period unprocessable time domain change detection submodule, a resource task time conflict detection submodule, an earliest valid time length search submodule, a start / end time calculation submodule, and a call interface module for a fixed value start / end time calculation submodule.

[0015] The task resource switching processing module for the task item includes a resource-task matching constraint compliance detection submodule and a calling interface module for the task item addition processing module;

[0016] The batch deletion processing module for associated tasks of the task item includes a calling interface module for a targeted process associated task retrieval submodule and a single task deletion submodule within a specified resource.

[0017] The task item's associated task batch adjustment processing module includes a targeted process associated task retrieval submodule and a task item addition processing module for specified task items, which serves as a calling interface module.

[0018] Furthermore, the order database contains product batch number process information, including product batch number name, process identifier, process scheduling generation sequence, actual on-site allocated execution resources, planned task start time, and planned task end time;

[0019] The existing resource arrangement database of the workshop contains task arrangement information, including task name, order identifier, process identifier, furnace batch number identifier, planned task start time, and planned task end time.

[0020] Furthermore, the resource task time conflict detection submodule, in the sequence of scheduled tasks sorted by the start time of the scheduled tasks, uses a binary search method based on the base time of the task to be processed, and takes the start time of the existing task item and the start time of the task to be processed as references, to quickly locate the preceding and following task processes of the task to be processed in the resource arrangement, and records the start and end times of the preceding and following task processes as [Sra, Era] and [Srb, Era], respectively; and detects the occurrence of conflicts and the direction of time conflicts by the relationship between the time interval [Sin, Ein] of the task to be processed and the time interval [Era, Srb].

[0021] Furthermore, the earliest matching valid time period search submodule, if it obtains a set reference time base value T... serch Search direction, time period length T R The length of the task gap time period is obtained from near to far in the search direction, denoted as T. id When T id <T R When, make T serch =T far Continue searching in the search direction. If the search reaches the last task of the resource in the search direction, then take the time value of the last task in the search direction as the earliest matching time; when T id ≥T R At that time, in the T id Within the corresponding time period [Srb, Erb], search the cumulative interval where the non-processable time period is denoted as T. unable Determine T id -T unable ≥T R If true, output the time interval [Srb, Erb]; otherwise, output the time interval T. id -T unable ≥T R If the result is false, continue performing the above search operation steps in the search direction;

[0022] Furthermore, the start / end time calculation submodule performs calculations based on the reference time, calculation direction, and time interval length information, using an iterative truncation method in the search direction. The process is as follows: first, by superimposing the calculated time intervals in the search direction, a first desired time interval is obtained. Then, within the time interval between the reference time and the first desired end time, a processable time interval is searched within the accumulated interval and compared with the calculated time interval. When the calculated time interval equals the accumulated value of the processable time interval, the first desired time interval is output as the result value. Otherwise, when the calculated time interval is greater than the accumulated value of the processable time interval, the difference between the two is taken as the new calculated time interval, and the previous desired time interval is taken as the reference time. The calculation is iterated until the calculated time interval equals the accumulated value of the processable time interval, and the desired time interval is output as the result value.

[0023] Furthermore, the resource-task matching constraint compliance detection submodule, based on the process processing resources in the process details of the corresponding order-associated instance in the order database, obtains the set of optional processing resources for the task process setting, determines the relationship between the target resource and the set of optional processing resources for the task process setting, and completes the resource-task matching constraint compliance detection;

[0024] The targeted process-related task retrieval submodule obtains the preceding / following process tasks by generating the process scheduling order within the process details of the corresponding order-related instance.

[0025] Another technical solution of the present invention provides a method for rapidly adjusting and generating a scheduling scheme, comprising the following steps:

[0026] Step S1: Establish data record fields describing the order name, order identifier, order quantity, furnace batch number identifier of the product included in the order, furnace batch number product process information, and process details of the order association instance. Based on the actual order information involved, complete the data assignment for the order name, order identifier, order quantity, and furnace batch number identifier fields. Execute Step S2;

[0027] Step S2: Based on the order processing requirements, complete the preliminary design of the order process: Search the process template library to see if a matching / similar process already exists. If a matching process exists, proceed to step S3; otherwise, proceed to step S4.

[0028] Step S3: Obtain the process information template from the process template library, perform final editing and correction, generate the corresponding order-related process information content, and assign it to the "Order-related Instance Process Details" field of the corresponding order in Step S1. Depending on its generality, decide whether to load the generated process information content into the process template library to complete the expansion of the process template library; proceed to Step S5.

[0029] Step S4: Construct process information content, which must include: process identifier, process number, process name, process content, process time, process responsible person, process scheduling generation sequence, and process optional equipment markers, fully describing the processes, process time, and process processing resources within the process; after the process information content is generated, it is assigned to the "Order Association Instance Process Details" field of the associated order in Step S1, and depending on its generality, it is decided whether to load the generated process information content into the process template library to complete the expansion of the process template library; proceed to Step S5;

[0030] Step S5: Construct on-site resource information, which should include: resource identifier, resource name, resource work shift system, resource work week system, non-working days and holidays caused by faults and anomalies, and existing task arrangement information for resources; based on the actual situation on-site and the plan, complete the assignment of corresponding values ​​in the existing arrangement data table of workshop resources; proceed to step S6.

[0031] Step S6: Based on the resource shift system, resource work week system, non-working days and holidays caused by faults and anomalies, and existing task arrangement information in the existing workshop resource arrangement data table constructed in Step S5, construct an interactive interface to display the existing task information of the resources in a Gantt chart. At the same time, implement the binding of events such as double-clicking task items, dragging task items, and double-clicking in the blank area of ​​resources in the Gantt chart component with the set response methods. Double-clicking a task item will bring up the operation interface for that task item. The interface includes a start and end time, task duration modification settings box, and four trigger buttons: save, cancel, delete, and batch delete.

[0032] If the settings are complete and the save button is clicked, step S7 will be executed.

[0033] If the delete button is clicked, step S8 will be executed.

[0034] If the "Batch Associated Deletion" button is clicked, step S9 will be executed.

[0035] If you click the Cancel button, you will not perform any operation and will exit the task operation interface;

[0036] A task item drag-and-drop event across resource areas occurs, triggering execution step S10;

[0037] Double-clicking on a blank resource area will bring up a resource operation interface; the interface includes a corresponding resource description information box, a new resource task editing box, and new and cancel buttons for resource tasks; clicking the new task button will trigger execution step S11.

[0038] Click the Cancel button to exit the resource operation interface without performing any operation; after completing the interactive operation of the Gantt chart, click the Send button in the Gantt chart display interface to trigger the execution step S16.

[0039] Step S7: After editing and saving a single task, retrieve the data set in the start and end times and task duration modification settings boxes of the task operation interface, and record Sn = modified task start time, En = modified end time, and Tn = modified working hours. Retrieve the current task start and end times and task duration, and record So = task start time before modification, Eo = task end time before modification, and To = working hours before modification. In the corresponding resource data, determine whether the non-processing task times included in the task time coverage area after the change have changed compared to before the change. If there is no change, directly update the task time value in the resource arranged task data; otherwise, obtain the start and end times and working hours information of the changed task, first execute the "single process task deletion" operation process for the task, and then execute the "single process task addition" operation process for the task. The workflow is as follows: After adding a new operation, the start and end times of the task are recorded as Sc and Ec. The time intervals for the preceding and succeeding processes of the product's process task are obtained: [SaEa], [Sf, Ef]. If the time interval [Sc, Ec] is within the [Ea, Sf] interval, and S = Sc and E = Ec are used to update the task time value in the resource-allocated task data, the process time will be updated. Otherwise, a pop-up message will appear indicating a process-related task conflict and asking whether adaptive adjustment should be performed. If adaptive adjustment is not possible, the task time modification fails, and the original unmodified task time So and Eo arrangements are returned. If adaptive adjustment is possible based on process association, the adaptive adjustment of the process task affected by the associated process task is performed according to the direction of the associated process task conflict in [Sc, Ec].

[0040] Step S8: Delete the information for this task from the list of tasks already assigned to the corresponding resource;

[0041] Step S9: In the tasks already arranged for the corresponding resources, execute step S8 to delete a single task, and obtain whether the task is still in the immediate subsequent task. If it is, execute the associated single task deletion operation in a loop until the process associated task deletion is completed.

[0042] Step S10: Switching scheduling resources across resource regions for a single task item:

[0043] First, search the order database for the resource allocation set corresponding to the product's process, denoted as set {Ra}. Based on the position of the dragged target in the Gantt graph component, calculate the resource marker Rn corresponding to that position. Determine if Rn is in set {Ra}. If it is not in {Ra}, meaning the process task cannot be processed by the target resource, the drag operation fails, and the task icon returns to the drag start position. If Rn is in set {Ra}, execute the "Add Single Process Task" operation process for the task in the dragged target resource Rn, and execute the "Delete Single Process Task" operation process for the task in the dragged source resource Ro. If the task drag is successful, the interface display position is updated, and the interface drag operation is completed.

[0044] Step S11, Adding a resource task:

[0045] First, determine whether the task marking reference is the start time or the end time. If the start time is used as the task limitation reference, execute step S12; if the end time is used as the task limitation reference, execute step S13.

[0046] Step S12: First, determine whether there are any scheduled / holidays for the corresponding resource within the task start and end time interval. If not, store the task information in the resource's scheduled tasks in a structured manner to complete the addition.

[0047] If the corresponding resource already has an arrangement / holiday, then based on the task mark time S, search in the direction of date increment for the earliest time period that satisfies "(ES) <= continuous processable time period", and record the start time of this time period as SF; then complete the value initialization Sc = SF; TR = ES; then execute step S14;

[0048] Step S13: First, determine whether there are any scheduled / holidays for the corresponding resource within the task start and end time interval. If not, store the task information in the resource's scheduled tasks in a structured manner to complete the addition.

[0049] If the corresponding resource already has an arrangement / holiday, then based on the task mark time E, search in the direction of earlier dates for the earliest time period that satisfies "(ES) <= continuous processable time period", and record the start time of this time period as EF; then complete the value initialization Ec = EF; TR = ES; then execute step S15;

[0050] Step S14: Using Sc as the baseline, proceed in the date increment direction to obtain the end time Ec = Sc + TR; determine whether there are non-working days in the interval [Sc, Ec]. If there are no non-working days in the interval [Sc, Ec], update the task start and end times: S = SF; E = Ec; and store the task information in the structured format in the resource-arranged tasks to complete the task addition; otherwise, when there are non-working days in the interval [Sc, Ec], obtain the start time Sh and end time Eh of the non-working day that is closest to Sc; complete the value update: TR = TR - (Sh - Sc); Sc = Eh; iteratively execute step S14;

[0051] Step S15: Using Ec as the reference, move forward in the date direction to obtain the start time Sc = Ec - TR; determine whether there are non-working days in the interval [Sc, Ec]. If there are no non-working days in the interval [Sc, Ec], update the task start and end times: S = Sc; E = EF; and store the task information in the structured format in the resource-arranged tasks to complete the task addition; otherwise, when there are non-working days in the interval [Sc, Ec], obtain the start time Sh and end time Eh of the non-working day that is closest to Ec; update the values: TR = TR - (Ec - Eh); Ec = Sh; iteratively execute step S15;

[0052] Step S16, Resource Scheduling:

[0053] First, retrieve the set of task items with changed task information {Tc} from the self-operation log; then, according to the different orders to which the task products belong, split the set of task items with changed task information {Tc} into subsets {OTc1}...{OTcn}; execute step S17;

[0054] Step S17: From the split set, take an untraversed subset as the iterative search subset {OTca}; execute step S18;

[0055] Step S18: Take the unprocessed task items in {OTca} and record them as Tr; determine whether the task information change type of Tr is addition / deletion. When the task information change type of Tr is addition / deletion, update the task scope information of the corresponding order product's completion arrangement process, and then update the corresponding order process level and product level completion time.

[0056] When the change type of the Tr task information is not addition / deletion, directly execute the update of the corresponding order process level and product level completion time; determine whether the process task content in {OTca} has been traversed. If it has not been traversed, continue to execute step S18. When the traversal is completed, execute step S19.

[0057] Step S19: Update the start and end times of the completed order subset; determine if there are any uncompleted order subsets. If not, continue with step S16. If the traversal is complete, update the resource scheduling scheme.

[0058] The beneficial effects of the planning and scheduling scheme, rapid adjustment generation system, and method provided by this invention are:

[0059] 1) This invention features a human-computer interaction design with a task drag-and-drop scheduling scheme, making it more intuitive and convenient for users to update and adjust scheduling schemes.

[0060] 2) This invention enables detailed process-level scheduling task monitoring and management down to the individual product level by setting data items in the order database, process database, and existing workshop resource arrangement database.

[0061] 3) This invention constructs a task adjustment processing method based on various adjustment operations of existing scheduling schemes, realizing functions such as automatic calculation of the effective time of scheme adjustment, resource constraint detection, batch adjustment and deletion of process-related tasks, and improving the efficiency of user scheme adjustment.

[0062] 4) This invention achieves synchronous calculation and update of the planning scheme after the scheduling scheme is manually saved through the linkage data processing of the scheduling scheme and the planning scheme. Attached Figure Description

[0063] The invention will be further described below with reference to the accompanying drawings:

[0064] Figure 1 This is a construction diagram of the rapid adjustment system for the scheduling scheme of this invention;

[0065] Figure 2 This is an overview of the Gantt diagram of the present invention;

[0066] Figure 3 This is a Gantt graph task item of the present invention;

[0067] Figure 4 This is a schematic diagram of the resource task time adjustment method of the present invention;

[0068] Figure 5 This is a schematic diagram of the adaptive adjustment method for process-related tasks of the present invention;

[0069] Figure 6 This is a schematic diagram of the batch deletion method for process-related tasks of the present invention;

[0070] Figure 7 This is a schematic diagram of the task resource switching and adjustment method of the present invention;

[0071] Figure 8 This is a schematic diagram of the method for adding new resource tasks according to the present invention;

[0072] Figure 9 Schematic diagram of the synchronous update method for the planned scheme of this invention;

[0073] Figure 10 This is a schematic diagram of the time conflict detection submodule method of the present invention;

[0074] Figure 11 This is a schematic diagram of the earliest valid time length time segment search submodule method of the present invention;

[0075] Figure 12This is a schematic diagram of the start / end time calculation submodule method of the present invention;

[0076] Figure 13 This is a schematic diagram of the resource-task matching constraint compliance detection module method of the present invention;

[0077] Figure 14 This is a schematic diagram of the process-related task retrieval module method of the present invention. Detailed Implementation

[0078] The following detailed description, in conjunction with the accompanying drawings and specific embodiments, provides a further detailed explanation of the rapid adjustment and generation system and method for the planning and scheduling scheme proposed in this invention. The advantages and features of this invention will become clearer from the following description and claims. It should be noted that the drawings are all in a very simplified form and use non-precise ratios, and are only used to facilitate and clarify the illustration of the embodiments of this invention.

[0079] Example 1

[0080] This embodiment provides a system for rapidly adjusting and generating planning and scheduling schemes, including an order database, a process template library, and a database of existing workshop resource arrangements. It utilizes a human-computer interaction task adjustment triggering device to perceive and collect interactive operation information. This triggers modules for adding, deleting, modifying, and updating scheduling schemes, with corresponding data processing operations performed on resource scheduling scheme task information and order product planning information within these modules. This achieves the goal of efficiently updating and rapidly generating planning and scheduling schemes.

[0081] The order database includes record fields such as order name, order identifier, order quantity, batch number identifier of products included in the order, process information of products in the batch number, and process details of the order associated instance; each order corresponds to one record in the order database;

[0082] The process template library includes process identifier, process number, process name, process content, process time, process responsible person, process scheduling generation sequence, and process optional equipment tag, which fully describe the information recording fields such as process, process time, and process processing resources within the process; complete the complete description of process information; and are used for the rapid generation of process details for order-related instances;

[0083] The existing workshop resource arrangement database includes information record fields such as resource identifier, resource name, resource work shift system, resource work week system, non-working days and holidays caused by faults and anomalies, and existing task arrangement information for resources; and a complete description of the completed resource task;

[0084] The human-computer interaction task adjustment triggering device includes basic input and output devices such as PC, display screen, mouse and keyboard (or similar hardware devices used to assist in expressing user intentions) and software controls to realize the event response jump function, including a task item addition processing module, a task item time adjustment processing module, a task item task resource switching processing module, a task item batch deletion processing module and a task item batch adjustment processing module.

[0085] The task item new processing module includes a resource task time conflict detection submodule, an earliest valid time length search submodule, and a start / end time calculation submodule.

[0086] The task time adjustment processing module includes a resource task time period unprocessable time domain change detection submodule, a resource task time conflict detection submodule, an earliest valid time length time period search submodule, a start / end time calculation submodule, and a call interface module for a fixed value start / end time calculation submodule.

[0087] The task resource switching processing module for the task item includes a resource-task matching constraint compliance detection submodule and a calling interface module for the task item addition processing module;

[0088] The batch deletion processing module for associated tasks of the task item includes a calling interface module for a targeted process associated task retrieval submodule and a single task deletion submodule within a specified resource.

[0089] The task item associated task batch adjustment processing module includes the targeted process associated task retrieval submodule and the task item addition processing module for the specified task item calling interface module.

[0090] Furthermore, the order database contains product batch number process information, including product batch number name, process identifier, process scheduling generation sequence, actual on-site allocated execution resources, planned task start time, and planned task end time;

[0091] Furthermore, the existing task arrangement information in the workshop resource database includes task name, order identifier, process identifier, furnace batch number identifier, planned task start time, and planned task end time.

[0092] Furthermore, the resource task time conflict detection submodule, in the sequence of scheduled tasks sorted by the start time of the scheduled tasks, uses a binary search method based on the base time of the task to be processed, and takes the start time of the existing task item and the start time of the task to be processed as references, to quickly locate the preceding and following task processes of the task to be processed in the resource arrangement, and records the start and end times of the preceding and following task processes as [Sra, Era] and [Srb, Era] respectively; by the relationship between the time interval [Sin, Era] of the task to be processed and the time interval [Era, Era], the conflict occurrence and the direction of the time conflict are detected;

[0093] Furthermore, the earliest matching valid time period search submodule, if it obtains a set reference time base value T... serch Search direction, time period length T R The length of the task gap time period is obtained from near to far in the search direction, denoted as T. id When T id <T R When, make T serch =T far Continue searching in the search direction. If the search reaches the last task of the resource in the search direction, then take the time value of the last task in the search direction as the earliest matching time; when T id ≥T R At that time, in the T id Within the corresponding time period [Srb, Erb], search the cumulative interval where the non-processable time period is denoted as T. unable Determine T id -T unable ≥T R If true, output the time interval [Srb, Erb]; otherwise, output the time interval T. id -T unable ≥T R If the result is false, continue performing the above search operation steps in the search direction;

[0094] Furthermore, the start / end time calculation submodule performs calculations based on the reference time, calculation direction, and time interval length information, using an iterative truncation method in the search direction. The main process is as follows: first, by superimposing the calculated time intervals in the search direction, a first expected time is obtained. Then, within the time interval between the reference time and the first expected end time, a processable time interval is searched within the accumulated interval and compared with the calculated time interval. When the calculated time interval equals the accumulated value of the processable time interval, the first expected time interval is output as the result value. Otherwise, when the calculated time interval is greater than the accumulated value of the processable time interval, the difference between the two is taken as the new calculated time interval, and the previous expected time interval is taken as the reference time. The calculation is iterated until the calculated time interval equals the accumulated value of the processable time interval, and the expected time interval is output as the result value.

[0095] Furthermore, the resource-task matching constraint compliance detection submodule, based on the process processing resources in the process details of the corresponding order-associated instance in the order database, obtains the set of optional processing resources for the task process setting, determines the relationship between the target resource and the set of optional processing resources for the task process setting, and completes the resource-task matching constraint compliance detection;

[0096] Furthermore, the targeted process-related task retrieval submodule obtains the preceding / following process tasks by using the process scheduling generation sequence within the process details of the corresponding order-related instance.

[0097] Example 2

[0098] This embodiment provides a method for rapidly adjusting and generating a scheduling plan, including the following steps:

[0099] Step S1: Establish data record fields describing the order name, order identifier, order quantity, furnace batch number identifier of the product included in the order, furnace batch number product process information, and process details of the order association instance. Based on the actual order information involved, complete the data assignment for the order name, order identifier, order quantity, and furnace batch number identifier fields. Execute Step S2;

[0100] Step S2: Based on the order processing requirements, complete the preliminary design of the order process. Search the process template library to see if a matching / similar process already exists. If a matching process exists, proceed to step S3; otherwise, proceed to step S4.

[0101] Step S3: Obtain the process information template from the process template library, perform final editing and correction, generate the corresponding order-related process information content, and assign it to the "Order-related Instance Process Details" field of the corresponding order in Step S1. Depending on its general applicability, decide whether to load the generated process information content into the process template library to complete the expansion of the process template library. Proceed to Step S5;

[0102] Step S4: Construct process information content, which must include: process identifier, process number, process name, process content, process time, process responsible person, process scheduling generation sequence, and process optional equipment markers, fully describing the processes, process time, and process processing resources within the process. After the process information content is generated, it is assigned to the "Order Association Instance Process Details" field of the associated order in Step S1, and its generality is considered to determine whether to load the generated process information content into the process template library to complete the expansion of the process template library. Execute Step S5;

[0103] Step S5: Construct on-site resource information, which should include: resource identifier, resource name, resource work shift system, resource work week system, non-working days and holidays caused by faults and anomalies, and existing task arrangement information for resources; based on the actual situation on-site and the plan, complete the assignment of corresponding values ​​in the existing arrangement data table of workshop resources; proceed to step S6.

[0104] Step S6: Based on the resource shift system, resource work week system, non-working days and holidays caused by faults and anomalies, and existing task arrangement information in the existing workshop resource arrangement data table constructed in Step S5, construct an interactive interface to display the existing task information of the resources in a Gantt chart. At the same time, bind the double-click of task items, dragging of task items, and double-click of blank areas of resources in the Gantt chart component with the set response methods. Double-clicking a task item will bring up the operation interface for that task item. The interface includes a modification setting box for start and end time and task duration, as well as four trigger buttons: save, cancel, delete, and batch delete. If the settings are completed and the save button is clicked, step S7 is triggered. If the delete button is clicked, step S8 is triggered. If the batch delete button is clicked, step S9 is triggered. Clicking the cancel button will not perform any operation and will exit the task operation interface. A drag-and-drop event across resource areas triggers step S10; double-clicking a blank resource area brings up a resource operation interface; the interface includes a corresponding resource description information box, a new resource task editing box, and new and cancel buttons for resource tasks; clicking the new task button triggers step S11; clicking the cancel button leaves the resource operation interface unchanged; after completing the interactive operation of the Gantt chart, clicking the send button in the Gantt chart display interface triggers step S16.

[0105] Step S7, the method for saving after single-task editing is attached. Figure 1As shown, retrieve the data set in the modification settings boxes for start and end time and task duration in the task operation interface, and record Sn = modified task start time, En = modified end time, and Tn = modified working hours. Retrieve the current (unmodified) task start and end time and task duration, and record So = task start time before modification, Eo = modified end time, and To = modified working hours. In the corresponding resource data, determine whether the non-processing task time included in the modified task time coverage area has changed compared to before the change. If there is no change, directly update the task time value in the resource arranged task data. Otherwise, obtain the start and end time and working hour information in the modified task, first execute the "single-process task deletion" operation process for the task, and then execute the "single-process task" operation process for the task. Add a new operation; after adding the operation, the start and end times of the task are recorded as: Sc, Ec; obtain the time intervals of the preceding and succeeding processes of the product process task: [SaEa], [Sf,Ef]; check if the time interval [Sc,Ec] is within the [Ea,Sf] interval. If it is, use S=Sc, E=Ec to update the task time value in the resource-allocated task data; otherwise, a pop-up prompts for process-related task conflicts, asking whether to perform adaptive adjustment. When adaptive adjustment cannot be performed, the task time modification fails, and the original unmodified task time So, Eo arrangement is returned; when adaptive adjustment can be performed based on process association, according to the direction of the process task conflict caused by [Sc,Ec], follow the attached... Figure 2 The process, through its execution, adaptively adjusts to influence the process tasks.

[0106] Step S8: Delete the information for this task from the list of tasks already assigned to the corresponding resource;

[0107] Step S9, the method for batch deletion of associated tasks in a single task is attached. Figure 3 As shown, in the tasks already arranged for the corresponding resources, step S8 is executed to delete a single task. It is then determined whether the task is still a subsequent task. If so, the associated single task deletion operation is executed in a loop until the process associated task deletion is completed.

[0108] Step S10, the method for switching scheduling resources across resource regions for a single task item is as follows: Figure 4As shown, firstly, the resource allocation set corresponding to the product's process is searched in the order database, denoted as set {Ra}. Based on the position of the dragged target in the Gantt graph component, the resource marker Rn corresponding to that position is calculated. It is then determined whether Rn is in set {Ra}. If it is not in {Ra}, meaning that the process task cannot be produced by the target resource, the drag operation fails, and the task icon returns to the drag start position. If Rn is in set {Ra}, the "Add Single Process Task" operation process for the task is executed in the dragged target resource Rn, and the "Delete Single Process Task" operation process for the task is executed in the drag source resource Ro. The task drag is successful, the interface display position is updated, and the interface drag operation is completed.

[0109] Step S11, the method for adding a resource task is as follows (see attached). Figure 5 As shown, firstly, the task marking benchmark is determined by...

[0110] If the start time is used as the task constraint benchmark, proceed to step S12; if the end time is used as the task constraint benchmark, proceed to step S13.

[0111] Step S12, the method for adding a resource task is as follows (see attached). Figure 5 As shown in the flowchart on the right, firstly, it is determined whether there is a corresponding resource already scheduled / holiday within the task start and end time interval. If not, the task information is structured and stored in the resource already scheduled tasks, completing the addition. If there is a corresponding resource already scheduled / holiday, then based on the task mark time S, the earliest time period that satisfies "(ES) <= continuous processable time period" is searched in the direction of date increase, and the start time of this time period is recorded as SF. Then, the values ​​are initialized Sc = SF; TR = ES; and then step S14 is executed.

[0112] Step S13, the method for adding a resource task is as follows (see attached). Figure 5 As shown in the flowchart on the left, firstly, it is determined whether there are any scheduled tasks / holidays for the corresponding resource within the task start and end time interval. If not, the task information is structured and stored in the scheduled tasks, completing the addition. If there are scheduled tasks / holidays for the corresponding resource, the earliest time period that satisfies "(ES) <= continuous processable time period" is searched in the direction of earlier dates, based on the task mark time E, and the start time of this time period is recorded as EF. Then, the values ​​are initialized: Ec = EF; TR = ES. Then, step S15 is executed.

[0113] Step S14: Using Sc as the baseline, proceed in the date increment direction to obtain the end time Ec = Sc + TR; determine whether there are non-working days in the interval [Sc, Ec]. If there are no non-working days in the interval [Sc, Ec], update the task start and end times: S = SF; E = Ec; and store the task information in the structured format in the resource-arranged tasks to complete the task addition; otherwise, if there are non-working days in the interval [Sc, Ec], obtain the start time Sh and end time Eh of the non-working day that is closest to Sc; update the values: TR = TR - (Sh - Sc); Sc = Eh; iteratively execute step S14;

[0114] Step S15: Using Ec as the reference, advance the date direction to obtain the start time Sc = Ec - TR; determine whether there are non-working days in the interval [Sc, Ec]. If there are no non-working days in the interval [Sc, Ec], update the task start and end times: S = Sc; E = EF; and store the task information in the structured format in the resource-arranged tasks to complete the task addition; otherwise, when there are non-working days in the interval [Sc, Ec], obtain the start time Sh and end time Eh of the non-working day that is closest to Ec; update the values: TR = TR - (Ec - Eh); Ec = Sh; iteratively execute step S15;

[0115] Step S16, Resource scheduling scheme update appendix Figure 6 As shown, firstly, the task that occurred is obtained from the self-operation log.

[0116] The task set {Tc} with information changes; based on the order to which the task product belongs, split the task set {Tc} with information changes into subsets {OTc1}……{OTcn}; execute step S17;

[0117] Step S17: From the resulting split set, select an untraversed subset as the iterative search subset {OTca}; proceed to step S18.

[0118] Step S18: Take the unprocessed task items in {OTca} and denote them as Tr; determine the task information change class of Tr.

[0119] If the change type of Tr task information is addition / deletion, when the change type is addition / deletion, update the task range information of the corresponding completed process of the order product (furnace batch number), and then update the completion time of the corresponding order process level and product level; when the change type of Tr task information is not addition / deletion, directly update the completion time of the corresponding order process level and product level; determine whether the process task content in {OTca} has been traversed completely. If it has not been traversed completely, continue to execute step S18. If it has been traversed completely, execute step S19.

[0120] Step S19: Update the start and end times of the completed order subset; determine if there are any incomplete orders.

[0121] If the order subset is not fully traversed, continue with step S16. Once the traversal is complete, the resource scheduling scheme will be updated.

[0122] The contents not described in detail in this specification are prior art known to those skilled in the art. It will be apparent to those skilled in the art that the present invention is not limited to the details of the exemplary embodiments described above, and that the invention can be implemented in other specific forms without departing from its spirit or essential characteristics. Therefore, the embodiments should be considered in all respects as exemplary and non-limiting, and the scope of the invention is defined by the appended claims rather than the foregoing description. Thus, it is intended that all variations falling within the meaning and scope of equivalents of the claims be included within the present invention.

Claims

1. A system for rapidly adjusting and generating scheduling schemes, characterized in that, It includes an order database, a process template library, a workshop resource existing arrangement information database, and a human-computer interaction task adjustment triggering device; using the human-computer interaction task adjustment triggering device, the interactive operation information is perceived and collected, triggering the design of the task item addition, deletion, modification and scheduling scheme update processing module, and the corresponding module realizes the corresponding data processing operations of resource scheduling scheme task information and order product plan arrangement information, so as to achieve the purpose of efficient updating and rapid generation of the plan scheduling scheme; The order database includes data record fields such as order name, order identifier, order quantity, batch number identifier of products included in the order, process information of the batch number products, and process details of the order associated instance; each order corresponds to one record in the order database; The process template library includes process identifier, process number, process name, process content, process time, process responsible person, process scheduling generation sequence, and process optional equipment mark, which fully describe the process, process time, and process processing resource information recording fields within the process; thus completing a complete description of the process information. Used for the rapid generation of process details for order-related instances; The existing workshop resource arrangement database includes fields for resource identifier, resource name, resource shift system, resource work week system, non-working days and holidays caused by faults and anomalies, and existing task arrangement information records for resources; and a complete description of the completed resource tasks; The human-computer interaction task adjustment triggering device consists of a hardware module and a functional module; The hardware module includes a PC, a display screen, and a mouse and keyboard. The functional modules include a task item addition processing module, a task item time adjustment processing module, a task item task resource switching processing module, a task item batch deletion processing module for associated tasks, and a task item batch adjustment processing module for associated tasks. The task item new processing module includes a resource task time conflict detection submodule, an earliest valid time length search submodule, and a start / end time calculation submodule. The task time adjustment processing module includes a resource task time period unprocessable time domain change detection submodule, a resource task time conflict detection submodule, an earliest valid time length search submodule, a start / end time calculation submodule, and a call interface module for the fixed value start / end time calculation submodule. The task resource switching processing module for the task item includes a resource-task matching constraint compliance detection submodule and a calling interface module for the task item addition processing module; The batch deletion processing module for associated tasks of the task item includes a calling interface module for a targeted process associated task retrieval submodule and a single task deletion submodule within a specified resource. The task item's associated task batch adjustment processing module includes a targeted process associated task retrieval submodule and a task item addition processing module for specified task items calling interface module; The resource task time conflict detection submodule, by using a binary search method, quickly locates the preceding and following task processes of the task to be processed in the resource arrangement, based on the baseline time of the task to be processed and the corresponding start time of the existing task items and the start time of the task to be processed, in the sequence of scheduled tasks sorted by the start time of the scheduled tasks. The start and end times of the preceding and following tasks are recorded as [Sra, Era] and [Srb, Era], respectively. By analyzing the relationship between the time interval [Sin, Ein] of the task to be processed and the time interval [Era, Srb], the module detects the occurrence of conflicts and the direction of time conflicts. The earliest matching valid time period search submodule, if it obtains a set reference time base value... T serch Search direction, time period length T R The length of the task gap time period is obtained from near to far in the search direction, denoted as T. id When T id < T R At that time, T serch = T far Continue searching in the search direction. If the search reaches the last task of the resource in the search direction, then take the time value of the last task in the search direction as the earliest matching time; when T id ≥ T R At that time, in the T id Within the corresponding time period [Srb, Erb], search the cumulative interval where the non-processable time period is denoted as... T unable Determine T id - T unable ≥ T R If true, output the time interval [Srb, Erb]; otherwise, output the time interval T. id - T unable ≥ T R If the result is false, continue performing the above search operation steps in the search direction; The start / end time calculation submodule performs calculations based on the reference time, calculation direction, and time interval length information, using an iterative truncation method along the search direction. The process is as follows: first, by superimposing the calculated time interval along the search direction, a first desired time is obtained. Then, within the time interval between the reference time and the first desired end time, a processable time interval is searched within the accumulated interval and compared with the calculated time interval. When the calculated time interval equals the accumulated value of the processable time interval, the first desired time is output as the result value. Otherwise, when the calculated time interval is greater than the accumulated value of the processable time interval, the difference is taken as the new calculated time interval, and the previous desired time interval is used as the reference time. This iterative calculation continues until the calculated time interval equals the accumulated value of the processable time interval, at which point the desired time interval is output as the result value. The resource-task matching constraint compliance detection submodule obtains the set of optional processing resources for task process settings based on the process processing resources in the process details of the corresponding order association instance in the order database, determines the relationship between the target resource and the set of optional processing resources for task process settings, and completes the resource-task matching constraint compliance detection. The targeted process-related task retrieval submodule obtains the preceding / following process tasks by generating the process scheduling order within the process details of the corresponding order-related instance.

2. The rapid adjustment and generation system for the planning and scheduling scheme as described in claim 1, characterized in that, The order database contains product batch number process information, including product batch number name, process identifier, process scheduling generation sequence, actual on-site allocated execution resources, planned task start time, and planned task end time. The existing resource arrangement database of the workshop contains task arrangement information, including task name, order identifier, process identifier, furnace batch number identifier, planned task start time, and planned task end time.

3. A method for rapidly adjusting and generating scheduling schemes, applied in the system for rapidly adjusting and generating scheduling schemes as described in claim 1 or 2, characterized in that, Includes the following steps: Step S1: Establish data record fields describing the order name, order identifier, order quantity, furnace batch number identifier of the product included in the order, furnace batch number product process information, and process details of the order association instance. Based on the actual order information involved, complete the data assignment for the order name, order identifier, order quantity, and furnace batch number identifier fields of the product included in the order; proceed to step S2. Step S2: Based on the order processing requirements, complete the preliminary design of the order process: Search the process template library to see if a matching / similar process already exists. If a matching process exists, proceed to step S3; otherwise, proceed to step S4. Step S3: Obtain the process information template from the process template library, perform final editing and correction, generate the corresponding order-related process information content, and assign it to the "Order-related Instance Process Details" field of the corresponding order in Step S1. Depending on its generality, decide whether to load the generated process information content into the process template library to complete the expansion of the process template library. Execute step S5; Step S4: Construct process information content, which must include: process identifier, process number, process name, process content, process time, process responsible person, process scheduling generation sequence, and process optional equipment markers, fully describing the processes, process time, and process processing resources within the process; after the process information content is generated, it is assigned to the "Order Association Instance Process Details" field of the associated order in Step S1, and depending on its generality, it is decided whether to load the generated process information content into the process template library to complete the expansion of the process template library; proceed to Step S5; Step S5: Construct on-site resource information, which should include: resource identifier, resource name, resource work shift system, resource work week system, non-working days and holidays caused by faults and anomalies, and existing task arrangement information for resources; based on the actual situation on-site and the plan, complete the assignment of corresponding values ​​in the existing arrangement data table of workshop resources; proceed to step S6. Step S6: Based on the resource shift system, resource work week system, non-working days and holidays caused by faults and anomalies, and existing task arrangement information in the existing workshop resource arrangement data table constructed in Step S5, construct an interactive interface to display the existing task information of the resources in a Gantt chart; at the same time, implement the binding of double-click, drag-and-drop, and double-click events of task items, resource blank areas in the Gantt chart component with the set response methods; double-clicking a task item will bring up the operation interface for that task item; the interface includes a start and end time, task duration modification settings box, and four trigger buttons for saving, canceling, deleting, and batch associated deletion; If the settings are complete and the save button is clicked, step S7 will be executed. If the delete button is clicked, step S8 will be executed. If the "Batch Associated Deletion" button is clicked, step S9 will be executed. If you click the Cancel button, you will not perform any operation and will exit the task operation interface; A task item drags across resource areas, triggering execution step S10. Double-clicking on a blank resource area will bring up a resource operation interface; the interface includes a corresponding resource description information box, a new resource task editing box, and new and cancel buttons for resource tasks; clicking the new task button will trigger execution step S11. Click the Cancel button to exit the resource operation interface without performing any operation; after completing the interactive operation of the Gantt chart, click the Send button in the Gantt chart display interface to trigger the execution step S16. Step S7: After editing a single task, save it. Retrieve the data set in the modification settings boxes for start and end time and task duration in the task operation interface, and record Sn = modified task start time, En = modified end time, and Tn = modified working hours. Retrieve the current task start and end time and task duration, and record So = task start time before modification, Eo = task end time before modification, and To = working hours before modification. In the corresponding resource data, determine whether the non-processing task time included in the task time coverage area after the change has changed compared to before the change. If there is no change, directly update the task time value in the resource arranged task data. Otherwise, obtain the start and end time and working hour information in the changed task, first execute the "single process task deletion" operation process for the task, and then execute the "single process task addition" operation process for the task. After the addition operation, the start and end time of the task is recorded as: Sc, Ec. Obtain the time range of the preceding and following processes of the product process task: [SaEa], [ [Sf,Ef]; Check if the time interval [Sc,Ec] is within the interval [Ea,Sf]. If it is, set S=Sc and E=Ec to update the task time value in the resource-assigned task data; otherwise, a pop-up window will prompt whether to perform adaptive adjustment due to process-related task conflicts. If adaptive adjustment is not possible, the task time modification will fail and the original unmodified task time So and Eo will be returned. If adaptive adjustment is possible due to process association, perform adaptive adjustment of the process tasks affected by the association according to the direction of the process task conflict in [Sc,Ec]. Step S8: Delete the information for this task from the list of tasks already assigned to the corresponding resource; Step S9: In the tasks already arranged for the corresponding resources, execute step S8 to delete a single task, and obtain whether the task is still in the immediate subsequent task. If it is, execute the associated single task deletion operation in a loop until the process associated task deletion is completed. Step S10: Switching scheduling resources across resource regions for a single task item: First, search the order database for the resource allocation set corresponding to the product's process, denoted as set {Ra}. Based on the position of the dragged target in the Gantt graph component, calculate the resource marker Rn corresponding to that position. Determine if Rn is in set {Ra}. If it is not in {Ra}, meaning the process task cannot be processed by the target resource, the drag operation fails, and the task icon returns to the drag start position. If Rn is in set {Ra}, execute the "Add Single Process Task" operation process for the task in the dragged target resource Rn, and execute the "Delete Single Process Task" operation process for the task in the dragged source resource Ro. If the task drag is successful, the interface display position is updated, and the interface drag operation is completed. Step S11, Adding a resource task: First, determine whether the task marking reference is the start time or the end time. If the start time is used as the task constraint reference, execute step S12; if the end time is used as the task constraint reference, execute step S13. Step S12: First, determine whether there are any scheduled / holidays for the corresponding resource within the task start and end time interval. If not, store the task information in the resource's scheduled tasks in a structured manner to complete the addition. If the corresponding resource already has an arrangement / holiday, then based on the task mark time S, search in the direction of date increment for the earliest time period that satisfies: "(ES)<= continuous processable time period", and record the start time of this time period as SF; then complete the value initialization Sc=SF;TR=ES; then execute step S14; Step S13: First, determine whether there are any scheduled / holidays for the corresponding resource within the task start and end time interval. If not, store the task information in the resource's scheduled tasks in a structured manner to complete the addition. If the corresponding resource already has an arrangement / holiday, then based on the task mark time E, search in the direction of earlier dates for the earliest time period that satisfies: "(ES)<= continuous processable time period", and record the start time of this time period as EF; then complete the value initialization Ec=EF; TR=ES; then execute step S15; Step S14: Using Sc as the baseline, proceed in the date increment direction to obtain the end time Ec = Sc + TR; determine whether there are non-working days in the interval [Sc, Ec]. If there are no non-working days in the interval [Sc, Ec], update the task start and end times: S = SF; E = Ec; and store the task information in the structured data in the scheduled tasks to complete the task addition; otherwise, if there are non-working days in the interval [Sc, Ec], obtain the start time Sh and end time Eh of the non-working day that is closest to Sc; update the values: TR = TR - (Sh - Sc); Sc = Eh; iteratively execute step S14. Step S15: Using Ec as the reference, move forward in the date direction to obtain the start time Sc = Ec - TR; determine whether there is a non-working date in the interval [Sc, Ec]. If there is no non-working date in the interval [Sc, Ec], update the task start and end times: S = Sc; E = EF; and store the task information in the structured data in the scheduled tasks to complete the task addition; otherwise, if there is a non-working date in the interval [Sc, Ec], obtain the start time Sh and end time Eh of the non-working date that is closest to Ec; update the values: TR = TR - (Ec - Eh); Ec = Sh; iteratively execute step S15. Step S16, Resource Scheduling: First, retrieve the set of task items with changed task information {Tc} from the self-operation log; then, according to the different orders to which the task products belong, split the set of task items with changed task information {Tc} into subsets {OTc1}...{OTcn}; execute step S17; Step S17: From the split set, take an untraversed subset as the iterative search subset {OTca}; execute step S18; Step S18: Take the unprocessed task items in {OTca} and record them as Tr; determine whether the task information change type of Tr is addition / deletion. When the task information change type of Tr is addition / deletion, update the task scope information of the corresponding order product's completion arrangement process, and then update the corresponding order process level and product level completion time. When the change type of the Tr task information is not addition / deletion, directly execute the update of the corresponding order process level and product level completion time; determine whether the process task content in {OTca} has been traversed. If it has not been traversed, continue to execute step S18. When the traversal is completed, execute step S19. Step S19: Update the start and end times of the completed order subset; determine if there are any uncompleted order subsets. If not, continue with step S16. If the traversal is complete, update the resource scheduling scheme.

Images