@misc{https://doi.org/10.4121/uuid:158448c5-3133-4d3e-b1e9-91e7312a4878,
  doi = {10.4121/uuid:158448c5-3133-4d3e-b1e9-91e7312a4878},
  url = {https://data.4tu.nl/articles/dataset/Network_instance_Job_shop_edition_2/12680984/1},
  author = {Planken, L.R.(Léon) and de Weerdt, Mathijs and van der Krogt, R.P.J.(Roman)},
  keywords = {APSP, all-pairs shortest paths, STN, simple temporal network, STP, simple temporal problem, shortest path},
  title = {Network instance Job shop, edition 2},
  publisher = {TU Delft - Delft University of Technology; Faculty EEMCS; Algorithmics group},
  year = {2012},
  copyright = {CC BY-NC-SA 3.0},
}