Automatic scheduling algorithm for personalized clinical test

Jung Woo Kim; Byung June Choi; Kyu Ho Noh; Hyouk Ryeol Choi; Ja Choon Koo; Sung Moo Ryew; Jin Hyun Kim; Woong Hee Son

doi:10.1109/SICE.2006.315248

Automatic scheduling algorithm for personalized clinical test

Jung Woo Kim, Byung June Choi, Kyu Ho Noh, Hyouk Ryeol Choi, Ja Choon Koo, Sung Moo Ryew, Jin Hyun Kim, Woong Hee Son

Dept. of Mechanical & Automotive Engineering

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

4 Scopus citations

Abstract

In this paper, we discuss how to arrange the activities of the clinical laboratory tests to minimize the total processing time. The order of each tests is different, but is fixed. Each of which is to be processed one at a time on m or fewer machines. This situation is referred to a job shop problem which consists of n jobs, m machines. The solution of this problem is considered and I simulated some tests.

Original language	English
Title of host publication	2006 SICE-ICASE International Joint Conference
Pages	5823-5827
Number of pages	5
DOIs	https://doi.org/10.1109/SICE.2006.315248
State	Published - 2006
Event	2006 SICE-ICASE International Joint Conference - Busan, Korea, Republic of Duration: 18 Oct 2006 → 21 Oct 2006

Publication series

Name	2006 SICE-ICASE International Joint Conference

Conference

Conference	2006 SICE-ICASE International Joint Conference
Country/Territory	Korea, Republic of
City	Busan
Period	18/10/06 → 21/10/06

Keywords

Automation
Clinical test
Job shop
Scheduling

Access to Document

10.1109/SICE.2006.315248

Cite this

@inproceedings{3217780ddb5d4079b40082af93ea7c99,

title = "Automatic scheduling algorithm for personalized clinical test",

abstract = "In this paper, we discuss how to arrange the activities of the clinical laboratory tests to minimize the total processing time. The order of each tests is different, but is fixed. Each of which is to be processed one at a time on m or fewer machines. This situation is referred to a job shop problem which consists of n jobs, m machines. The solution of this problem is considered and I simulated some tests.",

keywords = "Automation, Clinical test, Job shop, Scheduling",

author = "Kim, \{Jung Woo\} and Choi, \{Byung June\} and Noh, \{Kyu Ho\} and Choi, \{Hyouk Ryeol\} and Koo, \{Ja Choon\} and Ryew, \{Sung Moo\} and Kim, \{Jin Hyun\} and Son, \{Woong Hee\}",

year = "2006",

doi = "10.1109/SICE.2006.315248",

language = "English",

isbn = "8995003855",

series = "2006 SICE-ICASE International Joint Conference",

pages = "5823--5827",

booktitle = "2006 SICE-ICASE International Joint Conference",

note = "2006 SICE-ICASE International Joint Conference ; Conference date: 18-10-2006 Through 21-10-2006",

}

Kim, JW, Choi, BJ, Noh, KH, Choi, HR, Koo, JC, Ryew, SM, Kim, JH & Son, WH 2006, Automatic scheduling algorithm for personalized clinical test. in 2006 SICE-ICASE International Joint Conference., 4108619, 2006 SICE-ICASE International Joint Conference, pp. 5823-5827, 2006 SICE-ICASE International Joint Conference, Busan, Korea, Republic of, 18/10/06. https://doi.org/10.1109/SICE.2006.315248

TY - GEN

T1 - Automatic scheduling algorithm for personalized clinical test

AU - Kim, Jung Woo

AU - Choi, Byung June

AU - Noh, Kyu Ho

AU - Choi, Hyouk Ryeol

AU - Koo, Ja Choon

AU - Ryew, Sung Moo

AU - Kim, Jin Hyun

AU - Son, Woong Hee

PY - 2006

Y1 - 2006

N2 - In this paper, we discuss how to arrange the activities of the clinical laboratory tests to minimize the total processing time. The order of each tests is different, but is fixed. Each of which is to be processed one at a time on m or fewer machines. This situation is referred to a job shop problem which consists of n jobs, m machines. The solution of this problem is considered and I simulated some tests.

AB - In this paper, we discuss how to arrange the activities of the clinical laboratory tests to minimize the total processing time. The order of each tests is different, but is fixed. Each of which is to be processed one at a time on m or fewer machines. This situation is referred to a job shop problem which consists of n jobs, m machines. The solution of this problem is considered and I simulated some tests.

KW - Automation

KW - Clinical test

KW - Job shop

KW - Scheduling

UR - https://www.scopus.com/pages/publications/34250787605

U2 - 10.1109/SICE.2006.315248

DO - 10.1109/SICE.2006.315248

M3 - Conference contribution

AN - SCOPUS:34250787605

SN - 8995003855

SN - 9788995003855

T3 - 2006 SICE-ICASE International Joint Conference

SP - 5823

EP - 5827

BT - 2006 SICE-ICASE International Joint Conference

T2 - 2006 SICE-ICASE International Joint Conference

Y2 - 18 October 2006 through 21 October 2006

ER -

Automatic scheduling algorithm for personalized clinical test

Abstract

Publication series

Conference

Keywords

Access to Document

Other files and links

Fingerprint

Cite this