CN106815720A - The global adaptation system and method for automatic scheduling - Google Patents
The global adaptation system and method for automatic scheduling Download PDFInfo
- Publication number
- CN106815720A CN106815720A CN201710044605.4A CN201710044605A CN106815720A CN 106815720 A CN106815720 A CN 106815720A CN 201710044605 A CN201710044605 A CN 201710044605A CN 106815720 A CN106815720 A CN 106815720A
- Authority
- CN
- China
- Prior art keywords
- teams
- groups
- overtime
- group
- 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.)
- Pending
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/10—Office automation; Time management
- G06Q10/109—Time management, e.g. calendars, reminders, meetings or time accounting
- G06Q10/1093—Calendar-based scheduling for persons or groups
- G06Q10/1097—Task assignment
Landscapes
- Business, Economics & Management (AREA)
- Human Resources & Organizations (AREA)
- Engineering & Computer Science (AREA)
- Strategic Management (AREA)
- Entrepreneurship & Innovation (AREA)
- Operations Research (AREA)
- Economics (AREA)
- Marketing (AREA)
- Data Mining & Analysis (AREA)
- Quality & Reliability (AREA)
- Tourism & Hospitality (AREA)
- Physics & Mathematics (AREA)
- General Business, Economics & Management (AREA)
- General Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention discloses a kind of global adaptation system and method for automatic scheduling, the global adaptation method is comprised the following steps：S1, the multiple quitting times for obtaining all teams and groups, the corresponding work hours are calculated according to the quitting time；S2, the work hours are traveled through, obtain the work hours the latest；S3, multiple work hours are contrasted with the work hours the latest, acquisition is not more than the teams and groups corresponding to the work hours of very first time value with the time interval of the work hours the latest；S4, working duration one second time value of reduction by the corresponding teams and groups.The global adaptation system and method for automatic scheduling of the invention are by shortening the working duration of specific teams and groups, it is ensured that the fairness of the automatic scheduling of all teams and groups, improve manpower utilization.
Description
Technical field
The present invention relates to Internet technical field, the global adaptation system and method for more particularly to a kind of automatic scheduling.
Background technology
Arrange an order according to class and grade is the important means of reasonable arrangement working manpower, the equal extensive use in all enterprises.Arrange an order according to class and grade mainly root
According to company's practical business development need, each time period interior working manpower is reasonably arranged, it is ensured that meet corporate business demand, and
The waste of human resources is not caused again.Mostly arranged an order according to class and grade manually by administrative staff or the special Shi Jinhang that arranges an order according to class and grade in general enterprises,
There is natural defect in the working method：1) result of arranging an order according to class and grade is difficult to quantization and compares, experience, technical ability, adaptability to changes of the personnel that arrange an order according to class and grade etc.
The overall qualities of each side can all influence result of arranging an order according to class and grade.2) efficiency arranged an order according to class and grade is low, time-consuming, and the operating pressure to the personnel of arranging an order according to class and grade is carried
Go out high requirement.3) each personnel of arranging an order according to class and grade has arrange an order according to class and grade style and the preference of oneself, and result of arranging an order according to class and grade can be caused to there is larger difference, right
There is certain test in the capacity of self-regulation of working employee.
The content of the invention
The technical problem to be solved in the present invention is to overcome in the prior art using efficiency of being arranged an order according to class and grade caused by arranging an order according to class and grade manually
A kind of not high, defect that fairness of arranging an order according to class and grade is poor, there is provided the global adaptation system and method for automatic scheduling.
The present invention is to solve above-mentioned technical problem by following technical proposals：
A kind of global adaptation method of automatic scheduling, comprises the following steps：
S1, the multiple quitting times for obtaining all teams and groups, the corresponding work hours are calculated according to the quitting time；
S2, the work hours are traveled through, obtain the work hours the latest；
S3, multiple work hours are contrasted with the work hours the latest, obtain with it is described go to work the latest when
Between time interval be not more than teams and groups corresponding to the work hours of very first time value；
S4, working duration one second time value of reduction by the corresponding teams and groups.
It is preferred that in step s 2, being traveled through to the quitting time, the earliest quitting time is obtained；
In step s3, multiple quitting times are contrasted with the earliest quitting time, obtain with it is described earliest under
The time interval of class's time is not less than the teams and groups corresponding to the quitting time of the 3rd time value.
It is preferred that before step S1, it is further comprising the steps of：
S00, the teams and groups include that multiple is actually put not group and multiple and can put not group, obtain described actually putting and not organize and described
The accumulative overtime not organized can be put.
It is preferred that after step S00, it is further comprising the steps of：
S01, obtain described actually putting there are in not group the teams and groups of minimum accumulative overtime, and can put in not group and have
The teams and groups of largest cumulative overtime, and the largest cumulative overtime is less than in the minimum accumulative overtime, exchange
It is described actually to put the teams and groups in not group with minimum accumulative overtime and described putting when worked overtime with largest cumulative in not group
Between teams and groups state of arranging an order according to class and grade；The state of arranging an order according to class and grade includes working and rests.
It is preferred that in step S01, by arranging an order according to class and grade for the teams and groups actually put and in not group there is minimum to add up overtime
State is set to working, and the state of arranging an order according to class and grade for putting the teams and groups with largest cumulative overtime in not group is set to stop
Breath.
A kind of global adaptation system of automatic scheduling, including：
Time-obtaining module, the multiple quitting times for obtaining all teams and groups, correspondence is calculated according to the quitting time
Work hours；
Time screening module, for being traveled through to the work hours, obtains the work hours the latest；
First contrast module, for multiple work hours to be contrasted with the work hours the latest, obtain with
The time interval of the work hours the latest is not more than the teams and groups corresponding to the work hours of very first time value；
Adjusting module, for the working duration of the corresponding teams and groups to be reduced into one second time value.
It is preferred that the time screening module is additionally operable to travel through the quitting time, the earliest quitting time is obtained；
First contrast module is additionally operable to be contrasted multiple quitting times with the earliest quitting time, obtains earliest with described
The time interval of quitting time is not less than the teams and groups corresponding to the quitting time of one the 3rd time value.
It is preferred that the global adaptation system also includes：Overtime acquisition module, the teams and groups include that multiple is actually put
Not group and multiple can put not group；The overtime acquisition module puts what is not organized for obtaining the not group of actually putting with described
Accumulative overtime.
It is preferred that the global adaptation system also includes the second contrast module, second contrast module is used to obtain institute
State actually to put and there are in not group the teams and groups of minimum accumulative overtime, and can put in not group there is largest cumulative overtime
Teams and groups, and the largest cumulative overtime is less than in the minimum accumulative overtime, exchange is described actually to put tool in not group
There are the teams and groups of minimum accumulative overtime and the state of arranging an order according to class and grade for putting the teams and groups with largest cumulative overtime in not group；
The state of arranging an order according to class and grade includes working and rests.
It is preferred that second contrast module is additionally operable to for described actually putting to have minimum accumulative overtime in not group
The state of arranging an order according to class and grade of teams and groups is set to working, and arranging an order according to class and grade the teams and groups put and have largest cumulative overtime in not group
State is set to rest.
Positive effect of the invention is：The global adaptation system and method for automatic scheduling of the invention can ensure
The fairness arranged an order according to class and grade of all teams and groups, improves manpower utilization.
Brief description of the drawings
Fig. 1 is the flow chart of the global adaptation method of the automatic scheduling of a preferred embodiment of the present invention.
Fig. 2 is the structural representation figure of the global adaptation system of the automatic scheduling of a preferred embodiment of the present invention.
Specific embodiment
The present invention is further illustrated below by the mode of embodiment, but does not therefore limit the present invention to described reality
Apply among a scope.
As shown in figure 1, a kind of global adaptation method of automatic scheduling, comprises the following steps：
Step 101, the teams and groups include that multiple actually puts not groups and multiple can put not group, obtain it is described actually put not group and
It is described to put the accumulative overtime not organized.
Step 102, obtain described actually putting there are in not group the teams and groups of minimum accumulative overtime, and can put not group
Teams and groups with largest cumulative overtime, and the largest cumulative overtime is less than in the minimum accumulative overtime,
Exchange and described actually put the teams and groups in not group with minimum accumulative overtime and described being put add with largest cumulative in not group
The state of arranging an order according to class and grade of the teams and groups of class's time；The state of arranging an order according to class and grade includes working and rests.Wherein, described actually putting in not group is had
The state of arranging an order according to class and grade of the teams and groups of minimum accumulative overtime is set to working, by it is described put worked overtime with largest cumulative in not group when
Between teams and groups the state of arranging an order according to class and grade be set to rest.By the way that the minimum for actually putting the teams and groups in not group in step 106 is repeated several times
The contrast of accumulative overtime and the largest cumulative overtime of the teams and groups that can be put in not group, until actually putting the teams and groups in not group
Minimum accumulative overtime be more than largest cumulative deck time of the teams and groups that can be put in not group.Ensure the history overtime work of each teams and groups
Time and put the not time and reach unanimity.
Such as, if being in the business busy season, when overtime work is arranged, history of the giving priority in arranging for overtime work cumulative time minimum teams and groups；
If being in business dull season, if arrangement is put when not, the accumulative most group of history of giving priority in arranging for overtime work.
Step 103, the multiple quitting times for obtaining all teams and groups, when calculating corresponding working according to the quitting time
Between.
Step 104, the work hours are traveled through, obtain the work hours the latest.And at step 104, to institute
Stating the quitting time is traveled through, and obtains the earliest quitting time.
Step 105, multiple work hours are contrasted with the work hours the latest, obtained and the most evening
The time interval of class's time is not more than the teams and groups corresponding to the work hours of very first time value.In step 105, also include：Will
Multiple quitting times are contrasted with the earliest quitting time, and acquisition is not less than with the time interval of the earliest quitting time
Teams and groups corresponding to the quitting time of the 3rd time value.Such as very first time value can be taken as 1 hour, the value of very first time value
It is not limited to this.
Step 106, working duration one second time value of reduction by the corresponding teams and groups.Such as second time value
It it is 0.5 hour, the value of the second time value is not limited to this.Can so require that the group first come to work daily is first come off duty, together
When avoid the occurrence of and come off duty after the group first come to work；And, daily while next group, its working lead time is no more than default
The very first time value.
So, by shortening the overtime work of the working duration and the corresponding teams and groups of adjustment of specific teams and groups and putting not, it is ensured that all
The fairness arranged an order according to class and grade of teams and groups, improves manpower utilization.
In actual computer program, can by multistage genetic algorithm come iteration obtaining optimal automatic scheduling table.
As shown in Fig. 2 a kind of global adaptation system of automatic scheduling, including：
Time-obtaining module 11, the multiple quitting times for obtaining all teams and groups, calculates right according to the quitting time
The work hours answered.
Time screening module 12, for being traveled through to the work hours, obtains the work hours the latest.
First contrast module 13, for multiple work hours to be contrasted with the work hours the latest, obtains
It is not more than the teams and groups corresponding to the work hours of very first time value with the time interval of the work hours the latest.
Adjusting module 14, for the working duration of the corresponding teams and groups to be reduced into one second time value.
The time screening module 12 is additionally operable to travel through the quitting time, obtains the earliest quitting time；It is described
First contrast module is additionally operable to be contrasted multiple quitting times with the earliest quitting time, obtains and is come off duty earliest with described
The time interval of time is not less than the teams and groups corresponding to the quitting time of one the 3rd time value.
The global adaptation system also includes：Overtime acquisition module 15, the teams and groups include that multiple actually puts not group
Not group can be put with multiple；The overtime acquisition module 15 is used to obtaining described actually to be put not group and described puts not organize tired
Meter overtime.
The global adaptation system also includes the second contrast module 16, and second contrast module 16 is used to obtain the reality
Border has the teams and groups of minimum accumulative overtime in putting not group, and can put the class with largest cumulative overtime in not group
Group, and be less than the largest cumulative overtime in the minimum accumulative overtime, exchanging described actually putting in not group has
The teams and groups of minimum accumulative overtime and the state of arranging an order according to class and grade for putting the teams and groups with largest cumulative overtime in not group；Institute
Stating the state of arranging an order according to class and grade includes working and rests.
Second contrast module 16 is additionally operable to the teams and groups actually put and in not group there is minimum to add up overtime
The state of arranging an order according to class and grade be set to working, and by the state of arranging an order according to class and grade of the teams and groups put and there is in not group largest cumulative overtime
It is set to rest.
By shortening the overtime work of the working duration and the corresponding teams and groups of adjustment of specific teams and groups and putting not, it is ensured that all teams and groups
The fairness arranged an order according to class and grade, improves manpower utilization.
Although the foregoing describing specific embodiment of the invention, it will be appreciated by those of skill in the art that this is only
For example, protection scope of the present invention is to be defined by the appended claims.Those skilled in the art without departing substantially from
On the premise of principle of the invention and essence, various changes or modifications can be made to these implementation methods, but these changes and
Modification each falls within protection scope of the present invention.
Claims (10)
1. a kind of global adaptation method of automatic scheduling, it is characterised in that comprise the following steps：
S1, the multiple quitting times for obtaining all teams and groups, the corresponding work hours are calculated according to the quitting time；
S2, the work hours are traveled through, obtain the work hours the latest；
S3, multiple work hours are contrasted with the work hours the latest, obtained and the work hours the latest
Time interval is not more than the teams and groups corresponding to the work hours of very first time value；
S4, working duration one second time value of reduction by the corresponding teams and groups.
2. the global adaptation method of automatic scheduling as claimed in claim 1, it is characterised in that in step s 2, under described
Class's time is traveled through, and obtains the earliest quitting time；
In step s3, multiple quitting times are contrasted with the earliest quitting time, obtain with it is described earliest come off duty when
Between time interval not less than the 3rd time value quitting time corresponding to teams and groups.
3. the global adaptation method of automatic scheduling as claimed in claim 1, it is characterised in that before step S1, also include
Following steps：
S00, the teams and groups include that multiple is actually put not group and multiple and can put not group, obtain the not group of actually putting and are put with described
The accumulative overtime not organized.
4. the global adaptation method of automatic scheduling as claimed in claim 3, it is characterised in that after step S00, also include
Following steps：
S01, obtain described actually putting there are in not group the teams and groups of minimum accumulative overtime, and can put in not group there is maximum
The teams and groups of accumulative overtime, and the largest cumulative overtime is less than in the minimum accumulative overtime, exchange described
Actually putting the teams and groups in not group with minimum accumulative overtime and described putting in not group has largest cumulative overtime
The state of arranging an order according to class and grade of teams and groups；The state of arranging an order according to class and grade includes working and rests.
5. the global adaptation method of automatic scheduling as claimed in claim 4, it is characterised in that in step S01, by the reality
The state of arranging an order according to class and grade that the teams and groups in not group with minimum accumulative overtime are put on border is set to working, and described putting in not group is had
The state of arranging an order according to class and grade of the teams and groups of largest cumulative overtime is set to rest.
6. the global adaptation system of a kind of automatic scheduling, it is characterised in that including：
Time-obtaining module, the multiple quitting times for obtaining all teams and groups, calculates on corresponding according to the quitting time
Class's time；
Time screening module, for being traveled through to the work hours, obtains the work hours the latest；
First contrast module, for multiple work hours to be contrasted with the work hours the latest, obtain with it is described
The time interval of work hours is not more than the teams and groups corresponding to the work hours of very first time value the latest；
Adjusting module, for the working duration of the corresponding teams and groups to be reduced into one second time value.
7. the global adaptation system of automatic scheduling as claimed in claim 6, it is characterised in that the time screening module is also used
Traveled through in the quitting time, obtain the earliest quitting time；When first contrast module is additionally operable to come off duty multiple
Between contrasted with the earliest quitting time, obtain and be not less than for one the 3rd time with the time interval of the earliest quitting time
Teams and groups corresponding to the quitting time of value.
8. the global adaptation system of automatic scheduling as claimed in claim 6, it is characterised in that the global adaptation system is also wrapped
Include：Overtime acquisition module, the teams and groups include that multiple is actually put not group and multiple and can put not group；The overtime obtains
Module puts the accumulative overtime not organized for obtaining the not group of actually putting with described.
9. the global adaptation system of automatic scheduling as claimed in claim 8, it is characterised in that the global adaptation system is also wrapped
Include the second contrast module, second contrast module is used to obtaining described actually putting in not group has minimum accumulative overtime
Teams and groups, and the teams and groups with largest cumulative overtime in not group can be put, and it is less than institute in the minimum accumulative overtime
State largest cumulative overtime, exchanging described actually putting in not group has the teams and groups of minimum accumulative overtime and described put not
The state of arranging an order according to class and grade of the teams and groups with largest cumulative overtime in group；The state of arranging an order according to class and grade includes working and rests.
10. the global adaptation system of automatic scheduling as claimed in claim 9, it is characterised in that second contrast module is also
For the state of arranging an order according to class and grade for actually putting the teams and groups in not group with minimum accumulative overtime to be set into working, and by institute
Stating can put the state of arranging an order according to class and grade of the teams and groups in not group with largest cumulative overtime and be set to rest.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710044605.4A CN106815720A (en) | 2017-01-19 | 2017-01-19 | The global adaptation system and method for automatic scheduling |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710044605.4A CN106815720A (en) | 2017-01-19 | 2017-01-19 | The global adaptation system and method for automatic scheduling |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN106815720A true CN106815720A (en) | 2017-06-09 |
Family
ID=59112338
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710044605.4A Pending CN106815720A (en) | 2017-01-19 | 2017-01-19 | The global adaptation system and method for automatic scheduling |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106815720A (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2019024474A1 (en) * | 2017-08-01 | 2019-02-07 | 平安科技（深圳）有限公司 | Scheduling method and apparatus for employees, and server and storage medium |
| CN112257981A (en) * | 2020-09-23 | 2021-01-22 | 安徽中科新辰技术有限公司 | Intelligent automatic scheduling method and system |
-
2017
- 2017-01-19 CN CN201710044605.4A patent/CN106815720A/en active Pending
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2019024474A1 (en) * | 2017-08-01 | 2019-02-07 | 平安科技（深圳）有限公司 | Scheduling method and apparatus for employees, and server and storage medium |
| CN112257981A (en) * | 2020-09-23 | 2021-01-22 | 安徽中科新辰技术有限公司 | Intelligent automatic scheduling method and system |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN103458052B (en) | Resource scheduling method and device based on IaaS cloud platform | |
| CN106502871B (en) | The alarm threshold dynamic configuration system and method for supervisory systems | |
| CN109409763B (en) | Dynamic test task scheduling method and scheduling platform based on greedy grouping strategy | |
| CN107566910B (en) | The customized distribution monitoring method of resource, storage medium, electronic equipment and system is broadcast live | |
| WO2013004706A4 (en) | System and method for personal stress analysis | |
| CN108197849A (en) | A kind of intelligent worksheet processing system and worksheet processing method based on automation | |
| CN105976105A (en) | Method and device for managing carbon emission | |
| CN105049298A (en) | Method and system for monitoring cloud resource | |
| CN109739818A (en) | A kind of portable high-throughput big data acquisition method and system | |
| CN110503396A (en) | Complex space crowdsourcing method for allocating tasks based on more technical ability | |
| CN108846555A (en) | A kind of efficient accurate enthesis of electric load big data missing values | |
| CN109583840A (en) | A kind of scheduling method, device and equipment | |
| CN106815720A (en) | The global adaptation system and method for automatic scheduling | |
| CN106209495A (en) | The report form generation method of a kind of cloud monitoring system and device | |
| CN106952034A (en) | The automatic scheduling method and system realized using genetic algorithm | |
| CN109767052A (en) | Autotask distribution method and system | |
| CN111400010A (en) | Task scheduling method and device | |
| CN107067150A (en) | Automatic scheduling method and system | |
| CN109460299B (en) | Distributed parallel multi-source social network data acquisition system and method | |
| CN104378239A (en) | Rapid reliability index statistical system and method based on cluster frame | |
| CN104331479A (en) | Data ordering method based on similarity calculation method | |
| CN107196875A (en) | A kind of network resource scheduling system based on Consumer's Experience | |
| Mealey et al. | Solving the habitat dispersion problem in forest planning | |
| CN108183870B (en) | Cloud data center resource scheduling and sharing method and system based on cloud maturity | |
| CN116383443A (en) | Big data information processing system and 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 | ||
| RJ01 | Rejection of invention patent application after publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20170609 |