JP2009163378A - Information processor, its control method, and program - Google Patents

Abstract

<P>PROBLEM TO BE SOLVED: To provide an information processor capable of efficiently performing an allocation simulation for a plurality of resources of objects to be allocated. <P>SOLUTION: An allocation requirement setting unit 102 sets reservation data as allocation requirements. For the reservation data of each object to be allocated, an allocation order requirement setting unit 103 sets allocation order requirements for determining the order in which allocation processes for allocating the reservation data to bed data are performed. Based on the allocation order requirements set, an allocation order determining unit 104 determines the order in which the reservation data of each object to be allocated are allocated to the bed data. Based on the determined order of allocation and the allocation requirements set for the reservation data of the objects to be allocated, a temporary allocation unit 105 allocates the reservation data to the bed data that serve as allocation candidates searched for, and a display unit 107 displays for every bed data a time chart for the statuses of allocation of the reservation data already or newly allocated. <P>COPYRIGHT: (C)2009,JPO&INPIT

Description

  The present invention relates to an information processing apparatus, a control method therefor, and a program, and more particularly to an information processing apparatus that manages allocation of object data related to an object to resource data related to a resource that can allocate an object to be allocated in time series. And a control method and program thereof.

  In a general hospital bed management system, “current patient allocation to hospital beds” and “hospital reservation information” are managed. Based on the above two management items, whether or not an existing hospitalization reservation or a newly ordered hospitalization reservation can be allocated in the future has been determined based on the judgment based on the experience of the person in charge who receives the hospitalization reservation. For this reason, when the person in charge changes, the personality element that the judgment of admission / rejection change changes.

  Moreover, when simulating the allocation of each hospitalization reservation based on the hospitalization reservation list and the information on the current allocation status to the hospital bed by hand, a lot of labor is required depending on the number of hospital beds. In particular, if there are a large number of beds or the beds are congested, there is an allocatable bed, but it cannot be searched, even if it can be found, it takes time, or the allocation does not match the wishes of the inpatient There were problems such as only being found.

In order to improve this situation, for example, Patent Document 1 proposes a mechanism for automatically allocating beds based on resident information and bed allocation status information. Patent Document 1 discloses a technique for automatically allocating a bed based on a predetermined index indicating the degree of coincidence between a resident and a bed without intervening the judgment of the person in charge.
JP 2002-297760 A

  However, it is preferable that the above-described hospitalization reservation allocation simulation allocates as many hospitalization reservations as possible to the bed, and therefore, it is not practical to perform the manual reservation. Furthermore, if the current allocation state changes or the reservation content changes, all previous simulation results must be discarded, that is, they should be executed based on various conditions. Patent Document 1 described above only discloses a technique for automatically allocating a bed based on a predetermined index indicating the degree of coincidence between a resident and a bed, without intervening the judgment of the person in charge. No point is taken into consideration.

  An object of the present invention is to provide an information processing apparatus capable of efficiently executing an allocation simulation for a plurality of resources (resources) of an allocation object (object), a control method therefor, and a program.

  In order to achieve the above object, an information processing apparatus according to claim 1, wherein information processing for managing allocation of object data related to an object to resource data related to a resource capable of allocating an object to be allocated in time series. An allocation condition setting means for setting an allocation condition for allocating the object data to the resource data for each object data to be allocated, and allocation to the resource data in each of the allocation target object data An allocation order condition setting means for setting an allocation order condition for determining the order, and an allocation order for determining an allocation order for the resource data in each of the object data to be allocated based on the set allocation order condition Determining means and said set Based on the conditions and the determined allocation order, for each object data to be allocated, the resource data that becomes the allocation candidate of the object data is searched, and the object data is searched for the resource data of the searched allocation candidate. An allocation means for allocating an allocatable period of the unallocated period, and a time chart display of the allocation status of the already allocated object data and the object data newly allocated by the allocation means for each resource data Means.

  In order to achieve the above object, a method for controlling an information processing apparatus according to claim 13 manages allocation of object data related to an object to resource data related to a resource capable of allocating an object to be allocated in time series. A method for controlling an information processing apparatus, comprising: an allocation condition setting step for setting an allocation condition for allocating the object data to the resource data for each object data to be allocated; and each of the object data to be allocated An allocation sequence condition setting step for setting an allocation sequence condition for determining an allocation sequence for the resource data in the allocation, and allocation to the resource data in each of the object data to be allocated based on the allocated allocation sequence condition Assignment that determines the sequence Based on the order determination step, the set allocation condition, and the determined allocation order, for each object data to be allocated, the resource data that is an allocation candidate of the object data is searched, and the search is performed. An allocation step of allocating an allocatable period among the unallocated periods of the object data to the allocation candidate resource data, and for each resource data, the already allocated object data and the object data newly allocated in the allocation step And a display step for displaying the allocation state in a time chart.

  In order to achieve the above object, a program according to claim 14 is an information processing apparatus that manages allocation of object data related to an object to resource data related to a resource that can allocate an object to be allocated in time series. A program for causing a computer to execute a control method, wherein the control method sets, for each object data to be allocated, an allocation condition setting step for setting an allocation condition for allocating the object data to the resource data, and the allocation An allocation order condition setting step for setting an allocation order condition for determining an allocation order for the resource data in each of the target object data, and each of the allocation target object data based on the set allocation order condition Said litho in Resource data that is an allocation candidate of the object data for each object data to be allocated based on the allocation order determination step for determining the allocation order for the data, the set allocation condition, and the determined allocation order An allocation step of allocating an allocatable period among the unallocated periods of the object data to the retrieved allocation candidate resource data, and the already allocated object data and the allocation step for each resource data And a display step for displaying a time chart of the allocation state of the newly allocated object data.

  ADVANTAGE OF THE INVENTION According to this invention, the allocation simulation with respect to the several resource (resource) of an allocation target object (object) can be performed efficiently.

  Hereinafter, embodiments of the present invention will be described with reference to the drawings.

  First, an information processing apparatus according to an embodiment of the present invention will be described.

  The information processing apparatus according to the present embodiment allocates the allocation object resource (reserved in the case of the present embodiment) to the resource data related to the resource (the bed in the case of the present embodiment) that can be allocated in time series. Manage allocation of assigned object data for objects.

  FIG. 1 is a block diagram showing a functional configuration of the information processing apparatus according to the present embodiment.

  In FIG. 1, the information processing apparatus 100 includes a control unit 101, and the control unit 101 controls various components for realizing the information processing apparatus 100 according to the present embodiment.

  In the control unit 101, reference numeral 102 denotes an allocation condition setting unit, and a plurality of resources (in this embodiment) of a certain facility (in this embodiment, a hospital) based on conditions input via the operation unit 106 from the user. In the case of this form, for each assignment object (reservation) data of the assignment object (reservation in this embodiment) to the bed), an assignment condition (constraint condition) for assigning the reservation data to the bed data is set. It is set as reservation data for each patient (some are set as patient data, such as patient gender).

  Reference numeral 103 denotes an allocation order condition setting unit that sets an allocation order condition for determining the order (allocation order) in which allocation processing for allocating the reservation data to bed data is performed for each reservation data to be allocated.

  Reference numeral 104 denotes an allocation order determination unit that determines an allocation order for allocating each reservation data to be allocated to bed data based on the allocation order condition set by the allocation order condition setting unit 103.

  105 is a provisional allocation unit, and, based on the allocation conditions set in the reservation data and the allocation order determined by the allocation order determination unit 104, for each reservation data to be allocated, bed data that is an allocation candidate for the reservation data And assignable periods of the unassigned periods of the reservation data of the patient to the searched allocation candidate bed data.

  The information processing apparatus 100 includes an operation unit 106 and a display unit 107. The operation unit 106 performs various inputs for executing various processes provided by the information processing apparatus 100. The display unit 107 includes a user interface. Various images such as are displayed.

  Further, the information processing apparatus 100 includes a storage unit 108, and the storage unit 108 stores various data used in the information processing apparatus 100 according to the present embodiment.

  The storage unit 108 stores bed data 108a, room data 108b, patient data 108c, assigned data 108d, reservation data 108e, and the like.

Here, the content of each data is
[Bed data 108a]: Information about the bed [Room data 108b]: Room type (private room, 2-person room, 4-person room, etc.), information on the floor [Patient data 108c]: Patient's name, sex, date of birth, etc. Profile information [allocated data 108d]: information regarding allocated beds [reservation data 108e]: information regarding hospitalization reservation period and allocation conditions.

  As described above, in the present invention, resource data indicating information regarding a plurality of resources (resources) and object data indicating information regarding an allocation target (object) to be allocated to the resource data are stored in the storage unit 108. Then, using these data, the object data is provisionally allocated to the resource data, and the allocation simulation is executed repeatedly and efficiently. In addition, a user interface for executing the allocation simulation is realized using each component of the information processing apparatus 100.

  Next, a detailed configuration of various data stored in the storage unit 108 will be described.

  FIG. 2 is a diagram showing a detailed configuration of various data stored in the storage unit in FIG.

  In FIG. 2, the detailed configuration of various data stored in the storage unit 108 includes a data type, item names of item data constituting various types of data, and an explanation showing the contents.

  For example, the reservation data 108e includes a reservation ID, a patient ID, a desired start date, a desired start time, and the like as item data. Similarly, various item data exist for other types of data.

  Note that the various types of data in FIG. 2 are examples, and it goes without saying that various data or item data is configured according to the application and purpose.

  Next, the hardware configuration of the information processing apparatus according to the present embodiment will be described.

  FIG. 3 is a block diagram showing a hardware configuration of the information processing apparatus according to the present embodiment.

  Reference numeral 301 denotes a CPU, which controls the entire terminal (computer) using programs and data stored in the RAM 302 and ROM 303, and executes each process described later performed by the information processing apparatus 100.

  A RAM 302 has an area for temporarily storing programs and data loaded from an HDD (Hard Disk Drive) 304 and a work area used by the CPU 301 to perform each process described later.

  A ROM 303 stores various programs such as a computer boot program and BIOS. Reference numeral 304 denotes a large-capacity storage device such as an HDD (Hard Disk Drive), which stores various data such as an OS (Operating System) and programs and data for causing the CPU 301 to execute processes described later performed by the information processing apparatus 100. These are read out to the RAM 302 and executed by the control of the CPU 301 as necessary.

  Reference numeral 305 denotes a network I / F (interface) for connecting the information processing apparatus 100 to the network 310. The information processing apparatus 100 can perform data communication with other devices on the network 310 via the network I / F 305.

  Reference numeral 306 denotes a video I / F (interface), to which a display unit 321 is connected. The display unit 321 includes a CRT, a liquid crystal screen, and the like, and has a function of displaying information such as characters and images on the display screen based on a signal sent via the video I / F 306. These function as a display unit.

  Reference numeral 307 denotes a pointing device, and reference numeral 308 denotes a keyboard, which can input various instructions to the CPU 301. These function as an operation unit.

  Reference numeral 309 denotes an external storage device, which includes a CD-ROM, CD-R / RW, DVD-ROM, DVD-R / RW, DVD-RAM, and the like.

  Reference numeral 311 denotes a system bus, which functions as a bus that interconnects the above-described components.

  In this embodiment, when the number of processing data is enormous, a server client system is constructed in order to distribute the load on the information processing apparatus, and a bed control system is mounted on this system. Anyway. However, in this case, in order to maintain data consistency, it is preferable that clients accessing the server are exclusively controlled.

  Next, a temporary allocation process as an allocation simulation executed by the information processing apparatus according to this embodiment will be described.

  FIG. 4 is a flowchart of a temporary allocation process as an allocation simulation executed by the information processing apparatus according to this embodiment.

  In FIG. 4, first, the allocation condition setting unit 102 sets reservation data 108e as an allocation condition based on the user's operation via the operation unit 106 and the patient data 108c (step S401).

  Next, based on an operation through the user operation unit 106, the allocation order condition setting unit 103 sets an allocation order condition for determining the allocation order for the bed data 108a in each of the reservation data 108e to be allocated (step) S402).

  Next, the allocation order determination unit 104 determines the allocation order for the bed data 108a in each of the allocation data 108e based on the allocation order condition set in step S402 (step S403).

  Next, based on the allocation order determined in step S403, the allocation target reservation data 108e, the allocated data 108d, the room data 108b, the patient data 108c, and the like, the bed data 108a that is an allocation candidate is searched (step S404). .

  Next, the temporary allocation unit 105 temporarily allocates an allocatable period of the unallocated period of the reservation data 108e to the allocation candidate bed data 108a searched in step S404 (step S405).

  Next, the control unit 101 determines whether or not there is reservation data 108e to be allocated with unprovisional allocation (step S406). If there is reservation data 108e to be allocated with unprovisional allocation (YES in step S406), The process returns to step S404.

  As a result of the determination in step S406, if there is no reservation data 108e to be allocated that has not been provisionally allocated (NO in step S406), the display unit 107 displays the allocated reservation data and the provisionally allocated reservation data for each bed data 108a. Is displayed in a time chart (step S407), and the process is terminated.

  Next, the embodiment of the temporary allocation process of FIG. 4 will be specifically described.

  In this embodiment, a case where the present invention is applied to a small hospital having 10 beds will be described.

  First, the room and bed of this hospital are configured as shown in FIG. 5, and it is assumed that nine patients shown in FIG. 6 are currently hospitalized. Further, the current date and time is 11 days.

  When the time chart display of the state of FIG. 6 is performed with the horizontal axis as the date and time, it is as shown in FIG. In this hospital, men and women cannot be admitted to the same room and cannot move beds during hospitalization.

  In FIG. 7, a blank cell 701 indicates that the bed is empty at the date and time, and a hatched cell 702 indicates that the man occupies the bed at the date and time or the current date and time after that. The hatched cell 703 indicates that the woman is occupying the bed at the date and time, or that the woman is planning to occupy the bed after the current date and time. ing. Since the patient occupying the bed 102 has an undecided discharge date, the patient is supposed to occupy the bed for a sufficiently long period (up to the 20th day in FIG. 7 which is the last day on the display).

  Here, it is assumed that there are four hospitalization reservations as shown in FIG.

  At this time, the person in charge of the hospital executes a temporary allocation process as the allocation simulation of FIG.

  First, in step S401, four pieces of reservation data are set based on the operation of the person in charge. Next, in step S402, an allocation order condition for determining the allocation order is set based on the operation of the person in charge. Here, it is assumed that the reservation acceptance order is set as the allocation order condition. Next, in step S403, the allocation order is determined for the four pieces of reservation data based on the allocation order condition set in step S402. Next, in step S404, based on the allocation order determined in step S403, bed data that is an allocation candidate is searched based on the first reservation data (Mie Nishimoto's reservation data). Next, in step S405, the reservation data is provisionally allocated to the allocation candidate bed data searched in step S403. At this time, the reservation data is already assigned. Next, in step S406, since the next reservation data (reservation data such as Shiro Nagai and Kazuo Nishimoto) has not been allocated, the process returns to step S404, and temporary allocation of reservation data is continuously executed. In step S407, a time chart of the allocation state of the reserved data that has already been allocated (reservation data such as Hanako Yamada) and the reservation data that has been provisionally allocated (reservation data such as Megumi Nishimoto) is displayed.

  The time chart display at this time is as shown in FIG.

  In FIG. 9, a thin filled cell 901 indicates the allocation state of allocated reservation data, and the numbers in the cells indicate the allocation order. These temporary assignments are canceled after the assignment simulation is executed. Note that some temporary assignments may be finalized and only the remaining temporary assignments may be released. The reason is that there is a possibility that the current allocation state may change such as occurrence of sudden illness, change of scheduled discharge date, change of planned hospitalization date, patient bed movement or room movement. These changes are made according to the current bed availability. Therefore, it is not preferable to set all future reservations to the assigned state. When confirming some temporary assignments, enter the conditions to be confirmed (for example, hospitalization date or operation date), confirm the ones that match the conditions, or accept the selection of temporary assignments to confirm the assignment. A technique such as finalizing the assigned temporary allocation may be used.

  Here, it is assumed that a new hospitalization reservation as shown in FIG. 10 has occurred.

  At this time, the person in charge executes the allocation simulation for five hospitalization reservations in which the new hospitalization reservation shown in FIG. 10 is added to the hospitalization reservation shown in FIG.

  However, when the assignment simulation is executed, it is understood that a new hospitalization reservation cannot be assigned. Therefore, in order to be able to assign a new hospitalization appointment, it is necessary to make adjustments with the doctor such as advancing the discharge date of an existing or other appointment, or delaying the scheduled hospitalization date of a new hospitalization appointment. Specifically, the discharge date of the patient occupying the bed 301 is advanced by one day, or the planned hospitalization date of a new hospitalization reservation is delayed by one day. These measures can be determined by executing the above-described allocation simulation.

  In the above-described provisional assignment process, the order is determined in the order of accepting reservations. Instead, assignment may be made in descending order of specific constraint conditions. For example, it is assumed that a room type is desired as a constraint condition. Room types include quadruple rooms, double rooms, and private rooms. When a room type request is given to a certain reservation, it can be determined that the constraint condition is severe or moderate, depending on the number of beds for each room type in the hospital. In this way, for each constraint condition, the severity of the condition may be defined quantitatively, and the order may be determined and assigned according to the magnitude of the value.

  Further, in the above-described provisional assignment process, the order is determined in the order of accepting reservations, but instead, the order may be assigned in the order of the hospitalization scheduled date or may be assigned in the order of the scheduled surgery date.

  Further, in the above-described provisional allocation process, the allocation condition setting unit 102 sets allocation conditions for a plurality of types of items and sets weights for each allocation condition, and the allocation order condition setting unit 103 As an alternative, the strict order may be set in consideration of the weighting condition of the allocation condition.

  Next, a first modification of the temporary allocation process as an allocation simulation executed by the information processing apparatus according to this embodiment will be described.

  FIG. 11 is a flowchart of a first modification of the temporary allocation process as the allocation simulation executed by the information processing apparatus according to this embodiment.

  In FIG. 11, first, the allocation condition setting unit 102 sets reservation data 108e as an allocation condition based on a user operation via the operation unit 106 and patient data 108c (step S501).

  Next, bed data 108a that is an allocation candidate is searched based on the reservation data 108e to be allocated set in step S501 (step S502).

  Next, the bed data 108a that is the allocation candidate searched in step S502 is counted (step S503).

  Next, it is determined whether or not there is reservation data 108e for which the allocation candidate is not counted (step S504). If there is reservation data 108e for which the allocation candidate is not counted (YES in step S504), the processing returns to step S502. .

  As a result of the determination in step S504, when there is no reservation data 108e for which allocation candidates are not counted (NO in step S504), the allocation order condition setting unit 103 allocates the allocation data to the bed data 108a in each of the reservation data 108e to be allocated. As an assignment order condition for determining the order, the order with the smallest count result of assignment candidates in step S503 is set (step S505). The fact that the number of allocation candidates is small can be regarded as reservation data that is difficult to allocate. Therefore, in the first modification of the temporary allocation process of the present invention, the processing is performed in the order in which it is difficult to perform allocation, thereby reducing the occurrence of reservation data that cannot be allocated.

  Next, the allocation order determination unit 104 determines the allocation order for the bed data 108a in each of the reservation data 108e to be allocated based on the allocation order condition set in step S505 (step S506).

  Next, based on the allocation order determined in step S506, the allocation target reservation data 108e, the allocated data 108d, the room data 108b, the patient data 108c, and the like, the bed data 108a that is an allocation candidate is searched (step S507). .

  Next, the temporary allocation unit 105 temporarily allocates an allocatable period in the unallocated period of the reservation data 108e to the allocation candidate bed data 108a searched in step S507 (step S508).

  Next, the control unit 101 determines whether or not there is reservation data 108e to be allocated with unprovisional allocation (step S509). When there is reservation data 108e to be allocated with unprovisional allocation (YES in step S509), The process returns to step S507.

  As a result of the determination in step S509, when there is no reservation data 108e to be allocated for unprovisional allocation (NO in step S509), the display unit 107 displays the already allocated reservation data and new temporary allocation processing for each bed data 108a. The time chart display of the allocation state of the reservation data that has been performed is performed (step S510), and this process ends.

  Next, an example of the temporary allocation process of FIG. 11 will be specifically described.

  The case where this embodiment is also applied to a small hospital with 10 beds will be described.

  Similarly, the hospital room and bed are configured as shown in FIG. 5, and the nine patients shown in FIG. 6 are currently hospitalized. Further, the current date and time is 11 days. Further, when the time chart display of the state of FIG. 6 is performed with the horizontal axis as the date and time, it is as shown in FIG. In this hospital, men and women cannot be admitted to the same room and cannot move beds during hospitalization.

  Here, it is assumed that there are three hospitalization reservations as shown in FIG.

  At this time, when the person in charge of the hospital executes the provisional allocation process of FIG. 4, Keiji Nishimoto in the reservation acceptance order 1 can be allocated to the beds 201, 202, and 501 because men and women cannot be allocated to the same room. Here, it is assumed that Keizo Nishimoto in the reservation acceptance order 1 is assigned to the bed 201. In this case, there is no bed to which Shiro Nagai in the reservation acceptance order 2 can be allocated. Then, Kazuo Nishikawa in the reservation acceptance order 3 is assigned to either the bed 202 or the bed 501. Here, it is assumed that Kazuo Nishimoto in the order of reservation acceptance 3 is assigned to the bed 202. The time chart display of the allocation state at this time is as shown in FIG.

  If Shiro Nagai of reservation acceptance order 2 was assigned first, Shiro Nagai was assigned to bed 201, the remaining two were assigned to bed 202 and bed 501, and all three could be assigned. .

  At this time, the temporary allocation process shown in FIG. 11 is executed as an allocation simulation.

  First, in step S501, three pieces of reservation data are set based on the operation of the person in charge. Next, in steps S502 to S504, based on the three pieces of reservation data, bed data serving as allocation candidates when each reservation data is allocated independently is searched, and the bed data of the searched allocation candidates is counted. . Here, the counting result of the allocation candidate bed data based on the reservation data of Keiji Nishimoto is 3, the counting result of Shiro Nagai is 1, and the counting result of Nishikawa Kazuo is 3. Next, in step S505, an order having a smaller count result of assignment candidates is set as an assignment order condition for determining the order of assignment. Next, in step S506, the allocation order is determined for the three pieces of reservation data based on the allocation order condition set in step S505. Next, in step S507, based on the allocation order determined in step S506, bed data that is an allocation candidate is searched based on the reservation data with the smallest counting result (reservation data of Shiro Nagai). Next, in step S508, reservation data is temporarily allocated to the allocation candidate bed data searched in step S507. At this time, the reservation data is already assigned. Next, in step S509, since the reservation data with the smallest count result (reservation data of Keiji Nishimoto or Kazuo Nishikawa) is not yet allocated, the process returns to step S507 and continuously executes temporary allocation of the reservation data. . In step S510, a time chart of the allocation state of the allocated reservation data (reservation data such as Hanako Yamada) and the provisionally allocated reservation data (reservation data such as Shiro Nagai) is displayed.

  The time chart display at this time is as shown in FIG.

  In the provisional assignment process of FIG. 11, provisional assignment is performed from the reservation data with the smallest assignment candidate count result. Since the number of allocation candidates is one index that represents the severity of the constraint conditions, all reservation data is provisionally allocated by performing temporary allocation from the one with the smallest allocation candidate count result, that is, the one with severe conditions. The possibility that it can be increased.

  In addition, the allocation candidate mentioned above becomes the number of beds which can be allocated. However, when an inpatient or an inpatient reservation patient can be moved during the hospitalization period, there are various allocation candidates depending not only on the number of beds but also on the combination of beds before and after the movement and on the date of movement. The number of allocation candidates may be counted in consideration of such combinations.

  In addition, the allocation order determination unit 104 that determines the allocation order of the reservation data to be allocated determines a function that enumerates allocation candidates and outputs the number of candidates, and one allocation that is evaluated as the best among the candidates. It has a function to perform.

  In the temporary allocation process of FIG. 11 described above, the order is determined based on the number of beds that can be allocated. If there are a plurality of reservations having the same number of beds that can be allocated, a specific constraint condition among them is determined. You may assign in order from the one with severe value. For example, it is assumed that a room type is desired as a constraint condition. Room types include quadruple rooms, double rooms, and private rooms. When a room type request is given to a certain reservation, it can be determined that the constraint condition is severe or moderate, depending on the number of beds for each room type in the hospital. In this way, for each constraint condition, the severity of the condition may be defined quantitatively, and the order may be determined and assigned according to the magnitude of the value.

  In addition, when there are a plurality of reservations with the same number of beds that can be allocated, they may be allocated in the order from the earliest hospitalization date or from the earliest surgery date.

  Also, the allocation condition setting unit 102 sets allocation conditions for a plurality of types of items and sets weights for each allocation condition, and the allocation order condition setting unit 103 has reservations with the same number of assignable beds. If there are a plurality of reservations, the assignment order may be set in the order of strict assignment conditions among reservations with the same number of beds, taking into consideration the weighting of the assignment conditions as the assignment order conditions.

  Next, a second modification of the temporary allocation process as an allocation simulation executed by the information processing apparatus according to this embodiment will be described.

  FIG. 15 is a flowchart of a second modification of the temporary allocation process as the allocation simulation executed by the information processing apparatus according to this embodiment.

  In FIG. 15, first, the allocation condition setting unit 102 sets the reservation data 108e as the allocation condition based on the operation through the operation unit 106 from the user and the patient data 108c (step S601).

  Next, bed data 108a that is an allocation candidate is searched based on the allocation target reservation data 108e set in step S601 (step S602).

  Next, the bed data 108a that is the allocation candidate searched in step S602 is counted (step S603).

  Next, it is determined whether or not there is reservation data 108e for which the allocation candidate is not counted (step S604). If there is reservation data 108e for which the allocation candidate is not counted (YES in step S604), the processing returns to step S602. .

  As a result of the determination in step S604, when there is no reservation data 108e for which the allocation candidate is not counted (NO in step S604), the bed data 108a that is the allocation candidate for the reservation data 108e with the smallest allocation candidate count result in step S603. Is searched (step S605).

  Next, the temporary allocation unit 105 temporarily allocates an allocatable period in the unallocated period of the reservation data 108e to the allocation candidate bed data 108a searched in step S605 (step S606).

  Next, the control unit 101 determines whether or not there is reservation data 108e to be allocated with unprovisional allocation (step S607). If there is reservation data 108e to be allocated with unprovisional allocation (YES in step S607), The process returns to step S602.

  As a result of the determination in step S607, when there is no reservation data 108e to be allocated that is not provisionally allocated (NO in step S607), the display unit 107 assigns already allocated reservation data and newly allocated data for each bed data 108a. The time chart display of the reservation data allocation state is performed (step S608), and this process is terminated.

  According to the temporary allocation process of FIG. 15, the timing for counting allocatable beds is different from the temporary allocation process of FIG. 11, and every time one reservation data is allocated, the allocatable beds are counted again. Therefore, when the number of reservations and the number of beds is large, it is possible to calculate the strictness of restrictions more precisely and to increase the possibility of being allocated without generating the remaining allocation.

  The reservation data allocation is not limited to one by one, but a condition is set such that a predetermined number of assignments are assigned according to the assignment order, reservations with the number of assignment candidates equal to or less than a predetermined number are set, and reservation data that matches the conditions is set. It is also possible to assign. Thereafter, the number of candidates that can be allocated to the bed after the allocation state change is counted again for the remaining unprovisional allocation reservation.

  Further, when there are a plurality of reservation data having the same number of allocatable beds, it is possible to set the allocation order in the order of the conditions described in the first modification.

  Next, a third modification of the temporary allocation process as an allocation simulation executed by the information processing apparatus according to this embodiment will be described.

  FIG. 16 is a flowchart of a third modification of the temporary allocation process as the allocation simulation executed by the information processing apparatus according to this embodiment.

  In FIG. 16, first, the allocation condition setting unit 102 sets the reservation data 108e as the allocation condition based on the operation from the user via the operation unit 106 and the patient data 108c (step S701).

  Next, a permutation of the reservation data 108e according to the factorial of n when the total number of the reservation data 108e is n is generated (step S702).

  Next, it is determined whether or not there is an untriald permutation among the permutations generated in step S702 (step S703).

  As a result of the determination in step S703, if there is an untriald permutation (YES in step S703), the bed data 108a that is an allocation candidate of the reservation data 108e is searched in the order according to one permutation among the untriald permutations. (Step S704).

  Subsequently, the temporary allocation unit 105 temporarily allocates the reservation data 108e to the allocation candidate bed data 108a searched in step S704 (step S705).

  Next, the control unit 101 determines whether or not there is reservation data 108e to be allocated that is not provisionally allocated (step S706).

  As a result of the determination in step S706, if there is reservation data 108e to be allocated that has not been provisionally allocated (YES in step S706), it is determined whether or not the allocation is better than the best allocation so far (step S707). Here, the best allocation is an index that is set according to the evaluation criteria of the hospital, for example, when the number of allocated reservation data is the largest or when the occupancy rate of the bed during the specified period is the highest. It is the result of the highest allocation until halfway through.

  If the result of determination in step S707 is that the assignment is not better than the best assignment so far (NO in step S707), the process returns to step S703, and if the assignment is better than the best assignment so far (step (YES in S707), the best allocation so far is updated to the current allocation (step S708), and the process returns to step S703.

  If the result of determination in step S703 is that there is no permutation that has not been attempted (NO in step S703), or if the result of determination in step S706 is that there is no reservation data 108e to be allocated for tentative allocation (NO in step S706), The display unit 107 displays, for each bed data 108a, a time chart of the allocation state of the reservation data that has already been allocated and the reservation data that has been temporarily allocated (the best allocation state when NO in step S703). Step S709), the process is terminated.

  According to the temporary allocation process of FIG. 16, the allocation simulation can be repeatedly executed for all the permutations of the reservation data, and the reservation allocation can be executed efficiently.

  FIG. 17 is an example of a time chart display screen displayed during the execution of each allocation simulation described above.

  As shown in FIG. 17, the date and time are arranged in the horizontal direction, the bed is arranged in the vertical direction, and the reservation assigned to the bed is displayed in a rectangle (hereinafter referred to as “piece”). When the simulation button 801 on the time chart display screen in FIG. 17 is pressed, the above-described allocation simulation is executed. Further, when the confirm button 802 is pressed, an input screen as shown in FIG. 20 is displayed, and the designated scheduled hospitalization date can be input. Here, after designating the date and time, when the confirmation button 804 on the input screen in FIG. 20 is pressed, the assignment is confirmed for the reservation with the scheduled date of hospitalization before the designated date and time in the simulation result, and the next and subsequent times. It will be excluded from the target of simulation. When the cancel button 803 on the time chart display screen in FIG. 17 is pressed, a cancel process that is the reverse of the process when the confirm button 802 is pressed is executed, and the reservation allocation to the reservation bed is cancelled. Thus, the simulation can be performed from the next simulation.

  In addition, as shown in FIG. 18, the time chart display screen displayed during the execution of each allocation simulation described above identifies the reservation of temporary allocation during the execution of the allocation simulation by a hatched piece or a horizontal line piece on the time chart. May be. In FIG. 18, it is indicated by a hatched piece 901, a horizontal line piece 902, and the like that temporary allocation is made to the bed 1 of the room 203 and the bed 3 of the room 203 as a result of the simulation. Thereby, since the reservation whose allocation has already been confirmed is the filled piece 903, the reservation for temporary allocation can be easily determined. Further, by pressing the confirmation button 802 described above, these reservations are changed to a display similar to the painted piece 903. In addition, although the reservation of temporary allocation is displayed by the hatched piece or the horizontal line piece, it is needless to say that the method is not limited as long as it is an identifiable method such as color or shading.

  Further, in each allocation simulation described above, the allocation conditions may be relaxed or continuously relaxed. Thereby, allocation simulation can be performed efficiently. Here, the relaxation of the constraint condition means that, for example, when there is a constraint such as the number of transfer beds per hospitalization, this number is gradually relaxed from 0 times to 1 time to 2 times. Thereby, more reservations can be allocated. Also, by continuous relaxation, all reservations can be allocated under appropriate constraints, and the allocation simulation can be executed efficiently. In this case, the allocation condition setting unit 102 receives and sets the allocation condition relaxation condition setting.

  In addition, the time chart display screen displayed after execution of the allocation simulation when the constraint conditions are relaxed or continuously relaxed makes it easy to discriminate reservations allocated in a relaxed state on the screen as shown in FIG. May be. In the time chart display screen of FIG. 19, there is a darkly-painted piece 904 in the bed 2 of the room 203, which indicates that the reservation is in a state where the constraint conditions are relaxed. Furthermore, when the cursor 905 is overlaid on the piece 904, a pop-up 906 is displayed, and it may be explicitly displayed on the pop-up 906 which constraint conditions have been relaxed. As a result, the user can determine which constraint has been relaxed. It should be noted that the display with dark fill is only an example, and it is needless to say that the method is not limited as long as it is an identifiable method such as a color or pattern.

  The object of the present invention is achieved by executing the following processing. That is, a storage medium storing software program codes for realizing the functions of the above-described embodiment is supplied to a system or apparatus, and a computer (or CPU, MPU, etc.) of the system or apparatus is stored in the storage medium. This is a process of reading the program code. In this case, the program code itself read from the storage medium realizes the functions of the above-described embodiments, and the program code and the storage medium storing the program code constitute the present invention. .

  Moreover, the following can be used as a storage medium for supplying the program code. For example, floppy (registered trademark) disk, hard disk, magneto-optical disk, CD-ROM, CD-R, CD-RW, DVD-ROM, DVD-RAM, DVD-RW, DVD + RW, magnetic tape, nonvolatile memory card, ROM or the like. Alternatively, the program code may be downloaded via a network.

  Further, the present invention includes a case where the function of the present embodiment is realized by executing the program code read by the computer. In addition, the OS (operating system) running on the computer performs part or all of the actual processing based on the instruction of the program code, and the above-described functions of the present embodiment are realized by the processing. This is also included.

  Furthermore, the present invention includes a case where the above-described functions of the present embodiment are realized by the following processing. That is, the program code read from the storage medium is written in a memory provided in a function expansion board inserted into the computer or a function expansion unit connected to the computer. Thereafter, based on the instruction of the program code, the CPU or the like provided in the function expansion board or function expansion unit performs part or all of the actual processing.

It is a block diagram which shows the function structure of the information processing apparatus which concerns on embodiment of this invention. It is a figure which shows the detailed structure of the various data stored in the memory | storage part in FIG. It is a block diagram which shows the hardware constitutions of the information processing apparatus which concerns on this Embodiment. It is a flowchart of the temporary allocation process as an allocation simulation which the information processing apparatus which concerns on this Embodiment performs. It is a figure for demonstrating the Example of the allocation simulation which the information processing apparatus which concerns on this Embodiment performs. It is a figure for demonstrating the Example of the allocation simulation which the information processing apparatus which concerns on this Embodiment performs. It is a figure for demonstrating the Example of the allocation simulation which the information processing apparatus which concerns on this Embodiment performs. It is a figure for demonstrating the Example of the allocation simulation which the information processing apparatus which concerns on this Embodiment performs. It is a figure for demonstrating the Example of the allocation simulation which the information processing apparatus which concerns on this Embodiment performs. It is a figure for demonstrating the Example of the allocation simulation which the information processing apparatus which concerns on this Embodiment performs. It is a flowchart of the 1st modification of the temporary allocation process as an allocation simulation which the information processing apparatus which concerns on this Embodiment performs. It is a figure for demonstrating the Example of the allocation simulation which the information processing apparatus which concerns on this Embodiment performs. It is a figure for demonstrating the Example of the allocation simulation which the information processing apparatus which concerns on this Embodiment performs. It is a figure for demonstrating the Example of the allocation simulation which the information processing apparatus which concerns on this Embodiment performs. It is a flowchart of the 2nd modification of the temporary allocation process as an allocation simulation which the information processing apparatus which concerns on this Embodiment performs. It is a flowchart of the 3rd modification of the temporary allocation process as an allocation simulation which the information processing apparatus which concerns on this Embodiment performs. It is an example of the time chart display screen displayed during execution of each allocation simulation mentioned above. It is an example of the time chart display screen displayed during execution of each allocation simulation mentioned above. It is an example of the time chart display screen displayed during execution of each allocation simulation mentioned above. It is an example of the input screen of a designated hospitalization date.

Explanation of symbols

DESCRIPTION OF SYMBOLS 100 Information processing apparatus 101 Control part 102 Assignment condition setting part 103 Assignment order condition setting part 104 Assignment order determination part 105 Temporary assignment part 106 Operation part 107 Display part 108 Storage part 108a Bed data 108b Room data 108c Patient data 108d Assigned data 108e Reservation data

Claims (14)

An information processing apparatus that manages allocation of object data related to an object to resource data related to a resource capable of allocating an object that is an allocation target in time series,
Allocation condition setting means for setting an allocation condition for allocating the object data to the resource data for each object data to be allocated;
An allocation order condition setting means for setting an allocation order condition for determining an allocation order for the resource data in each of the object data to be allocated;
An allocation order determining means for determining an allocation order for the resource data in each of the allocation target object data based on the set allocation order condition;
Based on the set allocation conditions and the determined allocation order, for each object data to be allocated, the resource data that becomes the allocation candidate of the object data is searched, and the resource data of the searched allocation candidate Assigning means for assigning an allocatable period among the unallocated periods of the object data,
An information processing apparatus comprising: a display unit configured to display, for each resource data, a time chart that displays the already allocated object data and the allocation state of the object data newly allocated by the allocation unit. Further, based on the set allocation condition, for each object data to be allocated, a search is made for resource data that is an allocation candidate for the object data, and the object data that has not been searched for is assigned to the searched allocation candidate resource data. A counting means for counting the allocation combination of the results allocated in the allocatable period of the allocation period;
The information processing apparatus according to claim 1, wherein the allocation order condition setting unit sets, as the allocation order condition, an order having a smaller count result by the counting unit. The assigning means performs a part of object data assigning process,
The counting unit counts the allocation combination for the resource data after the allocation processing of the part of the object data is performed by the allocation unit for each remaining object data to be allocated after the allocation processing ends,
The information processing apparatus according to claim 2, wherein the object data is allocated to the resource data by repeating the processing of the counting unit and the allocation unit. The allocation condition setting means sets an allocation condition for a plurality of types of items, and sets a weight for each allocation condition,
The information processing method according to any one of claims 1 to 3, wherein the allocation order condition setting unit sets, as the allocation order condition, an order in which the allocation condition is strict considering the weighting. apparatus. The information processing apparatus according to any one of claims 1 to 4, wherein the allocation order condition includes an order in which an allocation period start date is earlier. The information processing apparatus according to any one of claims 1 to 5, wherein the allocation order condition includes an early order of a predetermined day in an allocation period. Permutation generating means for generating a permutation of the object data to be allocated according to the factorial of n when the total number of the object data to be allocated is n,
The allocation order condition setting means sets each permutation as an allocation order condition,
Provisional allocation means,
The allocating unit repeats the object data allocation process every time the allocation order condition setting unit sets the allocation order condition, and among the object data allocations performed by the temporary allocation unit, predetermined The information processing apparatus according to claim 1, wherein the object data is assigned according to a permutation that is assigned the best in the evaluation criteria. The information processing apparatus according to claim 1, further comprising a determination unit that determines the allocation of object data allocated to the resource data of the allocation candidate. Furthermore, a setting means for setting the final condition newly assigned by the assigning means,
The information processing apparatus according to claim 8, wherein the determination unit determines the allocation of the newly allocated object data that matches the determination condition. The display means displays the time chart display of the allocation state of the newly allocated object data differently from the time chart display of the allocation state of the allocated object data. The information processing apparatus according to any one of the above. Furthermore, a relaxation condition setting means for setting a relaxation condition allowed for the allocation condition;
Determining means for determining a new allocation condition from the allocation condition and the relaxation condition;
The temporary allocation means, based on the new allocation condition or the allocation condition and the new allocation condition, and the determined allocation order, assigns object data allocation candidates for each object data to be allocated. 8. The resource data is retrieved, and the object data is provisionally allocated during an allocatable period among the unallocated periods of the retrieved allocation candidate resource data. 8. The information processing apparatus described in 1. The information processing apparatus according to claim 11, wherein the display unit displays a time chart display of the allocation state of the object data temporarily allocated based on the new allocation condition different from the others. A control method of an information processing apparatus that manages allocation of object data related to an object to resource data related to a resource capable of allocating an object that is an allocation target in time series,
An allocation condition setting step for setting an allocation condition for allocating the object data to the resource data for each object data to be allocated;
An allocation order condition setting step for setting an allocation order condition for determining an allocation order for the resource data in each of the object data to be allocated;
An allocation order determining step for determining an allocation order for the resource data in each of the object data to be allocated based on the set allocation order condition;
Based on the set allocation conditions and the determined allocation order, for each object data to be allocated, the resource data that becomes the allocation candidate of the object data is searched, and the resource data of the searched allocation candidate An allocation step for assigning an allocatable period among the unallocated periods of the object data to
A control method for an information processing apparatus, comprising: a time chart display for displaying, for each resource data, object data that has already been assigned and an assignment state of the object data newly assigned in the assignment step. A program that causes a computer to execute a control method of an information processing apparatus that manages allocation of object data related to an object to resource data related to a resource that can assign an object that is an assignment target in time series, the control method comprising: ,
An allocation condition setting step for setting an allocation condition for allocating the object data to the resource data for each object data to be allocated;
An allocation order condition setting step for setting an allocation order condition for determining an allocation order for the resource data in each of the object data to be allocated;
An allocation order determining step for determining an allocation order for the resource data in each of the object data to be allocated based on the set allocation order condition;
Based on the set allocation conditions and the determined allocation order, for each object data to be allocated, the resource data that becomes the allocation candidate of the object data is searched, and the resource data of the searched allocation candidate An allocation step for assigning an allocatable period among the unallocated periods of the object data to
A display step for displaying, for each resource data, a time chart displaying the already allocated object data and the allocation state of the object data newly allocated in the allocation step.

Images