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

60.175 UPC academic works
You are here:
View Item 
  •   DSpace Home
  • Treballs acadèmics
  • Màsters oficials
  • Màster universitari en Automàtica i Robòtica
  • View Item
  •   DSpace Home
  • Treballs acadèmics
  • Màsters oficials
  • Màster universitari en Automàtica i Robòtica
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

General Solution for the Multistage Scheduling Problem with Time and Resource Constraints

Thumbnail
View/Open
tfm-valaitor-generalsolutionforthemultistageschedulingproblemwithtimeandresourceconstraints.pdf (2,018Mb)
Share:
 
  View Usage Statistics
Cita com:
hdl:2117/332372

Show full item record
Val Balmaña, Aitor
Tutor / directorPuig Cayuela, VicençMés informacióMés informacióMés informació
Document typeMaster thesis
Date2020-07-10
Rights accessOpen Access
Attribution-NonCommercial-ShareAlike 3.0 Spain
Except where otherwise noted, content on this work is licensed under a Creative Commons license : Attribution-NonCommercial-ShareAlike 3.0 Spain
Abstract
The aim is to get the most general possible solution for the multistage scheduling problem using an innovative and modern approach. The goal is to optimize, not only the makespan, but other aspects of the schedule as the production costs. The proposed solution will take the information of the plant (machines, formula for each product, orders, etc...) and give a feasible schedule that minimizes time, cost and other aspects. Moreover, the machines will have maintenance/cleaning needs that must be respected. Orders will have a due date associated that should be fulfilled. And, the most important feature that the program must have is adaptability. It has to be able to describe and solve a large pool of different plants, all of them with its own particularities. This has to be achieved with an open source constraint satisfaction solver relying heavily on pre- and post-processing along with possible artificial intelligence techniques. The scheduling tool is developed with Python and should be integrated as a service inside an API, this will ease the integration inside the industry 4.0 platform. This way of proceeding adapts the traditional scheduling problem to the new software developing philosophy with modern architecture
SubjectsComputer programming, Programació (Ordinadors)
URIhttp://hdl.handle.net/2117/332372
Collections
  • Màsters oficials - Màster universitari en Automàtica i Robòtica [187]
Share:
 
  View Usage Statistics

Show full item record

FilesDescriptionSizeFormatView
tfm-valaitor-ge ... andresourceconstraints.pdf2,018MbPDFView/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
  • Inici de la pàgina