Internet Archive Scholar

Empirical analysis of procedures that schedule unit length jobs subject to precedence constraints forming in- and out-stars

Samuel Tigistu Feder
2015 MaRBLe  

Preserved Fulltext

fulltext thumbnail
Web Archive Capture PDF (611.5 kB)
https://web.archive.org/web/20190429025012/https://openjournals.maastrichtuniversity.nl/index.php/Marble/article/download/96/175

A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL. The file type is application/pdf.

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
more » ... se but below the number of machines in the instance. * Samuel Tigistu Feder received a bachelor degree in Econometrics and Operations at Maastricht University in 2014. At the moment he takes a Master in Econometrics and Operations with a specialisation in Operations research at
doi:10.26481/marble.2015.v1.96 fatcat:i6jmffxkyrdbpmppdjzm2el6y4
Citation

Samuel Tigistu Feder. "Empirical analysis of procedures that schedule unit length jobs subject to precedence constraints forming in- and out-stars." MaRBLe (2015)