Eureka AIR delivers breakthrough ideas for toughest innovation challenges, trusted by R&D personnel around the world.

Airport check-in personnel scheduling method based on constraint relaxation solution

A slack and check-in technology, applied in the field of personnel scheduling solution, can solve the problems that the scheduling results are out of reality, the problem solving brings great difficulty, and less consideration is given to the scheduling model, etc.

Pending Publication Date: 2021-06-25
GUANGDONG UNIV OF TECH
View PDF0 Cites 4 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0005] ①Most studies are based on an extremely ideal ratio of human resources and demand, so they seldom consider the unsolvable situation of the scheduling model; In terms of methods, either the right-hand term of the constraint is reset every time the solution is solved, or a certain constraint is generally eliminated and invalidated during the solution process, which often makes the scheduling results out of reality
[0006] The personnel scheduling problem itself is an NP-Hard problem. As the number of manpower and tasks increases, it will bring great difficulty to the solution of the problem.

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Airport check-in personnel scheduling method based on constraint relaxation solution
  • Airport check-in personnel scheduling method based on constraint relaxation solution
  • Airport check-in personnel scheduling method based on constraint relaxation solution

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0041] The essence of the personnel scheduling problem is a mathematical combination problem. The increase in the amount of tasks, the number of people, and the qualifications will lead to an exponential expansion of the search space. For large-scale personnel scheduling problems, there has always been no fast and accurate method, even to determine whether the problem has This solution takes a lot of time. The existing technology usually sets a set of constraint combinations, and then solves it through an algorithm. In the case of a surplus of manpower, it is easier to find a better solution than manual scheduling. However, once human resources are relatively scarce, it often leads to no solution, but there is no scheduling result. The output is unacceptable in the actual production process. Although the method of constraining the parameter setting of the right-hand item can allow the user to input multiple times, this method is cumbersome and inefficient.

[0042] Aiming at ...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

PUM

No PUM Login to View More

Abstract

The invention discloses an airport check-in personnel scheduling method based on constraint relaxation solution, and the method comprises the steps: carrying out the collection of basic information needed by the scheduling of all employees participating in the scheduling according to a flight task plan given by each airline company; the basic information comprises scheduling task information, employee information and constraint information, and constructing a qualification matrix between employees and tasks; constructing a scheduling model by adopting a constraint satisfaction technology, and performing soft and hard constraint division on rest time constraints in the model to form a soft constraint set and a hard constraint set; solving the constructed scheduling model by using the collected basic information, and if the scheduling model finds a feasible solution, outputting a scheduling result; and if the scheduling model has no solution, solving by using a constraint relaxation algorithm. The scheduling problem of different human resources and task requirements under different proportions can be effectively solved, the probability of model result output is increased from the perspective of scheduling result output, and actual production operation can be effectively coped with.

Description

technical field [0001] The present invention relates to the technical field of personnel scheduling solution, and specifically relates to a personnel scheduling method for obtaining feasible scheduling results by loosely adjusting the constraints during the solution process under the condition that the shortage of human resources cannot satisfy the initial constraint set. Background technique [0002] Under the effect of the development of economic globalization, the air transport industry has grown unprecedentedly, and the cooperation between domestic and foreign airlines and airports has become closer. The most intuitive manifestation is the increase in the number of flights, cargo transportation and passenger numbers. Large-scale airports acting as agents for foreign airlines have the following characteristics: ① international flight services are strict, and service personnel are required to be arranged at all times around the clock; ② different flights require check-in pe...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

Application Information

Patent Timeline
no application Login to View More
Patent Type & Authority Applications(China)
IPC IPC(8): G06Q10/06G06F30/20G06Q50/26G06F111/04
CPCG06Q10/06311G06F30/20G06Q50/26G06F2111/04Y02P90/30
Inventor 詹智勇刘建军陈庆新毛宁胡常伟徐国宁
Owner GUANGDONG UNIV OF TECH
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Eureka Blog
Learn More
PatSnap group products