Abstract
The paper deals with a scheduling problem on the parallel processors, in which the sum of values of all the jobs is maximized. The value of job is characterized by a stepwise non-increasing function. Establishing an order of processing of datagrams which are sent by multiprocessor router is a practical example of application of this problem. It was already proved that its single processor case is NP-hard, thus the problem is also NP-hard. Therefore, two pseudo-polynomial time algorithms for the problem with common moments of job value change and a polynomial time algorithm for the case with identical processing times are constructed. It is also constructed and experimentally tested a number of heuristic algorithms which solve the general version of the problem.
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
Graham R. L., Lawler E. L., Lenstra J. K., Rinnooy Kan A. H. G. (1979) Optimization and approximation in deterministic sequencing and scheduling: a survey. Annals of Discrete Mathematics 5, 287–326
Janiak A., Kasperski A., Krysiak T. (2004) Scheduling jobs with a stepwise function of change of their values. In Ahr D., Fahrion R., Oswald M., Reinelt G. (Eds.), Operations Research Proceedings 2003, Selected Papers of the International Conference on Operations Research (OR 2003), Heidelberg, September 3–5, 2003, 363–370
Lawler E. L. (1976) Combinatorial optimization: Networks and Matroids. Holt, Rinehart & Winston, New York
Lawler E. L. and Lenstra J. K. and Rinooy Kan A. H. G. and Shmoys D. B. (1993) Sequencing and scheduling: Algorithms and complexity. In Graves S. C, Rinnooy Kan A. H. G., and Zipkin P. H. (Eds.), Handbooks in Operations Research and Management Science, 4, 445–522
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Janiak, A., Krysiak, T. (2005). Multiprocessor Scheduling Problem with Stepwise Model of Job Value Change. In: Fleuren, H., den Hertog, D., Kort, P. (eds) Operations Research Proceedings 2004. Operations Research Proceedings, vol 2004. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-27679-3_44
Download citation
DOI: https://doi.org/10.1007/3-540-27679-3_44
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-24274-1
Online ISBN: 978-3-540-27679-1
eBook Packages: Business and EconomicsBusiness and Management (R0)