Optimal On-Line Algorithms for Single-Machine Scheduling

Optimal time-critical scheduling via resource augmentation (extended abstract)

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing

Approximation techniques for average completion time scheduling

SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms

A guessing game and randomized online algorithms

STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing

On-line scheduling of a single machine to minimize total weighted completion time

SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms

Lower Bounds for On-Line Single-Machine Scheduling

MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science

Implementation of a PTAS for Scheduling with Release Dates

ALENEX '01 Revised Papers from the Third International Workshop on Algorithm Engineering and Experimentation

Competitive Online Scheduling with Level of Service

COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics

Minimizing the Total Completion Time On-line on a Single Machine, Using Restarts

ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms

Optimal Online Flow Time with Resource Augmentation

FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory

The Online-TSP against Fair Adversaries

CIAC '00 Proceedings of the 4th Italian Conference on Algorithms and Complexity

Minimizing total flow time and total completion time with immediate dispatching

Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures

Lower bounds for on-line single-machine scheduling

Theoretical Computer Science

Competitive Analysis of a Better On-line Algorithm to Minimize Total Completion Time on a Single-machine

Journal of Global Optimization

Competitive on-line scheduling with level of service

Journal of Scheduling - Special issue: On-line scheduling

Minimizing the total completion time on-line on a single machine, using restarts

Journal of Algorithms

Optimal on-line flow time with resource augmentation

Discrete Applied Mathematics - Special issue: Efficient algorithms

SIGACT news online algorithms column 10: competitiveness via doubling

ACM SIGACT News

Models and Algorithms for Stochastic Online Scheduling

Mathematics of Operations Research

On-line scheduling of parallel machines to minimize total completion times

Computers and Operations Research

Online Scheduling with Known Arrival Times

Mathematics of Operations Research

Optimally competitive list batching

Theoretical Computer Science

Optimal on-line flow time with resource augmentation

Discrete Applied Mathematics - Special issue: Efficient algorithms

Minimizing the total completion time on-line on a single machine, using restarts

Journal of Algorithms

An optimal semi-online algorithm for a single machine scheduling problem with bounded processing time

Information Processing Letters

Mechanism Design for Decentralized Online Machine Scheduling

Operations Research

SRPT is 1.86-competitive for completion time scheduling

SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms

Comments on "Competitive analysis of a better on-line algorithm to minimize total completion time on a single-machine"

Journal of Global Optimization

Best semi-online algorithms for unbounded parallel batch scheduling

Discrete Applied Mathematics

Decentralization and mechanism design for online machine scheduling

SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory

LP-based online scheduling: from single to parallel machines

IPCO'05 Proceedings of the 11th international conference on Integer Programming and Combinatorial Optimization

List scheduling in order of α-points on a single machine

Efficient Approximation and Online Algorithms

Efficient algorithms for average completion time scheduling

IPCO'10 Proceedings of the 14th international conference on Integer Programming and Combinatorial Optimization

Competitive analysis of preemptive single-machine scheduling

Operations Research Letters

A class of on-line scheduling algorithms to minimize total completion time

Operations Research Letters

Asymptotic analysis of an on-line algorithm for the single machine completion time problem with release dates

Operations Research Letters

On-line scheduling to minimize average completion time revisited

Operations Research Letters

Randomized algorithms for on-line scheduling problems: how low can't you go?

Operations Research Letters

A Hybrid Tabu Search and Constraint Programming Algorithm for the Dynamic Dial-a-Ride Problem

INFORMS Journal on Computing

Reactive scheduling in a job shop where jobs arrive over time

Computers and Industrial Engineering

A better online algorithm for the parallel machine scheduling to minimize the total weighted completion time

Computers and Operations Research