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
61.603 UPC E-Prints
You are here:
View Item 
  •   DSpace Home
  • E-prints
  • Grups de recerca
  • SCOM - Supply Chain and Operations Management
  • Articles de revista
  • View Item
  •   DSpace Home
  • E-prints
  • Grups de recerca
  • SCOM - Supply Chain and Operations Management
  • Articles de revista
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

A computational evaluation of constructive heuristics for the parallel blocking flow shop problem with sequence-dependent setup times

Thumbnail
View/Open
2021-IJIEC_2021_4.pdf (429,2Kb)
 
10.5267/j.ijiec.2021.1.004
 
  View Usage Statistics
  LA Referencia / Recolecta stats
Cita com:
hdl:2117/344033

Show full item record
Ribas Vila, ImmaculadaMés informacióMés informacióMés informació
Companys Pascual, RamónMés informació
Document typeArticle
Defense date2021-01-22
Rights accessOpen Access
Attribution-NonCommercial-NoDerivs 3.0 Spain
Except where otherwise noted, content on this work is licensed under a Creative Commons license : Attribution-NonCommercial-NoDerivs 3.0 Spain
Abstract
This paper deals with the problem of scheduling jobs in a parallel flow shop environment without buffers between machines and with sequence-dependent setup times in order to minimize the maximum completion time of jobs. The blocking constraint normally leads to an increase in the maximum completion time of jobs due to the blockage of machines, which can increase even more so when setup times are considerable. Hence, the heuristic to solve this problem must take into account these specificities in order to minimize the timeout of machines. Because the procedures designed to solve the parallel flow shop scheduling problem must deal not only with the sequencing of jobs but also with their allocation to the flow shops, 36 heuristics have been tested in this paper, of which 35 combine sequencing rules with allocation methods while the last one takes a different approach that is more related to the nature of this problem. The computational evaluation of the implemented heuristics showed good performance of the heuristic designed especially for the problem (RCP0) when the setup times are considerable. Furthermore, the evaluation has also allowed us to propose a combined heuristic that leads to good solutions in a short CPU time.
CitationRibas, I.; Companys, R. A computational evaluation of constructive heuristics for the parallel blocking flow shop problem with sequence-dependent setup times. "International journal of industrial engineering computations", 22 Gener 2021, vol. 12, núm. 3, p. 321-328. 
URIhttp://hdl.handle.net/2117/344033
DOI10.5267/j.ijiec.2021.1.004
ISSN1923-2934
Publisher versionhttp://growingscience.com/beta/ijiec/4775-a-computational-evaluation-of-constructive-heuristics-for-the-parallel-blocking-flow-shop-problem-with-sequence-dependent-setup-times.html
Collections
  • SCOM - Supply Chain and Operations Management - Articles de revista [66]
  • Departament d'Organització d'Empreses - Articles de revista [802]
  View Usage Statistics

Show full item record

FilesDescriptionSizeFormatView
2021-IJIEC_2021_4.pdf429,2KbPDFView/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
  • Contact Us
  • Send Feedback
  • Privacy Settings
  • Inici de la pàgina