메뉴 건너뛰기




Volumn 93, Issue 1, 1996, Pages 61-67

A simulated annealing approach for the one-machine mean tardiness scheduling problem

Author keywords

Heuristics; Mean tardiness; Simulated annealing; Single machine scheduling

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; HEURISTIC METHODS; MACHINERY; PRODUCTION; SIMULATED ANNEALING;

EID: 0030214652     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/0377-2217(95)00149-2     Document Type: Article
Times cited : (34)

References (12)
  • 3
    • 0000474126 scopus 로고
    • Minimizing total tardiness on one machine is NP-hard
    • Du, J., and Leung, J.Y.T., "Minimizing total tardiness on one machine is NP-hard", Mathematics of Operations Research 15 (1990) 483-495.
    • (1990) Mathematics of Operations Research , vol.15 , pp. 483-495
    • Du, J.1    Leung, J.Y.T.2
  • 4
    • 0014535952 scopus 로고
    • One machine sequencing to minimize certain functions of job tardiness
    • Emmons, H., "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
  • 5
    • 0017240964 scopus 로고
    • A dual algorithm for the one-machine scheduling problem
    • Fisher, M.I., "A dual algorithm for the one-machine scheduling problem", Mathematical Programming 11 (1976) 229-251.
    • (1976) Mathematical Programming , vol.11 , pp. 229-251
    • Fisher, M.I.1
  • 8
    • 0026626727 scopus 로고
    • A heuristic algorithm for sequencing on one machine to minimize total tardiness
    • Holsenback, J.E., and Russel, R.M., "A heuristic algorithm for sequencing on one machine to minimize total tardiness", Journal of the Operational Research Society 43 (1992) 53-62.
    • (1992) Journal of the Operational Research Society , vol.43 , pp. 53-62
    • Holsenback, J.E.1    Russel, R.M.2
  • 9
    • 26444479778 scopus 로고
    • Optimization by simulated annealing
    • Kirkpatrick, S., Gelatt, C., and Vecchi, M., "Optimization by Simulated Annealing", Science 20/4598 (1983) 671-680.
    • (1983) Science , vol.20 , Issue.4598 , pp. 671-680
    • Kirkpatrick, S.1    Gelatt, C.2    Vecchi, M.3
  • 10
    • 0020205577 scopus 로고
    • A decomposition algorithm for the single machine total tardiness problem
    • Potts, C.N., and Van Wassenhove, L.N., "A decomposition algorithm for the single machine total tardiness problem", Operations Research Letters 32 (1982) 177-181.
    • (1982) Operations Research Letters , vol.32 , pp. 177-181
    • Potts, C.N.1    Van Wassenhove, L.N.2
  • 11
    • 84912978525 scopus 로고
    • Single machine tardiness sequencing heuristics
    • Potts, C.N., and Van Wassenhove, L.N., "Single machine tardiness sequencing heuristics", IIE Transactions 23/4 (1991) 346-354.
    • (1991) IIE Transactions , vol.23 , Issue.4 , pp. 346-354
    • Potts, C.N.1    Van Wassenhove, L.N.2
  • 12
    • 0015128399 scopus 로고
    • An improved algorithm for scheduling independent tasks
    • Wilkerson, J., and Irwin, J.D., "An improved algorithm for scheduling independent tasks", AIIE Transactions 3 (1971) 239-245.
    • (1971) AIIE Transactions , vol.3 , pp. 239-245
    • Wilkerson, J.1    Irwin, J.D.2


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