Prof Emma Hart E.Hart@napier.ac.uk
Professor
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
Hart, E., & Sim, K. (2015). Roll Project Job Shop scheduling benchmark problems. [Data]. 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 |
Collection Date | Nov 10, 2015 |
Contract Date | Feb 1, 2016 |
JsspTraining.zip
(739 Kb)
Archive
readme.docx
(19 Kb)
Document
jsspGen.pdf
(130 Kb)
PDF
JsspTest.zip
(296 Kb)
Archive
Evolutionary Computation Combinatorial Optimization.
(2004)
Journal Article
A hyper-heuristic ensemble method for static job-shop scheduling.
(2016)
Journal Article
A research agenda for metaheuristic standardization.
(2015)
Presentation / Conference Contribution
A Lifelong Learning Hyper-heuristic Method for Bin Packing
(2015)
Journal Article
About Edinburgh Napier Research Repository
Administrator e-mail: repository@napier.ac.uk
This application uses the following open-source libraries:
Apache License Version 2.0 (http://www.apache.org/licenses/)
Apache License Version 2.0 (http://www.apache.org/licenses/)
SIL OFL 1.1 (http://scripts.sil.org/OFL)
MIT License (http://opensource.org/licenses/mit-license.html)
CC BY 3.0 ( http://creativecommons.org/licenses/by/3.0/)
Powered by Worktribe © 2025
Advanced Search