Utilize este identificador para referenciar este registo:
https://hdl.handle.net/1822/50922
Registo completo
Campo DC | Valor | Idioma |
---|---|---|
dc.contributor.author | E Santos, André Serra | por |
dc.contributor.author | Madureira, Ana Maria | por |
dc.contributor.author | Varela, Maria Leonilde Rocha | por |
dc.date.accessioned | 2018-02-22T19:46:04Z | - |
dc.date.available | 2018-02-22T19:46:04Z | - |
dc.date.issued | 2015 | - |
dc.identifier.issn | 1923-2926 | - |
dc.identifier.uri | https://hdl.handle.net/1822/50922 | - |
dc.description.abstract | All rights reserved. Global competition pressures have forced manufactures to adapt their productive capabilities. In order to satisfy the ever-changing market demands many organizations adopted flexible resources capable of executing several products with different performance criteria. The unrelated parallel-machines makespan minimization problem (Rm||Cmax) is known to be NP-hard or too complex to be solved exactly. In the heuristics used for this problem, the MCT (Minimum Completion Time), which is the base for several others, allocates tasks in a random like order to the minimum completion time machine. This paper proposes an ordered approach to the MCT heuristic. MOMCT (Modified Ordered Minimum Completion Time) will order tasks in accordance to the MS index, which represents the mean difference of the completion time on each machine and the one on the minimum completion time machine. The computational study demonstrates the improved performance of MOMCT over the MCT heuristic. | por |
dc.description.sponsorship | This work is supported by FEDER Funds through the “Programa Operacional Factores de Competitividade - COMPETE” program and by National Funds through FCT “Fundação para a Ciência e a Tecnologia” under the project: FCOMP-01-0124-FEDER-PEst-OE/EEI/UI0760/2011 and PEstOE/EEI/UI0760/2014. | por |
dc.language.iso | eng | por |
dc.publisher | Growing Science | por |
dc.relation | PEst-OE/EEI/UI0760/2011 | por |
dc.relation | info:eu-repo/grantAgreement/FCT/5876/135946/PT | por |
dc.rights | openAccess | por |
dc.subject | Makespan | por |
dc.subject | MCT | por |
dc.subject | MOMCT | por |
dc.subject | Scheduling | por |
dc.subject | Unrelated Parallel Machines | por |
dc.title | An ordered heuristic for the allocation of resources in unrelated parallel-machines | por |
dc.type | article | por |
dc.peerreviewed | yes | por |
oaire.citationStartPage | 145 | por |
oaire.citationEndPage | 156 | por |
oaire.citationIssue | 2 | por |
oaire.citationVolume | 6 | por |
dc.date.updated | 2018-02-14T18:30:49Z | - |
dc.identifier.doi | 10.5267/j.ijiec.2015.1.001 | por |
dc.description.publicationversion | info:eu-repo/semantics/publishedVersion | por |
sdum.export.identifier | 2721 | - |
sdum.journal | International Journal of Industrial Engineering Computations | por |
Aparece nas coleções: | CAlg - Artigos em revistas internacionais / Papers in international journals |
Ficheiros deste registo:
Ficheiro | Descrição | Tamanho | Formato | |
---|---|---|---|---|
IJIEC_2015_1.pdf | 371,8 kB | Adobe PDF | Ver/Abrir |