The medical laboratory scheduling for weighted flow-time

Wenhua Li () and Xing Chai
Additional contact information
Wenhua Li: Zhengzhou University
Xing Chai: Zhengzhou University

Journal of Combinatorial Optimization, 2019, vol. 37, issue 1, No 5, 83-94

Abstract: Abstract This paper studies an on-line scheduling in medical laboratory. The sample of a patient is regarded as a job waiting to be scheduled, and each analyzer as a machine that may analyze several samples simultaneously as a batch. The samples arrive over time, and the information of each sample is not released until the sample arrives. Each sample is given a weight in a known range to represent its importance or urgency. Thus the medical laboratory scheduling can be described as a parallel-batch on-line scheduling problem. The objective is to minimize the maximum weighted flow-time. For the unbounded batch capacity model, a best possible on-line algorithm is established for any given range of weights. Moreover, for the bounded batch capacity model, a best possible on-line algorithm is presented for the range of weights 1 to 2.

Keywords: Medical laboratory; On-line scheduling; Parallel-batch; Weighted flow-time; Competitive ratio (search for similar items in EconPapers)
Date: 2019
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (4)

Downloads: (external link)
http://link.springer.com/10.1007/s10878-017-0211-4 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:37:y:2019:i:1:d:10.1007_s10878-017-0211-4

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-017-0211-4

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().