Empirical analysis of procedures that schedule unit length jobs subject to precedence constraints forming in- and out-stars
DOI:
https://doi.org/10.26481/marble.2015.v1.96Abstract
This paper addresses the problem of scheduling unit length jobs subject to precedence constraints forming in- and out-stars. There are several different procedures that can be used to solve this problem and our aim in this paper is to compare these procedures empirically. We found that one algorithm that was thought to solve the problem optimally didn't do so for the general set of instances and that all procedures that we tested did not perform well if the number of stars in the instance was close but below the number of machines in the instance.References
A. Berger, A. Grigoriev, P. Heggernes, and Ruben Z. Scheduling unit-length jobs with precedence constraints of small height. OPERATIONS RESEARCHLETTERS, 42(2):166 - 172, 2014.
Danny Dolev and Manfred K Warmuth. Scheduling precedence graphs of bounded height. Journal of Algorithms, 5(1):48 - 59, 1984.
Harold N. Gabow. A linear-time recognition algorithm for interval dags. Information Processing Letters, 12(1):20 - 22, 1981.
T. C. Hu. Parallel sequencing and assembly line problems. Operations Research, 9(6):841 - 848, 1961.
Christos H. Papadimitriou and Mihalis Yannakakis. Scheduling interval-ordered tasks. SIAM Journal on Computing, 8(3):405 - 409, 1979.
J.D. Ullman. Np-complete scheduling problems. Journal of Computer and System Sciences, 10(3):384 - 393, 1975.
