Abstract
We consider the scheduling of biprocessor jobs under sum objective (BPSMS). Given a collection of unit-length jobs where each job requires the use of two processors, find a schedule such that no two jobs involving the same processor run concurrently. The objective is to minimize the sum of the completion times of the jobs. Equivalently, we would like to find a sum edge coloring of the given multigraphs, i.e. a partition of its edge set into matchings M 1,...,M t minimizing \(\sum_{i=1}^ti|M_i|\).
This problem is APX-hard even in the case of bipartite graphs [M04]. This special case is closely related to the classic open shop scheduling problem. We give a 1.829-approximation algorithm for BPSMS that combines a configuration LP with greedy methods improving the previously best known ratio of 2 [BBH+98]. The algorithm uses the fractions derived from the configuration LP and a non-standard randomized rounding. We also give a purely combinatorial and practical algorithm for the case of simple graphs, with a 1.8861-approximation ratio.
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
Afrati, F., Bampis, E., Fishkin, A., Jansen, K., Kenyon, C.: Scheduling to minimize the average completion time of dedicated tasks. In: Kapoor, S., Prasad, S. (eds.) FST TCS 2000. LNCS, vol. 1974, pp. 454–464. Springer, Heidelberg (2000)
Bar-Noy, A., Bellare, M., Halldórsson, M.M., Shachnai, H., Tamir, T.: On chromatic sums and distributed resource allocation. Inf. Comp. 140, 183–202 (1998)
Bansal, N., Sviridenko, M.: The Santa Claus problem. In: STOC, pp. 31–40 (2006)
Cook, W.J., Cunningham, W.H., Pulleyblank, W.R., Schrijver, A.: Combinatorial Optimization. John Wiley and Sons, Chichester (1998)
Coffman Jr., E.G., Garey, M.R., Johnson, D.S., LaPaugh, A.S.: Scheduling file transfers. SIAM J. Comput. 14, 744–780 (1985)
Chuzhoy, J., Ostrovsky, R., Rabani, Y.: Approximation Algorithms for the Job Interval Selection Problem and Related Scheduling Problems. In: FOCS, pp. 348–356 (2001)
Chudak, F., Shmoys, D.: Improved approximation algorithms for the uncapacitated facility location problem. SIAM J. Comput. 33(1), 1–25 (2003)
Dobson, G., Karmarkar, U.: Simultaneous resource scheduling to minimize weighted flow times. Oper. Res. 37, 592–600 (1989)
Fishkin, A.V., Jansen, K., Porkolab, L.: On minimizing average weighted completion time of multiprocessor tasks with release dates. In: Orejas, F., Spirakis, P.G., van Leeuwen, J. (eds.) ICALP 2001. LNCS, vol. 2076, pp. 875–886. Springer, Heidelberg (2001)
Fleischer, L., Goemans, M., Mirrokni, V., Sviridenko, M.: Tight approximation algorithms for maximum general assignment problems. In: SODA, pp. 611–620 (2006)
Gandhi, R., Halldórsson, M.M., Kortsarz, G., Shachnai, H.: Approximating non-preemptive open-shop scheduling and related problems. In: ICALP, pp. 658–669 (2004)
Gandhi, R., Mestre, J.: Combinatorial algorithms for data migration. In: Díaz, J., Jansen, K., Rolim, J.D.P., Zwick, U. (eds.) APPROX 2006 and RANDOM 2006. LNCS, vol. 4110. Springer, Heidelberg (2006)
Giaro, K., Kubale, M., Malafiejski, M., Piwakowski, K.: Dedicated scheduling of biprocessor tasks to minimize mean flow time. In: Wyrzykowski, R., Dongarra, J., Paprzycki, M., Waśniewski, J. (eds.) PPAM 2001. LNCS, vol. 2328, pp. 87–96. Springer, Heidelberg (2002)
Gehringer, E.F., Siewiorek, D.P., Segall, Z.: Parallel Processing: The Cm* Experience. Digital Press, Bedford (1987)
Halldórsson, M.M., Kortsarz, G., Shachnai, H.: Sum coloring interval and k-claw free graphs with application to scheduling dependent jobs. Algorithmica 37, 187–209 (2003)
Jain, K.: A factor 2 approximation algorithm for the generalized Steiner network problem. Combinatorica 21, 39–60 (2001)
Kubale, M.: Preemptive versus non-preemptive scheduling of biprocessor tasks on dedicated processors. European J. Operational Research 94, 242–251 (1996)
Khachiyan, L.: Polynomial-time algorithm for linear programming. USSR Comput. Math. and Math. Physics 20(1), 53–72 (1980)
Krawczyk, H., Kubale, M.: An approximation algorithm for diagnostic test scheduling in multicomputer systems. IEEE Trans. Comput. 34, 869–872 (1985)
Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G., Shmoys, D.B.: Sequencing and scheduling: Algorithms and complexity. In: Handbook in Operations Research and Management Science, vol. 4, pp. 445–522. North-Holland, Amsterdam (1993)
Marx, D.: Complexity results for minimum sum edge coloring (manuscript) (2004)
Nutov, Z., Beniaminy, I., Yuster, R.: A (1-1/e)-approximation algorithm for the generalized assignment problem. Oper. Res. Lett. 34(3), 283–288 (2006)
Vizing, V.G.: On an estimate of the chromatic class of a p-graph. Diskrete Analiz 3, 23–30 (1964)
Kim, Y.-A.: Data migration to minimize the total completion time. J. of Algorithms 55, 42–57 (2005)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Halldórsson, M.M., Kortsarz, G., Sviridenko, M. (2008). Min Sum Edge Coloring in Multigraphs Via Configuration LP. In: Lodi, A., Panconesi, A., Rinaldi, G. (eds) Integer Programming and Combinatorial Optimization. IPCO 2008. Lecture Notes in Computer Science, vol 5035. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-68891-4_25
Download citation
DOI: https://doi.org/10.1007/978-3-540-68891-4_25
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-68886-0
Online ISBN: 978-3-540-68891-4
eBook Packages: Computer ScienceComputer Science (R0)