메뉴 건너뛰기




Volumn 3, Issue , 2000, Pages 2001-2003

Using chaos-parallel evolutionary programming to solve the flow-shop scheduling problem

Author keywords

Chaos; Evolutionary programming; Flow shop scheduling problem; Parallel

Indexed keywords

CHAOS THEORY; COMPUTER SIMULATION; EVOLUTIONARY ALGORITHMS; PROBLEM SOLVING;

EID: 0034591406     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (2)

References (6)
  • 1
    • 0003075019 scopus 로고
    • Optimal two-and-three stage production schedules
    • Johnson D.S., Optimal Two-and-Three Stage Production Schedules. Nawl Research Logistics Quatrerly, 1954, p. 61-68
    • (1954) Nawl Research Logistics Quatrerly , pp. 61-68
    • Johnson, D.S.1
  • 2
    • 0017918132 scopus 로고
    • Flow-shop and job-shop schedules: Complexity and approximation
    • Gonzalez T., Sahni S., Flow-shop and Job-shop Schedules: Complexity and Approximation, Operation Researh, 1978, Vol. 20, p. 36-52
    • (1978) Operation Researh , vol.20 , pp. 36-52
    • Gonzalez, T.1    Sahni, S.2
  • 3
    • 0025571942 scopus 로고
    • Scheduling of serial multiproduct batch processes via simulated annealing
    • Das H., Cummings P.T., Le Van D.M., Scheduling of Serial Multiproduct Batch Processes via Simulated Annealing, Compt Chen Engng, 1990, Vol. 14(12), p. 1351-1362
    • (1990) Compt Chen Engng , vol.14 , Issue.12 , pp. 1351-1362
    • Das, H.1    Cummings, P.T.2    Le Van, D.M.3
  • 4
    • 0012599241 scopus 로고    scopus 로고
    • Chinese source
  • 5
    • 0012549873 scopus 로고    scopus 로고
    • Chinese source
  • 6
    • 0012495873 scopus 로고    scopus 로고
    • Chinese source


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