메뉴 건너뛰기




Volumn 35, Issue 5, 2003, Pages 479-486

A problem space algorithm for single machine weighted tardiness problems

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; GENETIC ALGORITHMS; GLOBAL OPTIMIZATION; JOB ANALYSIS; PROBLEM SOLVING; SCHEDULING; TIME AND MOTION STUDY;

EID: 0037694027     PISSN: 0740817X     EISSN: None     Source Type: Journal    
DOI: 10.1080/07408170304390     Document Type: Article
Times cited : (28)

References (10)
  • 1
    • 0032045130 scopus 로고    scopus 로고
    • A new lower bounding scheme for the total weighted tardiness problem
    • Akturk, M.S. and Yildirim, M.B. (1998) A new lower bounding scheme for the total weighted tardiness problem. Computers and Operations Research, 25(4), 265-278.
    • (1998) Computers and Operations Research , vol.25 , Issue.4 , pp. 265-278
    • Akturk, M.S.1    Yildirim, M.B.2
  • 2
    • 0001234583 scopus 로고    scopus 로고
    • Local search heuristics for the single machine total weighted tardiness scheduling
    • Crauwels, H.A.J., Potts, C.N. and Van Wassenhove, L.N. (1998) Local search heuristics for the single machine total weighted tardiness scheduling. INFORMS Journal on Computing, 10(3), 341-350.
    • (1998) INFORMS Journal on Computing , vol.10 , Issue.3 , pp. 341-350
    • Crauwels, H.A.J.1    Potts, C.N.2    Van Wassenhove, L.N.3
  • 3
    • 0014535952 scopus 로고
    • One machine sequencing to minimize certain functions of job tardiness
    • Emmons, H. (1969) One machine sequencing to minimize certain functions of job tardiness. Operations Research, 17, 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
    • Lawler, E.L. (1977) A 'Pseudopolynomial' algorithm for sequencing jobs to minimize total tardiness. Annals of Discrete Mathematics, 1, 331-342.
    • (1977) Annals of Discrete Mathematics , vol.1 , pp. 331-342
    • Lawler, E.L.1
  • 6
    • 0022023671 scopus 로고
    • A branch and bound algorithm for total weighted tardiness problem
    • Potts, C.N. and Van Wassenhove, L.N. (1985) A branch and bound algorithm for total weighted tardiness problem. Operations Research, 33, 363-377.
    • (1985) Operations Research , vol.33 , pp. 363-377
    • Potts, C.N.1    Van Wassenhove, L.N.2
  • 7
    • 84912978525 scopus 로고
    • Single machine tardiness sequencing heuristics
    • Potts, C.N. and Van Wassenhove, L.N. (1991) Single machine tardiness sequencing heuristics. IIE Transactions, 23, 346-354.
    • (1991) IIE Transactions , vol.23 , pp. 346-354
    • Potts, C.N.1    Van Wassenhove, L.N.2
  • 9
    • 0026930899 scopus 로고
    • New search spaces for sequencing problems with application to job shop scheduling
    • Storer, R.H., Wu, S.D. and Vaccari, R. (1992) New search spaces for sequencing problems with application to job shop scheduling. Management Science, 38(10), 1495-1509.
    • (1992) Management Science , vol.38 , Issue.10 , pp. 1495-1509
    • Storer, R.H.1    Wu, S.D.2    Vaccari, R.3
  • 10
    • 0000799803 scopus 로고
    • Local search in problem and heuristic space for job shop scheduling
    • Storer, R.H., Wu, S.D. and Vaccari, R. (1995) Local search in problem and heuristic space for job shop scheduling. ORSA Journal on Computing, 7(4), 453-467.
    • (1995) ORSA Journal on Computing , vol.7 , Issue.4 , pp. 453-467
    • Storer, R.H.1    Wu, S.D.2    Vaccari, R.3


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