메뉴 건너뛰기




Volumn 7, Issue 4, 2004, Pages 261-276

A weighted modified due date rule for sequencing to minimize weighted tardiness

Author keywords

Priority rules; Scheduling; Single machine; Weighted tardiness

Indexed keywords

COMPUTATIONAL METHODS; MACHINERY; POLYNOMIALS; PROBLEM SOLVING; SEMICONDUCTOR MATERIALS; STRUCTURAL DESIGN;

EID: 3042836706     PISSN: 10946136     EISSN: None     Source Type: Journal    
DOI: 10.1023/B:JOSH.0000031421.64487.95     Document Type: Article
Times cited : (68)

References (30)
  • 1
    • 0000315146 scopus 로고
    • A Survey of algorithms for the single machine total weighted tardiness scheduling problem
    • Abdul-Razaq, T. S., C. N. Potts, and L. N. van Wassenhove, "A Survey of algorithms for the single machine total weighted tardiness scheduling problem," Discrete Appl. Math., 26, 235-253 (1990).
    • (1990) Discrete Appl. Math. , vol.26 , pp. 235-253
    • Abdul-Razaq, T.S.1    Potts, C.N.2    Van Wassenhove, L.N.3
  • 3
    • 0032045130 scopus 로고    scopus 로고
    • A new lower bounding scheme for the total weighted tardiness problem
    • Akturk, M. S. and M. B. Yildirim, "A new lower bounding scheme for the total weighted tardiness problem," Comput. Oper. Res., 25(4), 265-278 (1998).
    • (1998) Comput. Oper. Res. , vol.25 , Issue.4 , pp. 265-278
    • Akturk, M.S.1    Yildirim, M.B.2
  • 4
    • 0002349523 scopus 로고
    • Weighted-tardiness scheduling on parallel machines with proportional weights
    • Arkin, E. M. and R. O. Roundy, "Weighted-tardiness scheduling on parallel machines with proportional weights," Oper. Res., 39(1), 64-81 (1991).
    • (1991) Oper. Res. , vol.39 , Issue.1 , pp. 64-81
    • Arkin, E.M.1    Roundy, R.O.2
  • 5
    • 0021496929 scopus 로고
    • Sequencing rules and due date assignments in a job shop
    • Baker, K.R., "Sequencing rules and due date assignments in a job shop," Manage. Sci., 30, 1093-1104 (1984).
    • (1984) Manage. Sci. , vol.30 , pp. 1093-1104
    • Baker, K.R.1
  • 6
    • 0002009274 scopus 로고
    • A dynamic priority rule for scheduling against due-dates
    • Baker, K. R. and J. W. M. Bertrand, "A dynamic priority rule for scheduling against due-dates," J. Oper. Manage. 3(1), 37-42 (1983).
    • (1983) J. Oper. Manage. , vol.3 , Issue.1 , pp. 37-42
    • Baker, K.R.1    Bertrand, J.W.M.2
  • 7
    • 0002563758 scopus 로고
    • Job shop scheduling with modified due dates
    • Baker, K. R. and J. J. Kanet, "Job shop scheduling with modified due dates," J. Oper. Manage. 4(1), 11-22 (1983).
    • (1983) J. Oper. Manage. , vol.4 , Issue.1 , pp. 11-22
    • Baker, K.R.1    Kanet, J.J.2
  • 8
    • 0021520852 scopus 로고
    • Improved decision rules in a combined system for minimizing job tardiness
    • Baker, K. R. and J. J. Kanet, "Improved decision rules in a combined system for minimizing job tardiness," Int. J. Prod. Res., 22(6), 917-922 (1984).
    • (1984) Int. J. Prod. Res. , vol.22 , Issue.6 , pp. 917-922
    • Baker, K.R.1    Kanet, J.J.2
  • 9
    • 0003347011 scopus 로고
    • Dispatching
    • G. Salvendy (ed.), John Wiley & Sons, New York
    • Bhaskaran, K. and M. Pinedo, "Dispatching," in G. Salvendy (ed.), Handbook of Industrial Engineering, John Wiley & Sons, New York, 1992, pp. 2184-2198.
    • (1992) Handbook of Industrial Engineering , pp. 2184-2198
    • Bhaskaran, K.1    Pinedo, M.2
  • 12
    • 0000474126 scopus 로고
    • Minimizing total tardiness on one machine is NP-hard
    • Du, J. and J. Y. T. Leung, "Minimizing total tardiness on one machine is NP-hard," Math. Oper. Res., 15(3), 483-495 (1990).
    • (1990) Math. Oper. Res. , vol.15 , Issue.3 , pp. 483-495
    • Du, J.1    Leung, J.Y.T.2
  • 13
    • 0000130569 scopus 로고
    • Multiple range and multiple F-tests
    • Duncan, D. B., "Multiple range and multiple F-tests," Biometrics, 11, 1-42 (1955).
    • (1955) Biometrics , vol.11 , pp. 1-42
    • Duncan, D.B.1
  • 14
    • 0031222081 scopus 로고    scopus 로고
    • A performance comparison of heuristics for the total weighted tardiness problem
    • Huegler, P. A. and F. J. Vasko, "A performance comparison of heuristics for the total weighted tardiness problem," Comput. Ind. Eng., 32(4), 753-767 (1997).
    • (1997) Comput. Ind. Eng. , vol.32 , Issue.4 , pp. 753-767
    • Huegler, P.A.1    Vasko, F.J.2
  • 15
    • 0012298197 scopus 로고
    • Priority dispatching with operation due dates in a job shop
    • Kanet, J. J. and J. C. Hayya, "Priority dispatching with operation due dates in a job shop" J. Oper. Manage., 2(4), 167-176 (1982).
    • (1982) J. Oper. Manage. , vol.2 , Issue.4 , pp. 167-176
    • Kanet, J.J.1    Hayya, J.C.2
  • 17
    • 84987049348 scopus 로고
    • A decision theory approach to priority dispatching for job shop scheduling
    • Kanet, J. J. and Z. Zhou, "A decision theory approach to priority dispatching for job shop scheduling," Prod. Oper. Manage., 2(1), 2-14 (1993).
    • (1993) Prod. Oper. Manage. , vol.2 , Issue.1 , pp. 2-14
    • Kanet, J.J.1    Zhou, Z.2
  • 18
    • 0028550668 scopus 로고
    • The total tardiness scheduling problem: Review and extensions
    • Koulamas, C. P., "The total tardiness scheduling problem: Review and extensions," Oper. Res., 42, 1025-1041 (1994).
    • (1994) Oper. Res. , vol.42 , pp. 1025-1041
    • Koulamas, C.P.1
  • 19
    • 77957077792 scopus 로고
    • A 'Pseudopolynomial' algorithm for sequencing jobs to minimize total tardiness
    • Lawler, E., "A 'Pseudopolynomial' algorithm for sequencing jobs to minimize total tardiness," Ann. Discrete Math., 1, 331-342 (1977).
    • (1977) Ann. Discrete Math. , vol.1 , pp. 331-342
    • Lawler, E.1
  • 20
    • 0030735290 scopus 로고    scopus 로고
    • A heuristic to minimize the total weighted tardiness with sequence-dependent setups
    • Lee, Y. H., K. Bhaskaran, and M. Pinedo, "A heuristic to minimize the total weighted tardiness with sequence-dependent setups," IIE Trans., 29, 45-52 (1997).
    • (1997) IIE Trans. , vol.29 , pp. 45-52
    • Lee, Y.H.1    Bhaskaran, K.2    Pinedo, M.3
  • 21
    • 0042622980 scopus 로고    scopus 로고
    • A modified shifting bottleneck heuristic for minimizing total weighted tardiness in complex job shops
    • Mason, S. J., J.W Fowler, and W. M. Carlyle, "A modified shifting bottleneck heuristic for minimizing total weighted tardiness in complex job shops," J. Scheduling, 5(3), 247-262 (2002).
    • (2002) J. Scheduling , vol.5 , Issue.3 , pp. 247-262
    • Mason, S.J.1    Fowler, J.W.2    Carlyle, W.M.3
  • 23
    • 0342575445 scopus 로고
    • Scheduling
    • G.Salvendy (ed.), John Wiley & Sons, New York
    • Pinedo, M., "Scheduling," in G.Salvendy (ed.), Handbook of Industrial Engineering, John Wiley & Sons, New York, 1992, pp. 2131-2153.
    • (1992) Handbook of Industrial Engineering , pp. 2131-2153
    • Pinedo, M.1
  • 24
    • 0022023671 scopus 로고
    • A branch and bound algorithm for the total weighted tardiness problem
    • Potts, C.N. and L. N. Van Wassenhove, "A branch and bound algorithm for the total weighted tardiness problem," Oper. Res., 33, 363-377 (1985).
    • (1985) Oper. Res. , vol.33 , pp. 363-377
    • Potts, C.N.1    Van Wassenhove, L.N.2
  • 25
    • 0023341921 scopus 로고
    • A note on the weighted tardiness problem
    • Rachamadugu, R. V., "A note on the weighted tardiness problem," Oper. Res. 35(3), 450-452 (1987).
    • (1987) Oper. Res. , vol.35 , Issue.3 , pp. 450-452
    • Rachamadugu, R.V.1
  • 26
    • 0024664313 scopus 로고
    • Real time scheduling of an automated manufacturing center
    • Raman, N., R. V. Rachamadugu, and F. B. Talbot, "Real time scheduling of an automated manufacturing center," Eur. J. Oper. Res., 40, 222-242 (1989).
    • (1989) Eur. J. Oper. Res. , vol.40 , pp. 222-242
    • Raman, N.1    Rachamadugu, R.V.2    Talbot, F.B.3
  • 27
    • 0002066821 scopus 로고
    • Various optimizers for single-stage production
    • Smith, W. E., "Various optimizers for single-stage production," Naval Res. Res. Logistics Quar., 3, 59-66 (1956).
    • (1956) Naval Res. Res. Logistics Quar. , vol.3 , pp. 59-66
    • Smith, W.E.1
  • 28
    • 0027592752 scopus 로고
    • Weighted tardiness single machine scheduling with proportional weights
    • Szwarc, W. and J. J. Liu, "Weighted tardiness single machine scheduling with proportional weights" Manage. Sci., 39(5), 626-632 (1993).
    • (1993) Manage. Sci. , vol.39 , Issue.5 , pp. 626-632
    • Szwarc, W.1    Liu, J.J.2
  • 29
    • 0023399009 scopus 로고
    • Priority rules for job shops with weighted tardiness costs
    • Vepsalainen, A. P. and T. E. Morton, "Priority rules for job shops with weighted tardiness costs," Manage. Sci., 33(3), 1035-1047 (1987).
    • (1987) Manage. Sci. , vol.33 , Issue.3 , pp. 1035-1047
    • Vepsalainen, A.P.1    Morton, T.E.2
  • 30
    • 0032770980 scopus 로고    scopus 로고
    • Improved heuristics for the n-job single-machine weighted tardiness problem
    • Volgenant, A. and E. Teerhuis, "Improved heuristics for the n-job single-machine weighted tardiness problem," Comput. Oper. Res., 26(1) 35-44 (1999).
    • (1999) Comput. Oper. Res. , vol.26 , Issue.1 , pp. 35-44
    • Volgenant, A.1    Teerhuis, E.2


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