메뉴 건너뛰기
Discrete Applied Mathematics
Volumn 84, Issue 1-3, 1998, Pages 55-70
Multi-machine scheduling with variance minimization
Author keywords

Completion time variance; Dynamic programming; NP completeness; Scheduling
Indexed keywords

EID: 0010204454     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(98)00020-1     Document Type: Article
Times cited : (13)
References (13)
  • 1
    • 0029378209 scopus 로고
    • Minimization of agreeably weighted variance in single machine systems
    • X. Cai, Minimization of agreeably weighted variance in single machine systems, Eur. J. Oper. Res. 85 (1995) 576-592.
    • (1995) Eur. J. Oper. Res. , vol.85 , pp. 576-592
    • Cai, X.1
  • 2
    • 0001254311 scopus 로고
    • On the minimization of completion time variance with a bi-criteria extension
    • P. De, J.B. Ghosh, C.E. Wells, On the minimization of completion time variance with a bi-criteria extension, Oper. Res. 40 (1992) 1148-1155.
    • (1992) Oper. Res. , vol.40 , pp. 1148-1155
    • De, P.1    Ghosh, J.B.2    Wells, C.E.3
  • 3
    • 0017460225 scopus 로고
    • Minimizing waiting time variance in the single machine problem
    • S. Eilon, I.G. Chowdhury, Minimizing waiting time variance in the single machine problem, Management Sci. 23 (1977) 567-575.
    • (1977) Management Sci. , vol.23 , pp. 567-575
    • Eilon, S.1    Chowdhury, I.G.2
  • 6
    • 0025476901 scopus 로고
    • Minimizing the flow-time variance in single-machine systems
    • M.C. Gupta, Y.P. Gupta, C.R. Bector, Minimizing the flow-time variance in single-machine systems, J. Oper. Res. Soc. 41 (1990) 767-779.
    • (1990) J. Oper. Res. Soc. , vol.41 , pp. 767-779
    • Gupta, M.C.1    Gupta, Y.P.2    Bector, C.R.3
  • 7
    • 0001406380 scopus 로고
    • Proof of the conjecture of Schrage about the completion time variance problem
    • N. Hall, W. Kubiak, Proof of the conjecture of Schrage about the completion time variance problem, Oper. Res. Lett. 10 (1991) 467-473.
    • (1991) Oper. Res. Lett. , vol.10 , pp. 467-473
    • Hall, N.1    Kubiak, W.2
  • 8
    • 0019704009 scopus 로고
    • Minimizing variation of flow time in single machine systems
    • J.J. Kanet, Minimizing variation of flow time in single machine systems, Management Sci. 27 (1981) 1453-1459.
    • (1981) Management Sci. , vol.27 , pp. 1453-1459
    • Kanet, J.J.1
  • 9
    • 0027644930 scopus 로고
    • Completion time variance on a single machine is difficult
    • W. Kubiak, Completion time variance on a single machine is difficult, Oper. Res. Lett. 12 (1993) 49-59.
    • (1993) Oper. Res. Lett. , vol.12 , pp. 49-59
    • Kubiak, W.1
  • 10
    • 0000953023 scopus 로고
    • New results on the completion time variance minimization
    • W. Kubiak, New results on the completion time variance minimization, Discrete Appl. Math. 58 (1995) 157-168.
    • (1995) Discrete Appl. Math. , vol.58 , pp. 157-168
    • Kubiak, W.1
  • 11
    • 0001127702 scopus 로고
    • Variance minimization in single machine sequencing problems
    • A.G. Merten, M.E. Muller, Variance minimization in single machine sequencing problems, Management Sci. 18 (1972) 518-528.
    • (1972) Management Sci. , vol.18 , pp. 518-528
    • Merten, A.G.1    Muller, M.E.2
  • 12
    • 0001459264 scopus 로고
    • Minimizing the time-in-system variance for a finite jobset
    • L. Schrage, Minimizing the time-in-system variance for a finite jobset, Management Sci. 21 (1975) 540-543.
    • (1975) Management Sci. , vol.21 , pp. 540-543
    • Schrage, L.1
  • 13
    • 0023170104 scopus 로고
    • Deterministic and random single machine sequencing with variance minimization
    • V. Vani, M. Raghavachari, Deterministic and random single machine sequencing with variance minimization, Oper. Res. 35 (1987) 111-120.
    • (1987) Oper. Res. , vol.35 , pp. 111-120
    • Vani, V.1    Raghavachari, M.2

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