On Approximating a Scheduling Problem
 Pierluigi Crescenzi,
 Xiaotie Deng,
 Christos H. Papadimitriou
 … show all 3 hide
Rent the article at a discount
Rent now* Final gross prices may vary according to local VAT.
Get AccessAbstract
Given a set of communication tasks (best described in terms of a weighted bipartite graph where one set of nodes denotes the senders, the other set the receivers, edges are communication tasks, and the weight of an edge is the time required for transmission), we wish to minimize the total time required for the completion of all communication tasks assuming that tasks can be preempted (that is, each edge can be subdivided into many edges with weights adding up to the edge's original weight) and that preemption comes with a cost. In this paper, we first prove that one cannot approximate this problem within a factor smaller than \(\frac{7}{6}\) unless P=NP. It is known that a simple approximation algorithm achieves within a ratio of two (H. Choi and S.L. Hakimi, Algorithmica, vol. 3, pp. 223–245, 1988). However, our experimental results show that its performance is worse than the originally proposed heuristic algorithm (I.S. Gopal and C.K. Wong, IEEE Transactions on Communications, vol. 33, pp. 497–501, 1985). We devise a more sophisticated algorithm, called the potential function algorithm which, on the one hand, achieves a provable approximation ratio of two, and on the other hand, shows very good experimental performance. Moreover, the way in which our more sophisticated algorithm derives from the simple one, suggests a hierarchy of algorithms, all of which have a worstcase performance at most two, but which we suspect to have increasingly better performance, both in worst case and with actual instances.
 G. Bongiovanni, D. Coppersmith, and C.K. Wong, “An optimal time slot assignment algorithm for an SS/TDMA system wit variable number of transponders,” IEEE Trans. on Communications, vol. 29, pp. 721726, 1981.
 H. Choi and S.L. Hakimi, “Data transfers in networks,” Algorithmica, vol. 3, pp. 223245, 1988.
 E.G. Coffman, Jr., M.R. Garey, D.S. Johnson, and A.S. Lapaugh, “Scheduling file transfers,” SIAM J. Comput., vol. 14, pp. 744780, 1985.
 S. Even, A. Itai, and A. Shamir, “On the complexity of timetable and multicommodity flow problems,” SIAM J. Comput., vol. 5, pp. 691703, 1976.
 I.S. Gopal and C.K. Wong, “Minimizing the number of switchings in an SS/TDMA system,” IEEE Trans. on Communications, vol. 33, pp. 497501, 1985.
 M. Goudreau, K. Lang, S.B. Rao, T. Suel, and T. Tsantilas, “Towards efficiency and portability: Programming with the BSP model,” in Proc. SPAA, pp. 112, 1996.
 E.L. Lawler and J. Labetoulle, “On preemptive scheduling of unrelated parallel processors by linear programming,” J. ACM, vol. 25, pp. 612619, 1978.
 L.G. Valiant, “A bridging model for parallel computation,” Comm. ACM, vol. 33, pp. 103111, 1990.
 Title
 On Approximating a Scheduling Problem
 Journal

Journal of Combinatorial Optimization
Volume 5, Issue 3 , pp 287297
 Cover Date
 20010901
 DOI
 10.1023/A:1011441109660
 Print ISSN
 13826905
 Online ISSN
 15732886
 Publisher
 Kluwer Academic Publishers
 Additional Links
 Topics
 Keywords

 parallel computation
 communication
 bipartite graph
 edge coloring
 Industry Sectors
 Authors

 Pierluigi Crescenzi ^{(1)}
 Xiaotie Deng ^{(2)}
 Christos H. Papadimitriou ^{(3)}
 Author Affiliations

 1. Dipartimento di Sistemi e Informatica, Università degli Studi di Firenze, Via C. Lombroso 6/17, 50134, Firenze, Italy
 2. Department of Computer Science, City University of Hong Kong, Kowloon, Hong Kong SAR, China
 3. Computer Science Division, University of California at Berkeley, Soda Hall 689, Berkeley, CA, 94720, USA