Prof Emma Hart E.Hart@napier.ac.uk
Professor
Roll Project Job Shop scheduling benchmark problems.
Hart, Emma; Sim, Kevin
Abstract
This document describes two sets of benchmark problem instances for the job shop scheduling problem. Each set of instances is supplied as a compressed (zipped) archive containing a single CSV file for each problem instance using the format described in http://rollproject.org/jssp/jsspGen.pdf
Citation
Hart, E., & Sim, K. (2015). Roll Project Job Shop scheduling benchmark problems. [Dataset]. https://doi.org/10.17869/ENU.2015.9365
| Publication Date | Nov 10, 2015 |
|---|---|
| Deposit Date | Feb 1, 2016 |
| Publicly Available Date | Feb 1, 2016 |
| Peer Reviewed | Not Peer Reviewed |
| DOI | https://doi.org/10.17869/ENU.2015.9365 |
| Keywords | Benchmark problem instances; job shop; scheduled problem; combinatorial optimisation; |
| Public URL | http://researchrepository.napier.ac.uk/id/eprint/9365 |
| Publisher URL | http://dx.doi.org/10.17869/ENU.2015.9365 |
| Collection Date | Nov 10, 2015 |
Files
JsspTest.zip
(<nobr>296 Kb</nobr>)
Archive
jsspGen.pdf
(<nobr>130 Kb</nobr>)
PDF
readme.docx
(<nobr>19 Kb</nobr>)
Document
JsspTraining.zip
(<nobr>739 Kb</nobr>)
Archive
You might also like
Evolutionary Approaches to Improving the Layouts of Instance-Spaces
(2022)
Conference Proceeding
Minimising line segments in linear diagrams is NP-hard
(2022)
Journal Article
A Neural Approach to Generation of Constructive Heuristics
(2021)
Conference Proceeding
Drawing Algorithms For Linear Diagrams (Supplementary)
(2020)
Dataset
Algorithm selection using deep learning without feature extraction
(2019)
Conference Proceeding