Note: A best on-line algorithm for single machine scheduling with small delivery times

Authors:
Ji Tian;Ruyan Fu;Jinjiang Yuan
Affiliations:
Department of Mathematics, Zhengzhou University, Zhengzhou, Henan 450052, Peoples Republic of China;Department of Mathematics, Zhengzhou University, Zhengzhou, Henan 450052, Peoples Republic of China;Department of Mathematics, Zhengzhou University, Zhengzhou, Henan 450052, Peoples Republic of China
Venue:
Theoretical Computer Science
Year:
2008

Citing 4
Cited 1

Jackson's rule for single-machine scheduling: making a good heuristic better

Mathematics of Operations Research
A Best Possible Deterministic On-Line Algorithm for Minimizing Maximum Delivery Time on a Single Machine

SIAM Journal on Discrete Mathematics
Efficient Approximation Schemes for Scheduling Problems with Release Dates and Delivery Times

Journal of Scheduling
Approximation schemes for constrained scheduling problems

SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science

Optimal algorithms for online single machine scheduling with deteriorating jobs

Theoretical Computer Science

Quantified Score

Hi-index	5.23

Visualization

Abstract

We consider a single machine on-line scheduling problem with delivery times. All jobs arrive over time. Each job's characteristics, such as processing time and delivery time, become known at its arrival time. Once the processing of a job is completed we deliver it to the destination by a vehicle. The objective is to minimize the time by which all jobs have been delivered. In this paper, we assume that all jobs have small delivery times, i.e., for each job J"j, q"j@?p"j, where p"j and q"j denote the processing time and the delivery time of J"j, respectively. We provide an on-line algorithm with a competitive ratio of 2, and the result is the best possible.