TECNOLOGIAS ENVOLVIDAS NO SISTEMA DE MÁQUINAS PARALELAS

Abstract

In this article are studied techniques involving the task scheduling problem in systems with parallel machines. These problems have a predetermined number of tasks, all with known runtimes. This problem seeks to minimize makespan, which is defined as the total processing time of the worst machine. Thus, this paper presents a systematic literature review aiming to identify the application areas and the technologies used for resolution. The most common areas of application are: industries, job scheduling, optimization, localization, healthcare, telecommunications. The research was conducted using the web of science databases, and was limited to English language and document type articles only. After the investigation using the systematic review methodology, 15 articles were selected. In conclusion, the areas of application and the methods (technologies) involved and used in the solution process were identified.