Lookahead Scheduling in a Real-Time Context

Proceedings of the Joint Conference on Information Sciences

Volumn 6, Issue , 2002, Pages 205-209

  Coleman, Ben ^a   Mao, Weizhen ^a  

^a Dept of Economics and Thomas Jefferson Program in Public Policy at the College of William and Mary   (United States)

Author keywords

Job Scheduling; Lookahead Algorithms; Online Algorithms

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; DECISION THEORY; ONLINE SYSTEMS; PROBLEM SOLVING; PROGRAM PROCESSORS; REAL TIME SYSTEMS; RESOURCE ALLOCATION;

JOB SCHEDULING; LOOKAHEAD ALGORITHMS; ONLINE ALGORITHMS;

SCHEDULING;

EID: 1642269837     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (4)

1. P. Keskinocak. Online algorithms with lookahead: A survey. ISYE Working Paper, 1999.
2. W. Mao and R. K. Kincaid. A look-ahead heuristic for scheduling jobs with release dates on a single machine. Computers and Operations Research, 21(10):1041-1050, 1994.
3. W. Mao, R. K. Kincaid, and A. Rifkin. On-line single machine scheduling algorithms, chapter 8. In S. Nash and A. Sofer, editors, The Impact of Emerging Technologies on Computer Science and Operations Research, pages 157-173. Kluwer Academic Publisher, 1995.
4. S. Phillips and J. Westbrook. On-line algorithms: Competitive analysis and beyond. In M. J. Atallah, editor, Algorithms and Theory of Computation Handbook, chapter 10. CRC Press, Boca Raton, 1999.