Abstract
The graphic conception of description of scheduling question with help of rough sets give us the possibility of looking on the mutual, relative location the parameters of tasks. It is the way on synthesis of results got with help of different algorithms scheduling also. Thanks to the graphic illustrations we can easily emphasize the general feature of group of scheduling tasks and assigned to the processors, such the bottom level of positive area, border and upper level of zone of upper probability. Graphic illustration of probabilities of conception takes into account the effects of integration of results ranking got for file of algorithms simultaneously.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Błażewicz, J., Lenstra, J.K., Rinnooy Kan, A.H.G.: Scheduling subject to resource constrains: Classification and complexity. Discrete Appl. Math. 5, 11–24 (1983)
Elmaghraby, S.E. (ed.): Symposium on the Theory of Scheduling. Springer, Berlin (1973)
Falk, J.E., Horowitz, J.L.: Critical Path problems with concave cost time curves. Menagement Sci. 19, 446–455 (1972)
Grey, M.R., Johnson, D.S.: Approximation algorithms for the bin packing problems. In: Analysis and Design of Algorithms in Combinatorial, pp. 147–172. Springer, Heidelberg (1981)
Jackson, J.R.: An extension of Johnson’s results on job lot scheduling. Naval Res. Logist. Quart. 3, 201–203 (1956)
Langston, M.A.: Improved LPT scheduling for identical processor systems. RAIRO Tech. Sci. Inform. 1, 69–75 (1982)
Liu, M., Chen, D., Wu, C., Li, H.: Fuzzy reasoning based on a new fuzzy rough set and its application to scheduling problems. Computers & Mathematics with Applications 51(9-10), 1507–1518 (2006)
Mllestad, T., Skowron, A.: A Rough Set Framework for Data Mining of Propositional Default Rules. In: Michalewicz, M., Raś, Z.W. (eds.) ISMIS 1996. LNCS, vol. 1079. Springer, Heidelberg (1996)
Piech, H., Ptak, A., Machura, M.: Evaluation of Operation and State of an Object Using Artificial Intelligence tools, pp. 465–475. Springer Science + Business Media, New York (2005)
Piech, H., Ptak, A., Machura, M.: Interchangeable Strategies (without Side Payments) on the base of Uncertain Information on Resources. Image Anal., Comp. Graph., and AI Applications, Białystok, 145–157 (2005)
Piech, H.: Scheduling with applying rough sets theory. Czestochowa University of Technology (2008)
Syslo, M.M., Deo, N., Kowalik, J.S.: Algorytmy optymalizacji dyskretnej. PWN, Warszawa (1995)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Piech, H. (2009). The Graphic Representation of Areas of Rough Sets Characterizing the Groups of Scheduled Tasks. In: Kwiecień, A., Gaj, P., Stera, P. (eds) Computer Networks. CN 2009. Communications in Computer and Information Science, vol 39. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02671-3_36
Download citation
DOI: https://doi.org/10.1007/978-3-642-02671-3_36
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-02670-6
Online ISBN: 978-3-642-02671-3
eBook Packages: Computer ScienceComputer Science (R0)