메뉴 건너뛰기
International Journal of Advanced Manufacturing Technology
Volumn 22, Issue 3-4, 2003, Pages 243-248
An investigation on single machine total weighted tardiness scheduling problems
Author keywords

[No Author keywords available]
Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; FLOWCHARTING; HEURISTIC METHODS; JOB ANALYSIS; RESOURCE ALLOCATION; SCHEDULING;
EID: 0142185298     PISSN: 02683768     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00170-002-1466-0     Document Type: Article
Times cited : (14)
References (8)
  • 1
    • 0030126119 scopus 로고    scopus 로고
    • A computational experiment of covert-AU class of rules for single machine tardiness scheduling problems
    • Alidaee B, Ramakrishnan KR (1996) A computational experiment of covert-AU class of rules for single machine tardiness scheduling problems. Comp Ind Engin J 30(2):201-209
    • (1996) Comp Ind Engin J , vol.30 , Issue.2 , pp. 201-209
    • Alidaee, B.1    Ramakrishnan, K.R.2
  • 2
    • 0004028632 scopus 로고
    • An introduction to sequencing and scheduling
    • Wiley, New York
    • Baker KR (1974) An introduction to sequencing and scheduling. Wiley, New York
    • (1974)
    • Baker, K.R.1
  • 3
    • 0004063929 scopus 로고
    • Computer and job-shop scheduling theory
    • Wiley, New York
    • Coffman JR (1976) Computer and job-shop scheduling theory. Wiley, New York
    • (1976)
    • Coffman, J.R.1
  • 4
    • 0001234583 scopus 로고    scopus 로고
    • Local search heuristics for the single machine total weighted tardiness scheduling problem
    • Crauwels HAJ, Potts CN, van Wassenhove LN (1998) Local search heuristics for the single machine total weighted tardiness scheduling problem. J Comput 10(3):341-350
    • (1998) J Comput , vol.10 , Issue.3 , pp. 341-350
    • Crauwels, H.A.J.1    Potts, C.N.2    Van Wassenhove, L.N.3
  • 5
    • 0035401193 scopus 로고    scopus 로고
    • A memetic algorithm for the total tardiness single machine scheduling problem
    • Franca PM, Mendes A, Moscato P (2001) A memetic algorithm for the total tardiness single machine scheduling problem. Eur J Operat Res 132(1):224-242
    • (2001) Eur J Operat Res , vol.132 , Issue.1 , pp. 224-242
    • Franca, P.M.1    Mendes, A.2    Moscato, P.3
  • 6
    • 0142199685 scopus 로고
    • Single machine scheduling to minimize total weighted late work
    • Hariri AMA, Potts CN, van Wassenhove LN (1995) Single machine scheduling to minimize total weighted late work. J Comput 7(2):232-242
    • (1995) J Comput , vol.7 , Issue.2 , pp. 232-242
    • Hariri, A.M.A.1    Potts, C.N.2    Van Wassenhove, L.N.3
  • 8
    • 0003614971 scopus 로고    scopus 로고
    • Industrial scheduling
    • PWS, Boston, MA
    • Sule DR (1997) Industrial scheduling. PWS, Boston, MA
    • (1997)
    • Sule, D.R.1

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