메뉴 건너뛰기




Volumn 4, Issue , 2009, Pages 81-85

A genetic algorithm-based approach to flexible job-shop scheduling problem

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL SEARCH; FLEXIBLE JOB-SHOP SCHEDULING PROBLEM; HARD PROBLEMS; IMPROVED GENETIC ALGORITHMS; INITIAL POPULATION; INTELLIGENT MUTATION; MAKESPAN; ON-MACHINES;

EID: 77950554767     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICNC.2009.609     Document Type: Conference Paper
Times cited : (14)

References (11)
  • 1
    • 37049003027 scopus 로고    scopus 로고
    • A genetic local search algorithm for minimizing total weighted tardiness in the job-shop scheduling problem
    • Imen Essafi, Yazid Mati, Stephane Dauzere-Peres, "A genetic local search algorithm for minimizing total weighted tardiness in the job-shop scheduling problem", Computers & Operations Research, 2008,35(2008). 2599-2616. (Pubitemid 350245426)
    • (2008) Computers and Operations Research , vol.35 , pp. 2599-2616
    • Essafi, I.1    Mati, Y.2    Dauzere-Peres, S.3
  • 2
    • 0033102020 scopus 로고    scopus 로고
    • Deterministic job-shop scheduling: Past, present and future
    • Jain AS, Meeran S. "Deterministic job-shop scheduling: past, present and future", European Journal of Operational Research, 1999, 113(2). 390-434.
    • (1999) European Journal of Operational Research , vol.113 , Issue.2 , pp. 390-434
    • Jain, A.S.1    Meeran, S.2
  • 4
    • 53749102032 scopus 로고    scopus 로고
    • Multiobjective flexible job shop schedule: Design and evaluation by simulation modeling
    • Li-Ning Xing, Ying-Wu Chen, Ke-Wei Yang, "Multiobjective flexible job shop schedule: Design and evaluation by simulation modeling", Applied Soft Computing, 2009, 9(2009). 362-376.
    • (2009) Applied Soft Computing , vol.9 , Issue.2009 , pp. 362-376
    • Xing, L.-N.1    Chen, Y.-W.2    Yang, K.-W.3
  • 6
    • 53449101643 scopus 로고    scopus 로고
    • Tabu search for discrete-continuous scheduling problems with heuristic continuous resource allocation
    • Grzegorz Waligora, "Tabu search for discrete-continuous scheduling problems with heuristic continuous resource allocation", European Journal of Operational Research, 2009, 193(2009). 849-856.
    • (2009) European Journal of Operational Research , vol.193 , Issue.2009 , pp. 849-856
    • Waligora, G.1
  • 7
    • 41749104232 scopus 로고    scopus 로고
    • A tabu search and a genetic algorithm for solving a bicriteria general job shop scheduling problem
    • Geoffrey Vilcot, Jean-Charles Billaut, "A tabu search and a genetic algorithm for solving a bicriteria general job shop scheduling problem", European Journal of Operational Research, 2008,190(2008). 398-411.
    • (2008) European Journal of Operational Research , vol.190 , Issue.2008 , pp. 398-411
    • Vilcot, G.1    Billaut, J.-C.2
  • 8
    • 0001251144 scopus 로고
    • Job-shop scheduling: Computational study of local search and large-step optimization methods
    • Lourenco HR, "Job-shop scheduling: computational study of local search and large-step optimization methods", European Journal of Operational Research, 1995, 83. 347-364
    • (1995) European Journal of Operational Research , vol.83 , pp. 347-364
    • Lourenco, H.R.1
  • 10
    • 40249118429 scopus 로고    scopus 로고
    • A genetic algorithm for the flexible job-shop scheduling problem
    • F. Pezzella, G. Morganti, G. Ciaschetti, "A genetic algorithm for the Flexible Job-shop Scheduling Problem", Computers & Operations Research, 2008, 35(2008). 3202-3212. (Pubitemid 351335142)
    • (2008) Computers and Operations Research , vol.35 , Issue.10 , pp. 3202-3212
    • Pezzella, F.1    Morganti, G.2    Ciaschetti, G.3


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