Approximating scheduling machines with capacity constraints

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5598 LNCS, Issue , 2009, Pages 283-292

  Zhang, Chi ^a   Wang, Gang ^a   Liu, Xiaoguang ^a   Liu, Jing ^a  

^a NANKAI UNIVERSITY   (China)

Author keywords

Approximation; Capacity Constraints; Iterative Rounding; Scheduling

Indexed keywords

APPROXIMATION; CAPACITY CONSTRAINTS; IDENTICAL MACHINES; ITERATIVE ROUNDING; MAKESPAN; PROCESSING TIME; SCHEDULING PROBLEM;

APPROXIMATION ALGORITHMS; SCHEDULING ALGORITHMS; TELECOMMUNICATION NETWORKS;

ITERATIVE METHODS;

EID: 70350639699     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-02270-8_29     Document Type: Conference Paper

References (14)

1. Angel, E., Bampis, E., Kononov, A.: A FPTAS for Approximating the Unrelated Parallel Machines Scheduling Problem with Costs. In: Meyer auf der Heide, F. (ed.) ESA 2001. LNCS, vol. 2161, pp. 194-205. Springer, Heidelberg (2001)
2. Gairing, M., Monien, B., Woclaw, A.: A faster combinatorial approximation algorithm for scheduling unrelated parallel machines. Theor. Comput. Sci. 380(1-2), 87-99 (2007)
3. Hochbaum, D.S., Shmoys, D.B.: Using dual approximation algorithms for scheduling problems: theoretical and practical results. J. ACM 34, 144-162 (1987)
4. Jain, K.: A factor 2 approximation algorithm for the generalized Steiner network problem. Combinatorica 21, 39-60 (2001)
5. Khachiyan, L.G.: A polynomial algorithm for linear programming. Doklady Akademiia Nauk USSR 244, 1093-1096 (1979);
6. A translation appears in: Soviet Mathematics Doklady 20, 191-194, (1979) (in Russian)
7. Lenstra, J.K., Shmoys, D.B., Tardos, É.: Approximation algorithms for scheduling unrelated parallel machines. Math. Programming 46, 259-271 (1990)
8. Singh, M., Lau, L.C.: Approximating minimum bounded degree spanning trees to within one of optimal. In: The Thirty-Ninth Annual ACM Symposium on Theory of Computing, San Diego, California, USA, pp. 661-670 (2007)
9. Tsai, L.H.: Asymptotic Analysis of an Algorithm for Balanced Parallel Processor Scheduling. SIAM Journal on Computing 21, 59-94 (1992)
10. Woeginger, G.J.: A comment on scheduling two parallel machines with capacity constraints. Discrete Optimization 2(3), 269-272 (2005)
11. Yang, H., Ye, Y., Zhang, J.: An approximation algorithm for scheduling two parallel machines with capacity constraints. Discrete Applied Mathematics 130(3), 449-467 (2003)
12. Zhang, J., Ye, Y.: On the Budgeted MAX-CUT problem and its Application to the Capacitated Two-Parallel Machine Scheduling. Working Paper, Department of Management Sciences, The University of Iowa (2001)
13. Etschmaier, M.M., Mathaisel, D.F.X.: Airline Scheduling: An Overview. Transportation Science 19(2), 127-138 (1985)
14. Rushmeier, R.A., Hoffman, K.L., Padberg, M.: Recent Advances in Exact Optimization of Airline Scheduling Problems. Technical Report, George Mason University (1995)