New heuristics for the 2-stage assembly scheduling problem with total earliness and tardiness minimisation: A computational evaluation

Traditionally, scheduling literature has focused mainly on solving problems related to processing jobs with non-assembly operations. Despite the growing interest in the assembly literature in recent years, knowledge of the problem is still in its early stages in many aspects. In this regard, we are...

ver descrição completa

Detalhes bibliográficos
Autores: Talens, Carla, Valente, Jorge M. S., Fernandez-Viagas, Victor
Formato: artículo
Estado:Versión publicada
Fecha de publicación:2024
País:España
Recursos:Consejo Superior de Investigaciones Científicas (CSIC)
Repositorio:DIGITAL.CSIC. Repositorio Institucional del CSIC
OAI Identifier:oai:digital.csic.es:10261/386893
Acesso em linha:http://hdl.handle.net/10261/386893
https://api.elsevier.com/content/abstract/scopus_id/85202835049
Access Level:acceso abierto
Palavra-chave:Tardiness
Assembly
Earliness
Heuristics
Just in time
Scheduling
id ES_b67b9c67dbc92d0b97dc938245c23218
oai_identifier_str oai:digital.csic.es:10261/386893
network_acronym_str ES
network_name_str España
repository_id_str
spelling New heuristics for the 2-stage assembly scheduling problem with total earliness and tardiness minimisation: A computational evaluationTalens, CarlaValente, Jorge M. S.Fernandez-Viagas, VictorTardinessAssemblyEarlinessHeuristicsJust in timeSchedulingTraditionally, scheduling literature has focused mainly on solving problems related to processing jobs with non-assembly operations. Despite the growing interest in the assembly literature in recent years, knowledge of the problem is still in its early stages in many aspects. In this regard, we are not aware of any previous contributions that address the assembly scheduling problem with just-in-time objectives. To fill this gap, this paper studies the 2-stage assembly scheduling problem minimising the sum of total earliness and total tardiness. We first analyse the relationship between the decision problem and the generation of the due dates of the jobs, and identify the equivalences with different related decision problems depending on the instances. The properties and conclusions obtained in the analysis are applied to design two constructive heuristics and a composite heuristic. To evaluate our proposals, different heuristics from the state-of-the-art of related scheduling problems are adapted, and a computational evaluation is carried out. The excellent behaviour of the proposed algorithms is demonstrated by an extensive computational evaluation.This research has been funded by the Spanish Ministry of Science and Innovation under project “ENSURE” with reference PID2022-142062OB-I00. In addition, this study has been funded by Instituto de Salud Carlos III (ISCIII) through the project “PI22/01096” and co-funded by the European Union .Peer reviewedElsevierEuropean CommissionMinisterio de Ciencia e Innovación (España)Instituto de Salud Carlos IIITalens, Carla [0000-0003-3689-6729]Valente, Jorge M. S. [0000-0001-5917-8880]Consejo Superior de Investigaciones Científicas [https://ror.org/02gfc7t72]202520252024info:eu-repo/semantics/articlehttp://purl.org/coar/resource_type/c_6501Publisher's versioninfo:eu-repo/semantics/publishedVersionapplication/pdfhttp://hdl.handle.net/10261/386893https://api.elsevier.com/content/abstract/scopus_id/85202835049reponame:DIGITAL.CSIC. Repositorio Institucional del CSICinstname:Consejo Superior de Investigaciones Científicas (CSIC)Inglés#PLACEHOLDER_PARENT_METADATA_VALUE#info:eu-repo/grantAgreement/AEI/Plan Estatal de Investigación Científica y Técnica y de Innovación 2021-2023/PID2022-142062OB-I00The underlying dataset has been published as supplementary material of the article in the publisher platform at DOI https://doi.org/10.1016/j.cor.2024.106824https://doi.org/10.1016/j.cor.2024.106824Síinfo:eu-repo/semantics/openAccessoai:digital.csic.es:10261/3868932026-05-22T06:33:51Z
dc.title.none.fl_str_mv New heuristics for the 2-stage assembly scheduling problem with total earliness and tardiness minimisation: A computational evaluation
title New heuristics for the 2-stage assembly scheduling problem with total earliness and tardiness minimisation: A computational evaluation
spellingShingle New heuristics for the 2-stage assembly scheduling problem with total earliness and tardiness minimisation: A computational evaluation
Talens, Carla
Tardiness
Assembly
Earliness
Heuristics
Just in time
Scheduling
title_short New heuristics for the 2-stage assembly scheduling problem with total earliness and tardiness minimisation: A computational evaluation
title_full New heuristics for the 2-stage assembly scheduling problem with total earliness and tardiness minimisation: A computational evaluation
title_fullStr New heuristics for the 2-stage assembly scheduling problem with total earliness and tardiness minimisation: A computational evaluation
title_full_unstemmed New heuristics for the 2-stage assembly scheduling problem with total earliness and tardiness minimisation: A computational evaluation
title_sort New heuristics for the 2-stage assembly scheduling problem with total earliness and tardiness minimisation: A computational evaluation
dc.creator.none.fl_str_mv Talens, Carla
Valente, Jorge M. S.
Fernandez-Viagas, Victor
author Talens, Carla
author_facet Talens, Carla
Valente, Jorge M. S.
Fernandez-Viagas, Victor
author_role author
author2 Valente, Jorge M. S.
Fernandez-Viagas, Victor
author2_role author
author
dc.contributor.none.fl_str_mv European Commission
Ministerio de Ciencia e Innovación (España)
Instituto de Salud Carlos III
Talens, Carla [0000-0003-3689-6729]
Valente, Jorge M. S. [0000-0001-5917-8880]
Consejo Superior de Investigaciones Científicas [https://ror.org/02gfc7t72]
dc.subject.none.fl_str_mv Tardiness
Assembly
Earliness
Heuristics
Just in time
Scheduling
topic Tardiness
Assembly
Earliness
Heuristics
Just in time
Scheduling
description Traditionally, scheduling literature has focused mainly on solving problems related to processing jobs with non-assembly operations. Despite the growing interest in the assembly literature in recent years, knowledge of the problem is still in its early stages in many aspects. In this regard, we are not aware of any previous contributions that address the assembly scheduling problem with just-in-time objectives. To fill this gap, this paper studies the 2-stage assembly scheduling problem minimising the sum of total earliness and total tardiness. We first analyse the relationship between the decision problem and the generation of the due dates of the jobs, and identify the equivalences with different related decision problems depending on the instances. The properties and conclusions obtained in the analysis are applied to design two constructive heuristics and a composite heuristic. To evaluate our proposals, different heuristics from the state-of-the-art of related scheduling problems are adapted, and a computational evaluation is carried out. The excellent behaviour of the proposed algorithms is demonstrated by an extensive computational evaluation.
publishDate 2024
dc.date.none.fl_str_mv 2024
2025
2025
dc.type.none.fl_str_mv info:eu-repo/semantics/article
http://purl.org/coar/resource_type/c_6501
Publisher's version
info:eu-repo/semantics/publishedVersion
format article
status_str publishedVersion
dc.identifier.none.fl_str_mv http://hdl.handle.net/10261/386893
https://api.elsevier.com/content/abstract/scopus_id/85202835049
url http://hdl.handle.net/10261/386893
https://api.elsevier.com/content/abstract/scopus_id/85202835049
dc.language.none.fl_str_mv Inglés
language_invalid_str_mv Inglés
dc.relation.none.fl_str_mv #PLACEHOLDER_PARENT_METADATA_VALUE#
info:eu-repo/grantAgreement/AEI/Plan Estatal de Investigación Científica y Técnica y de Innovación 2021-2023/PID2022-142062OB-I00
The underlying dataset has been published as supplementary material of the article in the publisher platform at DOI https://doi.org/10.1016/j.cor.2024.106824
https://doi.org/10.1016/j.cor.2024.106824
Sí
dc.rights.none.fl_str_mv info:eu-repo/semantics/openAccess
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv application/pdf
dc.publisher.none.fl_str_mv Elsevier
publisher.none.fl_str_mv Elsevier
dc.source.none.fl_str_mv reponame:DIGITAL.CSIC. Repositorio Institucional del CSIC
instname:Consejo Superior de Investigaciones Científicas (CSIC)
instname_str Consejo Superior de Investigaciones Científicas (CSIC)
reponame_str DIGITAL.CSIC. Repositorio Institucional del CSIC
collection DIGITAL.CSIC. Repositorio Institucional del CSIC
repository.name.fl_str_mv
repository.mail.fl_str_mv
_version_ 1869417450182803456
score 15,812429

Registos relacionados