On the drift of short schedules

Authors:
Uriel Feige;Giora Rayzman
Affiliations:
Department of Applied Mathematics and Computer Science, Faculty of Mathematical Science, The Weizmann Institute of Science, P.O. Box 26, Rehovot 76100, Israel;Department of Applied Mathematics and Computer Science, Faculty of Mathematical Science, The Weizmann Institute of Science, P.O. Box 26, Rehovot 76100, Israel
Venue:
Theoretical Computer Science
Year:
2002

Citing 3
Cited 0

Improved Approximation Algorithms for Shop Scheduling Problems

SIAM Journal on Computing
Improved bounds for acyclic job shop scheduling (extended abstract)

STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Balanced Allocations

SIAM Journal on Computing

Quantified Score

Hi-index	5.23

Visualization

Abstract

For the job shop scheduling problem, the drift of a schedule is the maximum difference between the number of operations performed by two jobs within a time interval. We show instances of the problem for which every short schedule must allow for nonconstant drift.