• Publications
  • Influence
Online Scheduling with Partial Job Values: Does Timesharing or Randomization Help?
  • F. Chin, S. Fung
  • Mathematics, Computer Science
  • Algorithmica
  • 6 August 2003
We study the following online preemptive scheduling problem: given a set of jobs with release times, deadlines, processing times and weights, schedule them so as to maximize the total value obtained.Expand
  • 95
  • 17
  • PDF
Online competitive algorithms for maximizing weighted throughput of unit jobs
We study an online unit-job scheduling problem arising in buffer management. Each job is specified by its release time, deadline, and a nonnegative weight. Due to overloading conditions, some jobsExpand
  • 59
  • 5
Online Competitive Algorithms for Maximizing Weighted Throughput of Unit Jobs
We study an online scheduling problem for unit-length jobs, where each job is specified by its release time, deadline, and a nonnegative weight. The goal is to maximize the weighted throughput, thatExpand
  • 62
  • 4
  • PDF
Linear-Time Haplotype Inference on Pedigrees Without Recombinations
In this paper, a linear-time algorithm, which is optimal, is presented to solve the haplotype inference problem for pedigree data when there are no recombinations and the pedigree has no matingExpand
  • 27
  • 4
  • PDF
Efficient algorithms for finding a longest common increasing subsequence
We study the problem of finding a longest common increasing subsequence (LCIS) of multiple sequences of numbers. The LCIS problem is a fundamental issue in various application areas, including theExpand
  • 20
  • 4
  • PDF
Online interval scheduling: randomized and multiprocessor cases
Abstract We consider the problem of scheduling a set of equal-length intervals arriving online, where each interval is associated with a weight and the objective is to maximize the total weight ofExpand
  • 21
  • 3
Improved on-line broadcast scheduling with deadlines
Abstract We study an on-line broadcast scheduling problem in which requests have deadlines, and the objective is to maximize the weighted throughput, i.e., the weighted total length of the satisfiedExpand
  • 29
  • 2
  • PDF
Improved competitive algorithms for online scheduling with partial job values
  • F. Chin, S. Fung
  • Computer Science, Mathematics
  • Theor. Comput. Sci.
  • 6 October 2004
This paper considers an online scheduling problem arising from Quality-of-Service (QoS) applications. We are required to schedule a set of jobs, each with release time, deadline, processing time andExpand
  • 17
  • 2
Improved Randomized Online Scheduling of Intervals and Jobs
We study the online preemptive scheduling of intervals and jobs (with restarts). Each interval or job has an arrival time, a deadline, a length and a weight. The objective is to maximize the totalExpand
  • 13
  • 2
  • PDF
Lower bounds on online deadline scheduling with preemption penalties
  • S. Fung
  • Computer Science, Mathematics
  • Inf. Process. Lett.
  • 20 October 2008
We generalize and improve previous results of online preemptive deadline scheduling with preemption penalties. We consider both the preemption-restart and the preemption-resume models, and give newExpand
  • 13
  • 2