CN104615712A - Method for fast judging whether time conflict exists in sanitation scheduling tasks - Google Patents
Method for fast judging whether time conflict exists in sanitation scheduling tasks Download PDFInfo
- Publication number
- CN104615712A CN104615712A CN201510060287.1A CN201510060287A CN104615712A CN 104615712 A CN104615712 A CN 104615712A CN 201510060287 A CN201510060287 A CN 201510060287A CN 104615712 A CN104615712 A CN 104615712A
- Authority
- CN
- China
- Prior art keywords
- data
- time
- recordn
- pstimevalue
- record
- 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
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/28—Databases characterised by their database models, e.g. relational or object models
- G06F16/284—Relational databases
-
- 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/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
- G06Q10/063—Operations research, analysis or management
- G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
- G06Q10/06311—Scheduling, planning or task assignment for a person or group
-
- 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
Abstract
The invention provides a method for fast judging whether time conflict exists in sanitation scheduling tasks. The method comprises the steps that when electronic scheduling is conducted, scheduling data are stored in a database according to a set data storage method, wherein the database adopts a relational database; when a new task plan is arranged, judgment is conducted according to a set data time conflict judgment rule, if the data conform to the conflict rule, reminding is conducted, and a friendly prompting message of plan conflict is provided; if the data do not conform to the conflict rule, the scheduling data of the new plan task is inserted into the database according to the set data inserting method, and a prompting message of data storage is provided. According to the method for fast judging whether the time conflict exists in the sanitation scheduling tasks, time conflict situations in the sanitation scheduling tasks can be effectively judged in special circumstances.
Description
Technical field
The present invention relates to environmental sanitation technical field, particularly relate to a kind of method whether quick time judging that environmental sanitation is arranged an order according to class and grade in task conflict.
Background technology
At present along with the development of computerized information, the software development of environmental sanitation aspect is rapid, a lot of environmental sanitation enterprise has started to utilize modern PC Tools software to carry out arranging an order according to class and grade of environmental sanitation routine work, namely manual scheduling is adopted, but in manual scheduling, same personnel or vehicle can only perform same task at one time, in view of time conflict judges complicated, current most of software all adopts manual type to judge, therefore how judges to become a kind of needs to the time conflict under arranging an order according to class and grade under many dates simultaneously fast.
Summary of the invention
The technical problem to be solved in the present invention, is a kind of method providing quick time judging that environmental sanitation is arranged an order according to class and grade in task whether to conflict, and the present invention effectively can solve environmental sanitation and to arrange an order according to class and grade the problem of the time conflict in task.
The present invention is achieved in that a kind of method whether quick time judging that environmental sanitation is arranged an order according to class and grade in task conflicts, described method is: when carrying out manual scheduling, by scheduling data according to one setting data storage method stored in database, database adopts relational database, when carrying out a new task plan and arranging, data time conflict judgment rule according to setting judges, if meet conflict, then point out, entry/exit conflicts prompting message arranged side by side, if do not meet conflict, then by the data inserted mode data inserting storehouse of the scheduling data of new task according to setting, and list preservation information.
Further, described data storage method is specially: set two task scheduling tables, table name is respectively FutureTask and HistoryTask, and FutureTask is used for storing the task scheduling do not started, and HistoryTask is used for storing the task scheduling of history; Need to preserve the critical data stored in two task scheduling tables and comprise environmental sanitation vehicles uniquely tagged VID, driver's uniquely tagged DriverID, task scheduling content Content, task scheduling start time PStimeValue and task scheduling end time PEtimeValue; The storage data layout of wall scroll critical data is { VID, DriverID, Content, PStimeValue, PEtimeValue}; Environmental sanitation vehicles uniquely tagged can adopt car number or license plate number; Numeral or alphabetical or digital alphabet promiscuous mode can be adopted; Driver's uniquely tagged can adopt numeral+alphabetical promiscuous mode to carry out uniquely tagged; Task scheduling content refers to the task definition that concrete needs perform adopt text formatting mode to store herein; Task scheduling start time and task scheduling end time need to comprise date time division information, carry out being converted the time-division date when data store; Database is responsible for storing the order of classes or grades at school sequenced, and stores according to numeric type mode, and under same vehicle same date section stores as a record same continuous time; FutureTask table only stores following planning data; In database, timing judges task scheduling, if it's the end time of task scheduling has past present system time, has then been transferred in historic task planning data sheet HistoryTask by task scheduling data record and stores.
Further, the initial conditions that setting conflict judges is vehicle uniquely tagged VID or driver's uniquely tagged DriverID; Described data time conflict judgment rule is specially: whole planning datas of designated vehicle uniquely tagged VID in inquiry FutureTask database table, and carry out ascending order arrangement according to the task scheduling start time, if the data number of inquiry is M bar, the data content of n-th record data Recordn wherein in sum M bar is { VID, DriverID, Content, PStimeValue, PEtimeValue}; By double lookup algorithm, search record data Recordn, { Recordn (PEtimeValue) <PStimeValue} and Recordn+1 (PStimeValue) >PEtimeValue} set up to make condition, if record Recordn exists, then represent that data are not conflicted, if data do not exist, then represent data collision, judge to terminate; Or, whole planning datas of driver's uniquely tagged DriverID are specified in inquiry FutureTask database table, and carry out ascending order arrangement according to the task scheduling start time, if the data number of inquiry is M bar, the data content of n-th record data Recordn wherein in sum M bar is { VID, DriverID, Content, PStimeValue, PEtimeValue}; By double lookup algorithm, search record data Recordn, { Recordn (PEtimeValue) <PStimeValue} and Recordn+1 (PStimeValue) >PEtimeValue} set up to make condition, if record Recordn exists, then represent that data are not conflicted, if data do not exist, then represent data collision, judge to terminate.
Further, described data inserted mode is specially: establish the unenforced task scheduling being assigned to a certain vehicle/driver existed in FutureTask database table to be recorded as M bar, and Recordn (PStimeValue) represents the task scheduling start time of N article of record, Recordn (PEtimeValue) represents the task scheduling end time of N article of record, the record Recordx that then newly arranges an order according to class and grade adds fashionable, if the time of arranging an order according to class and grade does not conflict, and { Recordx (PStimeValue) >Recordn (PEtimeValue) and Recordx (PEtimeValue) <Recordn+1 (PStimeValue) } is true, then record is inserted in the middle of Recordn and Recordn+1 record, make to record in database and arrange according to Record1 (PStimeValue) <Record2 (PStimeValue) <...<Recordn (PStimeValue) <Recordx (PStimeValue) <Recordn+1 (PStimeValue) <...<RecordM (PStimeValue) all the time, the described time of arranging an order according to class and grade whether conflict judge condition whether be true, if be true, then conflict, if be not true, then for not conflict, the described time of arranging an order according to class and grade whether conflict judge condition be: whether time period and the existing time period of planning to record of the task scheduling of setting have common factor, if the plan of arranging an order according to class and grade of setting before cancelling or deleting, then need data after FutureTask list deletion, transferred to by record in HistoryTask table, the table record order of database does not need to readjust accordingly, if the planned time of arranging an order according to class and grade of amendment setting, then need the time that rejudges whether to conflict, then the table record order of result to database whether basis conflicts is readjusted accordingly.
Tool of the present invention has the following advantages: the invention provides a kind of method whether quick time judging that environmental sanitation is arranged an order according to class and grade in task conflict, due to vehicle/personnel same date synchronization can only perform single task role, and software systems adopt the method carry out conflict judge after when carrying out manual scheduling, batch can be carried out arrange an order according to class and grade, saving task arranges speed, is particularly useful for the task duty arrangement of a large amount of vehicle/personnel in for a long time.By the method, the time conflict judging efficiency that multiplex (MUX) of many dates makes the manual scheduling under the time period effectively can be improved.
Accompanying drawing explanation
Fig. 1 is the inventive method schematic flow sheet.
Embodiment
Refer to shown in Fig. 1, the method whether a kind of quick time judging that environmental sanitation is arranged an order according to class and grade in task of the present invention conflicts, described method is: when carrying out manual scheduling, by scheduling data according to one setting data storage method stored in database, database adopts relational database, when carrying out a new task plan and arranging, data time conflict judgment rule according to setting judges, if meet conflict, then point out, entry/exit conflicts prompting message arranged side by side, if do not meet conflict, then by the data inserted mode data inserting storehouse of the scheduling data of new task according to setting, and list preservation information.
Described data storage method is specially: set two task scheduling tables, table name is respectively FutureTask and HistoryTask, and FutureTask is used for storing the task scheduling do not started, and HistoryTask is used for storing the task scheduling of history; Need to preserve the critical data stored in two task scheduling tables and comprise environmental sanitation vehicles uniquely tagged VID, driver's uniquely tagged DriverID, task scheduling content Content, task scheduling start time PStimeValue and task scheduling end time PEtimeValue; The storage data layout of wall scroll critical data is { VID, DriverID, Content, PStimeValue, PEtimeValue}; Environmental sanitation vehicles uniquely tagged can adopt car number or license plate number; Can the data of uniquely tagged information of vehicles, numeral or letter or digital alphabet promiscuous mode can be adopted; Driver's uniquely tagged can adopt numeral+alphabetical promiscuous mode to carry out uniquely tagged; Task scheduling content refers to the task definition that concrete needs perform adopt text formatting mode to store herein; Task scheduling start time and task scheduling end time need to comprise date time division information, carry out being converted the time-division date when data store; As 8:00 on November 01st, 2014 needs to be converted into 201411010800.Database is responsible for storing the order of classes or grades at school sequenced, and stores according to numeric type mode, and under same vehicle same date section stores as a record same continuous time; Suppose to arrange an order according to class and grade initial/end time is 10:30 on the 01st in November 8:00 to 2014 year on the 01st November in 2014, then the PStimeValue value stored in database is the value of 201411010800, PEtimeValue is 201411011030.FutureTask table only stores following planning data (namely the task scheduling start time is greater than present system time); In database, timing judges task scheduling, if it's the end time of task scheduling has past present system time, has then been transferred in historic task planning data sheet HistoryTask by task scheduling data record and stores.
The initial conditions that setting conflict judges is vehicle uniquely tagged VID or driver's uniquely tagged DriverID; Wherein, task scheduling start time PStimeValue, task scheduling end time PEtimeValue, and PStimeValue and PEtimeValue transforms according to data storage rule.Described data time conflict judgment rule is specially: whole planning datas of designated vehicle uniquely tagged VID in inquiry FutureTask database table, and carry out ascending order arrangement according to the task scheduling start time, if the data number of inquiry is M bar, the data content of n-th record data Recordn wherein in sum M bar is { VID, DriverID, Content, PStimeValue, PEtimeValue}; By double lookup algorithm, search record data Recordn, { Recordn (PEtimeValue) <PStimeValue} and Recordn+1 (PStimeValue) >PEtimeValue} set up to make condition, if record Recordn exists, then represent that data are not conflicted, if data do not exist, then represent data collision, judge to terminate; Or, whole planning datas of driver's uniquely tagged DriverID are specified in inquiry FutureTask database table, and carry out ascending order arrangement according to the task scheduling start time, if the data number of inquiry is M bar, the data content of n-th record data Recordn wherein in sum M bar is { VID, DriverID, Content, PStimeValue, PEtimeValue}; By double lookup algorithm, search record data Recordn, { Recordn (PEtimeValue) <PStimeValue} and Recordn+1 (PStimeValue) >PEtimeValue} set up to make condition, if record Recordn exists, then represent that data are not conflicted, if data do not exist, then represent data collision, judge to terminate.
Described data inserted mode is specially: establish the unenforced task scheduling being assigned to a certain vehicle/driver existed in FutureTask database table to be recorded as M bar, and Recordn (PStimeValue) represents the task scheduling start time of N article of record, Recordn (PEtimeValue) represents the task scheduling end time of N article of record, the record Recordx that then newly arranges an order according to class and grade adds fashionable, if the time of arranging an order according to class and grade does not conflict, and { Recordx (PStimeValue) >Recordn (PEtimeValue) and Recordx (PEtimeValue) <Recordn+1 (PStimeValue) } is true, then record is inserted in the middle of Recordn and Recordn+1 record, make to record in database and arrange according to Record1 (PStimeValue) <Record2 (PStimeValue) <...<Recordn (PStimeValue) <Recordx (PStimeValue) <Recordn+1 (PStimeValue) <...<RecordM (PStimeValue) all the time, the described time of arranging an order according to class and grade whether conflict judge condition whether be true, if be true, then conflict, if be not true, then for not conflict, the described time of arranging an order according to class and grade whether conflict judge condition be: whether time period and the existing time period of planning to record of the task scheduling of setting have common factor, if the plan of arranging an order according to class and grade of setting before cancelling or deleting, then need data after FutureTask list deletion, transferred to by record in HistoryTask table, the table record order of database does not need to readjust accordingly, if the planned time of arranging an order according to class and grade of amendment setting, then need the time that rejudges whether to conflict, then the table record order of result to database whether basis conflicts is readjusted accordingly.
In a word, the present invention can carry out batch and arrange an order according to class and grade, and task of saving arranges speed, is particularly useful for the task duty arrangement of a large amount of vehicle/personnel in for a long time.By the method, the time conflict judging efficiency that multiplex (MUX) of many dates makes the manual scheduling under the time period effectively can be improved.
The foregoing is only preferred embodiment of the present invention, all equalizations done according to the present patent application the scope of the claims change and modify, and all should belong to covering scope of the present invention.
Claims (4)
1. one kind judges the method whether time that environmental sanitation is arranged an order according to class and grade in task conflicts fast, it is characterized in that: described method is: when carrying out manual scheduling, by scheduling data according to one setting data storage method stored in database, database adopts relational database, when a new task plan arranges, data time conflict judgment rule according to setting judges, if meet conflict, then point out, entry/exit conflicts prompting message arranged side by side, if do not meet conflict, then by the data inserted mode data inserting storehouse of the scheduling data of new task according to setting, and list preservation information.
2. the method for whether conflicting of a kind of quick time judging that environmental sanitation is arranged an order according to class and grade in task according to claim 1, it is characterized in that: described data storage method is specially: set two task scheduling tables, table name is respectively FutureTask and HistoryTask, FutureTask is used for the task scheduling that storage time does not start, and HistoryTask is used for storing the task scheduling of history; Need to preserve the critical data stored in two task scheduling tables and comprise environmental sanitation vehicles uniquely tagged VID, driver's uniquely tagged DriverID, task scheduling content Content, task scheduling start time PStimeValue and task scheduling end time PEtimeValue; The storage data layout of wall scroll critical data is { VID, DriverID, Content, PStimeValue, PEtimeValue}; Environmental sanitation vehicles uniquely tagged can adopt car number or license plate number; Numeral or alphabetical or digital alphabet promiscuous mode can be adopted; Driver's uniquely tagged can adopt numeral+alphabetical promiscuous mode to carry out uniquely tagged; Task scheduling content refers to the task definition that concrete needs perform adopt text formatting mode to store herein; Task scheduling start time and task scheduling end time need to comprise date time division information, carry out being converted the time-division date when data store; Database is responsible for storing the order of classes or grades at school sequenced, and stores according to numeric type mode, and under same vehicle same date section stores as a record same continuous time; FutureTask table only stores following planning data; In database, timing judges task scheduling, if present system time has exceeded the end time of task scheduling, has then been transferred in historic task planning data sheet HistoryTask by task scheduling data record and stores.
3. the method for whether conflicting of a kind of quick time judging that environmental sanitation is arranged an order according to class and grade in task according to claim 2, is characterized in that: the initial conditions that setting conflict judges is vehicle uniquely tagged VID or driver's uniquely tagged DriverID; Described data time conflict judgment rule is specially: whole planning datas of designated vehicle uniquely tagged VID in inquiry FutureTask database table, and carry out ascending order arrangement according to the task scheduling start time, if the data number of inquiry is M bar, the data content of n-th record data Recordn wherein in sum M bar is { VID, DriverID, Content, PStimeValue, PEtimeValue}; By double lookup algorithm, search record data Recordn, { Recordn (PEtimeValue) <PStimeValue} and Recordn+1 (PStimeValue) >PEtimeValue} set up to make condition, if record Recordn exists, then represent that data are not conflicted, if data do not exist, then represent data collision, judge to terminate; Or, whole planning datas of driver's uniquely tagged DriverID are specified in inquiry FutureTask database table, and carry out ascending order arrangement according to the task scheduling start time, if the data number of inquiry is M bar, the data content of n-th record data Recordn wherein in sum M bar is { VID, DriverID, Content, PStimeValue, PEtimeValue}; By double lookup algorithm, search record data Recordn, { Recordn (PEtimeValue) <PStimeValue} and Recordn+1 (PStimeValue) >PEtimeValue} set up to make condition, if record Recordn exists, then represent that data are not conflicted, if data do not exist, then represent data collision, judge to terminate.
4. the method for whether conflicting of a kind of quick time judging that environmental sanitation is arranged an order according to class and grade in task according to claim 3, it is characterized in that: described data inserted mode is specially: establish the unenforced task scheduling being assigned to a certain vehicle/driver existed in FutureTask database table to be recorded as M bar, and Recordn (PStimeValue) represents the task scheduling start time of N article of record, Recordn (PEtimeValue) represents the task scheduling end time of N article of record, the record Recordx that then newly arranges an order according to class and grade adds fashionable, if the time of arranging an order according to class and grade does not conflict, and { Recordx (PStimeValue) >Recordn (PEtimeValue) and Recordx (PEtimeValue) <Recordn+1 (PStimeValue) } is true, then record is inserted in the middle of Recordn and Recordn+1 record, make to record in database and arrange according to Record1 (PStimeValue) <Record2 (PStimeValue) <...<Recordn (PStimeValue) <Recordx (PStimeValue) <Recordn+1 (PStimeValue) <...<RecordM (PStimeValue) all the time, the described time of arranging an order according to class and grade whether conflict judge condition whether be true, if be true, then conflict, if be not true, then for not conflict, the described time of arranging an order according to class and grade whether conflict judge condition be: whether time period and the existing time period of planning to record of the task scheduling of setting have common factor, if the plan of arranging an order according to class and grade of setting before cancelling or deleting, then need data after FutureTask list deletion, transferred to by record in HistoryTask table, the table record order of database does not need to readjust accordingly, if the planned time of arranging an order according to class and grade of amendment setting, then need the time that rejudges whether to conflict, then the table record order of result to database whether basis conflicts is readjusted accordingly.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510060287.1A CN104615712A (en) | 2015-02-05 | 2015-02-05 | Method for fast judging whether time conflict exists in sanitation scheduling tasks |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510060287.1A CN104615712A (en) | 2015-02-05 | 2015-02-05 | Method for fast judging whether time conflict exists in sanitation scheduling tasks |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN104615712A true CN104615712A (en) | 2015-05-13 |
Family
ID=53150154
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510060287.1A Pending CN104615712A (en) | 2015-02-05 | 2015-02-05 | Method for fast judging whether time conflict exists in sanitation scheduling tasks |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN104615712A (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107887006A (en) * | 2017-10-27 | 2018-04-06 | 上海京颐科技股份有限公司 | Rehabilitation programme based reminding method and device, storage medium, server |
| CN108229768A (en) * | 2016-12-12 | 2018-06-29 | 中国国际航空股份有限公司 | Aircraft overhauls task Workforce Management |
Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101014134A (en) * | 2006-12-29 | 2007-08-08 | 浙江大学 | Method for inserting and relaying IP service data based on cable television network |
| CN101345850A (en) * | 2007-07-09 | 2009-01-14 | 中兴通讯股份有限公司 | Method for reservation operation of mobile phone TV program |
| WO2009029833A1 (en) * | 2007-08-31 | 2009-03-05 | New Jersey Institute Of Technology | Scheduling processing tasks used in active network measurement |
| CN101472080A (en) * | 2007-12-26 | 2009-07-01 | 新奥特（北京）视频技术有限公司 | Automatic allocation method for acceptance equipment |
| CN101867728A (en) * | 2010-06-01 | 2010-10-20 | 中兴通讯股份有限公司 | Superposition processing method and device of video recording tasks in video monitoring |
| CN102098338A (en) * | 2011-01-21 | 2011-06-15 | 奇诺光瑞电子(深圳)有限公司 | Method and system for publishing government affair announcements through network |
| WO2012046354A1 (en) * | 2010-10-08 | 2012-04-12 | 株式会社日立製作所 | Computer system, storage management computer and storage management method |
| CN104022873A (en) * | 2013-02-28 | 2014-09-03 | 北京网河时代科技有限公司 | Offline dynamic identifying code generating method |
-
2015
- 2015-02-05 CN CN201510060287.1A patent/CN104615712A/en active Pending
Patent Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101014134A (en) * | 2006-12-29 | 2007-08-08 | 浙江大学 | Method for inserting and relaying IP service data based on cable television network |
| CN101345850A (en) * | 2007-07-09 | 2009-01-14 | 中兴通讯股份有限公司 | Method for reservation operation of mobile phone TV program |
| WO2009029833A1 (en) * | 2007-08-31 | 2009-03-05 | New Jersey Institute Of Technology | Scheduling processing tasks used in active network measurement |
| CN101472080A (en) * | 2007-12-26 | 2009-07-01 | 新奥特（北京）视频技术有限公司 | Automatic allocation method for acceptance equipment |
| CN101867728A (en) * | 2010-06-01 | 2010-10-20 | 中兴通讯股份有限公司 | Superposition processing method and device of video recording tasks in video monitoring |
| WO2012046354A1 (en) * | 2010-10-08 | 2012-04-12 | 株式会社日立製作所 | Computer system, storage management computer and storage management method |
| CN102098338A (en) * | 2011-01-21 | 2011-06-15 | 奇诺光瑞电子(深圳)有限公司 | Method and system for publishing government affair announcements through network |
| CN104022873A (en) * | 2013-02-28 | 2014-09-03 | 北京网河时代科技有限公司 | Offline dynamic identifying code generating method |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108229768A (en) * | 2016-12-12 | 2018-06-29 | 中国国际航空股份有限公司 | Aircraft overhauls task Workforce Management |
| CN107887006A (en) * | 2017-10-27 | 2018-04-06 | 上海京颐科技股份有限公司 | Rehabilitation programme based reminding method and device, storage medium, server |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Ansell et al. | Handbook on theories of governance | |
| DE602004015039D1 (en) | Encyclopedia with designated data and method of its construction and its use | |
| CN108268884B (en) | Document comparison method and device | |
| CN104615712A (en) | Method for fast judging whether time conflict exists in sanitation scheduling tasks | |
| EP2426027A3 (en) | Vehicle operation management method and server | |
| WO2009006030A3 (en) | A compliance management system | |
| WO2005074590A3 (en) | System and method for automatically updating business information reports | |
| CN104680347A (en) | RFID (radio frequency identification)-based chemical logistics storage taboo management system | |
| ATE521932T1 (en) | SYSTEM AND METHOD FOR INTELLIGENT TEXT ENTRY IN A MOBILE DEVICE | |
| CN108960630A (en) | Intellectual property automatically retrieval and analysis and management system | |
| Edwards | A guide to the 5S lean production method for occupational health and safety | |
| CN103179017A (en) | Method and system for event prompting | |
| DE60310699D1 (en) | METHOD FOR ORGANIZATION MANAGEMENT IN A TOTAL OF INDICATED DATABASES OF A COMPUTER SYSTEM | |
| CN102855227B (en) | Document processing system and method | |
| CN109710570B (en) | Nuclear power plant production preparation file management method and system | |
| CN112232687A (en) | Bus system branch line scheduling method | |
| CN115081802B (en) | Method and device for generating passenger task set, corresponding electronic equipment and storage medium | |
| CN106326203A (en) | Chunk-based document item editing method | |
| JP6439576B2 (en) | Legal specification check support method | |
| Zhao et al. | Platform research on car free carrier based on the “internet+” | |
| Moro et al. | The Applicability of the First Stage of 5S Methodology to Improve the Quality of Processes in Military Organizations | |
| CN113592383B (en) | System and method for comparing engineering BOM by using product function bill | |
| CN106372037B (en) | Document processing method using language block as basic unit | |
| Nehme et al. | Green logistics as an important part of CSR strategy | |
| Phillips | A Business and Labour History of Britain. Case Studies of Britain in the Nineteenth and Twentieth Centuries. Edited by Mike Richardson and Peter Nicholls. |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20150513 |
|
| WD01 | Invention patent application deemed withdrawn after publication |