Paper Info
Title
A Decomposition-Based Local Search Algorithm for Multi-Objective Sequence Dependent Setup Times Permutation Flowshop Scheduling
Abstract
The ftowshop scheduling problem (FSP) has been widely studied in the last decades, both in the single objective as well as in the multi-objective scenario. Besides, due to the real-world considerations on scheduling problems, the concern regarding sequence-dependent setup times has emerged. In this paper, we present a decomposition-based iterated local search algorithm (MOLS/D) to deal with the multi-objective sequence-dependent setup times permutation FSP. In order to demonstrate the validity of the proposed algorithm, we have conducted an experimental study on a set of 220 benchmark instances minimizing the criteria makespan and total weighted tardiness. The results, according to various performance metrics and statistical analysis, show that MOLS/D significantly outperforms a tailored MOEA/D variant and the best-known reference sets from the literature. Thus, we have established a state-of-the-art approach for the problem considered.
Year
DOI
Venue
2018
10.1109/CEC.2018.8477711
2018 IEEE Congress on Evolutionary Computation (CEC)
Keywords
Field
DocType
flowshop scheduling problem,statistical analysis,minimising makespan,iterated local search algorithm,multiobjective sequence-dependent setup times,scheduling problems,decomposition-based local search algorithm
Mathematical optimization,Tardiness,Job shop scheduling,Scheduling (computing),Computer science,Permutation,Minification,Local search (optimization),Iterated local search,Benchmark (computing)
Conference
ISBN
Citations 
PageRank 
978-1-5090-6018-4
0
0.34
References 
Authors
16
3
Name
Order
Citations
PageRank
Murilo Zangari1172.25
Ademir Aparecido Constantino2155.76
Josu Ceberio316915.71