WO2020256116A1 - Procédé d'ajustement d'horaires et support de stockage pour stocker un programme d'ajustement d'horaires - Google Patents

Procédé d'ajustement d'horaires et support de stockage pour stocker un programme d'ajustement d'horaires Download PDF

Info

Publication number
WO2020256116A1
WO2020256116A1 PCT/JP2020/024171 JP2020024171W WO2020256116A1 WO 2020256116 A1 WO2020256116 A1 WO 2020256116A1 JP 2020024171 W JP2020024171 W JP 2020024171W WO 2020256116 A1 WO2020256116 A1 WO 2020256116A1
Authority
WO
WIPO (PCT)
Prior art keywords
schedule
congestion
information
user
schedule adjustment
Prior art date
Application number
PCT/JP2020/024171
Other languages
English (en)
Japanese (ja)
Inventor
夏樹 塚野
俊二 川村
暖 山本
圭 北原
Original Assignee
株式会社日立製作所
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by 株式会社日立製作所 filed Critical 株式会社日立製作所
Priority to JP2021526926A priority Critical patent/JP7261878B2/ja
Publication of WO2020256116A1 publication Critical patent/WO2020256116A1/fr

Links

Images

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
    • 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/10—Services

Definitions

  • the present invention relates to a technique for adjusting a user's schedule.
  • shared offices In recent years, in order to improve the quality of life of all people and realize a society where they can work and play an active role, work style reforms, ingenuity in transportation behavior, shared offices, satellite offices, coworking spaces (hereinafter, "shared offices, etc.”" There is a social trend in which various work styles are recognized. On the other hand, frameworks and technologies for managing, collecting, and utilizing personal information such as information banks and PDSs (Personal Data Stores) are being developed.
  • PDSs Personal Data Stores
  • Patent Document 2 As a device for traffic behavior, there is Patent Document 2 for the purpose of alleviating road congestion.
  • Patent Document 2 discloses a technique for making a road traffic reservation, predicting the degree of congestion from the reservation result, reflecting the predicted degree of congestion in the toll, and mixing the congestion.
  • Patent Document 1 does not consider the creation of free time by devising traffic behavior or using shared offices when adjusting the schedule. Further, Patent Document 2 does not present a method of avoiding congestion, only motivation for avoiding congestion time zone. That is, there is a problem that commuting congestion is not alleviated even if the schedule during work is streamlined.
  • the present invention has been made in view of such circumstances, and an object of the present invention is to adjust a schedule that can create free time while avoiding commuting during busy hours.
  • a system that adjusts the schedule so that the user can commute to work while avoiding commuting congestion will be described based on the schedule of each user.
  • the terminal device 101 is a device held for each user and can be realized by a general computer. Although the figure is omitted, it includes a calculation unit, a communication unit, a storage unit, an input / output unit, and a position information acquisition unit.
  • the communication unit can communicate with a network such as the Internet.
  • the position information acquisition unit acquires the position information of the user, and is composed of an application or the like running on the terminal device 101.
  • the user can exchange information with the schedule adjustment system and use various services provided by the information bank and the external service provider by using the Web browser, the application and the add-on installed in the terminal device.
  • the calculation unit 201 avoids congestion based on the congestion status grasping processing unit 205 that calculates the congestion status from the user information and the information acquired from the external service provider 104, and the grasped congestion status and the user's schedule and intention. It has a congestion adjustment processing unit 206 that adjusts so as to be.
  • the storage unit 202 includes a congestion information holding unit 207 that holds the congestion information that is the processing result of the congestion status grasping processing unit 205 including a history, basic information of the user such as an address and main commuting means, and a user.
  • User information holding unit 208 that holds information on the schedule and location where the schedule is implemented, and external service information holding that holds past congestion status, location and availability information of shared office services acquired from the external service provider 104, etc. It has a part 209.
  • the communication unit 203 transmits the result processed by the calculation unit 201 to the terminal device 101, the information bank 103, and the external service provider 104 via a network such as the Internet, or information necessary for processing by the calculation unit 201. And the information stored in the storage unit 202 is received from the terminal device 101, the information bank 103, and the external service provider 104.
  • FIG. 3 is a block diagram showing the hardware configuration of the information bank 103 in this embodiment.
  • the information bank 103 can be realized by a general server device, and has a calculation unit 301 for managing personal data, a storage unit 302 for holding personal data, a terminal device 101, a schedule adjustment server 102, an external service provider 104, and a network 105. It is composed of a communication unit 303 for exchanging information via the information bank 103 and an input / output unit 304 for receiving input from the administrator of the information bank 103, and each unit is connected by a BUS or the like.
  • the calculation unit 301 includes an information cooperation unit 305 that exchanges personal data with the user using the terminal device 101 and exchanges personal data with the schedule adjustment server 102 and the external service provider 104 based on the contract with the user. It has a personal data management unit 306 that controls access, controls the information collection period, deletes information, and the like based on a contract with a user.
  • the storage unit 302 has a personal data holding unit 307 that holds personal data obtained as a result of the processing of the information linking unit 305.
  • the processing of the arithmetic unit 201 and the arithmetic unit 301 can be realized by the CPU executing a predetermined program loaded in the memory. That is, the communication units 203 and 303 can be realized by the CPU using the communication device.
  • the input / output units 204 and 304 are realized by the CPU using an input device or an output device.
  • the storage units 202 and 302 are realized by the CPU using a memory or an external storage device.
  • the calculation units 201 and 301 are realized as CPU processes.
  • These programs may be pre-stored in the computer's memory or external storage, and when needed, from removable storage media available to the computer, or from communication media (such as the network 105, or them). It may be introduced from other devices via a carrier wave or digital signal propagating over it.
  • a plurality of storage units having different storage methods such as RDB (Relational Database), file server, KVS (Key-Value Store), etc., depending on the size and format of the data stored in the storage unit 202 and the storage unit 302. It may be composed of. Further, a part or all of the data equivalent to the stored data may be provided from a plurality of other servers connected to the network 105 such as the Internet, or by a removable storage medium.
  • RDB Relational Database
  • file server file server
  • KVS Key-Value Store
  • each component shown in FIGS. 2 and 3 does not need to be physically separated, and one component may also serve as the other.
  • FIG. 4 is a sequence showing the processing procedure of the schedule adjustment system in this embodiment. That is, it shows a series of processing flows in which the schedule adjustment system acquires information from the user, grasps the congestion status, and adjusts the schedule so as to avoid congestion.
  • step S401 may be performed at any timing desired by the user, such as when the user starts using a new service.
  • step S403 may be performed at a timing agreed between the information bank 103, the external service provider 104, and the user, such as the date and time, weekly, and the timing when the information is changed.
  • the schedule adjustment server 102 acquires the shared office information 603, which will be described later, including the location and vacancy status of the facility from the external service provider 104, and stores it in the external service information holding unit 209 (S407).
  • step S407 may be performed daily, weekly, at the timing when information is changed, at the timing when there is a request from the user, or the like.
  • the information to be acquired may be only the information that has been added or changed.
  • the schedule adjustment server 102 transmits to the external service provider 104 and the information bank 103 whether or not the shared office is used and the contents of the schedule change (S412, S413).
  • the information bank 103 and the external service provider 104 store the received information.
  • the user basic information 501, the user schedule 502, and the implementation location information 503 shown in FIG. 5 are structural examples of user information for a certain user. This information exists in the database for at least the number of users. Further, each setting item may be automatically acquired from the information bank 103, or the user may access the schedule adjustment server 102 from the terminal device 101 and set it individually.
  • [Main means of commuting] sets the means of transportation used for commuting.
  • items such as public transportation such as trains and buses, private cars, walking, and bicycles can be set.
  • Standard commuting time sets the standard time for the user to commute, excluding non-standard times such as business trips, half-day holidays, late arrivals, and early departures.
  • the figure shows an example in which it takes one hour to commute, the outbound route is from 7:30 to 8:30, and the return route is from 17:30 to 18:30. If there are multiple standard commuting hours in the shift time system, multiple registrations may be made.
  • [Standard boarding time] is the time when the user is commuting to work as [Standard commuting time] and is boarding a train or bus.
  • Regular schedule sets the name and time of the schedule and the type of repetition for the regular schedule that the user carries out on a daily, weekly, or monthly basis.
  • This appointment may be a business appointment or a personal appointment.
  • Personal regular schedules include pick-up and drop-off at nursery schools, hobby lessons (fitness, cooking classes, etc.), and long-term care schedules.
  • the [Main means of commuting], [Station closest to home], [Station closest to work], [Commuting route], and [Working style] can be selected by the user from the values preset by the server administrator. It may be possible to set.
  • the name of the schedule entered by the user is set in [Schedule name].
  • the system may automatically input a regular schedule that can be inferred from the user basic information 501 such as commuting and fitness.
  • [Implementation location name] is set to the name of the implementation location of the schedule entered by the user.
  • "meeting room A” which is the name of the conference room
  • "A sports gym” which is the name of the sports gym are exemplified. If there is no place to carry out, such as when [Schedule name] is "Commuting", it will not be set.
  • implementation location information 503 includes items of [implementation location name] and [address].
  • Examplementation location name is set to the implementation location name set in the user schedule 502.
  • [Address] is set to the location of the place of implementation. For example, a city, ward, town, town area, street address, building name, room number, etc. are set. A postal code or a prefecture name may be set. The latitude / longitude information acquired from the position information acquisition unit of the terminal device 101 held by the user may be input.
  • operation information 601 includes items of [train number], [capacity], [link to timetable], and [route name].
  • Capacity is set for each train.
  • the capacity is set according to the vehicle formation, seats, and standing arrangement method.
  • [Link to timetable] is a reference of which timetable information 602 the train operates based on.
  • timetable information 602 includes items of [station name], [arrival time], and [departure time].
  • the timetable information 602 is an example of a data structure for a certain train. These data will exist in the database for at least the number of trains.
  • the timetable information 602 has a unique identifier for each train, and by setting one identifier as [link to the timetable] in the operation information 601 it is possible to refer to the timetable information for each train.
  • [Station name] is the name of the station related to the arrival, departure, passage, etc. of the train.
  • Arriv time is the time when the train arrives at the station. If there is no arrival time due to passing or the like, a mark indicating that there is no data such as "*" is input.
  • shared office information 603 includes items of [shared office name], [address], [link to availability], and [reservation site URL].
  • the name of the shared office is set in the [Shared office name] item. For example, “shared office A” or “shared office B” is set.
  • the item of [Address] is an item in which the location of the shared office is set. For example, a city, ward, town, village, town area, street address, building name, room number, etc. are set. A postal code or a prefecture name may be set.
  • the item of [Link to vacancy status] is set to refer to the vacancy status of each space in the shared office.
  • the URL of the reservation site of the shared office is set in the [Reservation site URL] item.
  • the API information may be retained.
  • vacancy status 604 includes items of [space ID], [vacancy date / time], and [space type].
  • Vacancy is an example of a structure for a shared office. There will be at least a few minutes of these data in the database for shared offices.
  • the vacancy status has a unique identifier for each shared office, and by setting one identifier as [link to vacancy status] in the shared office information 603, the vacancy status for each shared office can be referred to. Can be done.
  • [Vacancy date and time] is a daily list of available seats or private rooms with the space ID. For example, in FIG. 6D, it is shown that ROOM1 is vacant from 7:00 to 9:00 and 13:00 to 17:00 on December 1, 2018, and can be reserved.
  • past congestion information 605 includes items of [route name], [section], [congestion rate at peak time], and [peak time zone]. From this information, it is possible to acquire the congestion rate for each section and the time zone when congestion occurred.
  • [Peak-time congestion rate] indicates the peak-time congestion rate of the section on the route.
  • [Peak time zone] sets a time zone that becomes [congestion rate at peak time] in the relevant section of the route.
  • the congestion information holding unit 207 of the schedule adjustment server 102 in this embodiment holds the information of the congestion information 701.
  • the congestion information 701 includes items of [route name], [train number], [section], [congestion rate], [departure time], [arrival time], and [change history]. Since this congestion information is created based on the user's schedule, different information is created for each date. In the example of the congestion information 701, the congestion information for a certain day is shown, but the congestion information holding unit holds the congestion information for a preset date, for example, one month.
  • [Section] sets the section of the station for which the congestion rate is calculated.
  • the section is set from the departure of a certain station to the next stop. For example, if the train stops at each station, adjacent stations are set, and if it is an express or limited express train, a station that straddles multiple stations is set. Whether it is an express train or a limited express train can be determined by whether or not there is a passing station in the timetable information 602.
  • [Change history] retains history information in which congestion information has been changed. In the first row of FIG. 7, it is shown that the congestion rate was 198 on March 18, 2019. The congestion information may be changed multiple times a day, and in that case, the change history is set by adding time.
  • step S406 the congestion status grasping processing unit 205 of the schedule adjustment server 102 in this embodiment sets the user basic information 501, the user schedule 502, various information of the implementation location information 503, and the operation information 601. The process of creating congestion information based on the timetable information 602 and the past congestion information 605 is shown.
  • the [main commuting means], [commuting route], [standard boarding time], and the schedule name of the user schedule 502, which are commuting information of the user basic information 501 of all users, are shown.
  • the range of the schedule acquired in this step may be the period for which the congestion information is to be calculated, and for example, one week's worth or one month's worth is acquired.
  • the operation information 601 and the timetable information 602 are acquired, and the [standard boarding time] and the [route information] of the users whose [main commuting means] is "train” are compared, and all the users , [Train number] of the train to be boarded, and the section to be boarded in the timetable information 602 (S802).
  • step S803 the processes of steps S803 to S805 are performed for all the diamonds of the diamond information 602. That is, in step S803, the number of passengers between stations is calculated.
  • step S804 the number of passengers obtained in step S803 is divided by the [capacity] for each train to calculate the congestion rate. If the number of users of the schedule adjustment system is smaller than the actual number of passengers, such as when the system has just started operating, the past congestion rate will be reflected at a fixed rate. As a reflection method, if information on the number of passengers in the past can be obtained, the ratio between the users of the schedule adjustment system and the number of passengers in the past can be obtained, and the congestion rate can be increased according to the calculated ratio. .. Further, even if the information on the actual number of passengers cannot be obtained, it can be reflected at a fixed ratio such as 30%.
  • step S805 the congestion rate calculated in step S804 is added to the congestion information holding unit.
  • the congestion adjustment processing unit 206 of the schedule adjustment server 102 in this embodiment shows various types of user basic information 501, user schedule 502, and implementation location information 503 in steps S408 to S413 of FIG.
  • the process of adjusting the congestion based on the information and operation information 601, the timetable information 602, the shared office information 603, and the vacancy status 604 is shown.
  • the congestion rate between stations where the train to be boarded may be averaged and the averaged congestion rate and the threshold value may be compared.
  • the congestion adjustment process is unnecessary and this process ends.
  • the congestion rate exceeds the threshold value, it is determined whether or not the commuting schedule can be changed to a time other than the congestion time zone with reference to the user schedule 502 (S904). For example, if you plan to commute between 7:30 and 8:30 and the meeting is scheduled for the day from 10:00 to 12:00, there is no schedule until 10:00, so the commuting time is between 9:00 and 10:00. Judge that it can be changed to.
  • the congestion rate of the commuting time of the change destination is confirmed again, and it is confirmed that the congestion rate is below the threshold value in the commuting time of the change destination.
  • the commuting time candidate and the shared office usage time candidate are acquired from the external service information holding unit 209 (S905).
  • This candidate acquires multiple candidates in consideration of the fact that the shared office is not available.
  • the user schedule 502 and the [working style] of the user basic information 501 are referred to, and the time that can be pushed back most of the commuting time candidates is acquired. For example, if you normally commute between 7:30 and 8:30, but you work flextime and the core time is from 10 o'clock, the maximum commuting time is from 9 to 10 o'clock.
  • the shared office usage time candidate is 7:00. It will be from half to 8:30 and from 7:30 to 9:00.
  • it may be arbitrarily set in increments of 10 minutes or 15 minutes instead of 30 minutes.
  • the shared office information 603 and the vacancy status 604 stored in the external service information holding unit 209 are acquired (S906).
  • the shared office information 603 and the vacancy status 604 stored in the external service information holding unit 209 are acquired (S906).
  • the office when acquiring, if you want to advance the commuting time on the outbound route, and if the office is not open, acquire information on the shared office near the nearest station or the business trip destination, and set the commuting time on the outbound route. If you want to move backwards, get information about the shared office near the nearest station to your home.
  • the acquired share office information 603 and vacancy status 604 are compared with the share office usage time candidates, and it is confirmed whether the share office is vacant at that time (S907).
  • the congestion adjustment process is not possible, so this process ends.
  • the shared office is vacant
  • the user is presented with the shared office usage time candidate for which the shared office was vacant and the corresponding commuting time candidate as candidates for changing the schedule (S908).
  • the shared office usage time candidate for which the shared office was vacant
  • the corresponding commuting time candidate as candidates for changing the schedule (S908).
  • multiple candidates will be presented.
  • the candidate that becomes the minimum may be presented preferentially.
  • the change history of the congestion information 701 is acquired, and the trains and sections where the congestion rate increases and the threshold value is exceeded, the departure time and the arrival time are obtained. Identify.
  • the user who uses the section is specified, the user schedule 502 of the specified user is acquired, and the commuting date exceeding the threshold value is obtained. Determine if the time zone overlaps the departure and arrival times that exceed the threshold. If they overlap, the congestion rate is changed at the timing when the user schedule is updated, so the processes after step S904 are performed.
  • FIG. 10 an example of a screen for presenting the schedule adjustment result in this embodiment to the user is shown.
  • the user is presented with the schedule before and after the adjustment.
  • a pre-adjustment schedule commute between 7:30 and 8:30, hold a meeting between 10 and 12 o'clock, commute between 17:30 and 18:30, and 18:30.
  • the schedule for fitness is shown from.
  • the adjusted schedule is to work in a shared office from 7:30 to 9:00, commute between 9:00 and 10:00, hold meetings between 10:00 and 12:00, commute between 15:00 and 16:00, and from 16:00.
  • the schedule for working in a shared office between 6:30 pm and fitness from 6:30 pm is shown.
  • commuting congestion can be predicted based on the schedules of all users, and commuting congestion can be avoided by working in a shared office or the like during busy hours. It is possible to provide a schedule adjustment device and a schedule adjustment program capable of performing schedule adjustment that can create time. This can be expected to have the effect of improving the quality of life of the user.
  • 101 Terminal equipment, 102: Schedule adjustment server, 103: Information bank, 104: External service provider, 105: Network such as the Internet, 201: Calculation unit, 202: Storage unit, 203: Communication unit, 204: Input / output unit, 205: Congestion status grasping processing unit, 206: Congestion adjustment processing unit, 207: Congestion information holding unit, 208: User information holding unit, 209: External service information holding unit, 301: Calculation unit, 302: Storage unit, 303: Communication unit, 304: Input / output unit, 305: Information cooperation unit, 306: Personal data management unit, 307: Personal data retention unit, 501: Basic user information, 502: User schedule, 503: Implementation location information, 601: Operation information, 602: timetable information, 603: shared office information, 604: availability, 605: past congestion information, 701: congestion information.
  • 501 Basic user information
  • 502 User schedule
  • 503 Implementation location information
  • 601 Operation information
  • 602 timetable

Landscapes

  • Business, Economics & Management (AREA)
  • Engineering & Computer Science (AREA)
  • Strategic Management (AREA)
  • Tourism & Hospitality (AREA)
  • Human Resources & Organizations (AREA)
  • General Business, Economics & Management (AREA)
  • Economics (AREA)
  • Marketing (AREA)
  • Theoretical Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Physics & Mathematics (AREA)
  • Data Mining & Analysis (AREA)
  • Quality & Reliability (AREA)
  • Operations Research (AREA)
  • Health & Medical Sciences (AREA)
  • General Health & Medical Sciences (AREA)
  • Primary Health Care (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)

Abstract

L'invention concerne un procédé d'ajustement d'horaires destiné à un système d'ajustement d'horaires configuré à partir d'un dispositif terminal connecté à un réseau, d'un serveur d'ajustement d'horaires et d'un fournisseur de service externe, le serveur d'ajustement d'horaires identifiant l'état d'embouteillage pendant la fenêtre de temps de migration pendulaire d'un utilisateur sur la base d'informations d'utilisateur provenant du dispositif terminal et de conditions d'embouteillage passées provenant du fournisseur de service externe, et exécutant également un traitement d'ajustement pour état d'embouteillage lorsque l'utilisateur tente d'effectuer une migration pendulaire pendant un embouteillage et qu'il existe une salle vide au niveau d'un bureau partagé près d'un emplacement qui est plus proche que la destination de migration pendulaire, sur la base d'informations de bureau partagé provenant du fournisseur de service externe.
PCT/JP2020/024171 2019-06-20 2020-06-19 Procédé d'ajustement d'horaires et support de stockage pour stocker un programme d'ajustement d'horaires WO2020256116A1 (fr)

Priority Applications (1)

Application Number Priority Date Filing Date Title
JP2021526926A JP7261878B2 (ja) 2019-06-20 2020-06-19 スケジュール調整方法及びスケジュール調整プログラムを格納した記憶媒体

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
JP2019114801 2019-06-20
JP2019-114801 2019-06-20

Publications (1)

Publication Number Publication Date
WO2020256116A1 true WO2020256116A1 (fr) 2020-12-24

Family

ID=74040495

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/JP2020/024171 WO2020256116A1 (fr) 2019-06-20 2020-06-19 Procédé d'ajustement d'horaires et support de stockage pour stocker un programme d'ajustement d'horaires

Country Status (2)

Country Link
JP (1) JP7261878B2 (fr)
WO (1) WO2020256116A1 (fr)

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20210124955A1 (en) * 2019-10-29 2021-04-29 Nec Corporation Information processing system, information processing method, and non-transitory storage medium
JPWO2021117167A1 (fr) * 2019-12-11 2021-06-17
JP2023060947A (ja) * 2021-10-19 2023-05-01 株式会社日立製作所 労働支援装置及び方法
JP2023128390A (ja) * 2022-03-03 2023-09-14 野村不動産ホールディングス株式会社 シェアオフィス検索支援装置及びシェアオフィス検索支援方法
CN116822841A (zh) * 2023-05-25 2023-09-29 圣奥科技股份有限公司 一种共享工位的管理方法、计算机存储介质及设备

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2002150178A (ja) * 2000-11-07 2002-05-24 Biiraito:Kk レンタルシステム
JP2003276608A (ja) * 2002-03-22 2003-10-02 Nef:Kk 情報提供システム
JP2018045296A (ja) * 2016-09-12 2018-03-22 株式会社東芝 予定管理装置、予定管理システム、および予定管理プログラム

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2002150178A (ja) * 2000-11-07 2002-05-24 Biiraito:Kk レンタルシステム
JP2003276608A (ja) * 2002-03-22 2003-10-02 Nef:Kk 情報提供システム
JP2018045296A (ja) * 2016-09-12 2018-03-22 株式会社東芝 予定管理装置、予定管理システム、および予定管理プログラム

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
"Why Tokyu embarked on a shared office business", TOYOKEIZAI.NET, 5 December 2016 (2016-12-05), XP055774220, Retrieved from the Internet <URL:https://toyokeizai.net/articles//147873> [retrieved on 20200828] *

Cited By (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20210124955A1 (en) * 2019-10-29 2021-04-29 Nec Corporation Information processing system, information processing method, and non-transitory storage medium
JPWO2021117167A1 (fr) * 2019-12-11 2021-06-17
JP7306487B2 (ja) 2019-12-11 2023-07-11 日本電気株式会社 テレワーク効果予測装置、方法及びプログラム
JP2023060947A (ja) * 2021-10-19 2023-05-01 株式会社日立製作所 労働支援装置及び方法
JP7419323B2 (ja) 2021-10-19 2024-01-22 株式会社日立製作所 労働支援装置及び方法
JP2023128390A (ja) * 2022-03-03 2023-09-14 野村不動産ホールディングス株式会社 シェアオフィス検索支援装置及びシェアオフィス検索支援方法
JP7422171B2 (ja) 2022-03-03 2024-01-25 野村不動産ホールディングス株式会社 シェアオフィス検索支援装置及びシェアオフィス検索支援方法
CN116822841A (zh) * 2023-05-25 2023-09-29 圣奥科技股份有限公司 一种共享工位的管理方法、计算机存储介质及设备
CN116822841B (zh) * 2023-05-25 2024-06-11 圣奥科技股份有限公司 一种共享工位的管理方法、计算机存储介质及设备

Also Published As

Publication number Publication date
JPWO2020256116A1 (fr) 2020-12-24
JP7261878B2 (ja) 2023-04-20

Similar Documents

Publication Publication Date Title
WO2020256116A1 (fr) Procédé d&#39;ajustement d&#39;horaires et support de stockage pour stocker un programme d&#39;ajustement d&#39;horaires
Tirachini et al. The sustainability of shared mobility: Can a platform for shared rides reduce motorized traffic in cities?
Ceder et al. Approaching even-load and even-headway transit timetables using different bus sizes
Ting et al. Schedule coordination in a multiple hub transit network
Kumar et al. An algorithm for integrating peer-to-peer ridesharing and schedule-based transit system for first mile/last mile access
JP6823907B2 (ja) 輸送サービス予約方法、輸送サービス予約装置、及び輸送サービス予約プログラム
JP2023017285A (ja) 相乗りタクシーシステム
JP2002073756A (ja) 旅行案内提供装置および旅行案内提供システム並びにそれらのプログラム記録媒体
JP2018106397A (ja) スケジュール調停システムおよびスケジュール調停方法
JP2024100987A (ja) プログラム及び情報処理装置
JP2020040520A (ja) 車両割当支援システム、方法、およびプログラム
Hall Inframarginal travelers and transportation policy
Zhou et al. A novel control strategy in mitigating bus bunching: Utilizing real-time information
JP4054018B2 (ja) 空席経路探索システム、空席経路探索装置および端末装置
JP2021015379A (ja) 配車処理装置
RU2648561C2 (ru) Динамическая система формирования транспортных потоков
Homsi et al. Two‐stage stochastic one‐to‐many driver matching for ridesharing
Andrikopoulos et al. A game theoretic approach for managing multi-modal urban mobility systems
JP6875019B2 (ja) プログラム及び情報処理装置
JP7290433B2 (ja) ライドシェア管理装置
JP7178934B2 (ja) ライドシェア管理装置
JP7367987B2 (ja) プログラム及び情報処理装置
CN110858333A (zh) 计算机化系统、计算机实现的方法及有形计算机可读介质
Edirimanna et al. Integrating On-demand Ride-sharing with Mass Transit at-Scale
JP7410470B2 (ja) プログラム及び情報処理装置

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 20827853

Country of ref document: EP

Kind code of ref document: A1

ENP Entry into the national phase

Ref document number: 2021526926

Country of ref document: JP

Kind code of ref document: A

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 20827853

Country of ref document: EP

Kind code of ref document: A1