An iterated greedy algorithm for solving the total tardiness parallel blocking flow shop scheduling problem

This paper proposes an iterated greedy algorithm for scheduling jobs in F parallel flow shops (lines), each consisting of a series of m machines without storage capacity between machines. This constraint can provoke the blockage of machines if a job has finished its operation and the next machine is...

Descripción completa

Detalles Bibliográficos
Autores: Ribas Vila, Immaculada|||0000-0002-3701-118X, Companys Pascual, Ramón, Tort Martorell, X.
Tipo de recurso: artículo
Fecha de publicación:2019
País:España
Institución:Universitat Politècnica de Catalunya (UPC)
Repositorio:UPCommons. Portal del coneixement obert de la UPC
Idioma:inglés
OAI Identifier:oai:upcommons.upc.edu:2117/127883
Acceso en línea:https://hdl.handle.net/2117/127883
https://dx.doi.org/10.1016/j.eswa.2018.12.039
Access Level:acceso abierto
Palabra clave:Heuristic algorithms
Industrial management
Parallel flow shop
Distribution flow shop
Blocking
Scheduling Total tardiness
Empreses -- Direcció i administració
Programació heurística
Àrees temàtiques de la UPC::Economia i organització d'empreses
id ES_1d28ed6529ca4fc786bbc20f8fb33786
oai_identifier_str oai:upcommons.upc.edu:2117/127883
network_acronym_str ES
network_name_str España
repository_id_str
spelling An iterated greedy algorithm for solving the total tardiness parallel blocking flow shop scheduling problemRibas Vila, Immaculada|||0000-0002-3701-118XCompanys Pascual, RamónTort Martorell, X.Heuristic algorithmsIndustrial managementParallel flow shopDistribution flow shopBlockingScheduling Total tardinessEmpreses -- Direcció i administracióProgramació heurísticaÀrees temàtiques de la UPC::Economia i organització d'empresesThis paper proposes an iterated greedy algorithm for scheduling jobs in F parallel flow shops (lines), each consisting of a series of m machines without storage capacity between machines. This constraint can provoke the blockage of machines if a job has finished its operation and the next machine is not available. The criterion considered is the minimization of the sum of tardiness of all the jobs to schedule, i.e., minimization of the total tardiness of jobs. Notice that the proposed method is also valid for solving the Distributed Permutation Blocking Flow Shop Scheduling Problem (DBFSP), which allows modelling the scheduling process in companies with more than one factory when each factory has an identical flow shop configuration. Firstly, several constructive procedures have been implemented and tested to provide an efficient solution in terms of quality and CPU time. This initial solution is later improved upon with an iterated greedy algorithm that includes a variable neighbourhood search for interchanging or reassigning jobs from the critical line to other lines. Next, two strategies have been tested for selecting the critical line; the one with a higher total tardiness of jobs and the one with a job that has the highest tardiness. The experimental design chooses the best combination of initial solution and critical line selection. Finally, we compare the performance of the proposed algorithm against other benchmark algorithms proposed for the DPFSP, which have been adapted to the problem being considered here since, to the best of our knowledge, this is the first attempt to solve either the Parallel Blocking Flow Shop problem or the Distributed Blocking Flow Shop problem with the goal of minimizing total tardiness. This comparison has allowed us to confirm the good performance of the proposed method.Peer Reviewed20192019-05-0120192019-01-30journal articlehttp://purl.org/coar/resource_type/c_6501AMhttp://purl.org/coar/version/c_ab4af688f83e57aainfo:eu-repo/semantics/articleapplication/vnd.openxmlformats-officedocument.wordprocessingml.documentapplication/vnd.openxmlformats-officedocument.wordprocessingml.documenthttps://hdl.handle.net/2117/127883https://dx.doi.org/10.1016/j.eswa.2018.12.039reponame:UPCommons. Portal del coneixement obert de la UPCinstname:Universitat Politècnica de Catalunya (UPC)Inglésengopen accesshttp://purl.org/coar/access_right/c_abf2Attribution-NonCommercial-NoDerivs 3.0 Spainhttp://creativecommons.org/licenses/by-nc-nd/3.0/es/info:eu-repo/semantics/openAccessoai:upcommons.upc.edu:2117/1278832026-05-27T15:37:01Z
dc.title.none.fl_str_mv An iterated greedy algorithm for solving the total tardiness parallel blocking flow shop scheduling problem
title An iterated greedy algorithm for solving the total tardiness parallel blocking flow shop scheduling problem
spellingShingle An iterated greedy algorithm for solving the total tardiness parallel blocking flow shop scheduling problem
Ribas Vila, Immaculada|||0000-0002-3701-118X
Heuristic algorithms
Industrial management
Parallel flow shop
Distribution flow shop
Blocking
Scheduling Total tardiness
Empreses -- Direcció i administració
Programació heurística
Àrees temàtiques de la UPC::Economia i organització d'empreses
title_short An iterated greedy algorithm for solving the total tardiness parallel blocking flow shop scheduling problem
title_full An iterated greedy algorithm for solving the total tardiness parallel blocking flow shop scheduling problem
title_fullStr An iterated greedy algorithm for solving the total tardiness parallel blocking flow shop scheduling problem
title_full_unstemmed An iterated greedy algorithm for solving the total tardiness parallel blocking flow shop scheduling problem
title_sort An iterated greedy algorithm for solving the total tardiness parallel blocking flow shop scheduling problem
dc.creator.none.fl_str_mv Ribas Vila, Immaculada|||0000-0002-3701-118X
Companys Pascual, Ramón
Tort Martorell, X.
author Ribas Vila, Immaculada|||0000-0002-3701-118X
author_facet Ribas Vila, Immaculada|||0000-0002-3701-118X
Companys Pascual, Ramón
Tort Martorell, X.
author_role author
author2 Companys Pascual, Ramón
Tort Martorell, X.
author2_role author
author
dc.subject.none.fl_str_mv Heuristic algorithms
Industrial management
Parallel flow shop
Distribution flow shop
Blocking
Scheduling Total tardiness
Empreses -- Direcció i administració
Programació heurística
Àrees temàtiques de la UPC::Economia i organització d'empreses
topic Heuristic algorithms
Industrial management
Parallel flow shop
Distribution flow shop
Blocking
Scheduling Total tardiness
Empreses -- Direcció i administració
Programació heurística
Àrees temàtiques de la UPC::Economia i organització d'empreses
description This paper proposes an iterated greedy algorithm for scheduling jobs in F parallel flow shops (lines), each consisting of a series of m machines without storage capacity between machines. This constraint can provoke the blockage of machines if a job has finished its operation and the next machine is not available. The criterion considered is the minimization of the sum of tardiness of all the jobs to schedule, i.e., minimization of the total tardiness of jobs. Notice that the proposed method is also valid for solving the Distributed Permutation Blocking Flow Shop Scheduling Problem (DBFSP), which allows modelling the scheduling process in companies with more than one factory when each factory has an identical flow shop configuration. Firstly, several constructive procedures have been implemented and tested to provide an efficient solution in terms of quality and CPU time. This initial solution is later improved upon with an iterated greedy algorithm that includes a variable neighbourhood search for interchanging or reassigning jobs from the critical line to other lines. Next, two strategies have been tested for selecting the critical line; the one with a higher total tardiness of jobs and the one with a job that has the highest tardiness. The experimental design chooses the best combination of initial solution and critical line selection. Finally, we compare the performance of the proposed algorithm against other benchmark algorithms proposed for the DPFSP, which have been adapted to the problem being considered here since, to the best of our knowledge, this is the first attempt to solve either the Parallel Blocking Flow Shop problem or the Distributed Blocking Flow Shop problem with the goal of minimizing total tardiness. This comparison has allowed us to confirm the good performance of the proposed method.
publishDate 2019
dc.date.none.fl_str_mv 2019
2019-05-01
2019
2019-01-30
dc.type.none.fl_str_mv journal article
http://purl.org/coar/resource_type/c_6501
AM
http://purl.org/coar/version/c_ab4af688f83e57aa
dc.type.openaire.fl_str_mv info:eu-repo/semantics/article
format article
dc.identifier.none.fl_str_mv https://hdl.handle.net/2117/127883
https://dx.doi.org/10.1016/j.eswa.2018.12.039
url https://hdl.handle.net/2117/127883
https://dx.doi.org/10.1016/j.eswa.2018.12.039
dc.language.none.fl_str_mv Inglés
eng
language_invalid_str_mv Inglés
language eng
dc.rights.none.fl_str_mv open access
http://purl.org/coar/access_right/c_abf2
Attribution-NonCommercial-NoDerivs 3.0 Spain
http://creativecommons.org/licenses/by-nc-nd/3.0/es/
dc.rights.openaire.fl_str_mv info:eu-repo/semantics/openAccess
rights_invalid_str_mv open access
http://purl.org/coar/access_right/c_abf2
Attribution-NonCommercial-NoDerivs 3.0 Spain
http://creativecommons.org/licenses/by-nc-nd/3.0/es/
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv application/vnd.openxmlformats-officedocument.wordprocessingml.document
application/vnd.openxmlformats-officedocument.wordprocessingml.document
dc.source.none.fl_str_mv reponame:UPCommons. Portal del coneixement obert de la UPC
instname:Universitat Politècnica de Catalunya (UPC)
instname_str Universitat Politècnica de Catalunya (UPC)
reponame_str UPCommons. Portal del coneixement obert de la UPC
collection UPCommons. Portal del coneixement obert de la UPC
repository.name.fl_str_mv
repository.mail.fl_str_mv
_version_ 1869404264437121024
score 15,301603

Similares en LA Referencia