Please use this identifier to cite or link to this item:

TitleAn ordered approach to minimum completion time in unrelated parallel-machines for the makespan optimization
Author(s)Serra e Santos, Andre
Madureira, Ana Maria
Varela, M.L.R.
Unrelated Parallel Machines
Issue date2014
JournalWorld Congress on Nature and Biologically Inspired Computing
Abstract(s)In the current global market organizations face uncertainties and shorter response time. In order to remain competitive many organizations adopted flexible resources capable of performing several operations with different performance capabilities. The unrelated parallel-machines makespan minimization problem (RmIiCmax) is known to be NP-hard or too complex to be solved exactly. Among the several heuristics used for solving this problem, it is possible to identify MCT (Minimum Completion Time) that allocates tasks in a random order to the minimum completion time machine. This paper proposes an ordered approach to the MCT heuristic. MOMCT (Modified Ordered Minimum Completion Time), which will order tasks in accordance to the mean difference of the completion time on each machine and the minimum completion time machine. The computational study demonstrated the improved performance of the proposed ordered approach to the MCT heuristic.
TypeConference paper
AccessRestricted access (UMinho)
Appears in Collections:CAlg - Artigos em livros de atas/Papers in proceedings

Files in This Item:
File Description SizeFormat 
2014 An Ordered Approachto Minimum Completion Time in Unrelated Parallel - Machines for the Makespan Optimization.pdf
  Restricted access
3,65 MBAdobe PDFView/Open

Partilhe no FacebookPartilhe no TwitterPartilhe no DeliciousPartilhe no LinkedInPartilhe no DiggAdicionar ao Google BookmarksPartilhe no MySpacePartilhe no Orkut
Exporte no formato BibTex mendeley Exporte no formato Endnote Adicione ao seu ORCID