Skip to main content

Research Repository

Advanced Search

Evolutionary algorithms for multi-objective flexible job shop cell scheduling

Deliktaş, Derya; Özcan, Ender; Ustun, Ozden; Torkul, Orhan

Evolutionary algorithms for multi-objective flexible job shop cell scheduling Thumbnail


Authors

Derya Deliktaş

Profile Image

ENDER OZCAN ender.ozcan@nottingham.ac.uk
Professor of Computer Science and Operational Research

Ozden Ustun

Orhan Torkul



Abstract

The multi-objective flexible job shop scheduling in a cellular manufacturing environment is a challenging real-world problem. This recently introduced scheduling problem variant considers exceptional parts, intercellular moves, intercellular transportation times, sequence-dependent family setup times, and recirculation requiring minimization of makespan and total tardiness, simultaneously. A previous study shows that the exact solver based on mixed-integer nonlinear programming model fails to find an optimal solution to each of the ‘medium’ to ‘large’ size instances considering even the simplified version of the problem. In this study, we present evolutionary algorithms for solving that bi-objective problem and apply genetic and memetic algorithms that use three different scalarization methods, including weighted sum, conic, and tchebycheff. The performance of all evolutionary algorithms with various configurations is investigated across forty-three benchmark instances from ‘small’ to ‘large’ size including a large real-world problem instance. The experimental results show that the transgenerational memetic algorithm using weighted sum outperforms the rest producing the best-known results for almost all bi-objective flexible job shop cell scheduling instances, in overall.

Citation

Deliktaş, D., Özcan, E., Ustun, O., & Torkul, O. (2021). Evolutionary algorithms for multi-objective flexible job shop cell scheduling. Applied Soft Computing, 113(Part A), Article 107890. https://doi.org/10.1016/j.asoc.2021.107890

Journal Article Type Article
Acceptance Date Sep 4, 2021
Online Publication Date Sep 21, 2021
Publication Date Dec 1, 2021
Deposit Date Dec 2, 2021
Publicly Available Date Sep 22, 2022
Journal Applied Soft Computing
Print ISSN 1568-4946
Publisher Elsevier BV
Peer Reviewed Peer Reviewed
Volume 113
Issue Part A
Article Number 107890
DOI https://doi.org/10.1016/j.asoc.2021.107890
Keywords Software
Public URL https://nottingham-repository.worktribe.com/output/6847021
Publisher URL https://www.sciencedirect.com/science/article/abs/pii/S1568494621008127?via%3Dihub
Additional Information This article is maintained by: Elsevier; Article Title: Evolutionary algorithms for multi-objective flexible job shop cell scheduling; Journal Title: Applied Soft Computing; CrossRef DOI link to publisher maintained version: https://doi.org/10.1016/j.asoc.2021.107890; Content Type: article; Copyright: © 2021 Elsevier B.V. All rights reserved.

Files




You might also like



Downloadable Citations