CN108121305B - Dynamic scheduling method and device for job shop tasks - Google Patents

Dynamic scheduling method and device for job shop tasks Download PDF

Info

Publication number
CN108121305B
CN108121305B CN201611082464.7A CN201611082464A CN108121305B CN 108121305 B CN108121305 B CN 108121305B CN 201611082464 A CN201611082464 A CN 201611082464A CN 108121305 B CN108121305 B CN 108121305B
Authority
CN
China
Prior art keywords
task
disturbance
perturbation
main body
idle time
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
CN201611082464.7A
Other languages
Chinese (zh)
Other versions
CN108121305A (en
Inventor
王爱民
葛艳
刘少丽
丁晓宇
刘检华
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Beijing Yingjie Technology Co ltd
Original Assignee
Beijing University of Technology
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Beijing University of Technology filed Critical Beijing University of Technology
Priority to CN201611082464.7A priority Critical patent/CN108121305B/en
Publication of CN108121305A publication Critical patent/CN108121305A/en
Application granted granted Critical
Publication of CN108121305B publication Critical patent/CN108121305B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • G—PHYSICS
    • G05—CONTROLLING; REGULATING
    • G05B—CONTROL OR REGULATING SYSTEMS IN GENERAL; FUNCTIONAL ELEMENTS OF SUCH SYSTEMS; MONITORING OR TESTING ARRANGEMENTS FOR SUCH SYSTEMS OR ELEMENTS
    • G05B19/00—Programme-control systems
    • G05B19/02—Programme-control systems electric
    • G05B19/418—Total factory control, i.e. centrally controlling a plurality of machines, e.g. direct or distributed numerical control [DNC], flexible manufacturing systems [FMS], integrated manufacturing systems [IMS] or computer integrated manufacturing [CIM]
    • G05B19/41865—Total factory control, i.e. centrally controlling a plurality of machines, e.g. direct or distributed numerical control [DNC], flexible manufacturing systems [FMS], integrated manufacturing systems [IMS] or computer integrated manufacturing [CIM] characterised by job scheduling, process planning, material flow
    • G—PHYSICS
    • G05—CONTROLLING; REGULATING
    • G05B—CONTROL OR REGULATING SYSTEMS IN GENERAL; FUNCTIONAL ELEMENTS OF SUCH SYSTEMS; MONITORING OR TESTING ARRANGEMENTS FOR SUCH SYSTEMS OR ELEMENTS
    • G05B2219/00—Program-control systems
    • G05B2219/30—Nc systems
    • G05B2219/32—Operator till task planning
    • G05B2219/32252—Scheduling production, machining, job shop

Landscapes

  • Engineering & Computer Science (AREA)
  • General Engineering & Computer Science (AREA)
  • Manufacturing & Machinery (AREA)
  • Quality & Reliability (AREA)
  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Automation & Control Theory (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)
  • General Factory Administration (AREA)

Abstract

The embodiment of the invention provides a method and a device for dynamically scheduling job shop tasks, wherein the method for dynamically scheduling the job shop tasks comprises the following steps: acquiring a disturbance task which is disturbed in the production process and a disturbance type of the disturbance task; acquiring all related tasks related to the disturbance task according to the disturbance task, and establishing a related task association tree of all related tasks; and traversing the related task association tree in sequence, and scheduling the related tasks traversed in sequence in the related task association tree according to the disturbance type. The embodiment of the invention realizes the purposes of predicting the possible disturbance and adjusting the affected processes while reducing the deviation between actual production and plan caused by the existing disturbance.

Description

Dynamic scheduling method and device for job shop tasks
Technical Field
The invention relates to the technical field of manufacturing, in particular to a method and a device for dynamically scheduling tasks of a job shop.
Background
Scheduling, as a form of production decision, is a key factor affecting manufacturing production efficiency. By adopting an effective scheduling optimization technology, the utilization rate of equipment can be improved, on-time delivery can be guaranteed, and inventory and cost can be reduced, so that the economic target of an enterprise can be guaranteed. However, even the excellent scheduling plan can lose stability due to the inherent complexity of the production system and the random occurrence of various disturbances during the production process, which can affect the normal operation of the production system. Under the manufacturing environment with fast product updating, poor stability of the production system and complexity, enterprises not only need to produce products required by the market fast, but also need to deal with various disturbances (such as equipment failure, material supply shortage, error accumulation of process processing time and the like) frequently occurring in the production process fast and accurately.
In the production process, no matter what type of production disturbance occurs, the process at the disturbance position has the appearance that the starting time is advanced or delayed, and the working hours are shortened or increased. For example, when a process is cancelled, it is considered that the number of steps in the process is instantaneously reduced to zero or the start time of a subsequent process in the equipment is advanced; when the process insertion occurs, the process insertion is regarded as the occurrence of the continuous starting time delay of the subsequent process in the equipment, and the delay time length is determined by the actual working hours of the insertion process. In this case, if only the process at the disturbance is adjusted, the scheduling plan must be configured such that the idle time of the facility increases or a plurality of processes overlap on the same facility. Thus, production disturbances result in deviations from the plan for a series of processes, which are then a dependency tree of the affected processes.
When disturbances occur, the random scheduling by the experience of production scheduler personnel has not been able to meet the requirements of modern manufacturing models. The dynamic scheduling technology is a response processing mechanism for job scheduling plans after production plans are influenced by production disturbance events in the manufacturing and production processes. The dynamic scheduling can be divided into adaptive scheduling, incremental scheduling and rescheduling according to a disturbance processing mechanism adopted by the dynamic scheduling. The traditional self-adaptive dynamic scheduling method completes the automatic adjustment of the scheduling scheme under the influence of a production disturbance event by using a method of continuously approaching a target value by using a self-adaptive rule, and the plan after the automatic adjustment is often greatly different from the original plan, so that the original production preparation cannot correspond to a new plan. The incremental dynamic scheduling is a scheduling process aiming at the change of the number of production tasks, and the scheduling and scheduling of the incremental production tasks are finished by means of insertion or addition and the like on the premise of not changing the planned starting time and the planned ending time of a process in the original scheduling scheme. Rescheduling is a kind of repair scheduling for an affected scheduling scheme, which implements response processing to a production disturbance event by local adjustment of the affected scheduling scheme based on analysis of the influence range of the production disturbance, but rescheduling lacks prediction of disturbance that may occur, and cannot guide determination of an affected process and plan change of the affected process using the prediction.
Therefore, a real-time dynamic disturbance processing mechanism should have a processing principle of adaptive scheduling and continuously approaching a target value, a processing mechanism of incremental scheduling responding to the change of the number of production tasks and a processing capability of rescheduling analyzing the influence range of production disturbance.
Disclosure of Invention
The invention aims to provide a method and a device for dynamically scheduling a job shop task, which can reduce the deviation between actual production and plan caused by the existing disturbance, predict the possible disturbance and adjust the influenced process.
In a first aspect, an embodiment of the present invention provides a method for dynamically scheduling job shop tasks, including:
acquiring a disturbance task which is disturbed in the production process and the disturbance type of the disturbance task;
acquiring all related tasks related to the disturbance task according to the disturbance task, and establishing a related task association tree of all related tasks;
and traversing the relevant task association tree in sequence, and scheduling the relevant tasks traversed in sequence in the relevant task association tree according to the disturbance type.
Optionally, the step of acquiring, according to the perturbation task, all relevant tasks associated with the perturbation task and establishing a relevant task association tree of all relevant tasks includes: acquiring a task main body to which the disturbance task belongs and an equipment main body for executing the disturbance task; setting the disturbance task as a current task, detecting whether a first subsequent task behind the current task exists in the task main body, and detecting whether a second subsequent task behind the current task exists in the equipment main body; when a first subsequent task located behind the current task exists in the task main body, acquiring the first subsequent task and setting the first subsequent task as a first node behind the current task; when a second subsequent task located after the current task exists in the device main body, acquiring the second subsequent task and setting the second subsequent task as a second node after the current task; the disturbance task is a root node of the relevant task association tree, and the first node and the second node are both lower-layer nodes of the relevant task association tree; sequentially setting each node in the lower-layer nodes as a current task, and circularly entering the steps of detecting whether a first subsequent task behind the current task exists in the task main body and detecting whether a second subsequent task behind the current task exists in the equipment main body; and when a first subsequent task behind the current task does not exist in the task main body and a second subsequent task behind the current task does not exist in the equipment main body, finishing establishing the relevant task association trees of all relevant tasks.
Optionally, the step of scheduling the related tasks sequentially traversed in the related task association tree according to the disturbance type includes: when the disturbance type is a task starting time change type, acquiring a first idle time change value between a previous task before the disturbance task and the disturbance task in an equipment main body executing the disturbance task; scheduling the sequentially traversed related tasks except the disturbance task in the related task association tree according to the first idle time change value; when the first idle time change value is a positive value, delaying the start time of the sequentially traversed related tasks except the disturbance task in the related task association tree by the first idle time change value; and when the first idle time change value is a negative value, advancing the start time of the sequentially traversed related tasks except the disturbance task in the related task association tree by the first idle time change value.
Optionally, the step of obtaining a first idle time change value between a previous task before the perturbation task and the perturbation task in the device main body executing the perturbation task includes: when the task starting time change value of the disturbance task is constantIn value, according to a first formula TSTCCalculating to obtain the first idle time change value; wherein, in the first formula, TSTCRepresenting the first idle time change value, TA' representing the actual task starting time of the perturbation task, and TA representing the preset task starting time of the perturbation task; when the task starting time variation value of the disturbance task is the variation, according to a second formula
Figure BDA0001167271480000031
Calculating to obtain the first idle time change value; wherein, in the second formula,
Figure BDA0001167271480000032
and TSTCIRepresenting said first idle time variation value, KIRepresenting a preset coefficient, T representing the end time of a preset time period, and C (T) representing the function of the change value of the task start time to the time; FO represents the man-hours when the previous task before the perturbation task has been completed in the apparatus main body that executes the perturbation task, FQ represents the workload when the previous task before the perturbation task has been completed in the apparatus main body that executes the perturbation task, Q represents the total workload of the previous tasks before the perturbation task in the apparatus main body that executes the perturbation task, and TS represents the preset man-hours of the previous task before the perturbation task in the apparatus main body that executes the perturbation task.
Optionally, the step of scheduling the related tasks sequentially traversed in the related task association tree according to the disturbance type includes: when the disturbance type is a task man-hour change type, acquiring a second idle time change value between a subsequent task after the disturbance task and the disturbance task in the equipment main body for executing the disturbance task; scheduling the sequentially traversed related tasks except the disturbance task in the related task association tree according to the second idle time change value; when the second idle time change value is a positive value, delaying the start time of the sequentially traversed related tasks except the disturbance task in the related task association tree by the second idle time change value; and when the second idle time change value is a negative value, advancing the start time of the sequentially traversed related tasks except the disturbance task in the related task association tree by the second idle time change value.
Optionally, the step of obtaining a second idle time change value between a subsequent task after the perturbation task and the perturbation task in the device main body executing the perturbation task includes: when the task man-hour variation value of the disturbance task is a certain value, according to a third formula TMCCalculating the second idle time variation value as (TS' -TS) × NP; wherein, in the third formula, TMCRepresenting the second idle time change value, TS' representing the actual working hours of the perturbation tasks, TS representing the preset working hours of the perturbation tasks, and NP representing the number of task bodies to which the perturbation tasks belong; when the task man-hour change value of the disturbance task is the change amount, according to a fourth formula
Figure BDA0001167271480000041
Calculating to obtain the second idle time change value; wherein, in the fourth formula,wherein, TMCIRepresenting said second idle time variation value, KIRepresenting a preset coefficient, T representing the end time of a preset time period, and C' (T) representing the function of the change value of the task working hour to the time; FO ' represents the man-hour that the perturbation task has been completed, FQ ' represents the workload that the perturbation task has been completed, Q ' represents the total workload of the perturbation task, and TS represents the preset man-hour of the perturbation task.
In a second aspect, an embodiment of the present invention provides a device for dynamically scheduling job shop tasks, including:
the system comprises an acquisition module, a processing module and a control module, wherein the acquisition module is used for acquiring a disturbance task which is disturbed in the production process and the disturbance type of the disturbance task;
the establishment module is used for acquiring all related tasks related to the perturbation task according to the perturbation task and establishing related task association trees of all related tasks;
and the scheduling module is used for sequentially traversing the related task association tree and scheduling the sequentially traversed related tasks in the related task association tree according to the disturbance type.
Optionally, the establishing module includes: the first acquisition unit is used for acquiring a task main body to which the disturbance task belongs and an equipment main body for executing the disturbance task; the detection unit is used for setting the disturbance task as a current task, detecting whether a first subsequent task behind the current task exists in the task main body, and detecting whether a second subsequent task behind the current task exists in the equipment main body; when a first subsequent task located behind the current task exists in the task main body, acquiring the first subsequent task and setting the first subsequent task as a first node behind the current task; when a second subsequent task located after the current task exists in the device main body, acquiring the second subsequent task and setting the second subsequent task as a second node after the current task; the disturbance task is a root node of the relevant task association tree, and the first node and the second node are both lower-layer nodes of the relevant task association tree; the setting unit is used for sequentially setting each node in the lower-layer nodes as a current task, and circularly triggering the detection unit to detect whether a first subsequent task behind the current task exists in the task main body and whether a second subsequent task behind the current task exists in the equipment main body; and the establishing unit is used for completing the establishment of the relevant task association trees of all relevant tasks when a first subsequent task behind the current task does not exist in the task main body and a second subsequent task behind the current task does not exist in the equipment main body.
Optionally, the scheduling module includes: a second obtaining unit, configured to obtain, when the perturbation type is a task start time variation type, a first idle time variation value between a preceding task located before the perturbation task and the perturbation task in an apparatus main body that executes the perturbation task; the first scheduling unit is used for scheduling the sequentially traversed related tasks except the disturbance task in the related task association tree according to the first idle time change value; when the first idle time change value is a positive value, delaying the start time of the sequentially traversed related tasks except the disturbance task in the related task association tree by the first idle time change value; and when the first idle time change value is a negative value, advancing the start time of the sequentially traversed related tasks except the disturbance task in the related task association tree by the first idle time change value.
Optionally, the second obtaining unit includes: a first calculating unit, configured to, when a task start time variation value of the perturbation task is a certain value, calculate a task start time variation value according to a first formula TSTCCalculating to obtain the first idle time change value; wherein, in the first formula, TSTCRepresenting the first idle time change value, TA' representing the actual task starting time of the perturbation task, and TA representing the preset task starting time of the perturbation task; a second calculating unit, configured to calculate a task start time variation value of the task based on a second formula when the task start time variation value is a variation
Figure BDA0001167271480000061
Calculating to obtain the first idle time change value; wherein, in the second formula,
Figure BDA0001167271480000062
and TSTCIRepresenting said first idle time variation value, KIRepresenting a preset coefficient, T representing the end time of a preset time period, and C (T) representing the function of the change value of the task start time to the time; FO represents the location within the device body performing the perturbation taskThe method comprises the steps that previous tasks before a perturbation task are completed, FQ represents the completed workload of the previous tasks before the perturbation task in an equipment main body executing the perturbation task, Q represents the total workload of the previous tasks before the perturbation task in the equipment main body executing the perturbation task, and TS represents the preset labor hours of the previous tasks before the perturbation task in the equipment main body executing the perturbation task.
Optionally, the scheduling module includes: a third obtaining unit, configured to obtain, when the disturbance type is a task man-hour change type, a second idle time change value between a subsequent task located after the disturbance task and the disturbance task in an apparatus main body that executes the disturbance task; the second scheduling unit is used for scheduling the sequentially traversed related tasks except the disturbance task in the related task association tree according to the second idle time change value; when the second idle time change value is a positive value, delaying the start time of the sequentially traversed related tasks except the disturbance task in the related task association tree by the second idle time change value; and when the second idle time change value is a negative value, advancing the start time of the sequentially traversed related tasks except the disturbance task in the related task association tree by the second idle time change value.
Optionally, the third obtaining unit includes: a third calculation unit for calculating a task man-hour variation value of the task based on a third formula T when the task man-hour variation value is a certain valueMCCalculating the second idle time variation value as (TS' -TS) × NP; wherein, in the third formula, TMCRepresenting the second idle time change value, TS' representing the actual working hours of the perturbation tasks, TS representing the preset working hours of the perturbation tasks, and NP representing the number of task bodies to which the perturbation tasks belong; a fourth calculating unit, configured to, when the task man-hour variation value of the perturbation task is a variation, calculate the perturbation task according to a fourth formula
Figure BDA0001167271480000071
Calculating to obtain the second idle time change value; wherein, in the fourth formula,
Figure BDA0001167271480000072
wherein, TMCIRepresenting said second idle time variation value, KIRepresenting a preset coefficient, T representing the end time of a preset time period, and C' (T) representing the function of the change value of the task working hour to the time; FO ' represents the man-hour that the perturbation task has been completed, FQ ' represents the workload that the perturbation task has been completed, Q ' represents the total workload of the perturbation task, and TS represents the preset man-hour of the perturbation task.
The invention has the beneficial effects that:
the method comprises the steps of firstly obtaining a disturbed task which is disturbed in the production process and the disturbance type of the disturbed task, then establishing a relevant task association tree of all relevant tasks relevant to the disturbed task according to the disturbed task, finally traversing the relevant task association tree in sequence, and scheduling the relevant tasks traversed in sequence in the relevant task association tree according to the disturbance type. According to the method and the device, when disturbance occurs, the relevant task association tree influenced by the disturbance task can be found and predicted according to the disturbance task, so that the original scheduling plan can be adjusted purposefully, the relevant task association tree can be processed in real time, the adjustment of the original scheduling plan is reduced, and the purposes of predicting the possible disturbance and adjusting the influenced processes while reducing the deviation of the actual production and the plan caused by the existing disturbance are achieved.
Drawings
FIG. 1 is a flow chart illustrating the steps of a method for dynamically scheduling job-shop tasks in accordance with a first embodiment of the present invention;
FIG. 2 is a flow chart showing a specific implementation of step 102 in the first embodiment of the present invention;
FIG. 3 is a flow chart illustrating the steps of a method for dynamically scheduling job-shop tasks in accordance with a second embodiment of the present invention.
Detailed Description
Exemplary embodiments of the present disclosure will be described in more detail below with reference to the accompanying drawings. While exemplary embodiments of the present disclosure are shown in the drawings, it should be understood that the present disclosure may be embodied in various forms and should not be limited to the embodiments set forth herein. Rather, these embodiments are provided so that this disclosure will be thorough and complete, and will fully convey the scope of the disclosure to those skilled in the art.
The first embodiment:
as shown in fig. 1, which is a flowchart illustrating steps of a dynamic scheduling method for job shop tasks according to a first embodiment of the present invention, the dynamic scheduling method includes:
step 101, obtaining a disturbance task which is disturbed in the production process and the disturbance type of the disturbance task.
In this step, specifically, when a disturbance event occurs in the production process, a disturbance task in which a disturbance occurs in the production process and a disturbance type of the disturbance task may be obtained. Specifically, in the process of machining the component, the disturbance task may be a disturbance process in which disturbance occurs. The perturbation type may include a task start time variation type of the perturbation task and a task man-hour variation type of the perturbation task.
And 102, acquiring all related tasks related to the disturbance task according to the disturbance task, and establishing a related task related tree of all related tasks.
In this step, specifically, when a disturbance event occurs, that is, when there is a disturbance task, all tasks associated with the disturbance task may be taken as related tasks of the disturbance task. Here, all relevant tasks associated with the perturbation task may be obtained according to the perturbation task, and a relevant task association tree of all relevant tasks may be established. Of course, in the related task association tree, the perturbation task is the root node of the related task association tree.
And 103, traversing the relevant task association trees in sequence, and scheduling the relevant tasks traversed in sequence in the relevant task association trees according to the disturbance types.
In this step, specifically, after the relevant task association tree is established, the relevant task association tree may be sequentially traversed, and the relevant tasks sequentially traversed in the relevant task association tree may be scheduled according to the disturbance type. Therefore, by scheduling the related tasks which are traversed in sequence, the influence of the disturbance tasks on the generation process can be weakened to the maximum extent while the adjustment of the original scheduling plan is reduced.
In the embodiment, a disturbed task which is disturbed in the production process and a disturbance type of the disturbed task are obtained, then a relevant task association tree of all relevant tasks relevant to the disturbed task is established according to the disturbed task, finally the relevant task association tree is traversed in sequence, and the relevant tasks traversed in sequence in the relevant task association tree are scheduled according to the disturbance type, so that when the disturbance occurs, the relevant task association tree influenced by the disturbed task can be found and predicted according to the disturbed task, an original scheduling plan can be adjusted purposefully, the relevant task association tree can be processed in real time, the adjustment of the original scheduling plan is reduced, and the aims of predicting possible disturbance and adjusting the influenced processes while reducing the deviation of the production reality and the plan brought by the existing disturbance are fulfilled.
In the first embodiment of the present invention, in step 102, when all relevant tasks associated with the perturbation task are acquired according to the perturbation task, and a relevant task association tree of all relevant tasks is established, the following steps may be performed. Specifically, as shown in fig. 2, the specific implementation manner of the step 102 includes:
step 201, acquiring a task main body to which the perturbation task belongs and an equipment main body for executing the perturbation task.
In this step, specifically, when the perturbation task is obtained, a task main body to which the perturbation task belongs and an equipment main body for executing the perturbation task may be obtained. For example, when the perturbation task is a perturbation process in which perturbation occurs during the process of manufacturing a workpiece, and the workpiece is processed on a processing device, the workpiece is a task main body to which the perturbation task belongs, and the processing device is a device main body for executing the perturbation task.
Step 202, setting the perturbation task as a current task, detecting whether a first subsequent task behind the current task exists in the task main body, and detecting whether a second subsequent task behind the current task exists in the device main body.
In this step, specifically, the perturbation task may be set as a current task, and then it is detected whether a first subsequent task located after the current task exists in the task main body, and it is detected whether a second subsequent task located after the current task exists in the device main body. Specifically, when a first subsequent task located after the current task exists in the task main body, the first subsequent task is obtained and set as a first node after the current task; when a second subsequent task located after the current task is stored in the device main body, acquiring the second subsequent task and setting the second subsequent task as a second node after the current task; the disturbance task is a root node of a related task association tree, and the first node and the second node are both lower-layer nodes of the related task association tree. Specifically, the first node and the second node are nodes of the same level, that is, the first node and the second node have the same level in the relevant task association tree. Certainly, when a first subsequent task behind the current task does not exist in the task main body, but a second subsequent task behind the current task exists in the equipment main body, the lower-layer node of the related task tree is only a second node; similarly, when the task main body stores a first subsequent task located after the current task, but detects that a second subsequent task located after the current task does not exist in the device main body, the lower-layer node of the related task tree is only the first node. It should be noted that, when the perturbation task is used as the current task, and there is no first subsequent task located after the current task in the task main body, and there is no second subsequent task located after the current task in the device main body, it is indicated that the perturbation task is the last task in the task main body and in the device main body, and there is no related task associated with the perturbation task at this time, that is, a related task association tree cannot be established at this time.
For example, when the disturbance task is a disturbance procedure, the task main body is a workpiece, and the device main body is a processing device, the first subsequent task located after the current task in the task main body is a processing workpiece, and the next procedure is located after the disturbance procedure when the workpiece is processed; the second subsequent task after the current task in the apparatus main body is a next process of machining on the machining apparatus after the disturbance process when machining is performed on the machining apparatus, and of course, the next process of machining on the machining apparatus is not necessarily a process of machining a workpiece to which the disturbance process belongs, and may be a process of machining other workpieces. Therefore, according to the principle that the minimum equipment space time and the principle that only one process can be processed on the same equipment at the same time, the process route constraint of the workpiece is obeyed, and when the disturbance process is generated, the subsequent process in the workpiece and the subsequent process in the equipment of the disturbance process generate disturbance, so that the disturbance process is formed. Similarly, each newly generated disturbance procedure will generate disturbance in the subsequent procedures in the workpiece and the subsequent procedures in the equipment, and becomes a disturbance procedure. In this way, all the perturbation processes can form a correlation process association tree of all the correlation processes taking the first perturbation process as a root node according to the node arrangement.
And 203, sequentially setting each node in the lower-layer nodes as a current task, and circularly entering the steps of detecting whether a first subsequent task behind the current task exists in the task main body and detecting whether a second subsequent task behind the current task exists in the equipment main body.
In this step, specifically, when the lower nodes of the relevant task tree are obtained, each node in the lower nodes may be set as the current task in turn, and then the process loops to step 202. For example, when a first node is taken as a current task, it may be detected whether a first subsequent task located after the first node exists within the task body, and whether a second subsequent task located after the first node exists within the device body. Of course, when there is a first subsequent task located after the first node in the task main body, the first subsequent task located after the first node may continue to be set as a lower node of the relevant task tree; when a second subsequent task located after the first node exists in the device body, the second subsequent task located after the first node can be continuously used as a lower node of the related task tree. Similarly, when the second node is taken as the current task, whether a first subsequent task located behind the second node exists in the task main body or not can be detected, and whether a second subsequent task located behind the second node exists in the device main body or not can be detected. Of course, when there is a first subsequent task located after the second node in the task main body, the first subsequent task located after the second node may continue to be set as a lower node of the relevant task tree; when a second subsequent task located after the second node exists in the device body, the second subsequent task located after the second node can be continuously used as a lower node of the related task tree. In this way, as long as a first subsequent task located after the current task exists in the task main body or a second subsequent task located after the current task exists in the device main body, the related task tree has a lower node, and each lower node that appears at this time needs to be detected until the lower node does not appear, that is, until the last lower node that appears, the first subsequent task located after the lower node does not exist in the task main body, and the second subsequent task located after the lower node does not exist in the device main body.
And 204, when a first subsequent task behind the current task does not exist in the task main body and a second subsequent task behind the current task does not exist in the equipment main body, finishing establishing the relevant task association trees of all relevant tasks.
In this step, specifically, when there is no first subsequent task located after the current task in the task main body and there is no second subsequent task located after the current task in the device main body, the current task is the last task in the task main body, and the current task is the last task in the device main body, and at this time, the establishment of the related task tree is ended, that is, the establishment of the related task association trees of all the related tasks is completed.
Therefore, by circularly detecting whether a first subsequent task behind the current task exists in the task main body and detecting whether a second subsequent task behind the current task exists in the equipment main body, all related tasks related to the disturbed task can be detected, and related task association trees of all related tasks can be established, so that when disturbance occurs, the related task association trees influenced by the disturbed task can be found and predicted according to the disturbance, and a basis is provided for purposefully adjusting the original scheduling plan.
Furthermore, in the first embodiment of the present invention, in step 103, when the related tasks sequentially traversed in the related task association tree are scheduled according to the disturbance type, the related tasks sequentially traversed in the related task association tree may be scheduled differently for different disturbance types. This will be specifically explained below.
One is as follows:
when the disturbance type is a task start time variation type, a first idle time variation value between a preceding task and a disturbance task which are positioned before the disturbance task in the equipment main body for executing the disturbance task can be obtained; and then scheduling the sequentially traversed related tasks except the disturbance task in the related task association tree according to the first idle time change value.
Specifically, when the related tasks are scheduled, when the first idle time change value is a positive value, the start time of the sequentially traversed related tasks except the disturbance task in the related task association tree is delayed by the first idle time change value; and when the first idle time change value is a negative value, the start time of the sequentially traversed related tasks except the disturbance task in the related task association tree is advanced by the first idle time change value.
When the first idle time change value is obtained, the manner of calculating the first idle time change value may be determined according to whether the task start time change value of the perturbation task is a fixed value or a change amount that changes with time.
Specifically, when the task start time variation value of the perturbation task is a certain value,the algorithm may be adjusted according to the proportion of the change of the start time of the task, i.e. according to the first formula TSTCCalculating to obtain a first idle time change value; wherein, in the first formula, TSTCAnd representing a first idle time change value, TA' representing the actual task starting time of the task to be disturbed, and TA representing the preset task starting time of the task to be disturbed.
When the task start time variation value of the task to be disturbed is a variation, the algorithm can be adjusted according to the integral corresponding to the task start time variation, that is, according to the second formula
Figure BDA0001167271480000121
Calculating to obtain a first idle time change value; wherein, in the second formula,
Figure BDA0001167271480000122
and TSTCIRepresenting a first idle time variation value, KIRepresenting a preset coefficient, T representing the end time of a preset time period, and C (T) representing the function of the change value of the task start time to the time; FO represents the man-hours when the previous task before the disturbance task has been completed in the apparatus main body that executes the disturbance task, FQ represents the workload when the previous task before the disturbance task has been completed in the apparatus main body that executes the disturbance task, Q represents the total workload of the previous tasks before the disturbance task in the apparatus main body that executes the disturbance task, and TS represents the preset man-hours of the previous task before the disturbance task in the apparatus main body that executes the disturbance task. Specifically, since the actual task start time variation value of the perturbation task is caused by the continuous variation of the working hours of the previous tasks in the device main body or the task main body, the actual task start time of the perturbation task can be predicted and calculated according to the working hours of the previous tasks before the perturbation task in the device main body, so as to obtain the first idle time variation value.
In this way, when the first idle time variation value is a positive value, it indicates that the task start time of the perturbation task is delayed by the first idle time variation value, and at this time, the start times of the sequentially traversed related tasks except the perturbation task in the related task association tree may be all delayed by the first idle time variation value. When the first idle time change value is a negative value, it indicates that the task start time of the disturbance task is advanced by the first idle time change value, and at this time, the start times of the sequentially traversed related tasks except the disturbance task in the related task association tree may be advanced by the first idle time change value. Therefore, except that the task starting time of the related tasks in the related task tree is changed, the rest execution plans are the same as the original scheduling plan, and the adjustment of the original scheduling plan is reduced to the maximum extent.
The second step is as follows:
when the disturbance type is a task man-hour change type, acquiring a second idle time change value between a subsequent task after the disturbance task and the disturbance task in the equipment main body for executing the disturbance task; and scheduling the sequentially traversed related tasks except the disturbance task in the related task association tree according to the second idle time change value.
Specifically, when the related tasks are scheduled, when the second idle time change value is a positive value, the start times of the sequentially traversed related tasks except the disturbance task in the related task association tree are all delayed by the second idle time change value; and when the second idle time change value is a negative value, the start time of the sequentially traversed related tasks except the disturbance task in the related task association tree is advanced by the second idle time change value.
In addition, when the second idle-time variation value is acquired, the manner of calculating the second idle-time variation value may be determined according to whether the task man-hour variation value of the disturbance task is a constant value or a variation that varies with time.
Specifically, when the task man-hour variation value of the disturbance task is a certain value, the algorithm may be adjusted according to the proportion of the task man-hour variation, that is, according to the third formula TMCCalculating to obtain a second idle time variation value (TS' -TS) × NP; wherein, in the third formula, TMCRepresenting the second idle time variation value, TS' representing the actual man-hour of the perturbation task, TS representing the preset man-hour of the perturbation task, NP tableAnd displaying the number of task bodies to which the perturbation task belongs.
When the task man-hour variation value of the disturbance task is the variation, the integral adjustment algorithm for dealing with the variation of the task man-hour can be used, namely, the integral adjustment algorithm is used according to the fourth formula
Figure BDA0001167271480000131
Calculating to obtain a second idle time change value; wherein, in the fourth formula,
Figure BDA0001167271480000132
wherein, TMCIRepresenting a second idle time variation value, KIRepresenting a preset coefficient, T representing the end time of a preset time period, and C' (T) representing the function of the change value of the task working hour to the time; FO ' represents the man-hour that the task of perturbation has been completed, FQ ' represents the workload that the task of perturbation has been completed, Q ' represents the total workload of the task of perturbation, and TS represents the preset man-hour of the task of perturbation.
It should be noted that, the function C (t) of the task start time variation value to time in the second formula is referred to, and since the continuous change of the task start time variation value is actually caused by the continuous change of the working hours of the preceding task before the task disturbance in the device main body or the task main body, the function C (t) of the task start time variation value to time in the second formula and the function C' (t) of the task working hour variation value to time are the same in expression, and the preset coefficient K is set to be the sameIThe same is true.
In this way, when the second idle time variation value is a positive value, it indicates that the task time of the task disturbance task is increased by the second idle time variation value, and at this time, the start times of the sequentially traversed related tasks except the disturbance task in the related task association tree may be all delayed by the second idle time variation value. When the second idle time change value is a negative value, it is described that the task working hour time of the disturbance task is reduced by the second idle time change value, and at this time, the start times of the sequentially traversed related tasks except the disturbance task in the related task association tree can be all advanced by the second idle time change value. Therefore, except that the task starting time of the related tasks in the related task tree is changed, the rest execution plans are the same as the original scheduling plan, and the adjustment of the original scheduling plan is reduced to the maximum extent.
Thus, in this embodiment, first, a relevant task association tree of all relevant tasks is established according to the perturbation task, when the perturbation type of the perturbation task is a task start time variation type, a first idle time variation value is obtained by calculation, when the perturbation type of the perturbation task is a task man-hour variation type, a second idle time variation value is obtained by calculation, and finally, according to the first idle time variation value or the second idle time variation value, the sequentially traversed relevant tasks except the perturbation task in the relevant task association tree are scheduled, so that when the perturbation occurs in the production process, the relevant task association tree affected by the perturbation task can be found and predicted according to the perturbation task, thereby purposefully adjusting the original scheduling plan, performing real-time processing on the relevant task association tree, reducing the adjustment of the original scheduling plan, and realizing that the deviation of the production reality and the plan caused by the existing perturbation can be reduced, the purpose of predicting possible disturbances and adjusting the affected process.
Second embodiment:
as shown in fig. 3, a block diagram of a dynamic scheduling apparatus for job-shop tasks according to a second embodiment of the present invention includes:
an obtaining module 301, configured to obtain a disturbance task that is disturbed in a production process and a disturbance type of the disturbance task;
an establishing module 302, configured to obtain all relevant tasks associated with the perturbation task according to the perturbation task, and establish a relevant task association tree of all relevant tasks;
and the scheduling module 303 is configured to sequentially traverse the relevant task association trees, and schedule the sequentially traversed relevant tasks in the relevant task association trees according to the disturbance type.
Optionally, the establishing module 302 includes: the first acquisition unit is used for acquiring a task main body to which the disturbance task belongs and an equipment main body for executing the disturbance task; the detection unit is used for setting the disturbance task as a current task, detecting whether a first subsequent task behind the current task exists in the task main body, and detecting whether a second subsequent task behind the current task exists in the equipment main body; when a first subsequent task located behind the current task exists in the task main body, acquiring the first subsequent task and setting the first subsequent task as a first node behind the current task; when a second subsequent task located after the current task exists in the device main body, acquiring the second subsequent task and setting the second subsequent task as a second node after the current task; the disturbance task is a root node of the relevant task association tree, and the first node and the second node are both lower-layer nodes of the relevant task association tree; the setting unit is used for sequentially setting each node in the lower-layer nodes as a current task, and circularly triggering the detection unit to detect whether a first subsequent task behind the current task exists in the task main body and whether a second subsequent task behind the current task exists in the equipment main body; and the establishing unit is used for completing the establishment of the relevant task association trees of all relevant tasks when a first subsequent task behind the current task does not exist in the task main body and a second subsequent task behind the current task does not exist in the equipment main body.
Optionally, the scheduling module 303 includes: a second obtaining unit, configured to obtain, when the perturbation type is a task start time variation type, a first idle time variation value between a preceding task located before the perturbation task and the perturbation task in an apparatus main body that executes the perturbation task; the first scheduling unit is used for scheduling the sequentially traversed related tasks except the disturbance task in the related task association tree according to the first idle time change value; when the first idle time change value is a positive value, delaying the start time of the sequentially traversed related tasks except the disturbance task in the related task association tree by the first idle time change value; and when the first idle time change value is a negative value, advancing the start time of the sequentially traversed related tasks except the disturbance task in the related task association tree by the first idle time change value.
Optionally, the second obtaining unit includes: a first calculating unit, configured to, when a task start time variation value of the perturbation task is a certain value, calculate a task start time variation value according to a first formula TSTCCalculating to obtain the first idle time change value; wherein, in the first formula, TSTCRepresenting the first idle time change value, TA' representing the actual task starting time of the perturbation task, and TA representing the preset task starting time of the perturbation task; a second calculating unit, configured to calculate a task start time variation value of the task based on a second formula when the task start time variation value is a variation
Figure BDA0001167271480000161
Calculating to obtain the first idle time change value; wherein, in the second formula,
Figure BDA0001167271480000162
and TSTCIRepresenting said first idle time variation value, KIRepresenting a preset coefficient, T representing the end time of a preset time period, and C (T) representing the function of the change value of the task start time to the time; FO represents the man-hours when the previous task before the perturbation task has been completed in the apparatus main body that executes the perturbation task, FQ represents the workload when the previous task before the perturbation task has been completed in the apparatus main body that executes the perturbation task, Q represents the total workload of the previous tasks before the perturbation task in the apparatus main body that executes the perturbation task, and TS represents the preset man-hours of the previous task before the perturbation task in the apparatus main body that executes the perturbation task.
Optionally, the scheduling module 303 includes: a third obtaining unit, configured to obtain, when the disturbance type is a task man-hour change type, a second idle time change value between a subsequent task located after the disturbance task and the disturbance task in an apparatus main body that executes the disturbance task; the second scheduling unit is used for scheduling the sequentially traversed related tasks except the disturbance task in the related task association tree according to the second idle time change value; when the second idle time change value is a positive value, delaying the start time of the sequentially traversed related tasks except the disturbance task in the related task association tree by the second idle time change value; and when the second idle time change value is a negative value, advancing the start time of the sequentially traversed related tasks except the disturbance task in the related task association tree by the second idle time change value.
Optionally, the third obtaining unit includes: a third calculation unit for calculating a task man-hour variation value of the task based on a third formula T when the task man-hour variation value is a certain valueMCCalculating the second idle time variation value as (TS' -TS) × NP; wherein, in the third formula, TMCRepresenting the second idle time change value, TS' representing the actual working hours of the perturbation tasks, TS representing the preset working hours of the perturbation tasks, and NP representing the number of task bodies to which the perturbation tasks belong; a fourth calculating unit, configured to, when the task man-hour variation value of the perturbation task is a variation, calculate the perturbation task according to a fourth formula
Figure BDA0001167271480000171
Calculating to obtain the second idle time change value; wherein, in the fourth formula,
Figure BDA0001167271480000172
Figure BDA0001167271480000173
wherein, TMCIRepresenting said second idle time variation value, KIRepresents a preset coefficient, T represents the end time of a preset time period, C' (T) represents the task man-hour change value pairA function of time; FO ' represents the man-hour that the perturbation task has been completed, FQ ' represents the workload that the perturbation task has been completed, Q ' represents the total workload of the perturbation task, and TS represents the preset man-hour of the perturbation task.
The method can acquire the disturbed tasks and the disturbance types of the disturbed tasks in the production process, then establish the related task association trees of all related tasks related to the disturbed tasks according to the disturbed tasks, traverse the related task association trees in sequence, and schedule the related tasks sequentially traversed in the related task association trees according to the disturbance types, so that when the disturbance occurs, the related task association trees influenced by the disturbed tasks can be found and predicted according to the disturbed tasks, an original scheduling plan can be adjusted purposefully, the related task association trees can be processed in real time, the adjustment of the original scheduling plan is reduced, and the aims of predicting possible disturbance and adjusting influenced processes while reducing the deviation of production practice and plans brought by the existing disturbance are achieved.
While the preferred embodiments of the present invention have been described, it will be understood by those skilled in the art that various changes and modifications may be made without departing from the spirit and scope of the invention as defined in the following claims.

Claims (8)

1. A method for dynamically scheduling job shop tasks, comprising:
acquiring a disturbance task which is disturbed in the production process and the disturbance type of the disturbance task;
acquiring all related tasks related to the disturbance task according to the disturbance task, and establishing a related task association tree of all related tasks;
sequentially traversing the relevant task association tree, and scheduling the sequentially traversed relevant tasks in the relevant task association tree according to the disturbance type;
the step of scheduling the related tasks sequentially traversed in the related task association tree according to the disturbance type includes:
when the disturbance type is a task starting time change type, acquiring a first idle time change value between a previous task before the disturbance task and the disturbance task in an equipment main body executing the disturbance task;
scheduling the sequentially traversed related tasks except the disturbance task in the related task association tree according to the first idle time change value; wherein the content of the first and second substances,
when the first idle time change value is a positive value, delaying the start time of the sequentially traversed related tasks except the disturbance task in the related task association tree by the first idle time change value;
when the first idle time variation value is a negative value, the starting time of the sequentially traversed related tasks except the disturbance task in the related task association tree is advanced by the first idle time variation value;
the step of obtaining a first idle time change value between a previous task before the perturbation task and the perturbation task in the device main body executing the perturbation task includes:
when the task starting time variation value of the disturbance task is a certain value, according to a first formula TSTCCalculating to obtain the first idle time change value; wherein, in the first formula, TSTCRepresenting the first idle time change value, TA' representing the actual task starting time of the perturbation task, and TA representing the preset task starting time of the perturbation task;
when the task starting time variation value of the disturbance task is the variation, according to a second formula
Figure FDA0002130365450000011
Calculating to obtain the first idle time change value; wherein, in the second formula,and TSTCIRepresenting said first idle time variation value, KIRepresenting a preset coefficient, T representing the end time of a preset time period, and C (T) representing the function of the change value of the task start time to the time; FO represents the man-hours when the previous task before the perturbation task has been completed in the apparatus main body that executes the perturbation task, FQ represents the workload when the previous task before the perturbation task has been completed in the apparatus main body that executes the perturbation task, Q represents the total workload of the previous tasks before the perturbation task in the apparatus main body that executes the perturbation task, and TS represents the preset man-hours of the previous task before the perturbation task in the apparatus main body that executes the perturbation task.
2. The dynamic scheduling method according to claim 1, wherein the step of obtaining all relevant tasks associated with the perturbation task and establishing a relevant task association tree of all relevant tasks according to the perturbation task comprises:
acquiring a task main body to which the disturbance task belongs and an equipment main body for executing the disturbance task;
setting the disturbance task as a current task, detecting whether a first subsequent task behind the current task exists in the task main body, and detecting whether a second subsequent task behind the current task exists in the equipment main body; wherein the content of the first and second substances,
when a first subsequent task located behind the current task exists in the task main body, acquiring the first subsequent task and setting the first subsequent task as a first node behind the current task; when a second subsequent task located after the current task exists in the device main body, acquiring the second subsequent task and setting the second subsequent task as a second node after the current task; the disturbance task is a root node of the relevant task association tree, and the first node and the second node are both lower-layer nodes of the relevant task association tree;
sequentially setting each node in the lower-layer nodes as a current task, and circularly entering the steps of detecting whether a first subsequent task behind the current task exists in the task main body and detecting whether a second subsequent task behind the current task exists in the equipment main body;
and when a first subsequent task behind the current task does not exist in the task main body and a second subsequent task behind the current task does not exist in the equipment main body, finishing establishing the relevant task association trees of all relevant tasks.
3. The dynamic scheduling method according to claim 1, wherein the step of scheduling the related tasks sequentially traversed in the related task association tree according to the disturbance type includes:
when the disturbance type is a task man-hour change type, acquiring a second idle time change value between a subsequent task after the disturbance task and the disturbance task in the equipment main body for executing the disturbance task;
scheduling the sequentially traversed related tasks except the disturbance task in the related task association tree according to the second idle time change value; wherein the content of the first and second substances,
when the second idle time change value is a positive value, delaying the start time of the sequentially traversed related tasks except the disturbance task in the related task association tree by the second idle time change value;
and when the second idle time change value is a negative value, advancing the start time of the sequentially traversed related tasks except the disturbance task in the related task association tree by the second idle time change value.
4. The dynamic scheduling method according to claim 3, wherein the step of obtaining a second idle time variation value between a subsequent task after the perturbation task and the perturbation task in the device body executing the perturbation task comprises:
when the task man-hour variation value of the disturbance task is a certain value, according to a third formula TMCCalculating the second idle time variation value as (TS' -TS) × NP; wherein, in the third formula, TMCRepresenting the second idle time change value, TS' representing the actual working hours of the perturbation tasks, TS representing the preset working hours of the perturbation tasks, and NP representing the number of task bodies to which the perturbation tasks belong;
when the task man-hour change value of the disturbance task is the change amount, according to a fourth formula
Figure FDA0002130365450000031
Figure FDA0002130365450000032
Calculating to obtain the second idle time change value; wherein, in the fourth formula,
Figure FDA0002130365450000033
wherein, TMCIRepresenting said second idle time variation value, KCRepresenting a preset coefficient, T representing the end time of a preset time period, and C' (T) representing the function of the change value of the task working hour to the time; FO ' represents the man-hour that the perturbation task has been completed, FQ ' represents the workload that the perturbation task has been completed, Q ' represents the total workload of the perturbation task, and TS represents the preset man-hour of the perturbation task.
5. A device for dynamically scheduling job-shop tasks, comprising:
the system comprises an acquisition module, a processing module and a control module, wherein the acquisition module is used for acquiring a disturbance task which is disturbed in the production process and the disturbance type of the disturbance task;
the establishment module is used for acquiring all related tasks related to the perturbation task according to the perturbation task and establishing related task association trees of all related tasks;
the scheduling module is used for sequentially traversing the related task association tree and scheduling the related tasks sequentially traversed in the related task association tree according to the disturbance type;
wherein the scheduling module comprises:
a second obtaining unit, configured to obtain, when the perturbation type is a task start time variation type, a first idle time variation value between a preceding task located before the perturbation task and the perturbation task in an apparatus main body that executes the perturbation task;
the first scheduling unit is used for scheduling the sequentially traversed related tasks except the disturbance task in the related task association tree according to the first idle time change value; when the first idle time change value is a positive value, delaying the start time of the sequentially traversed related tasks except the disturbance task in the related task association tree by the first idle time change value; when the first idle time variation value is a negative value, the starting time of the sequentially traversed related tasks except the disturbance task in the related task association tree is advanced by the first idle time variation value;
wherein the second acquisition unit includes:
a first calculating unit, configured to, when a task start time variation value of the perturbation task is a certain value, calculate a task start time variation value according to a first formula TSTCCalculating to obtain the first idle time change value; wherein, in the first formula, TSTCRepresenting the first idle time change value, TA' representing the actual task starting time of the perturbation task, and TA representing the preset task starting time of the perturbation task;
a second calculating unit, configured to calculate a task start time variation value of the task based on a second formula when the task start time variation value is a variation
Figure FDA0002130365450000041
Calculating to obtain the first idle time change value; wherein, in the second formula,
Figure FDA0002130365450000042
and TSTCIRepresenting said first idle time variation value, KIRepresenting a preset coefficient, T representing the end time of a preset time period, and C (T) representing the function of the change value of the task start time to the time; FO represents the man-hours when the previous task before the perturbation task has been completed in the apparatus main body that executes the perturbation task, FQ represents the workload when the previous task before the perturbation task has been completed in the apparatus main body that executes the perturbation task, Q represents the total workload of the previous tasks before the perturbation task in the apparatus main body that executes the perturbation task, and TS represents the preset man-hours of the previous task before the perturbation task in the apparatus main body that executes the perturbation task.
6. The dynamic scheduling apparatus of claim 5, wherein the establishing module comprises:
the first acquisition unit is used for acquiring a task main body to which the disturbance task belongs and an equipment main body for executing the disturbance task;
the detection unit is used for setting the disturbance task as a current task, detecting whether a first subsequent task behind the current task exists in the task main body, and detecting whether a second subsequent task behind the current task exists in the equipment main body; when a first subsequent task located behind the current task exists in the task main body, acquiring the first subsequent task and setting the first subsequent task as a first node behind the current task; when a second subsequent task located after the current task exists in the device main body, acquiring the second subsequent task and setting the second subsequent task as a second node after the current task; the disturbance task is a root node of the relevant task association tree, and the first node and the second node are both lower-layer nodes of the relevant task association tree;
the setting unit is used for sequentially setting each node in the lower-layer nodes as a current task, and circularly triggering the detection unit to detect whether a first subsequent task behind the current task exists in the task main body and whether a second subsequent task behind the current task exists in the equipment main body;
and the establishing unit is used for completing the establishment of the relevant task association trees of all relevant tasks when a first subsequent task behind the current task does not exist in the task main body and a second subsequent task behind the current task does not exist in the equipment main body.
7. The dynamic scheduling apparatus of claim 5, wherein the scheduling module comprises:
a third obtaining unit, configured to obtain, when the disturbance type is a task man-hour change type, a second idle time change value between a subsequent task located after the disturbance task and the disturbance task in an apparatus main body that executes the disturbance task;
the second scheduling unit is used for scheduling the sequentially traversed related tasks except the disturbance task in the related task association tree according to the second idle time change value; when the second idle time change value is a positive value, delaying the start time of the sequentially traversed related tasks except the disturbance task in the related task association tree by the second idle time change value; and when the second idle time change value is a negative value, advancing the start time of the sequentially traversed related tasks except the disturbance task in the related task association tree by the second idle time change value.
8. The dynamic scheduling apparatus of claim 7, wherein the third obtaining unit comprises:
a third calculation unit for calculating a task man-hour variation value of the task based on a third formula T when the task man-hour variation value is a certain valueMC(TS' -TS) × NP, calculated to give the secondTwo idle time change values; wherein, in the third formula, TMCRepresenting the second idle time change value, TS' representing the actual working hours of the perturbation tasks, TS representing the preset working hours of the perturbation tasks, and NP representing the number of task bodies to which the perturbation tasks belong;
a fourth calculating unit, configured to, when the task man-hour variation value of the perturbation task is a variation, calculate the perturbation task according to a fourth formula
Figure FDA0002130365450000061
Calculating to obtain the second idle time change value; wherein, in the fourth formula,
Figure FDA0002130365450000062
wherein, TMCIRepresenting said second idle time variation value, KIRepresenting a preset coefficient, T representing the end time of a preset time period, and C' (T) representing the function of the change value of the task working hour to the time; FO ' represents the man-hour that the perturbation task has been completed, FQ ' represents the workload that the perturbation task has been completed, Q ' represents the total workload of the perturbation task, and TS represents the preset man-hour of the perturbation task.
CN201611082464.7A 2016-11-30 2016-11-30 Dynamic scheduling method and device for job shop tasks Active CN108121305B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201611082464.7A CN108121305B (en) 2016-11-30 2016-11-30 Dynamic scheduling method and device for job shop tasks

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201611082464.7A CN108121305B (en) 2016-11-30 2016-11-30 Dynamic scheduling method and device for job shop tasks

Publications (2)

Publication Number Publication Date
CN108121305A CN108121305A (en) 2018-06-05
CN108121305B true CN108121305B (en) 2020-01-17

Family

ID=62226284

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201611082464.7A Active CN108121305B (en) 2016-11-30 2016-11-30 Dynamic scheduling method and device for job shop tasks

Country Status (1)

Country Link
CN (1) CN108121305B (en)

Families Citing this family (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111007823B (en) * 2019-12-25 2021-01-22 北京理工大学 Flexible job shop dynamic scheduling method and device
CN112308472B (en) * 2020-12-31 2021-03-30 成都飞机工业（集团）有限责任公司 Robust scheduling method based on process time difference relaxation
CN112650187B (en) * 2021-01-22 2022-04-05 北京理工大学 Workshop scheduling method, device and system

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2932992B2 (en) * 1995-12-15 1999-08-09 日本電気株式会社 Work management alarm event suppression method
CN101416451A (en) * 2006-03-30 2009-04-22 卢森特技术有限公司 Method and apparatus for link transmission scheduling for handling traffic variation in wireless networks
CN101520656A (en) * 2008-11-21 2009-09-02 东北大学 On-line multi-mode time optimization scheduling method for steelmaking and continuous casting production
CN101770615A (en) * 2010-01-25 2010-07-07 重庆大学 Steelmaking-continuous casting production operation plan and real-time dispatching optimization method and system based on mixed intelligent optimization algorithm

Family Cites Families (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7181485B1 (en) * 2001-11-26 2007-02-20 Integrated Device Technology, Inc. Variably delayable transmission of packets between independently clocked source, intermediate, and destination circuits while maintaining orderly and timely processing in one or both of the intermediate and destination circuits
US7586892B2 (en) * 2004-04-26 2009-09-08 Hewlett-Packard Development Company, L.P. Computer method and apparatus for periodic scheduling with jitter-approximation tradeoff
US8234137B2 (en) * 2005-10-03 2012-07-31 Stellar Services One view integrated project management system
CN101794147A (en) * 2010-02-25 2010-08-04 北京理工大学 Shop operation dynamic dispatching method based on disturbance event driving
CN104268722B (en) * 2014-10-20 2017-08-22 南京信息工程大学 Dynamic flexible job-shop scheduling method based on multi-objective Evolutionary Algorithm
CN104636610B (en) * 2015-01-30 2017-12-05 同济大学 A kind of manufacture system being applied under dynamic environment sends work Information revision method

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2932992B2 (en) * 1995-12-15 1999-08-09 日本電気株式会社 Work management alarm event suppression method
CN101416451A (en) * 2006-03-30 2009-04-22 卢森特技术有限公司 Method and apparatus for link transmission scheduling for handling traffic variation in wireless networks
CN101520656A (en) * 2008-11-21 2009-09-02 东北大学 On-line multi-mode time optimization scheduling method for steelmaking and continuous casting production
CN101770615A (en) * 2010-01-25 2010-07-07 重庆大学 Steelmaking-continuous casting production operation plan and real-time dispatching optimization method and system based on mixed intelligent optimization algorithm

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
MES环境下作业车间多级动态调度方法研究;黄振刚 等;《机械设计与制造》;20111130(第11期);第240-242页 *

Also Published As

Publication number Publication date
CN108121305A (en) 2018-06-05

Similar Documents

Publication Publication Date Title
CN106651089B (en) Modeling and optimization solving method for distribution set robust model of production scheduling problem
CN108121305B (en) Dynamic scheduling method and device for job shop tasks
Ming-Xuan et al. Error tracking of iterative learning control systems
CN105069524B (en) Planned dispatching optimization method based on big data analysis
JP5227254B2 (en) Real-time calculation method and simulator of state quantity of process model
GB2509471A (en) Performance data in a worker profile aggregated by a job distribution platform for workers that perform crowd sourced tasks
CN111324639A (en) Data monitoring method and device and computer readable storage medium
CN114066262A (en) Method, system and device for estimating cause-tracing reasoning of abnormal indexes after power grid dispatching and storage medium
CN113159979A (en) Scheduling decision method and system
CN115392676A (en) Intelligent engineering cost management system and method based on cloud computing and big data
Snyman et al. Real-time scheduling in a sensorised factory using cloud-based simulation with mobile device access
JP5977373B2 (en) Systems and methods for automatically processing workflows in automation and / or electrical engineering projects
KR101411370B1 (en) Method and system for verification maintenance cycle of offshore plant
JP6398339B2 (en) Schedule management device in manufacturing factory and method of operating manufacturing factory
CN109740766B (en) Industrial equipment maintenance service planning method
CN112700050A (en) Method and system for predicting ultra-short-term 1 st point power of photovoltaic power station
CN116341740A (en) Urban fuel gas time-by-time load multi-step prediction method and system based on proportional splitting
US20200228945A1 (en) Data processing device, data analyzing device, data processing system and method for processing data
Behún et al. Risk assessment of non-repetitive production processes
US10571872B2 (en) Method for computer-aided control of an automation system
JP2023074027A (en) Production planning system and production planning method
Heinecke et al. Event-driven order rescheduling model for just-in-sequence deliveries to a mixed-model assembly line
Kalinowski et al. The procedure of reaction to unexpected events in scheduling of manufacturing systems with discrete production flow
Snyman et al. A real-time scheduling system in a sensorised job shop
CN108805506A (en) A kind of intelligent material dispensing method

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant
TR01 Transfer of patent right

Effective date of registration: 20220601

Address after: 112, F1, building 405, Tiantongyuan, Dongxiaokou Town, Changping District, Beijing 102208

Patentee after: Beijing Yingjie Technology Co.,Ltd.

Address before: 100081 No. 5 South Main Street, Haidian District, Beijing, Zhongguancun

Patentee before: BEIJING INSTITUTE OF TECHNOLOGY

TR01 Transfer of patent right