• Home
  • Search
  • The medical laboratory scheduling for weighted flow-time
  • Cite Icon7
  • https://doi.org/10.1007/s10878-017-0211-4Copy DOI Icon

The medical laboratory scheduling for weighted flow-time

Show More
  • Abstract
  • Literature Map
  • References
  • Citations
  • Similar Papers
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.

Similar Papers
  • Research Article

Online Scheduling on a Parallel‐Batch Machine With Pulse Interruptions

  • Mar 16, 2025
  • Naval Research Logistics (NRL)
  • Ran Lin +3
  • Research Article
  • Citations37

Online scheduling on two uniform machines to minimize the makespan

  • Jan 29, 2009
  • Theoretical Computer Science
  • Ming Liu +3
  • Research Article
  • Citations8

Heuristics for Online Scheduling on Identical Parallel Machines with Two GoS Levels

  • Aug 01, 2019
  • Journal of Systems Science and Complexity
  • Shuang Cai +1
  • Book Chapter
  • Citations100

Online Scheduling via Learned Weights

  • Jan 01, 2020
  • Silvio Lattanzi +3
  • Conference Article
  • Citations3

On-line scheduling of robotic cells with post-processing residency constraints

  • Nov 10, 2003
  • Hyun Joong Yoon +1
  • Conference Article
  • Citations8

On the speed requirement for optimal deadline scheduling in overloaded systems

  • Apr 23, 2001
  • Tak-Wah Lam +2
  • Research Article
  • Citations4

On robust online scheduling algorithms

  • Jul 21, 2009
  • Journal of Scheduling
  • Michael Gatto +1
  • Research Article
  • Citations32

Online real-time preemptive scheduling of jobs with deadlines on multiple machines

  • Jan 01, 2001
  • Journal of Scheduling
  • Bhaskar Das Gupta +1
  • Research Article
  • Citations5

Online scheduling with multi‐state machines

  • Dec 20, 2017
  • Networks
  • Dawsen Hwang +1
  • Research Article
  • Citations15

A best online algorithm for scheduling on two parallel batch machines

  • Feb 24, 2009
  • Theoretical Computer Science
  • Ji Tian +2
  • Research Article
  • Citations25

Markov Decision Process Based Energy-Efficient On-Line Scheduling for Slice-Parallel Video Decoders on Multicore Systems

  • May 25, 2012
  • IEEE Transactions on Multimedia
  • Nicholas Mastronarde +4
  • Conference Article
  • Citations12

MOCA: A multiprocessor on-line competitive algorithm for real-time system scheduling

  • Dec 01, 1993
  • G Koren +2
  • Research Article
  • Citations10

Online scheduling on two parallel-batching machines with limited restarts to minimize the makespan

  • Apr 24, 2010
  • Information Processing Letters
  • Ruyan Fu +3
  • Research Article
  • Citations15

Online scheduling on unbounded parallel-batch machines to minimize maximum flow-time

  • Jun 21, 2011
  • Information Processing Letters
  • Wenhua Li +1
  • Research Article
  • Citations61

Optimal Online Scheduling With Arbitrary Hard Deadlines in Multihop Communication Networks

  • Feb 01, 2016
  • IEEE/ACM Transactions on Networking
  • Zhoujia Mao +2
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.