| Name: | Description: | Size: | Format: | |
|---|---|---|---|---|
| 1023.71 KB | Adobe PDF |
Advisor(s)
Abstract(s)
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.
Description
Keywords
Scheduling problem General scheduling problem Graham’s notation Simulator complexity
Citation
Putnik, 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-3060
Publisher
2100 Projects Association - Scientific Association for Promotion of Technology and Management for Organizational and Social Transformative Change