메뉴 건너뛰기
European Journal of Operational Research
Volumn 202, Issue 3, 2010, Pages 669-674
Scheduling three chains on two parallel machines
Author keywords

Approximation; Computational complexity; Parallel machines; Scheduling
Indexed keywords

APPROXIMATION; FULLY POLYNOMIAL TIME APPROXIMATION SCHEMES; IDENTICAL MACHINES; MAKESPAN; NP-HARD; PARALLEL MACHINE; PARALLEL MACHINES; PRECEDENCE CONSTRAINTS; STRONGLY NP-HARD; TIME ALGORITHMS;
EID: 70350564191     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2009.07.001     Document Type: Article
Times cited : (12)
References (8)
  • 1
    • 0026170095 scopus 로고
    • Scheduling chain-structured tasks to minimize makespan and mean flow time
    • Du J., Leung J.Y.T., and Young G.H. Scheduling chain-structured tasks to minimize makespan and mean flow time. Information and Computation 92 2 (1991) 219-236
    • (1991) Information and Computation , vol.92 , Issue.2 , pp. 219-236
    • Du, J.1    Leung, J.Y.T.2    Young, G.H.3
  • 3
    • 35048899753 scopus 로고    scopus 로고
    • Approximation algorithms for scheduling jobs with chain precedence constraints
    • Jansen K., and Solis-Oba R. Approximation algorithms for scheduling jobs with chain precedence constraints. Lecture Notes in Computer Science 3019 (2004) 105-112
    • (2004) Lecture Notes in Computer Science , vol.3019 , pp. 105-112
    • Jansen, K.1    Solis-Oba, R.2
  • 4
    • 0031275738 scopus 로고    scopus 로고
    • Heuristics for unrelated machine scheduling with precedence constraints
    • Herrmann J., Proth J.-M., and Sauer N. Heuristics for unrelated machine scheduling with precedence constraints. European Journal of Operational Research 102 3 (1997) 528-537
    • (1997) European Journal of Operational Research , vol.102 , Issue.3 , pp. 528-537
    • Herrmann, J.1    Proth, J.-M.2    Sauer, N.3
  • 5
    • 0016560084 scopus 로고
    • Fast approximation algorithms for the knapsack and sum of subset problems
    • Ibarra O.H., and Kim C. Fast approximation algorithms for the knapsack and sum of subset problems. Journal of ACM 22 (1975) 463-468
    • (1975) Journal of ACM , vol.22 , pp. 463-468
    • Ibarra, O.H.1    Kim, C.2
  • 6
    • 0036392349 scopus 로고    scopus 로고
    • On the complexity of non-preemptive shop scheduling with two jobs
    • Kis T. On the complexity of non-preemptive shop scheduling with two jobs. Computing 69 (2002) 37-49
    • (2002) Computing , vol.69 , pp. 37-49
    • Kis, T.1
  • 7
    • 0017924416 scopus 로고
    • Complexity of scheduling under precedence constraints
    • Lenstra J.K., and Rinnooy Kan A.H.G. Complexity of scheduling under precedence constraints. Operations Research 26 (1978) 22-35
    • (1978) Operations Research , vol.26 , pp. 22-35
    • Lenstra, J.K.1    Rinnooy Kan, A.H.G.2
  • 8
    • 28044469893 scopus 로고    scopus 로고
    • Two machine preemptive scheduling problem with release dates, equal processing times and precedence constraints
    • Lushchakova I. Two machine preemptive scheduling problem with release dates, equal processing times and precedence constraints. European Journal of Operational Research 171 1 (2006) 107-122
    • (2006) European Journal of Operational Research , vol.171 , Issue.1 , pp. 107-122
    • Lushchakova, I.1

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