Putnik, GoranAlves, CátiaVarela, LeonildeÁvila, Paulo2023-06-122023-06-122016Putnik, G., Alves, C., Varela, L., Ávila, P. (2016) A Contribution for Generalization of Scheduling Problem Classes, Proceedings of 2100 Projects Association Joint Conferences, 2100 Projects Association, Vol. 4, ISSN 2183-30602183-3060http://hdl.handle.net/10400.22/23136It 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.engScheduling problemGeneral scheduling problemGraham’s notationSimulator complexityjournal article10.26537/recipp-23136