人間ドックにおける最適スケジュール作成について:- SSSMCシステムの構築 -  [in Japanese] Optimal Scheduling of a Thorough Physical Medical Checkup:- Systematic Construction of SSSMC -  [in Japanese]

Access this Article

Search this Article

Author(s)

Abstract

人間ドックの検査間の待ち時間を短くするために,対話型のスケジューリング支援システムを試作した.本論文では,システムの設計の考え方,人間ドック・スケジューリングの0-1整数計画問題としての定式化,実際例への適用結果を報告する.さらに,受診者の検診の開始順序を決定する問題をジョブショップ・スケジューリング問題の変種として捉えることで,受診者の順序にSPT規則を適用し,受診者の検診を開始する順序を並びかえた問題を解く.SPT規則を用いた受診者の順序は,医療機関で実際に使用されていた受診者の順序よりも受診者の待ち時間が短いスケジュールを与えることができた.そこで,SPT規則を近似的に実現する予約方法を提案し,その有効性を数値例で確かめた.

We develop an interactive support system for generating schedules of a thorough physical medical checkup (ningendoku in Japanese) to reduce the waiting time of medical examinees. Improving the efficiency of the medical checkup is an important problem to be solved for both examinees and medical institutions. For examinees, long waiting time is a waste of personal time. Additionally, unexpected delays in schedule times make examinees to readjust their schedules. These are burdens on the examinees. For medical institutions, reducing examine waiting time for medical checkups under the constraints of doctors and medical facilities will increase their ability to increase the number of examinees. This will result in raising the income of the medical institutions. In this paper, we show the basic idea of implementing a scheduling support system for medical checkups, a 0-1 integer programming formulation of the medical checkup scheduling problem included in the system, and the results of applying the system to real data of a medical institution. In addition to this, we apply the Shortest Processing Time (SPT) rule to the order of examinees by considering the problem as a variation of the job shop scheduling problem. We solve the examine rescheduling problem using the SPT rule. As the result, the schedule obtained has a much shorter waiting time than the real one. We also propose an appointment scheme method for the medical institution to apply the SPT rule approximately. The effectiveness of the scheme is shown by numerical examples.

Journal

  • Journal of Japan Industrial Management Association

    Journal of Japan Industrial Management Association 66(1), 49-58, 2015

    Japan Industrial Management Association

Codes

  • NII Article ID (NAID)
    130005076420
  • NII NACSIS-CAT ID (NCID)
    AN10561806
  • Text Lang
    JPN
  • ISSN
    1342-2618
  • NDL Article ID
    026368895
  • NDL Call No.
    Z4-298
  • Data Source
    NDL  J-STAGE 
Page Top