메뉴 건너뛰기
Naval Research Logistics
Volumn 47, Issue 7, 2000, Pages 593-601
Linear Compound Algorithms for the Partitioning Problem
Author keywords

Analysis of algorithms; Kernel; Machine release time; Multiprocessor scheduling; Partition; Worst case analysis
Indexed keywords

EID: 0344361506     PISSN: 0894069X     EISSN: None     Source Type: Journal    
DOI: 10.1002/1520-6750(200010)47:7<593::AID-NAV4>3.0.CO;2-H     Document Type: Article
Times cited : (13)
References (11)
  • 1
    • 0001923235 scopus 로고
    • An application of bin-packing to multiprocessor scheduling
    • E.G. Coffman, Jr., M.R. Garey, and D.S. Johnson, An application of bin-packing to multiprocessor scheduling, SIAM J Comput 7 (1978), 1-17.
    • (1978) SIAM J Comput , vol.7 , pp. 1-17
    • Coffman E.G., Jr.1    Garey, M.R.2    Johnson, D.S.3
  • 2
    • 0010056559 scopus 로고
    • Analysis of a compound bin packing algorithm
    • D.K. Friesen and M.A. Langston, Analysis of a compound bin packing algorithm, SIAM J Discrete Math 4 (1991), 61-79.
    • (1991) SIAM J Discrete Math , vol.4 , pp. 61-79
    • Friesen, D.K.1    Langston, M.A.2
  • 4
    • 0014477093 scopus 로고
    • Bounds on multiprocessing timing anomalies
    • R.L. Graham, Bounds on multiprocessing timing anomalies, SIAM J Appl Math 17 (1969), 263-269.
    • (1969) SIAM J Appl Math , vol.17 , pp. 263-269
    • Graham, R.L.1
  • 5
    • 0023170393 scopus 로고
    • Using dual approximation algorithms for scheduling problems: Theoretical and practical results
    • D.S. Hochbaum and D. Shmoys, Using dual approximation algorithms for scheduling problems: Theoretical and practical results. J ACM 34 (1987), 144-162.
    • (1987) J ACM , vol.34 , pp. 144-162
    • Hochbaum, D.S.1    Shmoys, D.2
  • 6
    • 0347302989 scopus 로고
    • Joint performance of greedy heuristics for the integer knapsack problem
    • R. Kohli and R. Krishnamurti, Joint performance of greedy heuristics for the integer knapsack problem, Discrete Appl Math 56 (1995), 37-48.
    • (1995) Discrete Appl Math , vol.56 , pp. 37-48
    • Kohli, R.1    Krishnamurti, R.2
  • 7
    • 0011332361 scopus 로고
    • Evaluation of gradient algorithms for knapsack and travelling salesman problems
    • University of Waterloo
    • M.M. Kovalev and V.M. Kotov, Evaluation of gradient algorithms for knapsack and travelling salesman problems, Report CORR 91-04, University of Waterloo, 1991.
    • (1991) Report CORR 91-04
    • Kovalev, M.M.1    Kotov, V.M.2
  • 8
    • 38249000375 scopus 로고
    • Worst-case analysis of greedy algorithms for the unbounded knapsack, subset-sum and partition problems
    • T.-C. Lai, Worst-case analysis of greedy algorithms for the unbounded knapsack, subset-sum and partition problems, Oper Res Lett 14 (1993), 215-220.
    • (1993) Oper Res Lett , vol.14 , pp. 215-220
    • Lai, T.-C.1
  • 9
    • 0001880962 scopus 로고
    • Parallel machine scheduling with nonsimultaneous machine available time
    • C.Y. Lee, Parallel machine scheduling with nonsimultaneous machine available time, Discrete Appl Math 30 (1991), 53-61.
    • (1991) Discrete Appl Math , vol.30 , pp. 53-61
    • Lee, C.Y.1
  • 10
    • 0024051185 scopus 로고
    • Multiprocessor scheduling: Combining LPT and Multifit
    • C.Y. Lee and J.D. Massey, Multiprocessor scheduling: Combining LPT and Multifit, Discrete Appl Math 20 (1988), 233-242.
    • (1988) Discrete Appl Math , vol.20 , pp. 233-242
    • Lee, C.Y.1    Massey, J.D.2
  • 11
    • 0016883405 scopus 로고
    • Algorithms for scheduling independent tasks
    • S. Sahni, Algorithms for scheduling independent tasks, J Assoc Comput Mach 23 (1976), 116-127.
    • (1976) J Assoc Comput Mach , vol.23 , pp. 116-127
    • Sahni, S.1

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