Mostra el registre d'ítem simple
An iterated greedy algorithm for the parallel blocking flow shop scheduling problem and sequence-dependent setup times
dc.contributor.author | Ribas Vila, Immaculada |
dc.contributor.author | Companys Pascual, Ramón |
dc.contributor.author | Tort-Martorell Llabrés, Xavier |
dc.contributor.other | Universitat Politècnica de Catalunya. Departament d'Organització d'Empreses |
dc.contributor.other | Universitat Politècnica de Catalunya. Departament d'Estadística i Investigació Operativa |
dc.date.accessioned | 2021-09-17T06:47:39Z |
dc.date.available | 2021-09-17T06:47:39Z |
dc.date.issued | 2021-07-08 |
dc.identifier.citation | Ribas, I.; Companys, R.; Tort-Martorell, J. An iterated greedy algorithm for the parallel blocking flow shop scheduling problem and sequence-dependent setup times. "Expert systems with applications", 8 Juliol 2021, vol. 184, p. 115535:1-115535:14. |
dc.identifier.issn | 0957-4174 |
dc.identifier.uri | http://hdl.handle.net/2117/351547 |
dc.description.abstract | This paper deals with the problem of scheduling jobs in a parallel flow shop configuration under the blocking constraint, in which the setup time of machines depends not only on the job to be processed but also on the previously processed one, i.e., there are sequence-dependent setup times. The performance analysis of several iterated greedy algorithms with different initial solution procedures and local searches lets us define an efficient algorithm to minimize the maximum job completion time. Moreover, the computational evaluation showed the efficiency of searching in different neighborhood structures and noted the significant influence of the initial solution. However, contrary to other scheduling problems, starting with a high quality solution does not guarantee better performance of the algorithm. |
dc.language.iso | eng |
dc.rights | Attribution-NonCommercial-NoDerivates 4.0 International |
dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/4.0/ |
dc.subject | Àrees temàtiques de la UPC::Economia i organització d'empreses |
dc.subject.lcsh | Parallel processing (Electronic computers) |
dc.subject.lcsh | Mathematical optimization |
dc.subject.lcsh | Industrial management |
dc.subject.other | Parallel Flow Shop |
dc.subject.other | Sequence-dependent Setup times |
dc.subject.other | Makespan |
dc.subject.other | Distributed Flow Shop |
dc.subject.other | Blocking |
dc.title | An iterated greedy algorithm for the parallel blocking flow shop scheduling problem and sequence-dependent setup times |
dc.type | Article |
dc.subject.lemac | Processament en paral·lel (Ordinadors) |
dc.subject.lemac | Optimització matemàtica |
dc.subject.lemac | Empreses -- Direcció i administració |
dc.contributor.group | Universitat Politècnica de Catalunya. SCOM - Supply Chain and Operations Management |
dc.contributor.group | Universitat Politècnica de Catalunya. ADBD - Anàlisi de Dades Complexes per a les Decisions Empresarials |
dc.identifier.doi | 10.1016/j.eswa.2021.115535 |
dc.description.peerreviewed | Peer Reviewed |
dc.relation.publisherversion | https://www.sciencedirect.com/science/article/pii/S0957417421009428 |
dc.rights.access | Open Access |
local.identifier.drac | 31918621 |
dc.description.version | Postprint (published version) |
local.citation.author | Ribas, I.; Companys, R.; Tort-Martorell, J. |
local.citation.publicationName | Expert systems with applications |
local.citation.volume | 184 |
local.citation.startingPage | 115535:1 |
local.citation.endingPage | 115535:14 |
Fitxers d'aquest items
Aquest ítem apareix a les col·leccions següents
-
Articles de revista [66]
-
Articles de revista [841]
-
Articles de revista [124]
-
Articles de revista [719]