Go to:
Logótipo
Comuta visibilidade da coluna esquerda
Você está em: Start > Publications > View > Metaheuristics for the permutation flowshop problem with a weighted quadratic tardiness objective
Publication

Publications

Metaheuristics for the permutation flowshop problem with a weighted quadratic tardiness objective

Title
Metaheuristics for the permutation flowshop problem with a weighted quadratic tardiness objective
Type
Article in International Scientific Journal
Year
2022
Authors
Silva, AF
(Author)
Other
The person does not belong to the institution. The person does not belong to the institution. The person does not belong to the institution. Without AUTHENTICUS Without ORCID
Schaller, JE
(Author)
Other
The person does not belong to the institution. The person does not belong to the institution. The person does not belong to the institution. Without AUTHENTICUS Without ORCID
Journal
Vol. 140
ISSN: 0305-0548
Publisher: Elsevier
Other information
Authenticus ID: P-00V-YGS
Abstract (EN): In this paper, we consider a permutation flowshop problem, with a weighted squared tardiness objective function, which addresses an important criterion for many customers. Our objective is to find metaheuristics that can, within acceptable computational times, provide sizeable improvements in solution quality over the best existing procedure (a dispatching rule followed by an improvement method). We consider four metaheuristics, namely iterated local search (ILS), iterated greedy (IG), variable greedy (VG) and steady-state genetic algorithms (SSGA). These are known for performing well on permutation flowshops and/or on tardiness criteria. For each metaheuristic, four versions are developed, differing on the choice of initial sequence and/or local search. Additionally, four different time limits are considered. Therefore, a total of 64 sets of results are obtained. The results show that all procedures greatly outperform the best existing method. The IG procedures provide the best results, followed by the SSGA procedures. The VG methods are usually inferior to SSGA, while the ILS metaheuristics tend to be the worst performers. The four metaheuristics prove to be robust in what regards initial solution and local search method, since both have little effect on the performance of the metaheuristics. Increasing the time limit does improve the performance of all procedures. Still, a sizeable improvement is obtained even for the lowest time limit. Therefore, even under restrictive time limits, the metaheuristics greatly outperform the best existing procedure.
Language: English
Type (Professor's evaluation): Scientific
No. of pages: 17
Documents
We could not find any documents associated to the publication.
Related Publications

Of the same journal

Unequal individual genetic algorithm with intelligent diversification for the lot-scheduling problem in integrated mills using multiple-paper machines (2015)
Article in International Scientific Journal
Marcos Furlan; Bernardo Almada Lobo; Maristela Santos; Reinaldo Morabito
The use of frontier techniques to identify efficient solutions for the Berth Allocation Problem solved with a hybrid evolutionary algorithm (2019)
Article in International Scientific Journal
Flávia Barbosa; Priscila C. Berbert Rampazzo; Akebo Yamakami; Ana S. Camanho
The Probabilistic Travelling Salesman Problem with Crowdsourcing (2022)
Article in International Scientific Journal
Santini, A; Viana, A; Klimentova, X; Joao Pedro Pedroso
The challenges of estimating the impact of distributed energy resources flexibility on the TSO/DSO boundary node operating points (2018)
Article in International Scientific Journal
João Silva; Jean Sumaili ; Ricardo J. Bessa; Luís Seca ; Manuel Matos; Vladimiro Miranda

See all (43)

Recommend this page Top
Copyright 1996-2025 © Faculdade de Direito da Universidade do Porto  I Terms and Conditions  I Acessibility  I Index A-Z  I Guest Book
Page created on: 2025-07-03 at 13:13:30 | Acceptable Use Policy | Data Protection Policy | Complaint Portal