메뉴 건너뛰기




Volumn 70, Issue , 1997, Pages 241-260

Sequencing jobs with random processing times to minimize weighted completion time variance

Author keywords

Dynamic programming; Np completeness; Scheduling sequencing; Stochastic programming; Variance minimization

Indexed keywords


EID: 0031505653     PISSN: 02545330     EISSN: 15729338     Source Type: Journal    
DOI: 10.1023/a:1018926305578     Document Type: Article
Times cited : (6)

References (24)
  • 1
    • 0025211593 scopus 로고
    • Sequencing with earliness and tardiness penalties: A review
    • K.R. Baker and G.D. Scudder, Sequencing with earliness and tardiness penalties: A review, Operations Research 38(1990)22-36.
    • (1990) Operations Research , vol.38 , pp. 22-36
    • Baker, K.R.1    Scudder, G.D.2
  • 2
    • 0029378209 scopus 로고
    • Minimization of agreeably weighted variance in single machine systems
    • X. Cai, Minimization of agreeably weighted variance in single machine systems, European Journal of Operational Research 85(1995)576-592.
    • (1995) European Journal of Operational Research , vol.85 , pp. 576-592
    • Cai, X.1
  • 3
    • 0012540784 scopus 로고    scopus 로고
    • V-Shape property for job sequences that minimize the expected completion time variance
    • X. Cai, V-Shape property for job sequences that minimize the expected completion time variance, European Journal of Operational Research 91(1996)118-123.
    • (1996) European Journal of Operational Research , vol.91 , pp. 118-123
    • Cai, X.1
  • 4
    • 0024303531 scopus 로고
    • Survey of scheduling research involving due date determination decisions
    • T.C.E. Cheng and M. Gupta, Survey of scheduling research involving due date determination decisions, European Journal of Operational Research 38(1989)156-166.
    • (1989) European Journal of Operational Research , vol.38 , pp. 156-166
    • Cheng, T.C.E.1    Gupta, M.2
  • 5
    • 0001254311 scopus 로고
    • On the minimization of completion time variance with a bicriteria extension
    • P. De, J.B. Ghosh and C.E. Wells, On the minimization of completion time variance with a bicriteria extension, Operations Research 40(1992)1148-1155.
    • (1992) Operations Research , vol.40 , pp. 1148-1155
    • De, P.1    Ghosh, J.B.2    Wells, C.E.3
  • 6
    • 0017460225 scopus 로고
    • Minimizing waiting time variance in the single machine problem
    • S. Eilon and I.G. Chowdhury, Minimizing waiting time variance in the single machine problem, Management Science 23(1977)567-575.
    • (1977) Management Science , vol.23 , pp. 567-575
    • Eilon, S.1    Chowdhury, I.G.2
  • 7
  • 8
    • 0027906589 scopus 로고
    • Minimizing flow time variance in a single machine system using genetic algorithms
    • M.C. Gupta, Y.P. Gupta and A. Kumar, Minimizing flow time variance in a single machine system using genetic algorithms, European Journal of Operational Research 70(1993)289-303.
    • (1993) European Journal of Operational Research , vol.70 , pp. 289-303
    • Gupta, M.C.1    Gupta, Y.P.2    Kumar, A.3
  • 9
    • 0001406380 scopus 로고
    • Proof of the conjecture of Schrage about the completion time variance problem
    • N. Hall and W. Kubiak, Proof of the conjecture of Schrage about the completion time variance problem, OperationsResearch Letters 10(1991)467-473.
    • (1991) OperationsResearch Letters , vol.10 , pp. 467-473
    • Hall, N.1    Kubiak, W.2
  • 10
    • 0026223840 scopus 로고
    • Earliness-tardiness scheduling problems, I: Weighted deviation of completion times about a common due date
    • N. Hall and M.E. Posner, Earliness-tardiness scheduling problems, I: Weighted deviation of completion times about a common due date, Operations Research 39(1991)836-846.
    • (1991) Operations Research , vol.39 , pp. 836-846
    • Hall, N.1    Posner, M.E.2
  • 11
    • 0026223827 scopus 로고
    • Earliness-tardiness scheduling problems, II: Deviation of completion times about a restrictive common due date
    • N. Hall, W. Kubiak and S.P. Sethi, Earliness-tardiness scheduling problems, II: Deviation of completion times about a restrictive common due date, Operations Research 39(1991)847-856.
    • (1991) Operations Research , vol.39 , pp. 847-856
    • Hall, N.1    Kubiak, W.2    Sethi, S.P.3
  • 13
    • 0019704009 scopus 로고
    • Minimizing variation of flow time in single machine systems
    • J.J. Kanet, Minimizing variation of flow time in single machine systems, Management Science 27(1981)1453-1459.
    • (1981) Management Science , vol.27 , pp. 1453-1459
    • Kanet, J.J.1
  • 14
    • 0017910613 scopus 로고
    • A solvable case of the one-machine scheduling problem with ready and due times
    • H. Kise, T. Ibaraki and H. Mine, A solvable case of the one-machine scheduling problem with ready and due times, Operations Research 26(1978)121-126.
    • (1978) Operations Research , vol.26 , pp. 121-126
    • Kise, H.1    Ibaraki, T.2    Mine, H.3
  • 15
    • 0027644930 scopus 로고
    • Completion time variance on a single machine is difficult
    • W. Kubiak, Completion time variance on a single machine is difficult, Operations Research Letters 12(1993)49-59.
    • (1993) Operations Research Letters , vol.12 , pp. 49-59
    • Kubiak, W.1
  • 16
    • 0016955936 scopus 로고
    • Sequencing to minimize the weighted number of tardy jobs
    • E.L. Lawler, Sequencing to minimize the weighted number of tardy jobs, Rev. Automat. Informat. Rec. Opnl. 10(1976)27-33.
    • (1976) Rev. Automat. Informat. Rec. Opnl. , vol.10 , pp. 27-33
    • Lawler, E.L.1
  • 17
    • 77957077792 scopus 로고
    • A pseudopolynomial algorithm for sequencing jobs to minimize total tardiness
    • E.L. Lawler, A pseudopolynomial algorithm for sequencing jobs to minimize total tardiness, Annals of Discrete Mathematics 1(1977)331-342.
    • (1977) Annals of Discrete Mathematics , vol.1 , pp. 331-342
    • Lawler, E.L.1
  • 18
    • 0025897854 scopus 로고
    • Minimizing weighted number of tardy jobs and weighted earliness-tardiness penalties about a common due date
    • C.-Y. Lee, S.L. Danusaputro and C.-S. Lin, Minimizing weighted number of tardy jobs and weighted earliness-tardiness penalties about a common due date, Computers and Operations Research 18(1991)379-389.
    • (1991) Computers and Operations Research , vol.18 , pp. 379-389
    • Lee, C.-Y.1    Danusaputro, S.L.2    Lin, C.-S.3
  • 19
    • 0001127702 scopus 로고
    • Variance minimization in single machine sequencing problems
    • A.G. Merten and M.E. Muller, Variance minimization in single machine sequencing problems, Management Science 18(1972)518-528.
    • (1972) Management Science , vol.18 , pp. 518-528
    • Merten, A.G.1    Muller, M.E.2
  • 20
    • 0001002199 scopus 로고
    • Stochastic single machine scheduling with quadratic early-tardy penalties
    • J. Mittenthal and M. Raghavachari, Stochastic single machine scheduling with quadratic early-tardy penalties, Operations Research 41(1993)786-796.
    • (1993) Operations Research , vol.41 , pp. 786-796
    • Mittenthal, J.1    Raghavachari, M.2
  • 21
    • 0020748381 scopus 로고
    • Stochastic scheduling with release dates and due dates
    • M. Pinedo, Stochastic scheduling with release dates and due dates, Operations Research 31(1983) 559-572.
    • (1983) Operations Research , vol.31 , pp. 559-572
    • Pinedo, M.1
  • 22
    • 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 Science 21 (1975)540-543.
    • (1975) Management Science , vol.21 , pp. 540-543
    • Schrage, L.1
  • 23
    • 0023170104 scopus 로고
    • Deterministic and random single machine sequencing with variance minimization
    • V. Vani and M. Raghavachari, Deterministic and random single machine sequencing with variance minimization, Operations Research 35(1987)111-120.
    • (1987) Operations Research , vol.35 , pp. 111-120
    • Vani, V.1    Raghavachari, M.2
  • 24
    • 0043157883 scopus 로고    scopus 로고
    • Variance minimization - Relationship between completion time variance and waiting time variance
    • S. Zhou and X. Cai, Variance minimization - relationship between completion time variance and waiting time variance, Journal of Australian Mathematical Society, Series B 38(1996)126-139.
    • (1996) Journal of Australian Mathematical Society, Series B , vol.38 , pp. 126-139
    • Zhou, S.1    Cai, X.2


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