Scheduling.jl -- Collaborative and Reproducible Scheduling Research with Julia

March 11, 2020 Β· Declared Dead Β· πŸ› arXiv.org

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Sascha Hunold, BartΕ‚omiej Przybylski arXiv ID 2003.05217 Category cs.DS: Data Structures & Algorithms Citations 2 Venue arXiv.org Last Checked 4 months ago
Abstract
We introduce the Scheduling.jl Julia package, which is intended for collaboratively conducting scheduling research and for sharing implementations of algorithms. It provides the fundamental building blocks for implementing scheduling algorithms following the three-field notation of Graham et al., i.e., it has functionality to describe machine environments, job characteristics, and optimality criteria. Our goal is to foster algorithm and code sharing in the scheduling community. Scheduling.jl can also be used to support teaching scheduling theory in classes. We will show the main functionalities of Scheduling.jl and give an example on how to use it by comparing different algorithms for the problem of P||Cmax .
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Data Structures & Algorithms

Died the same way β€” πŸ‘» Ghosted