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.690 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.

Best known solutions for Taillard’s instances adapted to the distributed blocking flow shop scheduling problem

Thumbnail
View/Open
Best solutions for the DBFSP.pdf (134,2Kb)
best solutions forn Taillard's instances on DBFSP (134,2Kb)
  View Usage Statistics
  LA Referencia / Recolecta stats
Cita com:
hdl:2117/87311

Show full item record
Ribas Vila, ImmaculadaMés informacióMés informacióMés informació
Companys Pascual, RamónMés informació
Document typeResearch report
Defense date2016-04-11
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
The distributed blocking flow shop scheduling problem (DBFSP) allows modeling the scheduling process in companies with more than one factory. It configures production systems as flow shop lines where the blocking constraint must be considered. To the best of our knowledge, this variant of the distributed permutation flow shop scheduling problem has not been studied. In this working paper, we show the best solutions found during our research for the Taillard’s instances adapted to this problem.
Description
In this working paper we show the best values found for the Taillard’s benchmark [17] applied to the DBFSP.
CitationRibas, I., Companys , R. "Best known solutions for Taillard’s instances adapted to the distributed blocking flow shop scheduling problem". 2016. 
URIhttp://hdl.handle.net/2117/87311
Collections
  • Departament d'Organització d'Empreses - Reports de recerca [138]
  • EOLI - Enginyeria d'Organització i Logística Industrial - Reports de recerca [59]
  View Usage Statistics

Show full item record

FilesDescriptionSizeFormatView
Best solutions for the DBFSP.pdf134,2KbPDFView/Open
Best solutions for the DBFSP.pdfbest solutions forn Taillard's instances on DBFSP134,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