CN117933642A

CN117933642A - Intelligent production scheduling system, method, equipment and medium

Info

Publication number: CN117933642A
Application number: CN202410102959.XA
Authority: CN
Inventors: 梁荧平; 简恭厚; 何源辉; 李学芹; 丁度然; 刘洪安
Original assignee: Guangdong Saiyi Information Technology Co ltd
Current assignee: Guangdong Saiyi Information Technology Co ltd
Priority date: 2024-01-24
Filing date: 2024-01-24
Publication date: 2024-04-26

Abstract

The invention provides an intelligent production scheduling system, method, equipment and medium, wherein the method comprises the following steps: acquiring a scheduling request, and screening a task set to be scheduled according to the scheduling request; acquiring an arranged task list to determine a resource time segment, wherein the resource time segment comprises an arranged task time segment and a resource pause time segment; under the condition that the scheduling type of the task set is additional scheduling, removing the scheduled task time segments and the resource pause time segments to obtain idle time segments, determining scheduling node time according to a pre-configured ordering rule, and visually ordering the task set to be scheduled in the corresponding idle time segments in a forward direction and/or a reverse direction based on the scheduling node time; and under the condition that the scheduling type of the task set is non-additional scheduling, the task set to be scheduled and the existing task set are subjected to visual scheduling in a forward direction or a reverse direction. The invention improves the scheduling flexibility and can quickly respond to the scheduling demands of different clients.

Description

Intelligent production scheduling system, method, equipment and medium

Technical Field

The invention relates to the technical field of intelligent scheduling, in particular to an intelligent production scheduling system, method, equipment and medium.

Background

In order to improve the production efficiency, the production tasks of the production equipment are usually required to be compactly arranged in advance, and the production flow is reasonably planned to enable the production equipment to effectively execute corresponding production work according to the arranged production tasks. The conventional scheduling process is generally performed manually, and with the rapid development of global informatization, a method of scheduling production tasks in a fixed scheduling order by means of hard coding is popular. However, for a newly added scheduling task across systems, existing hard-coded scheduling logic may not be able to respond to the newly added scheduling task, resulting in the newly added scheduling task not being able to perform the scheduling operation; the scheduling work of the newly added scheduling task can be realized only after the hard code is manually modified, the working efficiency is very low, the flexibility is low, and the scheduling requirements of different differentiation cannot be met; in addition, the existing scheduling work cannot display the scheduling process, only the scheduling result can be displayed, so that a user cannot modify the scheduling process according to own requirements, and the configurability is poor.

Disclosure of Invention

The embodiment of the invention provides an intelligent production scheduling system, method, equipment and medium, which are used for solving the problems of the related technology and have the following technical scheme:

in a first aspect, an embodiment of the present invention provides an intelligent production scheduling method, including:

Acquiring a scheduling request, and screening a task set to be scheduled according to the scheduling request;

acquiring an ordered task list corresponding to production resources, and determining a resource time segment according to the ordered task list, wherein the resource time segment comprises an ordered task time segment and a resource pause time segment;

Under the condition that the scheduling type of the task set is additional scheduling, removing the scheduled task time segments and the resource pause time segments to obtain idle time segments, determining scheduling node time according to a pre-configured ordering rule, and visually ordering the task set to be scheduled in the corresponding idle time segments in a forward direction and/or a reverse direction based on the scheduling node time;

And under the condition that the scheduling type of the task set is non-additional scheduling, the task set to be scheduled and the existing task set are subjected to visual scheduling in a forward direction or a reverse direction.

In one embodiment, the method for acquiring the scheduled task list includes:

Acquiring a corresponding production resource ID according to the process type ID;

Searching a resource scheme in an enabling state at present according to the production resource ID, and calling task information of the resource scheme, wherein the task information comprises a preset enabling date and effective time of a corresponding shift;

And determining the arranged task list according to the task information.

In one embodiment, the scheduled node time includes a tail process plan end time, a tail process plan start time, a front process plan end time, and a front process plan start time.

In one embodiment, the method further comprises:

Under the condition of receiving the auxiliary resource constraint request, acquiring the residual effective time of the auxiliary resource;

and calculating an intersection time segment between the residual effective time and the idle time segment of the auxiliary resource, and sequencing the task set to be scheduled in the intersection time segment.

In one embodiment, the method of visual scheduling is:

Generating a corresponding visualization module according to the planning time corresponding to each task in the task set;

and transversely arranging the visualization modules corresponding to the tasks according to the scheduling sequence to generate a task Gantt chart.

In one embodiment, the method further comprises:

acquiring a drag instruction, wherein the drag instruction is generated by dragging and moving any visualization module;

And determining a visualization module to be adjusted according to the dragging instruction, inserting the visualization module to be adjusted from the original row Cheng Yichu to a required position of the appointed schedule, and updating the task sequence of the appointed schedule.

In one embodiment, the method further comprises:

Acquiring an input plan list number, and searching for a corresponding task according to the plan list number;

And automatically pausing the scheduling operation under the condition that the scheduling is executed to the task corresponding to the single number, and continuing to execute the scheduling operation until receiving a continuous scheduling instruction.

In a second aspect, an embodiment of the present invention provides a production scheduling system, which performs the above-mentioned production scheduling method.

In a third aspect, an embodiment of the present invention provides an electronic device, including: memory and a processor. Wherein the memory and the processor are in communication with each other via an internal connection, the memory is configured to store instructions, the processor is configured to execute the instructions stored by the memory, and when the processor executes the instructions stored by the memory, the processor is configured to perform the method of any one of the embodiments of the above aspects.

In a fourth aspect, embodiments of the present invention provide a computer readable storage medium storing a computer program, the method of any one of the above embodiments being performed when the computer program is run on a computer.

The advantages or beneficial effects in the technical scheme at least comprise:

The task sets with different scheduling types are sequenced in the forward direction and/or the reverse direction in a visual mode, so that the scheduling flexibility is improved, and the scheduling requirements of different clients can be responded quickly.

The foregoing summary is for the purpose of the specification only and is not intended to be limiting in any way. In addition to the illustrative aspects, embodiments, and features described above, further aspects, embodiments, and features of the present invention will become apparent by reference to the drawings and the following detailed description.

Drawings

In the drawings, the same reference numerals refer to the same or similar parts or elements throughout the several views unless otherwise specified. The figures are not necessarily drawn to scale. It is appreciated that these drawings depict only some embodiments according to the disclosure and are not therefore to be considered limiting of its scope.

FIG. 1 is a flow chart of a method for scheduling production schedule according to the present invention;

FIG. 2 is a schematic diagram of a resource time segment according to the present invention;

FIG. 3 is a schematic diagram of a scheduling configuration interface according to the present invention;

FIG. 4 is a schematic diagram of the end time of the tail process plan in the idle time segment for the factory exchange period according to the present invention;

FIG. 5 is a schematic diagram of the end time of the tail process plan after the idle time segment in the factory exchange period according to the present invention;

FIG. 6 is a schematic diagram of a pre-process planning start time according to the present invention;

FIG. 7 is a second schematic diagram of the scheduled start time of the pre-process according to the present invention;

FIG. 8 is a schematic diagram of a schedule time considering a set time according to the present invention;

FIG. 9 is a schematic diagram of task scheduling in accordance with the present invention;

FIG. 10 is a schematic diagram of an interface for visual scheduling according to the present invention;

Fig. 11 is a block diagram of an electronic device according to an embodiment of the invention.

Detailed Description

Hereinafter, only certain exemplary embodiments are briefly described. As will be recognized by those of skill in the pertinent art, the described embodiments may be modified in various different ways without departing from the spirit or scope of the present invention. Accordingly, the drawings and description are to be regarded as illustrative in nature and not as restrictive.

Example 1

The embodiment provides an intelligent production scheduling method, which can sort task sets of different scheduling types in a forward direction and/or a reverse direction in a visual manner, improve scheduling configuration flexibility and quickly respond to scheduling demands of different clients.

As shown in fig. 1, the intelligent production scheduling method specifically includes the following steps:

Step S1: acquiring a scheduling request, and screening a task set to be scheduled according to the scheduling request;

Step S2: acquiring an ordered task list corresponding to production resources, and determining a resource time segment according to the ordered task list, wherein the resource time segment comprises an ordered task time segment and a resource pause time segment;

Step S3: under the condition that the scheduling type of the task set is additional scheduling, removing the scheduled task time segments and the resource pause time segments to obtain idle time segments, determining scheduling node time according to a pre-configured ordering rule, and visually ordering the task set to be scheduled in the corresponding idle time segments in a forward direction and/or a reverse direction based on the scheduling node time; and under the condition that the scheduling type of the task set is non-additional scheduling, the task set to be scheduled and the existing task set are subjected to visual scheduling in a forward direction or a reverse direction.

After a user initiates a scheduling request, generating a corresponding scheduling instruction, analyzing the scheduling instruction and then obtaining a corresponding large task set by following the scheduling instruction, wherein the large task set can be acquired by cross-system acquisition; screening task sets to be scheduled from the large task set, or dividing the large task set into a plurality of small task sets, and scheduling the task sets in batches; if a plurality of screening conditions exist, the screening conditions are sequentially executed.

Judging the scheduling type of the task set, if the task set is the additional scheduling, adding new tasks on the basis of the existing scheduled task list, wherein the new tasks do not influence the scheduling sequence of the scheduled tasks; if the task set is non-additional scheduling, the non-additional task set and the existing task set can be ranked together to form a new task list.

The method for the arranged task list comprises the following steps: acquiring a resource time segment, namely acquiring a corresponding production resource ID according to the input process type ID; searching a resource scheme in an enabling state at present according to a production resource ID, calling task information of the resource scheme, wherein the task information comprises preset enabling date, effective time corresponding to a working system and the like, determining a time node of a scheduled task according to the effective time of the task information, deriving the time node to determine a scheduled task list, and knowing the planned production flow of production equipment, wherein the scheduled task list comprises scheduled task time segments, rest time, maintenance time and the like as shown in fig. 2. The rest time and the maintenance time are in a resource suspension stage, so the duration of the rest time and the maintenance time are also called as resource suspension time segments.

The additional scheduling is to add new planning tasks for scheduling under the condition that the original planning is unchanged. When the task set is the additional scheduling, the time occupation condition of the scheduled task is obtained, namely, a scheduled task time segment is obtained, the scheduled task time segment and a resource pause time segment are removed from the resource time segment, and the remaining time segment capable of scheduling the task is obtained, and as shown in fig. 2, the segment is called an idle time segment, so that the task to be scheduled can be added in the idle time segment.

Under the condition that the task set is non-additional scheduling, deleting the non-locked non-issued scheduling tasks in the scheduled task list, releasing effective time, and re-scheduling the scheduling tasks in the original plan and the scheduling tasks in the new plan together according to a scheduling rule to form a new scheduling result.

As shown in fig. 3, the scheduling rules may be configured and checked by the user in advance, where the configuration content includes the scheduling direction, whether to link, whether to be constrained by the secondary resource capability, and so on.

The scheduling direction may be forward scheduling, i.e., the tasks are scheduled backward from the planned reference time; or reverse scheduling, i.e. the task is forward-ordered with the factory schedule as the node.

If the linkage is set, the method comprises the selection of full linkage or single procedure, wherein the full linkage can support the mixed scheduling mode of partial manufacturing Cheng Zheng rows and partial reverse manufacturing rows in the same process route during scheduling; while in the single process, the same process route only supports one scheduling direction: either the forward row or the reverse row.

Auxiliary resource energy constraint means whether the task scheduling is constrained by production accessories required during production of tools/dies and the like, for example, if a plurality of tasks need to use the same production accessory, and the number of production accessories cannot meet the requirement that all the tasks are simultaneously executed, the plurality of tasks need to be ordered, so that the production accessories execute the tasks in sequence, which represents that the process is constrained by the auxiliary resource energy.

In addition, the configuration of the scheduling rules includes setting the process quota, the efficiency rule, the time setting rule, the transportation time, etc. The process quota refers to the number standard of normal consumption of raw materials, which is required to be achieved in the production and processing process, and is used for calculating the occupation time of tasks on different resources; the efficiency rule is used for calculating the time length occupied by the task on different resources according to the efficiency; the time setting rule is used for calculating the front and back setting time of the task on different resources; the transportation time is set to calculate the reference Start time of the last process when the relation between the front and rear nodes is SS (Start-Start is abbreviated as meaning that the previous process is started and the next process can be started simultaneously).

After determining the task set to be scheduled, determining task resources, wherein the task resources can be production equipment for executing tasks; the allocation logic of task resources may include single resource allocation or multiple resource allocation. And single resource allocation, namely that only one resource of the same task can be allocated, represents that only one production device corresponding to the task is executed, and at the moment, the resource corresponding to the task is determined according to a direct allocation principle.

The same task can be distributed on a plurality of resources, and the task can be executed by a plurality of production devices, at the moment, corresponding resources can be determined according to resource distribution logic, wherein the resource distribution logic comprises the earliest priority of the planned ending time on each resource, the resources are determined according to the resource priority if the planned ending time is the same, and one resource is randomly determined from the plurality of resources if the priorities are the same.

After the task set and the production resource time segments are acquired, a configured scheduling rule is required to be determined, and transfer batches and transportation time are acquired from corresponding process routes according to the scheduling rule, wherein the transfer batches mean the number of products required to be completed in a single process, namely, after the first process is completed with the number of products, the next process can be started; the transport time is obtained for determining a reference start time of the tail process. And calculating the mass production time according to the transfer batch and the transportation time, wherein the mass production time is=the transfer batch multiplied by the corresponding process quota.

The following schedule node time such as the final process planning ending time, the final process planning starting time, the previous process planning ending time and the previous process planning starting time is determined according to different rule parameters:

Case one: task corresponds to single resource allocation logic, rule parameters are all-linked, the relation between front and back nodes is SS, and as shown in fig. 4 and 5, the end time of the tail procedure plan is= (corresponding to the latest time of the remaining time segment in the resource factory intersection range);

tail process plan start time= (tail process plan end time-tail process production duration);

Tail process production time = tail process task number x corresponding process quota;

as shown in fig. 6, the pre-process plan end time=min ((end process plan end time-mass production time-mass transportation time), corresponding to the latest time of the resource remaining time segment);

Note that: if the previous procedure plan ending time falls in the rest time, the latest time of the remaining time slice is found forward as the previous procedure plan ending time;

Pre-process plan start time= (pre-process plan end time-present process production duration);

Similarly, all process planning start times and planning end times are calculated.

And a second case: the task corresponds to single resource allocation logic, the rule parameter is full linkage, the relation between the front node and the rear node is ES (End-Start is short), the ES represents that the former process is finished and the latter process can be started), and the final process plans to finish the time= (the latest time of the remaining time segment in the corresponding resource factory intersection range);

As shown in fig. 7, the previous process plan end time=min (the last process plan start time, the latest time of the corresponding resource remaining time segment);

Note that: if the pre-process plan end time falls within the rest time, the latest time of the remaining time slice is found forward as the pre-process plan end time.

And a third case: task corresponds to single resource allocation logic, rule parameters are single processes, and the relation between front and back nodes is SS, then the plan ending time of the tail process= (corresponding to the latest time of the remaining time segment in the resource factory intersection range);

Case four: the task corresponds to single resource allocation logic, and the rule parameters are single procedures; and the relation between the front node and the rear node is ES; at this time, the liquid crystal display device,

Tail procedure plan end time= (latest time of remaining time slice in corresponding resource factory intersection range);

Tail procedure plan Start time= (Tail procedure plan end time-Tail procedure production duration)

Tail process production time = tail process task number x corresponding process rating

As shown in fig. 7, the previous process plan end time=min (last process plan start time, corresponding to resource remaining time slice latest time) notes: if the previous procedure plan ending time falls in the rest time, the latest time of the remaining time slice is found forward as the previous procedure plan ending time;

Case five: the tasks correspond to multi-resource allocation logic, rule parameters are full linkage, the relation between front nodes and back nodes is SS, and finishing time of each task on a plurality of corresponding resources is calculated:

Pre-process plan start time= (pre-process plan end time-present process production duration)

Case six: the task corresponds to multi-resource allocation logic, rule parameters are full linkage, the relation between front nodes and back nodes is ES, and the finishing time of each task on a plurality of corresponding resources is calculated:

Case seven: the task corresponds to multi-resource allocation logic, the rule parameter is single-procedure, and the relation between front and back nodes is SS; at this time, the liquid crystal display device,

Case eight: the task corresponds to multi-resource allocation logic, the rule parameter is a single procedure, and the relation between front and back nodes is ES; at this time, the liquid crystal display device,

Calculating the finishing time of each task on each corresponding resource, and determining the following scheduling rules:

1. whether or not secondary resources need to be considered:

Considering whether the auxiliary resource capacity is constrained or not, if the auxiliary resource capacity is constrained, the remaining effective time slices of the auxiliary resource and the resource remaining time slices are intersected in the calculating process to be used as the dischargeable time slices.

2. Whether the set time needs to be considered:

obtaining corresponding set time (minutes) from a set time rule table, and calculating the starting time of the task on different resources:

as shown in fig. 8, the planned start time=max { the planned start time of the tail process, (the planned end time of the preceding task on the resource+the preceding/following time) }.

3. Whether a process quota is required:

the corresponding process quota is obtained from the process quota, and the production time of the task on different resources is calculated: production duration = task schedule number x corresponding process quota (seconds/unit);

Of particular note is: when the production spans the rest time segment, the production duration automatically extends forward for the rest time segment length and then continues to occupy.

4. Whether efficiency rules need to be considered:

Corresponding efficiency is obtained from an efficiency rule table, and more accurate production time length of the task on different resources is calculated: production duration = number of tasks scheduled x corresponding process quota (seconds/unit)/efficiency (%).

5. Distribution turning:

In the reverse allocation process, if the planned starting time of the first procedure is less than the set planned starting time, forward scheduling is performed, and the scheduling allocation logic is identical to the forward allocation logic.

As shown in fig. 9 and 10, the tasks are scheduled in a visual step-by-step manner according to the scheduling rules, the tasks are ordered according to the scheduling node time, and the tasks are arranged laterally in a visual manner according to the scheduling sequence, so as to generate a task Gantt chart. The visual scheduling method comprises the following steps: generating a corresponding visualization module according to the planning time corresponding to each task in the task set; and transversely arranging the visualization modules corresponding to the tasks according to the scheduling sequence, generating a task Gantt chart for displaying, wherein the scheduling display speed can be controlled according to the configuration time of the scheduling display interval set by a user.

In order to make the scheduling process more flexible, the scheduling optimization can be realized through the scheduling optimization suspension operation, specifically, a user can input a planning single number/process single number/production order number in the single number of a tab in the scheduling optimization step, automatically suspend when the scheduling is executed to the single number, click a [ play/suspension ] button, and continue the scheduling; in addition, in the "schedule optimizing step" page sign single click [ play/pause ] button, pause the schedule, single click again, continue the schedule; or the step of stopping/starting the scheduling is realized by designating keys through a keyboard, for example, the scheduling is stopped by pressing a space key of the keyboard on a tab in the step of optimizing the scheduling, and the scheduling is continued by pressing again.

When the scheduling is in a pause state, the number of the scheduled plan list participating in the scheduling/optimizing can be adjusted (list shifting, list disassembling and list combining); double-clicking (scheduling optimization step) any plan single number in the list can be used for positioning in scheduling management; or adjusting the scheduling order of the "unscheduled scheduling pool" below the "scheduling optimization step".

The adjustment method can be realized by combining visual drag operation, a drag instruction generated by any one of the visual modules is dragged and moved, the visual module to be adjusted is determined according to the drag instruction, the visual module to be adjusted is inserted into a required position of the appointed schedule from the original schedule Cheng Yichu, and the task sequence of the appointed schedule is updated. Besides the drag operation, the drag operation can be realized by keyboard keys, for example, the sequence adjustment can be realized by a button of ' move up ', ' move down ', ' for example; or the order adjustment is realized through a right key of cut, paste to current plan before, paste to current plan after; the ordering is updated in time after the order is adjusted.

When the scheduling/optimizing is continued after the suspension, on the basis of the scheduled scheduling adjustment, scheduling the scheduling list with the adjusted sequence [ unscheduled scheduling pool ] to the scheduling Guan Lizhong according to the originally selected scheduling scheme; after the schedule list of the scheduling plan pool is discharged into the scheduling, deleting the schedule list, and then newly adding a record in the list of the scheduling optimization step; after all the planning sheets of the scheduling plan pool are completely arranged, a window of the scheduling plan KPI is popped up; in addition, "human intervention" may also be annotated after the scheduling scheme, which may indicate that it is likely not to be performed entirely in the scheduling scheme.

Example two

The present embodiment provides an intelligent production schedule scheduling system that performs the method of the first embodiment.

The system comprises:

the task screening module is used for acquiring the scheduling request and screening a task set to be scheduled according to the scheduling request;

The time segment determining module is used for acquiring an ordered task list corresponding to the production resource, determining a resource time segment according to the ordered task list, wherein the resource time segment comprises an ordered task time segment and a resource pause time segment;

The visual scheduling module is used for removing the scheduled task time segments and the resource pause time segments to obtain idle time segments under the condition that the scheduling type of the task set is additional scheduling, determining the scheduling node time of the task set to be scheduled according to a pre-configured ordering rule, and visually ordering the task set to be scheduled in the corresponding idle time segments in a forward direction and/or a reverse direction based on the scheduling node time; and under the condition that the scheduling type of the task set is non-additional scheduling, the task set to be scheduled and the existing task set are subjected to visual scheduling in a forward direction or a reverse direction.

In the embodiment, the task sets with different scheduling types are sequenced in the forward direction and/or the reverse direction in a visual mode, so that the scheduling flexibility is improved, and the scheduling requirements of different clients can be responded quickly.

The functions of each module of the system in the embodiment of the present invention may be referred to the corresponding descriptions in the above method, and will not be repeated here.

Example III

Fig. 11 shows a block diagram of an electronic device according to an embodiment of the invention. As shown in fig. 11, the electronic device includes: memory 100 and processor 200, and memory 100 stores a computer program executable on processor 200. The processor 200, when executing the computer program, implements the production schedule scheduling method in the above-described embodiment. The number of memory 100 and processors 200 may be one or more.

The electronic device further includes:

the communication interface 300 is used for communicating with external equipment and performing data interaction transmission.

If the memory 100, the processor 200, and the communication interface 300 are implemented independently, the memory 100, the processor 200, and the communication interface 300 may be connected to each other and perform communication with each other through buses. The bus may be an industry standard architecture (Industry Standard Architecture, ISA) bus, an external device interconnect (PERIPHERAL COMPONENT INTERCONNECT, PCI) bus, or an extended industry standard architecture (Extended Industry Standard Architecture, EISA) bus, among others. The bus may be classified as an address bus, a data bus, a control bus, etc. For ease of illustration, only one thick line is shown in FIG. 11, but not only one bus or one type of bus.

Alternatively, in a specific implementation, if the memory 100, the processor 200, and the communication interface 300 are integrated on a chip, the memory 100, the processor 200, and the communication interface 300 may communicate with each other through internal interfaces.

The embodiment of the invention provides a computer readable storage medium storing a computer program which, when executed by a processor, implements the method provided in the embodiment of the invention.

The embodiment of the invention also provides a chip, which comprises a processor and is used for calling the instructions stored in the memory from the memory and running the instructions stored in the memory, so that the communication equipment provided with the chip executes the method provided by the embodiment of the invention.

The embodiment of the invention also provides a chip, which comprises: the input interface, the output interface, the processor and the memory are connected through an internal connection path, the processor is used for executing codes in the memory, and when the codes are executed, the processor is used for executing the method provided by the embodiment of the invention.

It should be appreciated that the processor may be a central processing unit (Central Processing Unit, CPU), other general purpose processor, digital signal processor (DIGITAL SIGNAL processing, DSP), application Specific Integrated Circuit (ASIC), field programmable gate array (fieldprogrammablegate array, FPGA) or other programmable logic device, discrete gate or transistor logic device, discrete hardware components, etc. A general purpose processor may be a microprocessor or any conventional processor or the like. It is noted that the processor may be a processor supporting an advanced reduced instruction set machine (ADVANCED RISC MACHINES, ARM) architecture.

Further, optionally, the memory may include a read-only memory and a random access memory, and may further include a nonvolatile random access memory. The memory may be volatile memory or nonvolatile memory, or may include both volatile and nonvolatile memory. The nonvolatile memory may include a read-only memory (ROM), a Programmable ROM (PROM), an erasable programmable ROM (erasable PROM), an electrically erasable programmable EPROM (EEPROM), or a flash memory, among others. Volatile memory can include random access memory (random access memory, RAM), which acts as external cache memory. By way of example, and not limitation, many forms of RAM are available. For example, static random access memory (STATIC RAM, SRAM), dynamic random access memory (dynamic random access memory, DRAM), synchronous Dynamic Random Access Memory (SDRAM), double data rate synchronous dynamic random access memory (doubledata DATE SDRAM, DDR SDRAM), enhanced synchronous dynamic random access memory (ENHANCED SDRAM, ESDRAM), synchronous link dynamic random access memory (SYNCHLINK DRAM, SLDRAM), and direct memory bus random access memory (direct rambus RAM, DR RAM).

In the above embodiments, it may be implemented in whole or in part by software, hardware, firmware, or any combination thereof. When implemented in software, may be implemented in whole or in part in the form of a computer program product. The computer program product includes one or more computer instructions. When the computer program instructions are loaded and executed on a computer, the processes or functions in accordance with the present invention are fully or partially produced. The computer may be a general purpose computer, a special purpose computer, a computer network, or other programmable apparatus. Computer instructions may be stored in a computer-readable storage medium or transmitted from one computer-readable storage medium to another.

In the description of the present specification, a description referring to terms "one embodiment," "some embodiments," "examples," "specific examples," or "some examples," etc., means that a particular feature, structure, material, or characteristic described in connection with the embodiment or example is included in at least one embodiment or example of the present invention. Furthermore, the particular features, structures, materials, or characteristics described may be combined in any suitable manner in any one or more embodiments or examples. Furthermore, the different embodiments or examples described in this specification and the features of the different embodiments or examples may be combined and combined by those skilled in the art without contradiction.

Furthermore, the terms "first," "second," and the like, are used for descriptive purposes only and are not to be construed as indicating or implying a relative importance or implicitly indicating the number of technical features indicated. Thus, a feature defining "a first" or "a second" may explicitly or implicitly include at least one such feature. In the description of the present invention, the meaning of "a plurality" is two or more, unless explicitly defined otherwise.

The foregoing is merely illustrative of the present invention, and the present invention is not limited thereto, and any person skilled in the art will readily recognize that various changes and substitutions are possible within the scope of the present invention. Therefore, the protection scope of the invention is subject to the protection scope of the claims.

Claims

1. An intelligent production scheduling method is characterized by comprising the following steps:

Acquiring a scheduled task list corresponding to production resources, and determining resource time segments according to the scheduled task list, wherein the resource time segments comprise scheduled task time segments and resource pause time segments;

And under the condition that the scheduling type of the task set is non-additional scheduling, carrying out visual scheduling on the task set to be scheduled and the existing task set together according to the forward direction or the reverse direction.

2. The intelligent production scheduling method according to claim 1, wherein the method for acquiring the scheduled task list is as follows:

And determining the arranged task list according to the task information.

3. The intelligent production schedule scheduling method of claim 1, wherein the schedule node time comprises a tail process schedule end time, a tail process schedule start time, a front process schedule end time, and a front process schedule start time.

4. The intelligent production schedule scheduling method of claim 1, further comprising:

And calculating an intersection time segment between the residual effective time of the auxiliary resource and the idle time segment, and sequencing the task set to be scheduled in the intersection time segment.

5. The intelligent production schedule scheduling method according to claim 1, wherein the method of visual scheduling is:

6. The intelligent production schedule scheduling method of claim 5, further comprising:

7. The intelligent production schedule scheduling method of claim 1, further comprising:

acquiring an input plan list number, and searching a corresponding task according to the plan list number;

And automatically suspending the scheduling operation under the condition that the scheduling is executed to the task corresponding to the single number, and continuing to execute the scheduling operation until receiving a continuing scheduling instruction.

8. An intelligent production schedule scheduling system, characterized in that an intelligent production schedule scheduling method according to any one of claims 1 to 7 is performed.

9. An electronic device, comprising: a processor and a memory in which instructions are stored, the instructions being loaded and executed by the processor to implement the intelligent production schedule scheduling method of any one of claims 1 to 7.

10. A computer readable storage medium, wherein a computer program is stored in the computer readable storage medium, and when the computer program is executed by a processor, the intelligent production schedule scheduling method according to any one of claims 1 to 7 is implemented.