메뉴 건너뛰기
Mathematical Methods of Operations Research
Volumn 56, Issue 3, 2003, Pages 407-412
A polynomial algorithm for P | pj = 1, rj, outtree | Σ Cj
Author keywords

Complexity results; Outtree; Parallel machines; Scheduling
Indexed keywords

PARALLEL ALGORITHMS; PROBLEM SOLVING; SCHEDULING;
EID: 0036461508     PISSN: 14322994     EISSN: None     Source Type: Journal    
DOI: 10.1007/s001860200228     Document Type: Article
Times cited : (16)
References (5)
  • 1
    • 0035362830 scopus 로고    scopus 로고
    • On preemption redundancy in scheduling unit processing time jobs on two parallel machines
    • Baptiste P, Timkovsky V (2001) On preemption redundancy in scheduling unit processing time jobs on two parallel machines. Operations Research Letters 28:205-212
    • (2001) Operations Research Letters , vol.28 , pp. 205-212
    • Baptiste, P.1    Timkovsky, V.2
  • 3
    • 0026170095 scopus 로고
    • Scheduling chain-structured tasks to minimize make-span and mean flow time
    • Du J, Leung JY-T, Young GH (1991) Scheduling chain-structured tasks to minimize make-span and mean flow time. Information and Computation 92:219-236
    • (1991) Information and Computation , vol.92 , pp. 219-236
    • Du, J.1    Leung, J.Y.-T.2    Young, G.H.3
  • 4
    • 0001430010 scopus 로고
    • Parallel sequencing and assembly line problems
    • Hu TC (1961) Parallel sequencing and assembly line problems. Operations Research 9:841-848
    • (1961) Operations Research , vol.9 , pp. 841-848
    • Hu, T.C.1
  • 5
    • 0002643827 scopus 로고
    • Scheduling with deadlines and loss functions
    • McNaughton R (1959) Scheduling with deadlines and loss functions. Management Science 6:1-12
    • (1959) Management Science , vol.6 , pp. 1-12
    • McNaughton, R.1

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