How much can lookahead help in online single machine scheduling

Authors:
Feifeng Zheng;Yinfeng Xu;E. Zhang
Affiliations:
School of Management, Xi'an Jiao Tong University, Xi'an, Shaanxi 710049, China;School of Management, Xi'an Jiao Tong University, Xi'an, Shaanxi 710049, China and The State Key Lab for Manufacturing Systems Engineering, Xi'an, Shaanxi 710049, China;School of Information Management and Engineering, Shanghai University of Finance and Economics, Shanghai 200433, China
Venue:
Information Processing Letters
Year:
2008

Citing 4
Cited 3

A look-ahead heuristic for scheduling jobs with release dates on a single machine

Computers and Operations Research
Online computation and competitive analysis

Online computation and competitive analysis
Online scheduling with hard deadlines

Journal of Algorithms
Clairvoyant Non-Preemptive EDF Scheduling

ECRTS '06 Proceedings of the 18th Euromicro Conference on Real-Time Systems

Note: Online scheduling of unit length jobs on a batching machine to maximize the number of early jobs with lookahead

Theoretical Computer Science
Online algorithms for scheduling unit length jobs on parallel-batch machines with lookahead

Information Processing Letters
Online interval scheduling on a single machine with finite lookahead

Computers and Operations Research

Quantified Score

Hi-index	0.89

Visualization

Abstract

This paper studies online single machine scheduling where jobs have unit length and the objective is to maximize the number of completed jobs. Lookahead is considered to improve the competitiveness of online deterministic strategies. For preemption-restart model, we will prove a lower bound of (@?LD@?+2)/(@?LD@?+1) for the case where LD=1 and 3/2 for the case where 0=