Go to:
Logótipo
Comuta visibilidade da coluna esquerda
Você está em: Start > Publications > View > Efficient procedures for the weighted squared tardiness permutation flowshop scheduling problem
Publication

Publications

Efficient procedures for the weighted squared tardiness permutation flowshop scheduling problem

Title
Efficient procedures for the weighted squared tardiness permutation flowshop scheduling problem
Type
Article in International Scientific Journal
Year
2020
Authors
Costa, MRC
(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. 32
Pages: 487-522
ISSN: 1936-6582
Publisher: Springer Nature
Other information
Authenticus ID: P-00Q-VFJ
Abstract (EN): This paper addresses a permutation flowshop scheduling problem, with the objective of minimizing total weighted squared tardiness. The focus is on providing efficient procedures that can quickly solve medium or even large instances. Within this context, we first present multiple dispatching heuristics. These include general rules suited to various due date-related environments, heuristics developed for the problem with a linear objective function, and procedures that are suitably adapted to take the squared objective into account. Then, we describe several improvement procedures, which use one or more of three techniques. These procedures are used to improve the solution obtained by the best dispatching rule. Computational results show that the quadratic rules greatly outperform the linear counterparts, and that one of the quadratic rules is the overall best performing dispatching heuristic. The computational tests also show that all procedures significantly improve upon the initial solution. The non-dominated procedures, when considering both solution quality and runtime, are identified. The best dispatching rule, and two of the non-dominated improvement procedures, are quite efficient, and can be applied to even very large-sized problems. The remaining non-dominated improvement method can provide somewhat higher quality solutions, but it may need excessive time for extremely large instances.
Language: English
Type (Professor's evaluation): Scientific
No. of pages: 36
Documents
We could not find any documents associated to the publication.
Related Publications

Of the same journal

Delivery mode planning for distribution to brick-and-mortar retail stores: discussion and literature review (2018)
Another Publication in an International Scientific Journal
Sara Martins; Pedro Amorim; Bernardo Almada Lobo
Ramping up a heuristic procedure for storage location assignment problem with precedence constraints (2022)
Article in International Scientific Journal
Trindade, MAM; Sousa, PSA; Moreira, MRA
Managing perishability in production-distribution planning: a discussion and review (2013)
Article in International Scientific Journal
Amorim, P; Meyr, H; Almeder, C; Almada Lobo, B
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-02 at 20:44:15 | Acceptable Use Policy | Data Protection Policy | Complaint Portal