Abstract
We address a generalization of the classical 1- and 2-processor UET scheduling problem on dedicated machines. In our chromatic model of scheduling machines have non-simultaneous availability times and tasks have arbitrary release times and due dates. Also, the versatility of our approach makes it possible to generalize all known classical criteria of optimality. Under these constraints we show that the problem of optimal scheduling of sparse instances can be solved in polynomial time.
This research was partially supported by KBN grant 4T11C 04725.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Bianco, L., Błażewicz, J., Dell’Olmo, P., Drozdowski, M.: Preemptive multiprocessor task scheduling with release times and time windows. Ann. Oper. Res. 70, 43–55 (1997)
Błażewicz, J., Dell’Olmo, P., Drozdowski, M., Ma̧czka, P.: Scheduling multiprocessor tasks on parallel processors with limited availability. Euro. J. Oper. Res. 149, 377–389 (2003)
Błażewicz, J., Dell’Olmo, P., Drozdowski, M., Speranza, M.G.: Scheduling multiprocessor tasks on three dedicated processors. Infor. Process. Lett. 41, 275–280 (1992), Corrigendum IPL 49, 269–270 (1994)
Coffman Jr., E.G., Garey, M.R., Johnson, D.S., LaPaugh, A.S.: Scheduling file transfers. SIAM J. Comput. 14, 744–780 (1985)
Dobson, G.S., Karmarkar, U.S.: Simultaneous resource scheduling to minimize weighted flow times. Oper. Res. 37, 592–600 (1989)
Drozdowski, M.: Scheduling multiprocessor tasks - An overview. J. Oper. Res. 94, 215–230 (1996)
Gehringer, E.F., Siewiorek, D.P., Segall, Z.: Parallel Processing: The Cm* Experience. Digital Press, Bedford (1987)
Gharbi, A., Haouari, M.: Optimal parallel machines scheduling with availability constraints. Disc. Appl. Math. 148, 63–87 (2005)
Giaro, K., Kubale, M.: Edge-chromatic sum of trees and bounded cyclicity graphs. Infor. Process. Lett. 75, 65–69 (2000)
Giaro, K., Kubale, M., Piwakowski, K.: Complexity results on open schop scheduling to minimize total cost of operations. Intern. J. Comp. Sys. Sign. 3, 84–91 (2002)
Kao, M., Lam, T., Sung, W., Ting, H.: All-cavity maximum matchings. Proc. Inf. Syst. E-87, 364–373 (2004)
Krawczyk, H., Kubale, M.: An approximation algorithm for diagnostic test scheduling in multicomputer systems. IEEE Trans. Comp. 34, 869–872 (1985)
Kubale, M.: The complexity of scheduling independent two-processor tasks on dedicated processors. Infor. Process. Lett. 24, 141–147 (1987)
Kubale, M.: Preemptive versus nonpreemptive scheduling of biprocessor tasks on dedicated prosessors. Euro. J. Oper. Res. 94, 242–251 (1996)
Lloyd, E.L.: Concurrent task systems. Oper. Res. 29, 189–201 (1981)
Zhou, X., Nishizeki, T.: Algorithms for the cost edge-coloring of trees. In: Wang, J. (ed.) COCOON 2001. LNCS, vol. 2108, pp. 288–297. Springer, Heidelberg (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Giaro, K., Kubale, M. (2006). Chromatic Scheduling of 1- and 2-Processor UET Tasks on Dedicated Machines with Availability Constraints. In: Wyrzykowski, R., Dongarra, J., Meyer, N., Waśniewski, J. (eds) Parallel Processing and Applied Mathematics. PPAM 2005. Lecture Notes in Computer Science, vol 3911. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11752578_103
Download citation
DOI: https://doi.org/10.1007/11752578_103
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-34141-3
Online ISBN: 978-3-540-34142-0
eBook Packages: Computer ScienceComputer Science (R0)