Minimizing total busy time in parallel scheduling with application to optical networks

Theoretical Computer Science

Volumn 411, Issue 40-42, 2010, Pages 3553-3562

  Flammini, Michele ^a   Monaco, Gianpiero ^f   Moscardelli, Luca ^b   Shachnai, Hadas ^c   Shalom, Mordechai ^d   Tamir, Tami ^e   Zaks, Shmuel ^c  

^a UNIVERSITY OF L'AQUILA   (Italy)

^b UNIVERSITY OF CHIETI   (Italy)

^c TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^d TEL HAI COLLEGE   (Israel)

^e INTERDISCIPLINARY CENTER   (Israel)

^f UNIVERSITY OF NICE SOPHIA ANTIPOLIS   (France)

Author keywords

Approximation algorithms; Optical networks; Scheduling

Indexed keywords

NP-HARD; OPTICAL NETWORKS; PARALLEL SCHEDULING; SCHEDULING PROBLEM; SINGLE MACHINES; SWITCHING COSTS; TIME INTERVAL;

OPTIMIZATION; SCHEDULING ALGORITHMS;

APPROXIMATION ALGORITHMS;

EID: 77956095155     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2010.05.011     Document Type: Article

References (19)

1. A. Bar-Noy, R. Bar-Yehuda, A. Freund, J. Naor, and B. Schieber A unified approach to approximating resource allocation and scheduling Journal of the ACM 2000 1 23
2. S. Bhatia, J. Chuzhoy, A. Freund, and J. Naor Algorithmic aspects of bandwidth trading ACM Transactions on Algorithms 3 1 2007
3. P. Brucker Scheduling Algorithms 5th ed. 2007 Springer
4. S. Chen, I. Ljubic, and S. Raghavan The regenerator location problem Networks 55 3 2010 205 220
5. S. Chen, S. Raghavan, The regenerator location problem, in: Proceedings of the International Network Optimization Conference, INOC, 2007.
6. A.L. Chiu, and E.H. Modiano Traffic grooming algorithms for reducing electronic multiplexing costs in wdm ring networks Journal of Lightwave Technology 18 1 2000 2 12
7. J.Y.-T. Leung, Handbook of Scheduling: Algorithms, Models, and Performance Analysis 2004 CRS Press
8. M. Flammini, G. Monaco, L. Moscardelli, M. Shalom, S. Zaks, Approximating the traffic grooming problem with respect to adms and oadms, in: 14th International European Conference on Parallel and Distributed Computing (EuroPar), Las Palmas de Gran Canaria, Spain, August 2629, 2008.
9. M. Flammini, G. Monaco, L. Moscardelli, M. Shalom, S. Zaks, Optimizing regenerator cost in traffic grooming 2010 (submitted for publication).
10. M. Flammini, L. Moscardelli, M. Shalom, S. Zaks, Approximating the traffic grooming problem, in: ISAAC, 2005, pp. 915924.
11. H.N. Gabow, An efficient reduction technique for degree-constrained subgraph and bidirected network flow problems, in: STOC, 1983, pp. 448456.
12. O. Gerstel, R. Ramaswami, G. Sasaki, Cost effective traffic grooming in wdm rings, in: INFOCOM'98, Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies, 1998.
13. D. Gijswijt, V. Jost, and M. Queyranne Clique partitioning of interval graphs with submodular costs on the cliques RAIRO-Operations Research-Recherche Oprationelle 41 3 2007 275 287
14. P.E. Green Fiber-Optic Communication Networks 1992 Prentice Hall
15. R. Khandekar, B. Schieber, H. Shachnai, T. Tamir, Real-time scheduling to minimize machine busy times 2010 (submitted for publication).
16. R. Klasing, Methods and problems of wavelength-routing in all-optical networks, in: Proceeding of the MFCS'98 Workshop on Communication, August 2425, Brno, Czech Republic, 1998, pp. 19.
17. M.Y. Kovalyov, C.T. Ng, and T.C.E. Cheng Fixed interval scheduling: models, applications, computational complexity and algorithms European Journal of Operational Research 178 2 2007 331 342
18. E. Lawler, J.K. Lenstra, A.H.G.R. Kan, and D. Shmoys Sequencing and scheduling: algorithms and complexity S.C. Graves, A.H.G. Rinnooy Kan, P. Zipkin, Handbooks in Operations Research and Management Science, 4 1993
19. P. Winkler, L. Zhang, Wavelength assignment and generalized interval graph coloring, in: SODA, 2003, pp. 830831.