메뉴 건너뛰기




Volumn 31, Issue 2, 1996, Pages 155-160

A genetic algorithm for job shop scheduling - A case study

Author keywords

Branch and bound algorithm; Dispatching rules; Genetic algorithm; Job shop scheduling

Indexed keywords

EFFICIENCY; GENETIC ALGORITHMS; JOB ANALYSIS; OPTIMIZATION; PERFORMANCE;

EID: 0030286613     PISSN: 01663615     EISSN: None     Source Type: Journal    
DOI: 10.1016/0166-3615(96)00043-7     Document Type: Article
Times cited : (23)

References (11)
  • 4
    • 0026930899 scopus 로고
    • New search spaces for sequencing problems with applications to job shop
    • R.H. Storer, S.D. Wu and R. Vaccari, "New search spaces for sequencing problems with applications to job shop", Management Science, Vol. 38, 1992, pp. 1495-1509.
    • (1992) Management Science , vol.38 , pp. 1495-1509
    • Storer, R.H.1    Wu, S.D.2    Vaccari, R.3
  • 8
    • 0027906589 scopus 로고
    • Minimizing flow time variance in a single machine system using genetic algorithms
    • M.C. Gupta, Y.P. Gupta and Anup Kumar, "Minimizing flow time variance in a single machine system using genetic algorithms", European Journal of Operational Research, 1993, pp. 289-303.
    • (1993) European Journal of Operational Research , pp. 289-303
    • Gupta, M.C.1    Gupta, Y.P.2    Kumar, A.3
  • 9
    • 0030192321 scopus 로고    scopus 로고
    • Scheduling in flow shop and cellular manufacturing systems with multiple objectives - A genetic algorithmic approach
    • to appear in
    • J. Sridhar and C. Rajendran, "Scheduling in flow shop and cellular manufacturing systems with multiple objectives - A genetic algorithmic approach", to appear in Production Planning and Control.
    • Production Planning and Control
    • Sridhar, J.1    Rajendran, C.2


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