Title :
Algorithms for the unspecified unrelated parallel machine scheduling problem with additional resources
Author :
Luis Fanjul;Federico Perea;Rub?n Ruiz
Author_Institution :
Grupo de Sistemas de Optimizaci?n Aplicada, Instituto Tecnol?gico de Inform?tica, Ciudad Polit?cnica de la Innovaci?n, Edifico 8G, Acc. B., Universitat Polit?cnica de Val?ncia, Camino de Vera s/n, 46021, Spain
Abstract :
In this paper we study the unspecified unrelated parallel machine scheduling problem with additional resources. Jobs can be processed at any machine, using a certain number of units of a scarce resource. The objective is to schedule jobs in parallel machines, so that the makespan is minimized, and the use of resources does not exceed a given limit, at any time. We propose an ILP program to solve this problem to optimality. Due to the complexity of the problem, this program explodes for medium-size instances. Therefore, we introduce a heuristic procedure. Both algorithms are tested over a computational experience.
Keywords :
"Parallel machines","Random access memory","Upper bound","Complexity theory","Program processors","Blades","Algorithm design and analysis"
Conference_Titel :
Industrial Engineering and Systems Management (IESM), 2015 International Conference on
DOI :
10.1109/IESM.2015.7380139
