CN112651672A

CN112651672A - Dispatching planning method for human resources and related equipment

Info

Publication number: CN112651672A
Application number: CN202110064335.XA
Authority: CN
Inventors: 苗艳丽; 王莹; 何喆; 马晓兵; 马铁勇; 于娜
Original assignee: China Travelsky Holding Co
Current assignee: China Travelsky Technology Co Ltd; China Travelsky Holding Co
Priority date: 2021-01-18
Filing date: 2021-01-18
Publication date: 2021-04-13

Abstract

The application provides a labor allocation planning method and related equipment for human resources, which can reduce the workload of labor allocation planning personnel and improve the labor allocation efficiency and the utilization rate of human resources. The method comprises the following steps: obtaining N flights within a preset time length, wherein N is a positive integer greater than or equal to 1; determining at least one dispatching task of a first target flight and human resources within the preset time length, wherein the first target flight is any one flight of the N flights; acquiring the allocation rule of the human resources and the shift plan of the human resources; determining a dispatching parameter corresponding to the at least one dispatching task; and carrying out dispatching arrangement on the human resources based on the dispatching parameters, the distribution rules and the shift plan to obtain a dispatching planning result of the human resources.

Description

Dispatching planning method for human resources and related equipment

Technical Field

The application relates to the field of aviation, in particular to a manpower resource dispatching planning method and related equipment.

Background

With the rapid development of aviation business of large-scale aviation departments (referring to airlines with multiple stations and more ground service staffs, complex ground service organization structures and more ground service scenes), the number of flights is continuously increased, and the defects of the traditional ground support commanding and dispatching mode are gradually revealed. In recent years, in the field of aviation ground service, resource management systems dominated by airlines or airport service and guarantee are established.

Most of the airlines lack system support in the aspect of resource scheduling at present, and basically depend on the personal experience and the capability of a dispatcher to manually dispatch. Particularly for a large navigation department, the number of ground service personnel is large, the service scene is complex, and the labor production efficiency is low due to the adoption of a mode of dispatching people through brain shift scheduling and interphone commanding. The traditional dispatching mode distributes tasks by depending on paper receipts and interphones, and manually distributes the tasks, so that the workload is large, the adjustment amount of the distributed tasks is large under the condition that flights are delayed in a large area, and the dispatching efficiency and the resource utilization rate are low.

Disclosure of Invention

The application provides a manpower resource dispatching planning method and related equipment, which can reduce the workload of dispatching planning personnel and improve the dispatching efficiency and the utilization rate of manpower resources.

A first aspect of the embodiments of the present application provides a method for scheduling human resources, including:

obtaining N flights within a preset time length, wherein N is a positive integer greater than or equal to 1;

determining at least one dispatching task of a first target flight and human resources within the preset time length, wherein the first target flight is any one flight of the N flights;

acquiring the allocation rule of the human resources and the shift plan of the human resources;

determining a dispatching parameter corresponding to the at least one dispatching task;

and carrying out dispatching arrangement on the human resources based on the dispatching parameters, the distribution rules and the shift plan to obtain a dispatching planning result of the human resources.

A second aspect of the embodiments of the present application provides a manpower resource dispatching planning apparatus, including:

the system comprises a first acquisition unit, a second acquisition unit and a control unit, wherein the first acquisition unit is used for acquiring N flights within a preset time length, and N is a positive integer greater than or equal to 1;

a first determining unit, configured to determine at least one dispatch task of a first target flight and human resources within the preset time duration, where the first target flight is any one of the N flights;

a second acquiring unit, configured to acquire an allocation rule of the human resources and a shift plan of the human resources;

the second determining unit is used for determining the dispatching parameters corresponding to the at least one dispatching task;

and the dispatching planning unit is used for dispatching and arranging the human resources based on the dispatching parameters, the distribution rules and the shift plan to obtain a dispatching planning result of the human resources.

A third aspect of the present application provides a computer apparatus comprising at least one processor and a memory connected to each other, wherein the memory is used for storing program codes, and the program codes are loaded and executed by the processor to implement the steps of the dispatch planning method for human resources according to the first aspect.

A fourth aspect of the present application provides a machine-readable medium comprising instructions which, when run on a machine, cause the machine to perform the steps of the method for dispatch planning of human resources of the first aspect described above.

In summary, it can be seen that, in the embodiment provided in the present application, the dispatch planning apparatus for human resources can first preset the dispatch tasks corresponding to the N flights within the duration, preset the distribution rules of available human resources within the duration, the shift plans of human resources, and the dispatch parameters of the dispatch tasks, and then dispatch the human resources according to the distribution rules of human resources, the shift plans, and the dispatch parameters of the dispatch tasks to obtain the dispatch planning result, so that when dispatching, the dispatch can be performed based on the dispatch planning result. Compared with the prior art that the dispatching is carried out manually, the method can reduce the workload of dispatching planners, and improve the dispatching efficiency and the utilization rate of human resources.

Drawings

The above and other features, advantages and aspects of various embodiments of the present application will become more apparent from the following detailed description when taken in conjunction with the accompanying drawings. Throughout the drawings, the same or similar reference numbers refer to the same or similar elements. It should be understood that the drawings are schematic and that elements and features are not necessarily drawn to scale.

FIG. 1 is a flowchart illustrating a human resource dispatching planning method according to an embodiment of the present disclosure;

fig. 2 is a schematic view of a virtual structure of a human resource dispatching planning device according to an embodiment of the present disclosure;

FIG. 3 is a schematic structural diagram of a machine-readable medium provided by an embodiment of the present application;

fig. 4 is a schematic hardware structure diagram of a server according to an embodiment of the present application.

Detailed Description

Embodiments of the present application will be described in more detail below with reference to the accompanying drawings. While certain embodiments of the present application are shown in the drawings, it should be understood that the present application may be embodied in various forms and should not be construed as limited to the embodiments set forth herein, but rather are provided for a more thorough and complete understanding of the present application. It should be understood that the drawings and embodiments of the present application are for illustration purposes only and are not intended to limit the scope of the present application.

The terms "include" and variations thereof as used herein are inclusive and open-ended, i.e., "including but not limited to. The term "based on" is "based, at least in part, on". The term "one embodiment" means "at least one embodiment"; the term "another embodiment" means "at least one additional embodiment"; the term "some embodiments" means "at least some embodiments". Relevant definitions for other terms will be given in the following description.

It should be noted that the terms "first", "second", and the like in the present application are only used for distinguishing different devices, modules or units, and are not used for limiting the order or interdependence relationship of the functions performed by the devices, modules or units.

It is noted that references to "a", "an", and "the" modifications in this application are intended to be illustrative rather than limiting, and that those skilled in the art will recognize that reference to "one or more" unless the context clearly dictates otherwise.

The method for scheduling manpower resources is described below from the perspective of a device for scheduling manpower resources, and the device for scheduling manpower resources may be a server or a service unit in the server, and is not particularly limited.

Referring to fig. 1, fig. 1 is a schematic flow chart illustrating a human resource dispatching planning method according to an embodiment of the present application, including:

101. and acquiring N flights within a preset time length.

In this embodiment, the manpower resource dispatching planning device may obtain N flights within a preset duration, that is, the resource planning device may obtain a plurality of flights within a future period of time, and the manner of obtaining the flights within the preset duration is not limited herein, for example, the manpower resource dispatching planning device may obtain N flights within the preset duration from the flight planning system.

It should be noted that the preset time period is a time period after the current time, that is, a time period in the future, for example, a week in the future and 15 days in the future, in addition, the preset time period may also be a specific time period after the current time, for example, the current time is 11 months and 15 days, the preset time period may be 11 months and 20 days to 11 months and 25 days, and of course, the preset time period may also be set according to an actual situation, and is not particularly limited.

102. At least one dispatching task of the first target flight and human resources within a preset time length are determined.

In this embodiment, after obtaining N flights within the preset time, the dispatch plan of the human resources may determine at least one dispatch task of a first target flight and the human resources within the preset time, where the first target flight is any one of the N flights, the dispatch task may include a crew guidance task, a cone bucket placing task, all service tasks from the aircraft to the middle of the aircraft takeoff again, including a passenger ladder vehicle task, a passenger train receiving task, a passenger entering and leaving task, and a baggage unloading task, and the human resources within the preset time refer to the number of employees available within the preset time and the qualification of each employee.

103. And acquiring a distribution rule of the human resources and a shift plan of the human resources.

In this embodiment, after obtaining the human resources within the preset duration, the human resource dispatching planning device may obtain an allocation rule of the human resources within the preset duration and a shift plan of the human resources within the preset duration, where the allocation rule refers to an allocation rule of a person, that is, the allocation rule is to be matched with a position of the person, where the person is allocated to a dispatching task; the shift plan refers to the shift type of the staff (shift type refers to several times of a day, for example, five times of a day) and the corresponding number, which refers to how many staff can execute each shift type.

104. And determining a dispatching parameter corresponding to at least one dispatching task.

In this embodiment, the dispatch planning apparatus for human resources may determine a dispatch parameter corresponding to at least one dispatch task, where the method of determining the dispatch parameter corresponding to the dispatch task is not particularly limited, and may be, for example, manually input by a human, or may be obtained from data; the dispatching parameters comprise task attributes of each dispatching task in at least one dispatching task, task descriptions of each dispatching task in at least one dispatching task, the number of the dispatching tasks in at least one dispatching task, the cost of each dispatching task in at least one dispatching task, work preparation time, task starting time, task ending time, dispatching intervals, alarm time, pre-dispatching window time and task locking time.

The task description comprises a specific position of the task, a location of the task (the airport is divided into a plurality of areas, each area has a corresponding location, and the area of the task refers to which location the task is specifically executed in), a distance between the location of the task and a start location of the task, a specific description of the task (what the task is specifically done), a start location of the task, and an end location of the task. The work preparation duration refers to a period of time before the dispatching task starts, such as the handover of work for shift change, which is non-guarantee time; the task starting time refers to the starting time of a first dispatching task corresponding to a flight within a preset time length; the task ending time refers to the ending time of the last dispatching task corresponding to the flight within the preset time length, for example, the preset time length is 1 day, and the task ending time refers to the ending time of the last dispatching task in the dispatching tasks corresponding to the flight on the day; the dispatching interval refers to the time interval for carrying out rolling dispatching together; the alarm duration refers to the alarm for the time before the dispatching task starts; the pre-dispatching window duration refers to taking dispatching tasks within a long time period within a preset duration to automatically dispatch (it can be understood that the pre-dispatching window duration may be less than or equal to the preset duration); the task locking duration refers to that after the dispatching task is successfully distributed and the worker receives the dispatching task, the received dispatching task is locked within a specified time, and the corresponding worker is not changed.

105. And carrying out dispatching arrangement on the human resources based on the dispatching parameters, the distribution rules and the shift plan to obtain a dispatching planning result of the human resources.

In this embodiment, after obtaining the dispatching parameter corresponding to at least one dispatching task, the allocation rule of the human resources within the preset duration, and the shift plan of the human resources within the preset duration, the dispatching planning device of the human resources may dispatch the human resources within the preset duration based on the dispatching parameter, the allocation rule, and the shift plan, so as to obtain a dispatching planning result of the human resources. Specifically, the method comprises the following steps: the dispatching planning device of the human resources can obtain all feasible task combinations corresponding to the human resources according to dispatching parameters, distribution rules and shift plans, wherein each task in the task combinations comprises at least one human resource number in the task resources; and inputting the task combination into an integer programming solver to obtain a dispatching programming result of the human resources. That is to say, the dispatching planning device for human resources may train a model in advance, and dispatch and arrange the human resources based on the model to obtain a dispatching public telephone result corresponding to the human resources, where the principle of the model is to enumerate all possible task combination lists corresponding to the human resources, and input the possible task combination lists into an integer planning solver to obtain an optimal solution, where the optimal solution is the dispatching planning result.

In one embodiment, the manpower resource dispatching planning device may determine a target manpower resource corresponding to a second target flight and completion data of a first target dispatching task corresponding to the second target flight, where the second target flight is a problem flight within the preset time length;

and adjusting the target dispatching task set according to the target human resources and the completion data of the first target dispatching task to obtain a first dispatching planning result, wherein the target dispatching task set is a set of unfinished dispatching tasks in at least one dispatching task.

In this embodiment, in order to respond to an emergency generated in the working process in real time, such as a late flight, a cancellation of a flight, and the like, the dispatch planning apparatus for human resources may analyze a new dispatch task according to the obtained dispatch planning result and a completion condition of a dispatch task in the at least one dispatch task, find a task in which a conflict occurs due to a change of information of the dispatch task and an unassigned new task in the at least one dispatch task, and perform fast re-dispatch, thereby having a very fast response speed. That is, the manpower resource dispatching planning device may first determine a dispatching task corresponding to a problem flight (the problem flight may be, for example, a late flight or a cancelled flight, and certainly may also be a newly added flight, which is not specifically limited as long as the flight is not within N flights), determine the manpower resource of the dispatching task and completion data of the dispatching task, and then adjust an unforted task of at least one dispatching task according to the target manpower resource and the completion data of the first target dispatching task to obtain a first dispatching planning result.

In one embodiment, the adjusting the target dispatching task set according to the target human resources and the completion data of the first target dispatching task by the dispatching planning device of human resources comprises:

judging whether a second target dispatching task exists in the target dispatching task set or not, wherein the second target dispatching task is at least one task which has time conflict with the first target dispatching task in the target dispatching task set;

if so, unbinding the second target dispatching task;

enumerating all feasible combination modes of the second target dispatching task after unbinding and tasks which are not dispatched in the target dispatching task set to generate a target queue;

and solving the possible rows and columns of the target through an integer programming solver to obtain a first dispatching programming result.

In this embodiment, the manpower resource dispatching planning device may first analyze connection rationality between the dispatching tasks, enumerate all feasible combination manners of tasks that need to be reassigned, and finally input the analysis result to the integer planning solver to solve, so as to obtain a latest dispatching planning result, where the specific manpower resource dispatching planning device traverses whether a second target dispatching task having a time conflict with the first target dispatching task exists among the uncompleted dispatching tasks in at least one task, and if there are all dispatching tasks having a conflict with the first target dispatching task, then generates a feasible row and a feasible row by enumerating all feasible combination manners of the unbound conflict tasks and tasks having no dispatching in the target dispatching task set, and solves through the integer planning solver, so as to obtain the latest dispatching planning result.

It is to be understood that the flowchart and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present application. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams and/or flowchart illustration, and combinations of blocks in the block diagrams and/or flowchart illustration, can be implemented by special purpose hardware-based systems which perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.

The names of messages or information exchanged between a plurality of devices in the embodiments of the present application are for illustrative purposes only, and are not intended to limit the scope of the messages or information.

Although the operations are depicted in a particular order, this should not be understood as requiring that such operations be performed in the particular order shown or in sequential order. Under certain circumstances, multitasking and parallel processing may be advantageous.

It should be understood that the various steps recited in the method embodiments of the present application may be performed in a different order and/or in parallel. Moreover, method embodiments may include additional steps and/or omit performing the illustrated steps. The scope of the present application is not limited in this respect.

Additionally, the present application may also be written with computer program code for performing the operations of the present application in one or more programming languages, including, but not limited to, an object oriented programming language such as Java, Smalltalk, C + +, and conventional procedural programming languages, such as the "C" programming language or similar programming languages. The program code may execute entirely on the user's computer, partly on the user's computer, as a stand-alone software package, partly on the user's computer and partly on a remote computer or entirely on the remote computer or server. In the case of a remote computer, the remote computer may be connected to the user's computer through any type of network, including a Local Area Network (LAN) or a Wide Area Network (WAN), or the connection may be made to an external computer (for example, through the Internet using an Internet service provider).

The present application is described above in terms of a method for scheduling dispatch of human resources, and the present application is described below in terms of a device for scheduling dispatch of human resources.

Referring to fig. 2, fig. 2 is a schematic view of a virtual structure of a human resource dispatch planning apparatus 200 according to an embodiment of the present application, including:

a first obtaining unit 201, configured to obtain N flights within a preset time duration, where N is a positive integer greater than or equal to 1;

a first determining unit 202, configured to determine at least one dispatch task of a first target flight and human resources within the preset time duration, where the first target flight is any one of the N flights;

a second obtaining unit 203, configured to obtain an allocation rule of the human resources and a shift plan of the human resources;

a second determining unit 204, configured to determine a dispatch parameter corresponding to the at least one dispatch task;

the dispatch planning unit 205 is configured to perform dispatch arrangement on the human resources based on the dispatch parameters, the allocation rules, and the shift plan, so as to obtain a dispatch planning result of the human resources.

In a possible implementation manner, the dispatch planning unit 205 is specifically configured to:

obtaining all feasible task combination lists corresponding to the human resources according to the dispatching parameters, the allocation rules and the shift plan, wherein each task in the task combination lists comprises at least one human resource number in the task resources;

and inputting the task combination column into an integer programming solver to obtain a dispatching programming result of the human resources.

In a possible implementation manner, the first determining unit 201 is further configured to determine a target human resource corresponding to a second target flight and completion data of a first target dispatch task corresponding to the second target flight, where the second target flight is a problem flight within the preset time length;

the dispatch planning unit 205 is further configured to adjust a target dispatch task set according to the target human resources and the completion data of the first target dispatch task to obtain a first dispatch planning result, where the target dispatch task set is a set of unfinished dispatch tasks in the at least one dispatch task.

In one possible implementation manner, the adjusting, by the dispatch planning unit 205, the target dispatch task set according to the target human resources and the completion data of the first target dispatch task includes:

judging whether a second target dispatching task exists in the target dispatching task set or not, wherein the second target dispatching task is at least one task which is in time conflict with the first target dispatching task in the target dispatching task set;

if so, unbinding the second target dispatching task;

and solving the possible rows and columns of the target through an integer programming solver to obtain the first dispatching programming result.

In a possible implementation manner, the dispatch parameter includes:

the task attribute of each of the at least one dispatching task, the task description of each of the at least one dispatching task, the number of the dispatching tasks in the at least one dispatching task, the cost of each of the at least one dispatching task, the work preparation time, the task starting time, the task ending time, the dispatching interval, the alarm time, the pre-dispatching window time and the task locking time.

It should be noted that the units described in the embodiments of the present application may be implemented by software, and may also be implemented by hardware. Here, the name of the unit does not constitute a limitation of the unit itself in some cases, and for example, the acquisition unit may also be described as "a unit that acquires credential information of a target user".

The functions described herein above may be performed, at least in part, by one or more hardware logic components. For example, without limitation, exemplary types of hardware logic components that may be used include: field Programmable Gate Arrays (FPGAs), Application Specific Integrated Circuits (ASICs), Application Specific Standard Products (ASSPs), systems on a chip (SOCs), Complex Programmable Logic Devices (CPLDs), and the like.

Referring to fig. 3, fig. 3 is a schematic diagram of an embodiment of a machine-readable medium according to the present application.

As shown in FIG. 3, the embodiment provides a machine-readable medium 300, on which a computer program 311 is stored, wherein the computer program 311, when executed by a processor, implements the steps of the dispatch planning method for human resources as described in FIG. 1.

In the context of this application, a machine-readable medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device. The machine-readable medium may be a machine-readable signal medium or a machine-readable storage medium. A machine-readable medium may include, but is not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any suitable combination of the foregoing. More specific examples of a machine-readable storage medium would include an electrical connection based on one or more wires, a portable computer diskette, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing.

It should be noted that the machine-readable medium described above in this application may be a computer-readable signal medium or a computer-readable storage medium or any combination of the two. A computer readable storage medium may be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any combination of the foregoing. More specific examples of the computer readable storage medium may include, but are not limited to: an electrical connection having one or more wires, a portable computer diskette, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing. In the present application, a computer readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device. In this application, however, a computer readable signal medium may include a propagated data signal with computer readable program code embodied therein, for example, in baseband or as part of a carrier wave. Such a propagated data signal may take many forms, including, but not limited to, electro-magnetic, optical, or any suitable combination thereof. A computer readable signal medium may also be any computer readable medium that is not a computer readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device. Program code embodied on a computer readable medium may be transmitted using any appropriate medium, including but not limited to: electrical wires, optical cables, RF (radio frequency), etc., or any suitable combination of the foregoing.

The computer readable medium may be embodied in the electronic device; or may exist separately without being assembled into the electronic device.

Referring to fig. 4, fig. 4 is a schematic diagram of a hardware structure of a server according to an embodiment of the present disclosure, where the server 400 may have a relatively large difference due to different configurations or performances, and may include one or more Central Processing Units (CPUs) 422 (e.g., one or more processors) and a memory 432, and one or more storage media 430 (e.g., one or more mass storage devices) storing an application 442 or data 444. Wherein the memory 432 and storage medium 430 may be transient or persistent storage. The program stored on the storage medium 430 may include one or more modules (not shown), each of which may include a series of instruction operations for the server. Still further, the central processor 422 may be arranged to communicate with the storage medium 430, and execute a series of instruction operations in the storage medium 430 on the server 400.

The server 400 may also include one or more power supplies 426, one or more wired or wireless network interfaces 450, one or more input-output interfaces 458, and/or one or more operating systems 441, such as Windows Server, Mac OS XTM, UnixTM, LinuxTM, FreeBSDTM, and so forth.

The steps performed by the dispatch planning apparatus for human resources in the above embodiment may be based on the server structure shown in fig. 4.

It should be further noted that, according to the embodiment of the present application, the process of the dispatch planning method for human resources described in the flowchart of fig. 1 above can be implemented as a computer software program. For example, embodiments of the present application include a computer program product comprising a computer program carried on a non-transitory computer readable medium, the computer program containing program code for performing the method illustrated in the flow chart diagram of fig. 2 described above.

Although the subject matter has been described in language specific to structural features and/or methodological acts, it is to be understood that the subject matter defined in the appended claims is not necessarily limited to the specific features or acts described above. Rather, the specific features and acts described above are disclosed as example forms of implementing the claims.

While several specific implementation details are included in the above discussion, these should not be construed as limitations on the scope of the application. Certain features that are described in the context of separate embodiments can also be implemented in combination in a single embodiment. Conversely, various features that are described in the context of a single embodiment can also be implemented in multiple embodiments separately or in any suitable subcombination.

The above description is only a preferred embodiment of the application and is illustrative of the principles of the technology employed. It will be appreciated by those skilled in the art that the scope of the disclosure herein is not limited to the particular combination of features described above, but also encompasses other arrangements formed by any combination of the above features or their equivalents without departing from the spirit of the disclosure. For example, the above features may be replaced with (but not limited to) features having similar functions disclosed in the present application.

Claims

1. A method for dispatching and planning human resources is characterized by comprising the following steps:

2. The method of claim 1, wherein the dispatching the human resources based on the dispatching parameters, the allocation rules, and the shift plans comprises:

3. The method of claim 1, further comprising:

determining target human resources corresponding to a second target flight and completion data of a first target dispatching task corresponding to the second target flight, wherein the second target flight is a problem flight within the preset duration;

and adjusting a target dispatching task set according to the target human resources and the completion data of the first target dispatching task to obtain a first dispatching planning result, wherein the target dispatching task set is a set of unfinished dispatching tasks in the at least one dispatching task.

4. The method of claim 3, wherein adjusting a set of target dispatch tasks based on the target human resources and completion data for the first target dispatch task comprises:

if so, unbinding the second target dispatching task;

5. The method according to any one of claims 1 to 4, wherein the dispatch parameters include:

6. A manpower resource dispatching planning device is characterized by comprising:

7. The apparatus of claim 6, wherein the dispatch plan unit is specifically configured to:

8. The apparatus of claim 6,

the first determining unit is further configured to determine a target human resource corresponding to a second target flight and completion data of a first target dispatching task corresponding to the second target flight, where the second target flight is a problem flight within the preset duration;

the dispatch planning unit is further configured to adjust a target dispatch task set according to the target human resources and the completion data of the first target dispatch task to obtain a first dispatch planning result, where the target dispatch task set is a set of unfinished dispatch tasks in the at least one dispatch task.

9. The apparatus of claim 8, wherein the dispatch planning unit adjusting the set of target dispatch tasks based on the target human resources and completion data for the first target dispatch task comprises:

if so, unbinding the second target dispatching task;

10. A machine-readable medium comprising instructions which, when executed on a machine, cause the machine to perform the steps of the method of dispatch planning for human resources of any of claims 1 to 5.