KR102250716B1 - Scheduling system under blockchain mechanism - Google Patents

Abstract

Disclosed is a scheduling system based on blockchain which can establish a work schedule plan on a blockchain platform. The scheduling system based on blockchain comprises: a receiver which receives work information on work to be processed, and classifies the received work by cycle; a plurality of schedulers establishing a work schedule plan for the received work in accordance with the cycle of the work classified by the receiver; a selector selecting anyone in accordance with a preset selection criterion among the plurality of work schedule plans established by the plurality of schedulers; and a broadcaster generating the work schedule plan selected by the selector as a block and broadcasting the generated block with the plurality of schedulers, wherein the plurality of schedulers form blockchain by adding the block received from the broadcaster, respectively, and confirm the work schedule plan for the work processed up to the cycle immediately preceding the current point.

Description

Blockchain-based scheduling system {Scheduling system under blockchain mechanism}

The present invention relates to a blockchain-based scheduling system.

Blockchain is a technology that distributes and stores periodically generated blocks in the form of a chain, and one block is the information of the block creation time, the hash of the previous block, and the details of the transaction (processing). It includes. In the case of bitcoin, a block is generated every 10 minutes, and in the case of Ethereum, a block is generated approximately every 14 seconds. In addition, since the block that has already been created is disclosed to all relevant persons, it is difficult to modify the contents of the generated block. In addition, since the order between blocks that have already been created is maintained using a hash code, the order of all transactions (processing) is not modified. Therefore, in order to utilize the advantages of transparency through the sharing of the blockchain, distributed processing, and integrity through the creation of blocks based on majority vote, the blockchain is being applied in the fields of financial transactions, public services, and logistics (supply chain management).

Although the field of application of blockchain technology is becoming more diverse, there are not many cases where blockchain technology is applied for production planning and control other than supply chain management in the blockchain platform.

As an example of applying blockchain technology to production planning and control, it has been found that blockchain technology can be used as a solution to the security vulnerability of IoT (Internet Of Things). There is an example that has shown that blockchain can be used for tracking information, flow and transaction history. In addition, there is a case in which blockchain technology can be used to control the right to access resources such as IoT in smart factories. However, these cases are cases in which the strength of the blockchain of complementing security vulnerabilities and traceability of information history is utilized.

However, there is a lack of utilization and application methods to increase the effectiveness of distributed processing, which is one of the other major strengths of the blockchain. In particular, when the number of tasks to be processed increases, such as production or service planning in manufacturing or service industries, and work schedule planning for control, blockchain as a means to solve the NP-complete problem, which greatly increases the time required for scheduling. There is no presenting a plan to utilize the technology.

Therefore, it is necessary to develop a technology to establish periodic scheduling that utilizes the strengths of the blockchain.

Korean Registered Patent Publication No. 10-1977178 (2019.05.03)

The present invention is to provide a blockchain-based scheduling system that establishes a work schedule plan in a blockchain platform by using the concept of periodic block generation of a block chain, unmodifiable of the generated block, and decentralized block generation of members.

According to an aspect of the present invention, a blockchain-based scheduling system is disclosed.

The blockchain-based scheduling system according to an embodiment of the present invention receives a job information for a job to be processed, receives a job, and classifies the received job by period, and a period of the job classified by the receiving unit. According to a plurality of schedulers for establishing a work schedule plan for the received job according to, a selector for selecting any one according to a preset selection criterion among a plurality of work schedule plans established by the plurality of schedulers, and a job selected by the selector It includes a broadcaster that generates a schedule as a block and broadcasts the generated block to the plurality of schedulers, wherein each of the plurality of schedulers forms a block chain by adding the blocks received from the broadcaster to form a block chain immediately preceding the current period. Finalize the work schedule for the tasks that have been processed up to.

The receiver receives a periodic time for each period, sets a periodic time for each period, and transmits information on jobs to be processed for each period according to the classification to the plurality of schedulers, wherein the periodic times for each period are all set the same, or It is set in inverse proportion to the number of processing requests.

The plurality of schedulers sets a work schedule plan establishment method specified by a user, generates a work schedule plan using the set work schedule plan establishment method, and transmits the generated work schedule plan to the selector, wherein the The work schedule planning method is the LPT (Longest Processing Time) method, which processes jobs with a long processing time first, the ERD (Earliest Ready Date) method, which processes jobs with a fast reception time first, and is better among a number of work schedule plans It includes the PSO (Particle Swarm Optimization) method and MIP (Mixed Integer Programming), which selects the work schedule plan when it is determined that there is no more good schedule plan while exploring the schedule plan.

When the work schedule plan establishment method is set to the mixed constant planning method, the plurality of schedulers use the following equation to minimize _{the makespan (C max) of tasks to be processed during the cycle time T of the current cycle.} Yields

Here, C _ik is the completion time of the k-th task processed in _{the work facility i, X ijk} is a variable of 0 or 1 that has a value of 1 only when the work j is processed in the k-th time in the work facility i, i =1, 2,… , M, and j=1, 2,… , n, and k=1, 2,… , n.

The plurality of schedulers wait for the job to be processed to be received, and when the job to be processed is received, check the earliest job start time of the affiliated work facility, and plan the work schedule according to the identified fastest job start time. Is created.

The selector sets the selection criteria according to user input, and selects any one of the received work schedule plans of each scheduler using the set selection criteria, and the selection criteria is the work schedule plan with the smallest makespan or the most It is a work schedule plan established quickly.

When the work schedule plan having the smallest makespan is selected as the selection criterion, the selector selects any one of the work schedule plans of each scheduler using the mixed constant planning method.

The blockchain-based scheduling system according to an embodiment of the present invention can establish a work schedule plan on the blockchain platform by using the concept of periodic block generation of the block chain, unmodifiable of the generated block, and decentralized block generation of members. have.

1 is a diagram schematically illustrating the configuration of a blockchain-based scheduling system according to an embodiment of the present invention.
FIG. 2 is a diagram showing an example in which the blockchain-based scheduling system of FIG. 1 is arranged in a facility.
3 to 5 are flowcharts illustrating an operation method of each component of the block chain-based scheduling system of FIG. 1.

Singular expressions used in the present specification include plural expressions unless the context clearly indicates otherwise. In the present specification, terms such as “consisting of” or “comprising” should not be construed as necessarily including all of the various elements or various steps described in the specification, and some of the elements or some steps It may not be included, or it should be interpreted that it may further include additional components or steps. In addition, terms such as "... unit" and "module" described in the specification mean a unit that processes at least one function or operation, which may be implemented as hardware or software or a combination of hardware and software. .

Hereinafter, various embodiments of the present invention will be described in detail with reference to the accompanying drawings.

1 is a diagram schematically illustrating the configuration of a blockchain-based scheduling system according to an embodiment of the present invention, and FIG. 2 is a diagram illustrating an example in which the blockchain-based scheduling system of FIG. 1 is arranged in a facility, and FIG. 3 To FIG. 5 is a flowchart showing an operation method of each component of the block chain-based scheduling system of FIG. 1. Hereinafter, focusing on FIG. 1, a block chain-based scheduling system according to an embodiment of the present invention will be described, with reference to FIGS. 2 to 5.

Referring to FIG. 1, a blockchain-based scheduling system according to an embodiment of the present invention includes a receiver 10, a plurality of schedulers 20, a selector 30, and a broadcaster 40.

The receptionist 10 receives job information on the job to be processed, receives the job to be processed, and classifies the received job by period.

The plurality of schedulers 20 establish work schedule plans for the received jobs according to the cycle of jobs classified by the receptionist 10.

The selector 30 selects one of a plurality of work schedule plans established by the plurality of schedulers 20 according to a preset selection criterion.

The broadcaster 40 generates a work schedule plan selected by the selector 30 as a block, and broadcasts the generated block to a plurality of schedulers 20.

Here, each scheduler 20 may form a block chain by adding blocks received from the broadcaster 40 to determine a work schedule plan for tasks processed up to the period immediately preceding the present time.

Each component of the blockchain-based scheduling system according to an embodiment of the present invention is connected to communication by a wired or wireless communication method, but a communication method according to a block chain communication standard or a de facto standard may be used.

The scheduler 20, the selector 30, and the broadcaster 40 may be installed and operated in one work facility or computing resource.

For example, referring to FIG. 2, a selector 30 and a broadcaster 40 having the same function are installed one by one in each work facility 111, 112, 113, and a scheduler ( 20-1, 20-2, 20-3) can be installed. Here, each of the schedulers 20-1, 20-2, and 20-3 may be operated in different ways for each work facility 111, 112, and 113.

As shown in FIG. 2, a plurality of work facilities 111, 112, and 113 having a parallel structure receive a work to be processed from the work order processing facility 110, process it, and discharge it. Here, the reception device 10 may be installed and operated in the work order processing facility 110.

A job according to an embodiment of the present invention may be a semi-finished product or raw material in a manufacturing system, but may be data in an information system, and thus a result of processing of the job may be a finished product or information according to a job processing requirement.

Hereinafter, a method of operating each component of a blockchain-based scheduling system according to an embodiment of the present invention will be described with reference to FIGS. 3 to 5.

First, referring to FIG. 3, FIG. 3 shows a method of operating the receiver 10.

In step S310, the reception device 10 receives the job information for the job to be processed and receives the job to be processed.

In step S320, the receiver 10 receives the cycle time for each cycle and sets the cycle time for each cycle.

In step S330, the receptionist 10 classifies the received job to be processed by period.

In step S340, the receptionist 10 transmits information on jobs to be processed for each period according to the classification for each period to the plurality of schedulers 20.

For example, the receptionist 10 may receive and set a periodic time for each period, wait for a job to be processed to be received, and when a job to be processed is received, classify the received job to be processed by period.

Here, the periodic time for each period may be designated as an arbitrary value by a user who wants to establish a work schedule plan.

The cycle time for each period may be set to be the same, or may be set to be short or long according to a pattern of a request for processing a job according to a time flow. That is, in a time period with a large number of job processing requests, the periodic periodic time may be set to be short, and on the contrary, in a time period with a small number of job processing requests, the periodic periodic time may be set long. In addition, the cycle time for each cycle may be set differently for each work equipment 111, 112, and 113. However, the cycle time for each cycle must be set according to the block size constraints in the blockchain platform.

Through the setting of the cycle time for each cycle, information on tasks to be processed for each cycle is formed, so that a work schedule plan can be sequentially established.

Next, referring to FIG. 4, FIG. 4 shows an operation method of each scheduler 20.

In step S410, the scheduler 20 receives the work schedule plan information broadcast by the broadcaster 40. Here, the broadcaster 40 generates the work schedule plan selected by the selector 30 as a block, and broadcasts the generated block to the plurality of schedulers 20.

In step S420, the scheduler 20 forms a block chain by adding blocks received from the broadcaster 40 to determine a work schedule plan for the tasks processed up to the current cycle. Here, the block chain can be created by adding an extended work schedule plan to the work schedule plan determined for each work facility 111, 112, 113 so far.

In step S430, the scheduler 20 sets a method of establishing a work schedule plan designated by the user. For example, the user can designate an appropriate work schedule plan establishment method in consideration of the generated block chain and the state of the work facilities 111, 112, and 113 to which the scheduler 20 belongs.

For example, in the work schedule planning method, the LPT (Longest Processing Time) method, which processes jobs with long processing time first, the ERD (Earliest Ready Date) method, which processes jobs with fast reception time first, and multiple work schedules. There is a PSO (Particle Swarm Optimization) method that selects a work schedule when it is determined that there is no more good schedule while searching for a better schedule among the plans. One of these work schedule planning methods may be selected and used by the scheduler 20.

In step S440, the scheduler 20 generates a work schedule plan using the set work schedule plan establishment method, and transmits the generated work schedule plan to the selector 30.

For example, each scheduler 20 waits for a job to be processed to be received, and when a job to be processed is received, checks the earliest job start time of the affiliated work equipment 111, 112, 113, and You can create a work schedule plan according to the quick work start time. Subsequently, each scheduler 20 may transmit the generated work schedule plan to the selector 30 to notify the selector 30 that the establishment of the work schedule plan of the affiliated work equipment 111, 112, 113 has been completed. .

According to an embodiment of the present invention, a method of establishing a work schedule may be set to a mixed integer programming method (MIP) in addition to the LPT method, the ERD method, and the PSO method.

Hereinafter, as a method of establishing a work schedule plan, when a mixed water purification planning method is set, a method of establishing a work schedule plan by the scheduler 20 using the mixed water purification planning method will be described.

It is assumed that the cycle time of a specific cycle is T, and n tasks that arrive during the cycle time T are processed using M identical parallel work facilities. And, it is assumed that each job j is received at the time point _{r j} and requires a processing time of _{t j. In addition, it is assumed that C ik} is the completion time of the k-th task processed in the work facility i as a decision variable to be determined through the establishment of the work schedule plan. And, _{it is assumed that X ijk} is an integer variable of 0 or 1 that has a value of 1 only when the job j is processed for the kth in the work facility i. Where i=1, 2,… , M, and j=1, 2,… , n, and k=1, 2,… , n.

Assuming that the makespan of the entire work schedule plan is C _max , the work schedule plan that minimizes the makespan of jobs to be processed during the cycle time T of the current cycle can be modeled and calculated using the following equation.

Equations 1 and 2 are for defining makespan, which is the purpose of the work schedule plan, and establishing a work schedule plan for minimizing makespan. Equation 3 is a definition of the completion time of each task. Equation 4 represents the limitation of the work completion time as only one work is processed at a time in the same work facility. Similarly, Equations 5 and 6 indicate that each work facility can process only one job at the same time, and each job should be processed only in one facility. Equation 7 is for establishing a forward work schedule plan to start processing tasks as early as possible.

As described above, each scheduler 20 checks the earliest work start time of the work equipment 111, 112, and 113 to which it belongs. This can be confirmed by using a block chain for tasks up to the previous cycle for each work facility for each cycle.

For example, in Equation 4, C _i0 may represent the earliest time at which work processing can be started for each work facility i. The value of C _i0 may be calculated from _{the value C ik} of the decision variable of the immediately preceding period using Equations 1 to 8.

Such a work schedule plan generation can be repeatedly performed to establish a work schedule plan for the entire work.

Next, referring to FIG. 5, FIG. 5 shows a method of operating the selector 30 and the broadcaster 40.

In step S510, the selector 30 receives a work schedule plan from each scheduler (20).

In step S520, the selector 30 sets a selection criterion according to a user input, and selects any one of the received work schedule plans of each scheduler 20 by using the set selection criterion.

Here, the selection criterion may be a work schedule plan with the smallest makespan or a work schedule plan established at the earliest.

For example, when a work schedule plan having the smallest makespan is selected, a mixed constant planning method according to Equations 1 to 8 described above may be used.

In step S530, the broadcaster 40 generates a block of the work schedule plan of the scheduler 20 selected by the selector 30, and broadcasts the generated block to the plurality of schedulers 20.

Accordingly, each scheduler 20 may establish an overall work schedule plan by adding the broadcasted block as the last block of the current blockchain.

In this way, each work schedule plan established by each scheduler 20 based on a block chain is the same as each other. Accordingly, the blockchain-based scheduling system according to an embodiment of the present invention can have a long path of information security and integrity, and distributed processing in a distributed environment.

Meanwhile, the constituent elements of the above-described embodiment can be easily grasped from a process point of view. That is, each component can be identified as a respective process. In addition, the process of the above-described embodiment can be easily grasped from the viewpoint of the components of the device.

In addition, the above-described technical contents may be implemented in the form of program instructions that can be executed through various computer means and recorded in a computer-readable medium. The computer-readable medium may include program instructions, data files, data structures, etc. alone or in combination. The program instructions recorded on the medium may be specially designed and configured for the embodiments, or may be known and usable to those skilled in computer software. Examples of computer-readable recording media include magnetic media such as hard disks, floppy disks, and magnetic tapes, optical media such as CD-ROMs and DVDs, and magnetic media such as floptical disks. -A hardware device specially configured to store and execute program instructions such as magneto-optical media, and ROM, RAM, flash memory, and the like. Examples of program instructions include not only machine language codes such as those produced by a compiler, but also high-level language codes that can be executed by a computer using an interpreter or the like. The hardware device may be configured to operate as one or more software modules to perform the operations of the embodiments, and vice versa.

The above-described embodiments of the present invention are disclosed for the purpose of illustration, and those skilled in the art who have ordinary knowledge of the present invention will be able to make various modifications, changes, and additions within the spirit and scope of the present invention. It should be seen as falling within the scope of the following claims.

10: reception desk
20: scheduler
30: selector
40: broadcaster

Claims (7)

In a blockchain-based scheduling system,
A receiver for receiving job information on a job to be processed, receiving a job, and classifying the received job by period;
A plurality of schedulers for establishing a work schedule plan for the received job according to the period of the job classified by the receptionist;
A selector for selecting one of a plurality of work schedule plans established by the plurality of schedulers according to a preset selection criterion; And
A broadcaster for generating a work schedule plan selected by the selector as a block and broadcasting the generated block to the plurality of schedulers,
Each of the plurality of schedulers forms a block chain by adding the blocks received from the broadcaster to determine a work schedule plan for tasks processed up to the current cycle.
The method of claim 1,
The receiver receives the period time for each period, sets the period time for each period, and transmits information on jobs to be processed for each period according to the classification to the plurality of schedulers,
Blockchain-based scheduling system, characterized in that the cycle times for each cycle are all set equally or in inverse proportion to the number of requests for processing work.
The method of claim 1,
The plurality of schedulers set a work schedule plan establishment method specified by a user, generate a work schedule plan using the set work schedule plan establishment method, and transmit the generated work schedule plan to the selector,
The work schedule planning method may include a Longest Processing Time (LPT) method in which a job with a long processing time is first processed, an ERD (Earliest Ready Date) method in which a job with a fast reception time is processed first, and a plurality of work schedule plans A block characterized by including a Particle Swarm Optimization (PSO) method and a mixed integer programming (MIP) method for selecting a work schedule when it is determined that there is no more good schedule while searching for a better schedule plan. Chain-based scheduling system.
The method of claim 3,
When the work schedule plan establishment method is set to the mixed water purification planning method
The plurality of schedulers calculate a work schedule plan that minimizes _{makespan (C max} ) of tasks to be processed during a cycle time T of the current cycle using the following equation.

Here, C _ik is the completion time of the k-th task processed in _{the work facility i, X ijk} is a variable of 0 or 1 that has a value of 1 only when the work j is processed in the k-th time in the work facility i, i =1, 2,… , M, and j=1, 2,… , n, and k=1, 2,… , is n
The method of claim 3,
The plurality of schedulers wait for the job to be processed to be received, and when the job to be processed is received, check the earliest job start time of the affiliated work facility, and plan the work schedule according to the identified fastest job start time. Blockchain-based scheduling system, characterized in that to create a.
The method of claim 3,
The selector sets the selection criteria according to a user input, and selects any one of the received work schedule plans of each scheduler using the set selection criteria,
The selection criterion is a blockchain-based scheduling system, characterized in that makespan is the smallest work schedule plan or the fastest established work schedule plan.
The method of claim 6,
When a work schedule plan having the smallest makespan is selected as the selection criterion, the selector selects any one of the work schedule plans of each scheduler using the mixed integer planning method.

Images