메뉴 건너뛰기




Volumn 39, Issue 6, 2011, Pages 423-427

An improved monotone algorithm for scheduling related machines with precedence constraints

Author keywords

Algorithmic mechanism design; Monotone algorithms; Precedence constraints; Scheduling

Indexed keywords

ALGORITHMIC MECHANISM DESIGN; MONOTONE ALGORITHMS; PRECEDENCE CONSTRAINTS; SCHEDULING RELATED MACHINES;

EID: 80855137982     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.orl.2011.07.009     Document Type: Article
Times cited : (1)

References (8)
  • 2
    • 0013027033 scopus 로고    scopus 로고
    • An efficient approximation algorithm for minimizing makespan on uniformly related machines
    • Preliminary version appeared in IPCO'98
    • C. Chekuri, and M. Bender An efficient approximation algorithm for minimizing makespan on uniformly related machines J. Algorithms 41 2 2001 212 224 Preliminary version appeared in IPCO'98
    • (2001) J. Algorithms , vol.41 , Issue.2 , pp. 212-224
    • Chekuri, C.1    Bender, M.2
  • 3
    • 0000869985 scopus 로고    scopus 로고
    • Approximation algorithms for precedence-constrained scheduling problems on parallel machines that run at different speeds
    • Preliminary version appeared in SODA'97
    • F.A. Chudak, and D.B. Shmoys Approximation algorithms for precedence-constrained scheduling problems on parallel machines that run at different speeds J. Algorithms 30 2 1999 323 343 Preliminary version appeared in SODA'97
    • (1999) J. Algorithms , vol.30 , Issue.2 , pp. 323-343
    • Chudak, F.A.1    Shmoys, D.B.2
  • 4
    • 74849101820 scopus 로고
    • Optimization and approximation in deterministic sequencing and scheduling: A survey
    • Discrete optimization (Proc. Adv. Res. Inst. Discrete Optimization and Systems Appl., Banff, Alta., 1977), II
    • R.L. Graham, E.L. Lawler, J.K. Lenstra, and A.H.G. Rinnooy Kan Optimization and approximation in deterministic sequencing and scheduling: a survey Ann. Discrete Math. 5 1979 287 326 Discrete optimization (Proc. Adv. Res. Inst. Discrete Optimization and Systems Appl., Banff, Alta., 1977), II
    • (1979) Ann. Discrete Math. , vol.5 , pp. 287-326
    • Graham, R.L.1    Lawler, E.L.2    Lenstra, J.K.3    Rinnooy Kan, A.H.G.4
  • 5
    • 84976775580 scopus 로고
    • Efficient scheduling of tasks without full use of processor resources
    • J.M. Jaffe Efficient scheduling of tasks without full use of processor resources Theoret. Comput. Sci. 12 1 1980 1 17
    • (1980) Theoret. Comput. Sci. , vol.12 , Issue.1 , pp. 1-17
    • Jaffe, J.M.1
  • 6
    • 39149121208 scopus 로고    scopus 로고
    • A monotone approximation algorithm for scheduling with precedence constraints
    • S.O. Krumke, A. Schwahn, R. van Stee, and S. Westphal A monotone approximation algorithm for scheduling with precedence constraints Oper. Res. Lett. 36 2 2008 247 249
    • (2008) Oper. Res. Lett. , vol.36 , Issue.2 , pp. 247-249
    • Krumke, S.O.1    Schwahn, A.2    Van Stee, R.3    Westphal, S.4
  • 7
    • 0000085874 scopus 로고
    • Scheduling parallel machines on-line
    • Preliminary version appeared in FOCS'91
    • D.B. Shmoys, J. Wein, and D.P. Williamson Scheduling parallel machines on-line SIAM J. Comput. 24 6 1995 1313 1331 Preliminary version appeared in FOCS'91
    • (1995) SIAM J. Comput. , vol.24 , Issue.6 , pp. 1313-1331
    • Shmoys, D.B.1    Wein, J.2    Williamson, D.P.3


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