메뉴 건너뛰기




Volumn 83, Issue , 1998, Pages 271-287

Decomposition in single-machine scheduling

Author keywords

[No Author keywords available]

Indexed keywords


EID: 0032336672     PISSN: 02545330     EISSN: 15729338     Source Type: Journal    
DOI: 10.1023/a:1018916215399     Document Type: Article
Times cited : (11)

References (18)
  • 1
    • 0002349523 scopus 로고
    • Weighted-tardiness scheduling on parallel machines with proportional weights
    • E.M. Arkin and R.O. Roundy, Weighted-tardiness scheduling on parallel machines with proportional weights, Operations Research 39(1991)64-81.
    • (1991) Operations Research , vol.39 , pp. 64-81
    • Arkin, E.M.1    Roundy, R.O.2
  • 3
    • 0014535952 scopus 로고
    • One-machine sequencing to minimize certain functions of job tardiness
    • H. Emmons, One-machine sequencing to minimize certain functions of job tardiness, Operations Research 17(1969)701-715.
    • (1969) Operations Research , vol.17 , pp. 701-715
    • Emmons, H.1
  • 4
    • 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
  • 5
    • 0020205577 scopus 로고
    • A decomposition algorithm for the single machine total tardiness problem
    • C.N. Potts and L.N. Van Wassenhove, A decomposition algorithm for the single machine total tardiness problem, Operations Research Letters 1(1982)177-182.
    • (1982) Operations Research Letters , vol.1 , pp. 177-182
    • Potts, C.N.1    Van Wassenhove, L.N.2
  • 6
    • 0023565502 scopus 로고
    • Dynamic programming and decomposition approaches for the single machine total tardiness problem
    • C.N. Potts and L.N. Van Wassenhove, Dynamic programming and decomposition approaches for the single machine total tardiness problem, European Journal of Operational Research 32(1987) 405-414.
    • (1987) European Journal of Operational Research , vol.32 , pp. 405-414
    • Potts, C.N.1    Van Wassenhove, L.N.2
  • 7
    • 0025227153 scopus 로고
    • Minimizing a generalized quadratic penalty function of job completion times: An improved branch-and-bound approach
    • T. Sen, P. Dileepan and B. Ruparel, Minimizing a generalized quadratic penalty function of job completion times: An improved branch-and-bound approach, Engineering Costs and Production Economics 18(1990)197-202.
    • (1990) Engineering Costs and Production Economics , vol.18 , pp. 197-202
    • Sen, T.1    Dileepan, P.2    Ruparel, B.3
  • 8
    • 0005506580 scopus 로고
    • The single machine problem with a quadratic cost function of completion times
    • W. Szwarc, M.E. Posner and J.J. Liu, The single machine problem with a quadratic cost function of completion times, Management Science 34(1988)1480-1488.
    • (1988) Management Science , vol.34 , pp. 1480-1488
    • Szwarc, W.1    Posner, M.E.2    Liu, J.J.3
  • 9
    • 0025402708 scopus 로고
    • Parametric precedence relations in single machine scheduling
    • W. Szwarc, Parametric precedence relations in single machine scheduling, Operations Research Letters 9(1990)133-140.
    • (1990) Operations Research Letters , vol.9 , pp. 133-140
    • Szwarc, W.1
  • 10
    • 0027592752 scopus 로고
    • Weighted tardiness single machine scheduling with proportional weights
    • W. Szwarc and J.J. Liu, Weighted tardiness single machine scheduling with proportional weights, Management Science 38(1993)626-632.
    • (1993) Management Science , vol.38 , pp. 626-632
    • Szwarc, W.1    Liu, J.J.2
  • 11
    • 0027557236 scopus 로고
    • Adjacent orderings in single-machine scheduling with earliness and tardiness penalties
    • 1993
    • W. Szwarc, Adjacent orderings in single-machine scheduling with earliness and tardiness penalties, Naval Research Logistics 40(1993)229-243 (1993).
    • (1993) Naval Research Logistics , vol.40 , pp. 229-243
    • Szwarc, W.1
  • 13
    • 0029324873 scopus 로고
    • Minimizing a quadratic cost function of waiting times in single-machine scheduling
    • W. Szwarc and S.K. Mukhopadhyay, Minimizing a quadratic cost function of waiting times in single-machine scheduling, Journal of Operational Research Society 46(1995)753-761.
    • (1995) Journal of Operational Research Society , vol.46 , pp. 753-761
    • Szwarc, W.1    Mukhopadhyay, S.K.2
  • 14
    • 84977334714 scopus 로고
    • Optimal timing schedules in earliness-tardiness single machine sequencing
    • W. Szwarc and S.K. Mukhopadhyay, Optimal timing schedules in earliness-tardiness single machine sequencing, Naval Research Logistics 42(1995)1109-1114.
    • (1995) Naval Research Logistics , vol.42 , pp. 1109-1114
    • Szwarc, W.1    Mukhopadhyay, S.K.2
  • 15
    • 0042056287 scopus 로고    scopus 로고
    • Solution of the generalized Townsend single machine scheduling model
    • W. Szwarc and S.K. Mukhopadhyay, Solution of the generalized Townsend single machine scheduling model, European Journal of Operational Research 91(1996)1263-1270.
    • (1996) European Journal of Operational Research , vol.91 , pp. 1263-1270
    • Szwarc, W.1    Mukhopadhyay, S.K.2
  • 16
    • 0009606561 scopus 로고    scopus 로고
    • Earliness and tardiness single machine scheduling with proportional weights
    • special issue on scheduling
    • W. Szwarc and S.K. Mukhopadhyay, Earliness and tardiness single machine scheduling with proportional weights, The Journal of Global Optimization 9(1996)227-236, special issue on scheduling.
    • (1996) The Journal of Global Optimization , vol.9 , pp. 227-236
    • Szwarc, W.1    Mukhopadhyay, S.K.2
  • 17
    • 0000859976 scopus 로고    scopus 로고
    • Decomposition of the single machine total tardiness problem
    • W. Szwarc and S.K. Mukhopadhyay, Decomposition of the single machine total tardiness problem, Operations Research Letters 19(1996)243-250.
    • (1996) Operations Research Letters , vol.19 , pp. 243-250
    • Szwarc, W.1    Mukhopadhyay, S.K.2
  • 18
    • 0017921371 scopus 로고
    • The single machine problem with quadratic penalty function of completion times: A branch-and-bound solution
    • W. Townsend, The single machine problem with quadratic penalty function of completion times: A branch-and-bound solution, Management Science 24(1978)530-534.
    • (1978) Management Science , vol.24 , pp. 530-534
    • Townsend, W.1


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