EP3259714A2 - System and method for transportation scheduling and planning - Google Patents
System and method for transportation scheduling and planningInfo
- Publication number
- EP3259714A2 EP3259714A2 EP16752026.1A EP16752026A EP3259714A2 EP 3259714 A2 EP3259714 A2 EP 3259714A2 EP 16752026 A EP16752026 A EP 16752026A EP 3259714 A2 EP3259714 A2 EP 3259714A2
- Authority
- EP
- European Patent Office
- Prior art keywords
- transportation
- scheduling
- server
- optimization
- plan
- 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.)
- Ceased
Links
- 238000000034 method Methods 0.000 title claims abstract description 64
- 238000013439 planning Methods 0.000 title description 5
- 238000005457 optimization Methods 0.000 claims abstract description 87
- 230000008569 process Effects 0.000 claims description 22
- 230000004048 modification Effects 0.000 claims description 18
- 238000012986 modification Methods 0.000 claims description 18
- 230000008859 change Effects 0.000 claims description 11
- 230000002452 interceptive effect Effects 0.000 abstract description 18
- 230000004075 alteration Effects 0.000 abstract description 2
- 230000004044 response Effects 0.000 description 14
- 230000006870 function Effects 0.000 description 6
- 238000010586 diagram Methods 0.000 description 4
- 238000012546 transfer Methods 0.000 description 3
- 238000004590 computer program Methods 0.000 description 2
- 238000004891 communication Methods 0.000 description 1
- 238000012913 prioritisation Methods 0.000 description 1
- 238000004088 simulation Methods 0.000 description 1
- 238000012800 visualization Methods 0.000 description 1
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
- G06Q50/00—Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
- G06Q50/40—Business processes related to the transportation industry
-
- 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/04—Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
-
- 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/06312—Adjustment or analysis of established resource schedule, e.g. resource or task levelling, or dynamic rescheduling
-
- 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
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/14—Session management
Definitions
- the present invention relates to Scheduling systems.
- the present invention relates to transportation scheduling.
- the present invention relates to novel improvements in transportation planning and allocation of resources.
- This transportation scheduling and planning imperative coincides with an added desire to limit the allocation of resources and optimize available transportation resources. This has proven to be especially relevant to those in the public transportation field or bus and airline companies requiring a high degree of versatility and ability to plan, optimize, schedule, amend and change reactively to developing situations both expected and unexpected.
- the present invention introduces a new system and method for achieving a high degree of novel versatility and ability to create, edit, modify and ran simulations as well as an optimization engine, such as displaying the cost difference after a change, or disallowing edits that are not valid.
- US patent 8,781,726 discloses a method and system for adjusting a demand response transit schedule, reviewed during performance of the demand response transit schedule.
- US patent 8,521,577 discloses a method and system for paratransit run-cutting.
- a target number of paratransit vehicles is determined for each of a set of time intervals.
- a target number of trips corresponding to the target number of paratransit vehicles is generated for each time interval, each of said mock trips being defined such that a vehicle performing one of said mock trips in one of said time intervals is able to perform any of said mock trips in an immediately subsequent one of said time intervals.
- the target number of mock trips for each of the time intervals is entered into a fixed-route transit run-cutting application. Paratransit runs are created using fixed-route transit runs generated by said fixed-route transit run-cutting application.
- the scheduler can select multiple (or all) blocks which were assigned to a transportation resource, and mark the transportation resources as inseparable scheduled tasks block wherein subsequent rescheduling performed with the automated optimization system will treat the task block as a single task and merge the task block into a single transportation resource. Nevertheless, the tasks block can also be displaced and rescheduled as a manually as a whole entity by the scheduler and the same recommendation rules described in the relocate task process will apply here.
- the present invention is a system and method for transportation scheduling and plan.
- FIG. 1 is a diagram view of a first embodiment of the system and method for
- FIG. 2 is a block diagram view of the system and method for transportation scheduling and plan according to the present invention.
- the system and method for transportation scheduling and plan according to the present invention readily facilitates updating/editing devoid of violations of operator rules, preferences, and regulations.
- the system and method for transportation scheduling and plan provides an efficient and novel alternative, wherein the present system offers full interactivity between schedulers and the optimization engine, thus efficiently facilitating at least one of the following modifications selected from the group consisting of: executing optimization iteration while changing preferences and constraints, relocating a scheduled task for a first transportation resources to a second transportation resource, or from a first time slot to a second time slot duty, incorporating recommendations on each alternative duty/transportations resource, locking multiple tasks into a schedule block, wherein the at least one block is readily selectable and which at least one blocks is assigned to a transportation resource, and mark the transportation resources as inseparable scheduled tasks block wherein subsequent rescheduling performed with the automated optimization system will treat the task block as a single task and will merge the task block together to a single transportation resource.
- the present system offers full interactivity between schedulers and the optimization engine, thus efficiently facilitating at least one of the following modifications selected from the group consisting of: executing optimization iteration while changing preferences and constraints, relocating a scheduled
- the tasks block can also be displaced and rescheduled as a whole manually by the scheduler and the same recommendation rules described in the relocate task process will apply here, inserting a new transportation resource row - the scheduler readily facilitates inserting a new transportation resource row, along with the transportation resource type, for rescheduling tasks from existing transportation resources into a specific transportation resource selected and changing the time of one or more trips (departure, arrival, or both).
- a system and method for transportation scheduling and plan 10 includes at least three elements: a client interface 12, wherein client interface 12 is preferably displayed as a Gantt chart, a server 14 wherein server 14 preferably includes an optimization engine 16 and a data set 18, wherein data set 18 preferably includes a plurality of tasks (not shown in Figure 1) for scheduling.
- Server 14 is a Web server wherein server 14 is responsive to requests received from client interface 12.
- server 14 transfers requests to optimization engine 16 or a second server, getting response and send it back to the client interface 12 for visualization.
- optimization engine 16 is situated on a single hardware platform with web server 14.
- system and method for transportation scheduling and plan 10 includes an optimization engine 16, and a web server 14, wherein optimization engine 16, and web server 14 are situated on at least two distinct and separate hardware platform.
- At least one component selected from the group consisting of: client interface 12, server 14, data service, interface service including scheduling process 22, session manager 30 and optimization engine 16 are remotely located and electronically connected to client interface 12.
- At least on one component selected from the group consisting of: client interface 12, server 14, data service, interface service including scheduling process 22, session manager 30 and optimization engine 16 are wirelessly connected to at least one component selected from the group consisting of: client interface 12, server 14, data service, interface service including scheduling process 22, session manager 30 and optimization engine 16.
- client interface 12 preferably displays on an output module (not shown in Figure 1) the current scheduling state of the tasks and server 14 will preferably hold a session which will preferably include a representation by optimization engine 16 of data set 18 as well as a current scheduling (not shown in Figure 1).
- system and method for transportation scheduling and plan 10 can readily request a scheduling operation from server 14 via client interface 12 with the relevant constraints while asking server 14 to schedule specific tasks together and/or to specific vehicles.
- system and method for transportation scheduling and plan 10 can manually change the current scheduling by relocating tasks (such as dragging and dropping tasks in a Gantt chart) between vehicles and resources.
- the current scheduling state is kept in sync with the server session, thereby facilitating minimal data transfer between the client interface 12) and server 14 on each change the client interface 12 performs and each optimization result server 14 generates.
- system and method for transportation scheduling and plan 10 preferably receives recommendations server 14 for each operation system and method for transportation scheduling and plan 10 attempts to complete, preferably by way of having both server 14 and the client interface 12 execute relevant optimization and validity logic associated to the operation.
- server 14 returns a rapid response.
- the response provide by server 14 is significantly shorter than a minute.
- the response provide by server 14 is shorter than a second.
- the response provide by server 14 is substantially under 500 milliseconds.
- server 14 preferably utilizes a memory module 26 by way of maintaining an in-memory state of the last optimization problem, represented as a network graph 28, which residual network of network graph 28 is substantially at a maximum flow.
- optimization engine 30 receives a request by way of client interface 12, a small number of adjustments are made to the network graph 28 that represent a minor manual change (e.g. changing a single trip start time).
- optimization engine 16 initiates an optimization process, using a plurality network flow algorithms.
- the optimization process starts from the last state as the initial state of the network, after applying the modifications.
- the algorithms then run a full optimization, invariably completed very fast due to the tight potential on most edges. Occasioning on the algorithm not completing the process within 500ms, the user is notified and can continue to work asynchronously.
- system and method for transportation scheduling and plan 10 merges the changes made that were not part of the optimization requests.
- optimization engine 16 runs at least one additional optimization including the newly added changes.
- client interface 12 requests at least one data set 18 substantially subsequently to a session starting.
- client interface 12 displays data set 18 on client interface 12.
- the client Upon user modifications, the client passes the user modifications to server 14. Upon receiving a response which contains notifications selected from the group consisting of recommendations, warnings, and the like. Preferably, the notifications are displayed on client interface 12.
- interactive Server 14 receives a signal to start an interactive session when the user asks to get a data set 18, substantially contemporaneously with getting data set 18 from a database.
- the signal is passed to a Session Manager 30 for creating an optimization session.
- server 14 Upon receiving an interactive request which includes the user modifications, server 14 requests the active session from Session Manager 30.
- the session contains the endpoint for directly communicating with the optimization engine that holds this session. Then, the interactive service directly communicates the modification to session optimization engine 16.
- Session Manager 30 receives a request for creating a session. Session manager 30 sends a request to the optimization engine 16 to create a new optimization instance with the dataset. Then, when receiving a request to get the session, session manager 30 returns the endpoint of the optimization instance.
- optimization engine 16 receives a request for creating a new optimization instance, wherein optimization engine 16 initiates a new optimization process which upon startup preferably including the steps:
- b Creating indices to access common fields (e.g. trip id, empty trip, etc.). c. Building a network flow graph 28 from the trips that represents the available connections between trips, with their associated costs according to cost functions and preferences. d. Optimizing the network by running minimum cost flow algorithms to obtain the min-cost flow of the network
- optimization engine 16 performs the steps:
- transportation shall include but will not be hmited to: a means of conveyance or travel from one place to another including a
- vehicle or system of vehicles such as a bus, a train, a ship, a boat, a taxi, a car, an automobile, a two and three wheeled vehicle, a sea vessel, an aircraft or an airborne carrier and the like for private and public conveyance of passengers or goods especially as a commercial enterprise.
- a system and method for transportation scheduling and plan 10 includes at least three elements: a client interface 12, wherein client interface 12 is preferably displayed as a Gantt chart, a server 14 wherein server 14 preferably includes an optimization engine 16 and a data set 18, wherein data set 18 preferably includes a plurality of tasks 20 for scheduling.
- client interface 12 preferably displays on an output module 24 the current scheduling 32 state of the tasks 20 and server 14 will preferably hold a session which will preferably include a representation by optimization engine 16 of data set 18 as well as a current scheduling 32.
- output module 24 can be selected from the group consisting of: a wired telecommunication device 34, a wireless communication device 36, a physical output device 38, a display 40 and an audio device 42.
- output module 24 can include a dispatch and/or dispatcher for readily conveying schedule 32 to at least one intended recipient including but not limited to, a driver, a dedicated on-board system, a computerized relay, a cell phone and a display.
- a dispatch and/or dispatcher for readily conveying schedule 32 to at least one intended recipient including but not limited to, a driver, a dedicated on-board system, a computerized relay, a cell phone and a display.
- system and method for transportation scheduling and plan 10 can readily request a scheduling 32 operation from server 14 via client interface 12 with the relevant constraints while asking server 14 to schedule specific tasks 20 together and/or to specific vehicles.
- system and method for transportation scheduling and plan 10 can manually change the current scheduling 32 by relocating tasks 20 (such as dragging and dropping tasks in a Gantt chart) between vehicles and resources.
- the current scheduling 32 state is kept in sync with the server session, thereby facilitating minimal data transfer between the client interface 12 and server 14 on each change the client interface 12 performs and each optimization result server 14 generates.
- system and method for transportation scheduling and plan 10 preferably receives recommendations server 14 for each operation system and method for transportation scheduling and plan 10 attempts to complete, preferably by way of having both server 14 and the client interface 12 execute relevant optimization and validity logic associated to the operation.
- server 14 returns a rapid response.
- the response provide by server 14 is significantly shorter than a minute.
- the response provide by server 14 is shorter than a second.
- the response provide by server 14 is substantially under 500 milliseconds.
- server 14 preferably utilizes a memory module 26 by way of maintaining an in-memory state of the last optimization problem, represented as a network graph 28, which residual network of network graph 28 is substantially at a maximum flow.
- optimization engine 30 receiving a request by way of client interface 12, a small number of adjustments are made to the network graph 28 that represent a minor manual change (e.g. changing a single trip start time).
- optimization engine 16 initiates an optimization process, using a plurality network flow algorithms.
- the optimization process starts from the last state as the initial state of the network, after applying the modifications to the residual network.
- the algorithms then run full optimization, which usually conclude rapidly due to the residual network preferably being substantially optimized tight potential on most edges. Occasioning on the algorithm not completing the process within 500ms, the user is notified and can continue to work asynchronously.
- system and method for transportation scheduling and plan 10 merges the changes made that were not part of the optimization requests.
- optimization engine 16 runs at least one additional optimization including the newly added changes.
- client interface 12 requests at least one data set 18 substantially subsequently to a session starting.
- client interface 12 displays data set 18 on client interface 12.
- the client passed the user modifications to server 14.
- server 14 Upon receiving a response which contains notifications selected from the group consisting of recommendations, warnings, and the like.
- the notifications are displayed on client interface 12.
- interactive Server 14 receives a signal to start an interactive session when the user asks to get a data set 18, substantially contemporaneously with getting data set 18 from a database.
- the signal is passed to a Session Manager 30 for creating an optimization session.
- server 14 Upon receiving an interactive request which includes the user modifications, server 14 requests the active session from Session Manager 30.
- the session contains the endpoint for directly communicating with the optimization engine that holds this session. Then, the interactive service directly communicates the modification to session optimization engine 16.
- Session Manager 30 receives a request for creating a session. Session manager 30 sends a request to the optimization engine 16 to create a new optimization instance with the dataset. Then, when receiving a request to get the session, session manager 30 returns the endpoint of the optimization instance.
- optimization engine 16 receives a request for creating a new optimization instance, wherein optimization engine 16 initiates a new optimization process which upon startup preferably including the steps:
- optimization engine 16 performs the steps:
Landscapes
- Business, Economics & Management (AREA)
- Human Resources & Organizations (AREA)
- Engineering & Computer Science (AREA)
- Strategic Management (AREA)
- Economics (AREA)
- Entrepreneurship & Innovation (AREA)
- Tourism & Hospitality (AREA)
- Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Marketing (AREA)
- General Physics & Mathematics (AREA)
- General Business, Economics & Management (AREA)
- Operations Research (AREA)
- Quality & Reliability (AREA)
- Development Economics (AREA)
- Game Theory and Decision Science (AREA)
- Data Mining & Analysis (AREA)
- Educational Administration (AREA)
- Health & Medical Sciences (AREA)
- General Health & Medical Sciences (AREA)
- Primary Health Care (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
Description
Claims
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US201562116579P | 2015-02-16 | 2015-02-16 | |
PCT/IL2016/000002 WO2016132344A2 (en) | 2015-02-16 | 2016-02-16 | System and method for transportation scheduling and planning |
Publications (2)
Publication Number | Publication Date |
---|---|
EP3259714A2 true EP3259714A2 (en) | 2017-12-27 |
EP3259714A4 EP3259714A4 (en) | 2018-08-01 |
Family
ID=56692623
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
EP16752026.1A Ceased EP3259714A4 (en) | 2015-02-16 | 2016-02-16 | System and method for transportation scheduling and planning |
Country Status (4)
Country | Link |
---|---|
US (1) | US20180240210A1 (en) |
EP (1) | EP3259714A4 (en) |
IL (1) | IL253990A0 (en) |
WO (1) | WO2016132344A2 (en) |
Families Citing this family (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN111709570B (en) * | 2020-06-11 | 2022-09-27 | 西南交通大学 | Optimization method for network drop-and-drop transport scheduling |
CN112885094B (en) * | 2021-01-27 | 2022-05-13 | 福州大学 | Method for identifying coordinated development areas of multiple types of operating vehicles |
Family Cites Families (12)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20030135304A1 (en) * | 2002-01-11 | 2003-07-17 | Brian Sroub | System and method for managing transportation assets |
US20060149841A1 (en) * | 2004-12-20 | 2006-07-06 | Alcatel | Application session management for flow-based statistics |
US20070024440A1 (en) * | 2005-07-28 | 2007-02-01 | Lucent Technologies Inc. | School bus tracking and notification system |
US8428990B2 (en) * | 2005-08-19 | 2013-04-23 | Siemens Aktiengesellschaft | Method for allocating resources to jobs using network flow algorithms |
US8676919B2 (en) * | 2008-06-26 | 2014-03-18 | Microsoft Corporation | Asynchronously editing a synchronous data store, such as a project management data store |
US20100106605A1 (en) * | 2008-10-23 | 2010-04-29 | Yahoo! Inc. | Inventory allocation with tradeoff between fairness and maximal value of remaining inventory |
US20100299177A1 (en) * | 2009-05-22 | 2010-11-25 | Disney Enterprises, Inc. | Dynamic bus dispatching and labor assignment system |
US9261376B2 (en) * | 2010-02-24 | 2016-02-16 | Microsoft Technology Licensing, Llc | Route computation based on route-oriented vehicle trajectories |
US20130151421A1 (en) * | 2011-12-08 | 2013-06-13 | Oracle International Corporation | Real-time project progress entry: applying project team member-entered progress immediately to the project plan |
CA2768578C (en) * | 2012-02-16 | 2017-03-07 | Trapeze Software Inc. | Method and system for adjusting a demand-response transit schedule |
DE202013012472U1 (en) * | 2012-08-03 | 2017-01-13 | Terra Bella Technologies Inc. | Satellite planning system |
US9984580B2 (en) * | 2015-01-09 | 2018-05-29 | General Electric Company | Method and system for robust network planning optimization of airline flight operations |
-
2016
- 2016-02-16 EP EP16752026.1A patent/EP3259714A4/en not_active Ceased
- 2016-02-16 US US15/551,362 patent/US20180240210A1/en not_active Abandoned
- 2016-02-16 WO PCT/IL2016/000002 patent/WO2016132344A2/en active Application Filing
-
2017
- 2017-08-14 IL IL253990A patent/IL253990A0/en unknown
Also Published As
Publication number | Publication date |
---|---|
WO2016132344A2 (en) | 2016-08-25 |
WO2016132344A3 (en) | 2016-12-29 |
IL253990A0 (en) | 2017-10-31 |
EP3259714A4 (en) | 2018-08-01 |
US20180240210A1 (en) | 2018-08-23 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
CN106600057B (en) | Express delivery task scheduling method and device | |
CN110322231B (en) | Automatic publishing method and system for flight schedule | |
US20110224816A1 (en) | Multi-agent system for distributed manufacturing scheduling with genetic algorithms and tabu search | |
US8462793B2 (en) | System for strategic management and communication of data in machine environments | |
CN115298518A (en) | Improved logistics management system | |
EP1600837A2 (en) | System and method utilizing temporal constraints to coordinate multiple planning sessions | |
CN110852659A (en) | Logistics management method and device | |
CN109858655B (en) | Method and system for reserved test | |
CN110611707A (en) | Task scheduling method and device | |
JP6674887B2 (en) | Schedule arbitration system and schedule arbitration method | |
CN112241405A (en) | Flight plan automatic generation method and device, storage medium and electronic equipment | |
US8190461B2 (en) | Logically centralized scrap management using planning operations | |
CN114169836A (en) | Management scheduling method, device and equipment for logistics transportation and readable storage medium | |
US20210065120A1 (en) | A system and a method for managing the operations of a commercial transportation vehicle | |
US20180240210A1 (en) | System and method for transportation scheduling and planning | |
Tadumadze et al. | Loading and scheduling outbound trucks at a dispatch warehouse | |
CN109300335A (en) | Flight number transposing systems and exchange method | |
CN115511292B (en) | Production scheduling method, system, intelligent terminal and storage medium | |
Zhong et al. | Integrated scheduling of production and distribution with release dates and capacitated deliveries | |
CN111582407A (en) | Task processing method and device, readable storage medium and electronic equipment | |
CN111260281A (en) | Task processing method and device, electronic equipment and computer readable storage medium | |
US6917843B2 (en) | System and method for scheduling production of molds | |
CN113159671A (en) | Material conveying method and device based on intelligent driving | |
WO2014147711A1 (en) | Schedule determination device and determination method | |
US11893544B2 (en) | Distributed system for test drive conflict rescheduling |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
PUAI | Public reference made under article 153(3) epc to a published international application that has entered the european phase |
Free format text: ORIGINAL CODE: 0009012 |
|
17P | Request for examination filed |
Effective date: 20170907 |
|
AK | Designated contracting states |
Kind code of ref document: A2 Designated state(s): AL AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HR HU IE IS IT LI LT LU LV MC MK MT NL NO PL PT RO RS SE SI SK SM TR |
|
AX | Request for extension of the european patent |
Extension state: BA ME |
|
DAV | Request for validation of the european patent (deleted) | ||
DAX | Request for extension of the european patent (deleted) | ||
A4 | Supplementary search report drawn up and despatched |
Effective date: 20180704 |
|
RIC1 | Information provided on ipc code assigned before grant |
Ipc: G06Q 50/30 20120101AFI20180628BHEP Ipc: G06Q 10/06 20120101ALI20180628BHEP Ipc: G06Q 10/04 20120101ALI20180628BHEP |
|
17Q | First examination report despatched |
Effective date: 20190617 |
|
STAA | Information on the status of an ep patent application or granted ep patent |
Free format text: STATUS: EXAMINATION IS IN PROGRESS |
|
REG | Reference to a national code |
Ref country code: DE Ref legal event code: R003 |
|
STAA | Information on the status of an ep patent application or granted ep patent |
Free format text: STATUS: THE APPLICATION HAS BEEN REFUSED |
|
18R | Application refused |
Effective date: 20201122 |