Abstract
We consider scheduling problems in a multiprocessor system with incompatible jobs (two incompatible jobs cannot be processed by the same machine). We consider the problem to minimize the maximum job completion time, the makespan. This problem is NP-complete.
We present a number of polynomial time approximation algorithms for this problem where the job incompatibilities possess a special structure. As the incompatibilities form a graph on the set of jobs, our algorithms strongly rely on graph theoretic methods. We also solve an open problem by Biró, Hujter and Tuza on coloring precolored bipartite graphs.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
Biró, B., Hujter, M., and Tuza, Z.: Precoloring extension. I. Interval graphs. Disc. Math. (to appear)
Bodlaender, H.L., Jansen, K.: Restrictions of graph partition problems. Part I. Technical Report RUU-CS-91-44, Department of Computer Science, Utrecht University, Utrecht, the Netherlands (1991)
Bodlaender, H.L., Kloks, T.: Better algorithms for the pathwidth and treewidth of graphs. Proc. 18th ICALP, LNCS 510 (Springer, Berlin, 1991) 544–555
Fisher, M.L.: Worst-case analysis of heuristic algorithms. Management Sci 26 (1980) 1–17
Garey, M.R., Graham, R.L., Johnson, D.S.: Performance guarantees for scheduling algorithms. Operations Research 26 (1978) 3–21
Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco (1979)
Graham, R.L.: Bounds for certain multiprocessing anomalies. Bell Syst. Tech. J. 45 (1966) 1563–1581
Graham, R.L.: Bounds on multiprocessing timing anomalies. SIAM J. Appl. Math. 17 (1969) 263–269
Hochbaum, D.S., Shmoys, D.B.: Using dual approximation algorithms for scheduling problems: Theoretical and practical results. J. ACM 34 (1987) 144–162
Hujter, M., Tuza, Z.: Precoloring extension. II. Graph classes related to bipartite graphs. J. Graph Theory (to appear)
Jansen, K., Scheffler, P.: Generalized coloring for tree-like graphs. Technical Report 319 Fachbereich Mathematik, TU Berlin, Berlin, Germany (1992)
Lee, C.Y.: Parallel machines scheduling with nonsimultaneous machine available time. Disc. Appl. Math. 30 (1991) 53–61
Linial, N., Vazirani, U.: Graph products and chromatic numbers. FOCS (1989) 124–128
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bodlaender, H.L., Jansen, K., Woeginger, G.J. (1993). Scheduling with incompatible jobs. In: Mayr, E.W. (eds) Graph-Theoretic Concepts in Computer Science. WG 1992. Lecture Notes in Computer Science, vol 657. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56402-0_34
Download citation
DOI: https://doi.org/10.1007/3-540-56402-0_34
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-56402-7
Online ISBN: 978-3-540-47554-5
eBook Packages: Springer Book Archive