메뉴 건너뛰기




Volumn 11, Issue 5-6, 2004, Pages 741-750

Machine scheduling problems with a learning effect

Author keywords

Flow shop; Learning; Parallel machines; Scheduling; Single machine

Indexed keywords


EID: 4544370515     PISSN: 12013390     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Conference Paper
Times cited : (27)

References (10)
  • 1
    • 0345201636 scopus 로고    scopus 로고
    • Single-machine scheduling with learning considerations
    • D. Biskup, Single-machine scheduling with learning considerations. European Journal of Operational Research 115(1999) 173-178.
    • (1999) European Journal of Operational Research , vol.115 , pp. 173-178
    • Biskup, D.1
  • 3
  • 4
    • 0032637355 scopus 로고    scopus 로고
    • Scheduling identical jobs with chain precedence constraints on two uniform machines
    • P. Brucker, J. Hurink, W. Kubiak, Scheduling identical jobs with chain precedence constraints on two uniform machines. Mathematical Methods of Operations Research 49(1999) 211-219.
    • (1999) Mathematical Methods of Operations Research , vol.49 , pp. 211-219
    • Brucker, P.1    Hurink, J.2    Kubiak, W.3
  • 5
    • 0021301027 scopus 로고
    • Openshop and flowshop scheduling to minimize sum of completion times
    • I. Adiri, N. Amit, Openshop and flowshop scheduling to minimize sum of completion times, Computers & Operations Research 11(1984) 275-284.
    • (1984) Computers & Operations Research , vol.11 , pp. 275-284
    • Adiri, I.1    Amit, N.2
  • 7
    • 0033311145 scopus 로고    scopus 로고
    • Minimizing total completion time in a two-machine flowshop: Analysis of special cases
    • J.A. Hoogeveen, T. Kawaguchi, Minimizing total completion time in a two-machine flowshop: analysis of special cases. Mathematics of Operations Research 24(4) (1999) 887-910.
    • (1999) Mathematics of Operations Research , vol.24 , Issue.4 , pp. 887-910
    • Hoogeveen, J.A.1    Kawaguchi, T.2


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