健康檢查作業排程模式之研究
Date Issued
2004
Date
2004
Author(s)
簡佩思
DOI
zh-TW
Abstract
This study focused on the model of the scheduling in health examination, and develops a model which completes all patients’ health examination with their own requirements under the constraints of time, resources and other particular limits like the sequence, continuing time of examination to the objective of minimizing the total examination and waiting time counting by examinees and doctors.
For the optimizing solution of scheduling, formulate an integer linear programming model to gain the best solution. But in this integer linear programming model according to the scheduling in health examination, all the variables are binary variables. With the growing numbers of the variables and constraints followed by the increasing parameter, the difficulty and complexity are getting greater. Solving an integer linear programming model especially spends much more time and system resources, even results to infeasible solutions. Therefore, this study proposes the method of heuristic algorithm.
This study proposes two kinds of the heuristic algorithms solving the scheduling in health examination, the examinee based and the doctor based. Although there are two heuristic algorithms based on different targets, both apply for some common steps for the preparation of scheduling. The same parts of the two algorithms are the sort of examinees and operations, and the way to divide the examinees and operations into group. In the algorithm, based on the examinee, the main solution for scheduling is try to plan any operation for one examinee since he has started without any break. Unless all the unplanned operations are dissatisfied the constraints, the examinee must wait in this case. However, according to solution of the doctor based algorithm in scheduling, the considering subject becomes doctors instead of examinees. The method arranges any feasible examinees for doctors as possible in a period of time. Under the only condition of searching out no feasible examinee, the doctor would wait. Whatever applying for any scheduling algorithm, it still check the sequence of operations, resource constraints, continuing working limit, etc. and make sure all the examinees in one group start to accept examination at the same time. Therefore, the heuristic algorithms this study proposed would achieve the objective of minimizing the total examination and waiting time counting by examinees and doctors. In practice, these algorithms could actually used in different environment.
Subjects
啟發性演算法
健康檢查
排程
Heuristic Algorithm
Health Examination
Scheduling
Type
other
File(s)![Thumbnail Image]()
Loading...
Name
ntu-93-R91725005-1.pdf
Size
23.31 KB
Format
Adobe PDF
Checksum
(MD5):027d58b9e4b21cd7f1c0133ff6cf03f0