An ordered approach to minimum completion time in unrelated parallel-machines for the makespan optimization
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 minimizatio...
| Autor principal: | |
|---|---|
| Outros Autores: | , |
| Formato: | conferencePaper |
| Idioma: | eng |
| Publicado em: |
2014
|
| Assuntos: | |
| Texto completo: | http://hdl.handle.net/1822/63040 |
| País: | Portugal |
| Oai: | oai:repositorium.sdum.uminho.pt:1822/63040 |
| Resumo: | 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. |
|---|