A Contribution for Generalization of Scheduling Problem Classes

• Autor(a) principal: Putnik, Goran
• Data de Publicação: 2016
• Outros Autores: Alves, Cátia, Varela, Leonilde, Ávila, Paulo
• Tipo de documento: Artigo
• Idioma: eng
• Título da fonte: Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
• Texto Completo: http://hdl.handle.net/10400.22/23136
• topic: Scheduling problem; General scheduling problem; Graham’s notation; Simulator complexity

It is identified that different scheduling problem classes are just special cases of one “general scheduling problem” that is that a number of traditional scheduling problem classes (for the case of 64 classes obtained by combination of 6 parameters) could be reduced to the scheduling problem for a set of lots, with one part per lot. “General scheduling problem” definition helps to minimize the simulator’s size/complexity concerning modeling and evaluation of three scheduling paradigms. Further, for scheduling problems different notations were developed to represent different scheduling problems classes. In this paper we introduced a new field into the Graham´s notation, named “sub-problem solution classes”, considering that the general solution (objective) is integrated over solutions for sub-problems.