SCOPUS 정보 검색 플랫폼

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

Volumn 1879, Issue , 2000, Pages 268-277

Preemptive scheduling with rejection (Extended abstract)

(3) Hoogeveen, Han a Skutella, Martin b Woeginger, Gerhard J c

a UTRECHT UNIVERSITY (Netherlands)

b TECHNISCHE UNIVERSITÄT BERLIN (Germany)

c GRAZ UNIVERSITY OF TECHNOLOGY (Austria)

Author keywords

Approximation algorithm; Computational complexity; In approximability; Preemption; Scheduling; Worst case ratio

Indexed keywords

APPROXIMATION ALGORITHMS; COMPUTATIONAL COMPLEXITY; POLYNOMIAL APPROXIMATION; SCHEDULING; ALGORITHMS; PROGRAM PROCESSORS;

APPROXIMABILITY; COMPLETE CLASSIFICATION; EXTENDED ABSTRACTS; FULLY POLYNOMIAL TIME APPROXIMATION SCHEMES; PRE-EMPTIVE SCHEDULING; PREEMPTION; SCHEDULING PROBLEM; WORST CASE RATIO; UNRELATED MACHINES;

JOB SHOP SCHEDULING;

EID: 84927128454 PISSN: 03029743 EISSN: 16113349 Source Type: Book Series
DOI: 10.1007/3-540-45253-2_25 Document Type: Article

Times cited : (21)

References (9)

1
- 0002019995
- Hardness of approximation
- D.S. Hochbaum (ed.), PWS Publishing Company, Boston
- S Arora and C. Lund [1997]. Hardness of approximation. In: D.S. Hochbaum (ed.) Approximation algorithms for NP-hard problems, PWS Publishing Company, Boston, 399-446.
- (1997) Approximation Algorithms for Np-Hard Problems , pp. 399-446
- Arora, S.¹ Lund, C.²

2
- 0002514784
- Multiprocessor scheduling with rejection
- GIE, 269
- Y. Bartal, S. Leonardi, A. Marchetti-Spaccamela, J. Sgall, and L. Stou GIE [2000]. Multiprocessor scheduling with rejection. SIAM Journal on Discrete Mathematics 13, 64-78. 269
- (2000) SIAM Journal on Discrete Mathematics , vol.13 , pp. 64-78
- Bartal, Y.¹ Leonardi, S.² Marchetti-Spaccamela, A.³ Sgall, J.⁴ Stou, L.⁵

3
- 84927134775
- On Dependent Randomized Rounding Algorithms. Proceedings of the 5th International IPCO Conference
- 271
- D. Bertsimas, C. Teo, AND R. Vohra [1996]. On Dependent Randomized Rounding Algorithms. Proceedings of the 5th International IPCO Conference, Springer LNCS 1084, 330-344. 271
- (1996) Springer LNCS , vol.1084 , pp. 330-344
- Bertsimas, D.¹ Teo, C.² Vohra, R.³

4
- 84927162813
- A compendium of NP-optimization problems
- P. Crescenzi and V. Kann [1997]. A compendium of NP-optimization problems. http://www.nada.kth.se/nada/theory/problemlist.html.
- (1997)
- Crescenzi, P.¹ Kann, V.²

5
- 84896765020
- Techniques for scheduling with rejection. Proceedings of the 6th European Symposium on Algorithms (ESA'98)
- 269
- D.W. Engels, D.R. Karger, S.G. Kolliopoulos, S. Sengupta, R.N. Uma, AND J. Wein [1998]. Techniques for scheduling with rejection. Proceedings of the 6th European Symposium on Algorithms (ESA'98), Springer LNCS 1461, 490-501. 269
- (1998) Springer LNCS , vol.1461 , pp. 490-501
- Engels, D.W.¹ Karger, D.R.² Kolliopoulos, S.G.³ Sengupta, S.⁴ Uma, R.N.⁵ Wein, J.⁶

6
- 0003603813
- Freeman, San Francisco
- M.R. Garey and D.S. Johnson [1979]. Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco. 273
- (1979) Computers and Intractability: A Guide to the Theory of Np-Completeness , pp. 273
- Garey, M.R.¹ Johnson, D.S.²

7
- 0345901561
- Sequencing and scheduling: Algorithms and complexity
- S.C. Graves, A.H.G. Rinnooy Kan, and P.H. Zipkin (eds.), 268, 269, 270, 274
- E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan, and D.B. Shmoys [1993]. Sequencing and scheduling: Algorithms and complexity. In: S.C. Graves, A.H.G. Rinnooy Kan, and P.H. Zipkin (eds.) Logistics of Production and Inventory, Handbooks in Operations Research and Management Science 4, North-Holland, Amsterdam, 445-522. 268, 269, 270, 274
- (1993) Logistics of Production and Inventory, Handbooks in Operations Research and Management Science 4, North-Holland, Amsterdam , pp. 445-522
- Lawler, E.L.¹ Lenstra, J.K.² Rinnooy Kan, A.³ Shmoys, D.B.⁴

8
- 84878897018
- Laboratory for Computer Science, MIT
- S. Sengupta [1999]. Algorithms and approximation schemes for minimum lateness and tardiness scheduling with rejection. Manuscript, Laboratory for Computer Science, MIT. 269
- (1999) Algorithms and Approximation Schemes for Minimum Lateness and Tardiness Scheduling with Rejection. Manuscript , pp. 269
- Sengupta, S.¹

9
- 0032803604
- When does a dynamic programming formulation guarantee the existence of an FPTAS?
- 274
- G.J. Woeginger [1999]. When does a dynamic programming formulation guarantee the existence of an FPTAS? Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'99), 820-829. 273, 274
- (1999) Proceedings of the 10Th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'99) , vol.273 , pp. 820-829
- Woeginger, G.J.¹

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.