SCOPUS 정보 검색 플랫폼

Volumn 21, Issue 1, 2013, Pages 125-139

Comparing the minimum completion times of two longest-first scheduling-heuristics

Author keywords

Heuristics; Identical parallel machines; Minimum completion time; Scheduling; Worst case analysis

Indexed keywords

EID: 84871934161 PISSN: 1435246X EISSN: 16139178 Source Type: Journal
DOI: 10.1007/s10100-011-0217-4 Document Type: Article

Times cited : (11)

References (11)

1
- 0003780756
- New York: Wiley
- Arnold BC, Balakrishnan N, Nagaraja HN (1992) A first course in order statistics. Wiley, New York.
- (1992) A First Course in Order Statistics
- Arnold, B.C.¹ Balakrishnan, N.² Nagaraja, H.N.³

2
- 84949203735
- On-line machine covering
- Azar Y, Epstein L (1997) On-line machine covering. Lect Notes Comput Sci 1284: 23-36.
- (1997) Lect Notes Comput Sci , vol.1284 , pp. 23-36
- Azar, Y.¹ Epstein, L.²

3
- 0021522999
- A performance guarantee for the greedy set-partitioning algorithm
- Coffman EG Jr, Langston MA (1984) A performance guarantee for the greedy set-partitioning algorithm. Acta Informatica 21: 409-415.
- (1984) Acta Informatica , vol.21 , pp. 409-415
- Coffman Jr., E.G.¹ Langston, M.A.²

4
- 0016873384
- Algorithms minimizing mean flow time: schedule-length properties
- Coffman EG Jr, Sethi R (1976) Algorithms minimizing mean flow time: schedule-length properties. Acta Informatica 6: 1-14.
- (1976) Acta Informatica , vol.6 , pp. 1-14
- Coffman Jr., E.G.¹ Sethi, R.²

5
- 0026881284
- The exact LPT-bound for maximizing the minimum completion time
- Csirik J, Kellerer H, Woeginger G (1992) The exact LPT-bound for maximizing the minimum completion time. Oper Res Lett 11: 281-287.
- (1992) Oper Res Lett , vol.11 , pp. 281-287
- Csirik, J.¹ Kellerer, H.² Woeginger, G.³

6
- 0001629328
- Scheduling to maximize the minimum processor finish time in a multiprocessor system
- Deuermeyer BL, Friesen DK, Langston MA (1982) Scheduling to maximize the minimum processor finish time in a multiprocessor system. SIAM J Algebraic Discret Methods 3: 190-196.
- (1982) SIAM J Algebraic Discret Methods , vol.3 , pp. 190-196
- Deuermeyer, B.L.¹ Friesen, D.K.² Langston, M.A.³

7
- 0019525220
- Analysis of greedy solutions for a replacement part sequencing problem
- Friesen DK, Deuermeyer BL (1981) Analysis of greedy solutions for a replacement part sequencing problem. Math Oper Res 6: 74-87.
- (1981) Math Oper Res , vol.6 , pp. 74-87
- Friesen, D.K.¹ Deuermeyer, B.L.²

8
- 57049164903
- Maximizing the minimum completion time on parallel machines
- Haouari M, Jemmali M (2008) Maximizing the minimum completion time on parallel machines. 4OR Q J Oper Res 6: 375-392.
- (2008) 4OR Q J Oper Res , vol.6 , pp. 375-392
- Haouari, M.¹ Jemmali, M.²

9
- 0036604772
- Ordinal on-line scheduling for maximizing the minimum machine completion time
- He Y, Tan ZY (2002) Ordinal on-line scheduling for maximizing the minimum machine completion time. J Comb Optim 6: 199-206.
- (2002) J Comb Optim , vol.6 , pp. 199-206
- He, Y.¹ Tan, Z.Y.²

10
- 0026820770
- Asymptotic analysis of an algorithm for balanced parallel processor scheduling
- Tsai L-H (1992) Asymptotic analysis of an algorithm for balanced parallel processor scheduling. SIAM J Comput 21: 59-64.
- (1992) SIAM J Comput , vol.21 , pp. 59-64
- Tsai, L.-H.¹

11
- 0000080996
- A polynomial-time approximation scheme for maximizing the minimum machine completion time
- Woeginger GJ (1997) A polynomial-time approximation scheme for maximizing the minimum machine completion time. Oper Res Lett 20: 149-154.
- (1997) Oper Res Lett , vol.20 , pp. 149-154
- Woeginger, G.J.¹

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