Ir al contenido (pulsa Retorno)

Universitat Politècnica de Catalunya

    • Català
    • Castellano
    • English
    • LoginRegisterLog in (no UPC users)
  • mailContact Us
  • world English 
    • Català
    • Castellano
    • English
  • userLogin   
      LoginRegisterLog in (no UPC users)

UPCommons. Global access to UPC knowledge

Banner header
68.799 UPC E-Prints
You are here:
View Item 
  •   DSpace Home
  • E-prints
  • Departaments
  • Departament d'Organització d'Empreses
  • Reports de recerca
  • View Item
  •   DSpace Home
  • E-prints
  • Departaments
  • Departament d'Organització d'Empreses
  • Reports de recerca
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

An efficient hybrid iterated local search algorithm for the total tardiness blocking flow shop problem

Thumbnail
View/Open
working paper on tardiness flow shop blocking problem (270,0Kb)
  View UPCommons Usage Statistics
  LA Referencia / Recolecta stats
Includes usage data since 2022
Cita com:
hdl:2117/17099

Show full item record
Ribas Vila, ImmaculadaMés informacióMés informacióMés informació
Companys Pascual, RamónMés informacióMés informació
Tort-Martorell Llabrés, XavierMés informacióMés informacióMés informació
Document typeResearch report
Defense date2012-09-04
Rights accessOpen Access
Attribution-NonCommercial-NoDerivs 3.0 Spain
This work is protected by the corresponding intellectual and industrial property rights. Except where otherwise noted, its contents are licensed under a Creative Commons license : Attribution-NonCommercial-NoDerivs 3.0 Spain
Abstract
This paper deals with the blocking flow shop problem and proposes an Iterated Local Search (ILS) procedure combined with a variable neighbourhood search (VNS) for the total tardiness minimization. The proposed ILS makes use of a NEH-based procedure to generate the initial solution, uses a local search to intensify the exploration which combines the insertion and swap neighbourhood and uses a perturbation mechanism that applies, d times, three neighbourhood operators to the current solution to diversify the search. The computational evaluation has shown that the insertion neighbourhood is more effective than the swap one, but it also has shown that the combination of both is a good strategy to improve the obtained solutions. Finally, the comparison of the ILS with an Iterated greedy algorithm and with a greedy randomized adaptive search procedure has revealed its good performance.
CitationRibas, I.; Companys, R.; Tort-martorell, J. "An efficient hybrid iterated local search algorithm for the total tardiness blocking flow shop problem". 2012. 
URIhttp://hdl.handle.net/2117/17099
Collections
  • Departament d'Organització d'Empreses - Reports de recerca [141]
  • GRESA - Grup de recerca en estadística aplicada - Reports de recerca [2]
  • Departament d'Estadística i Investigació Operativa - Reports de recerca [92]
  • EOLI - Enginyeria d'Organització i Logística Industrial - Reports de recerca [59]
  View UPCommons Usage Statistics

Show full item record

FilesDescriptionSizeFormatView
an ILS with VNS ... king flow shop problem.pdfworking paper on tardiness flow shop blocking problem270,0KbPDFView/Open

Browse

This CollectionBy Issue DateAuthorsOther contributionsTitlesSubjectsThis repositoryCommunities & CollectionsBy Issue DateAuthorsOther contributionsTitlesSubjects

© UPC Obrir en finestra nova . Servei de Biblioteques, Publicacions i Arxius

info.biblioteques@upc.edu

  • About This Repository
  • Metadata under:Metadata under CC0
  • Contact Us
  • Send Feedback
  • Privacy Settings
  • Inici de la pàgina