Author pages are created from data sourced from our academic publisher partnerships and public sources.

- Publications
- Influence

Online Scheduling with Partial Job Values: Does Timesharing or
Randomization Help?

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

Online competitive algorithms for maximizing weighted throughput of unit jobs

- F. Chin, M. Chrobak, S. Fung, Wojciech Jawor, J. Sgall, T. Tichý
- Mathematics, Computer Science
- J. Discrete Algorithms
- 1 June 2006

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 jobs… Expand

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, that… Expand

Linear-Time Haplotype Inference on Pedigrees Without Recombinations

- B. M. Chan, W. Chan, F. Chin, S. Fung, M. Kao
- Computer Science
- WABI
- 11 September 2006

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 mating… Expand

Efficient algorithms for finding a longest common increasing subsequence

- W. Chan, Y. Zhang, S. Fung, Deshi Ye, H. Zhu
- Computer Science, Mathematics
- J. Comb. Optim.
- 14 February 2007

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 the… Expand

Online interval scheduling: randomized and multiprocessor cases

- S. Fung, C. K. Poon, Feifeng Zheng
- Computer Science, Mathematics
- J. Comb. Optim.
- 5 January 2008

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 of… Expand

Improved on-line broadcast scheduling with deadlines

- S. Fung, Feifeng Zheng, W. Chan, F. Chin, C. K. Poon, Prudence W. H. Wong
- Computer Science, Mathematics
- J. Sched.
- 1 August 2008

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 satisfied… Expand

Improved competitive algorithms for online scheduling with partial job values

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 and… Expand

Improved Randomized Online Scheduling of Intervals and Jobs

- Stanley P. Y. Fung, Chung Keung Poon, Feifeng Zheng
- Computer Science, Mathematics
- Theory of Computing Systems
- 13 April 2012

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 total… Expand

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 new… Expand