Derya Deliktaş
A benchmark dataset for multi-objective flexible job shop cell scheduling
Deliktaş, Derya; Özcan, Ender; Ustun, Ozden; Torkul, Orhan
Authors
ENDER OZCAN ender.ozcan@nottingham.ac.uk
Professor of Computer Science and Operational Research
Ozden Ustun
Orhan Torkul
Abstract
This data article presents a description of a benchmark dataset for the multi-objective flexible job shop scheduling problem in a cellular manufacturing environment. This problem considers intercellular moves, exceptional parts, sequence-dependent family setup and intercellular transportation times, and recirculation requiring minimization of makespan and total tardiness simultaneously. It is called a flexible job shop cell scheduling problem with sequence-dependent family setup times and intercellular transportation times (FJCS-SDFSTs-ITTs) problem. The dataset has been developed to evaluate the multi-objective evolutionary algorithms of the FJCS-SDFSTs-ITTs problems that are presented in ‘Evolutionary algorithms for multi-objective flexible job shop cell scheduling’. The dataset contains forty- three benchmark instances from ‘small’ to ‘large’, including a large real-world problem instance. Researchers can use the dataset to evaluate the future algorithms for the FJCS-SDFSTs- ITTs problems and compare the performance with the existing algorithms.
Citation
Deliktaş, D., Özcan, E., Ustun, O., & Torkul, O. (2024). A benchmark dataset for multi-objective flexible job shop cell scheduling. Data in Brief, 52, Article 109946. https://doi.org/10.1016/j.dib.2023.109946
Journal Article Type | Other |
---|---|
Acceptance Date | Dec 6, 2023 |
Online Publication Date | Dec 13, 2023 |
Publication Date | 2024-02 |
Deposit Date | Dec 18, 2023 |
Publicly Available Date | Jan 2, 2024 |
Journal | Data in Brief |
Electronic ISSN | 2352-3409 |
Publisher | Elsevier |
Peer Reviewed | Peer Reviewed |
Volume | 52 |
Article Number | 109946 |
DOI | https://doi.org/10.1016/j.dib.2023.109946 |
Keywords | Cell scheduling; Flexible job shop scheduling; Multi-objective model; Sequence-dependent family setup times; Intercellular transportation times; Exceptional and reentrant parts |
Public URL | https://nottingham-repository.worktribe.com/output/28434014 |
Additional Information | This article is maintained by: Elsevier; Article Title: A benchmark dataset for multi-objective flexible job shop cell scheduling; Journal Title: Data in Brief; CrossRef DOI link to publisher maintained version: https://doi.org/10.1016/j.dib.2023.109946; Content Type: article; Copyright: © 2023 Published by Elsevier Inc. |
Files
1-s2.0-S2352340923009770-main
(854 Kb)
PDF
Publisher Licence URL
https://creativecommons.org/licenses/by/4.0/
Copyright Statement
© 2023 Published by Elsevier Inc. This is an open access article under the CC BY license (http://creativecommons.org/licenses/by/4.0/)
You might also like
CUDA-based parallel local search for the set-union knapsack problem
(2024)
Journal Article
An adaptive greedy heuristic for large scale airline crew pairing problems
(2023)
Journal Article
Downloadable Citations
About Repository@Nottingham
Administrator e-mail: discovery-access-systems@nottingham.ac.uk
This application uses the following open-source libraries:
SheetJS Community Edition
Apache License Version 2.0 (http://www.apache.org/licenses/)
PDF.js
Apache License Version 2.0 (http://www.apache.org/licenses/)
Font Awesome
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 © 2024
Advanced Search