메뉴 건너뛰기




Volumn 12, Issue 5, 2006, Pages 731-736

Research on multi-objective optimization for flexible job shop scheduling

Author keywords

Flexible job shop; Genetic algorithm; Multi objective scheduling; Niche technology; Random weigh method

Indexed keywords

CHROMOSOMES; COMPUTER SIMULATION; DECODING; ENCODING (SYMBOLS); FLEXIBLE MANUFACTURING SYSTEMS; GENETIC ALGORITHMS; MACHINE SHOP PRACTICE; MATHEMATICAL MODELS; OPTIMIZATION; SCHEDULING; SYNCHRONIZATION;

EID: 33746559361     PISSN: 10065911     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article
Times cited : (47)

References (10)
  • 2
    • 0025531716 scopus 로고
    • Job-shop scheduling with multipurpose machines
    • BRUKER P, SCHLIE R. Job-shop scheduling with multipurpose machines[J]. Computing, 1990, 45(4): 369-375.
    • (1990) Computing , vol.45 , Issue.4 , pp. 369-375
    • Bruker, P.1    Schlie, R.2
  • 3
    • 34250084648 scopus 로고
    • Routing and scheduling in a flexible job shop by taboo search
    • BRANDIMARTE P. Routing and scheduling in a flexible job shop by taboo search[J]. Annals of Operations Research, 1993, 22(2): 157-183.
    • (1993) Annals of Operations Research , vol.22 , Issue.2 , pp. 157-183
    • Brandimarte, P.1
  • 4
    • 0034245064 scopus 로고    scopus 로고
    • Pareto simulated annealing for fuzzy multi-objective combinatorial optimization
    • HAPKE M. Pareto simulated annealing for fuzzy multi-objective combinatorial optimization[J]. Journal of Heuristics, 2000, 6(3): 329-345.
    • (2000) Journal of Heuristics , vol.6 , Issue.3 , pp. 329-345
    • Hapke, M.1
  • 5
    • 1042289055 scopus 로고    scopus 로고
    • Tardiness minimization in a flexible job shop: A tabu search approach
    • RIGAO C. Tardiness minimization in a flexible job shop: a tabu search approach[J]. Journal of Intelligent Manufacturing, 2004, 15(1): 103-115.
    • (2004) Journal of Intelligent Manufacturing , vol.15 , Issue.1 , pp. 103-115
    • Rigao, C.1
  • 6
    • 0042261208 scopus 로고    scopus 로고
    • An integrated approach for modeling and solving the general multiprocessor job-shop scheduling problem using tabu search
    • DAUZèR-PéRèS S, PAULLI J. An integrated approach for modeling and solving the general multiprocessor job-shop scheduling problem using tabu search[J]. Annals of Operations Research, 1997, 70(3): 281-306.
    • (1997) Annals of Operations Research , vol.70 , Issue.3 , pp. 281-306
    • Dauzèr-Pérès, S.1    Paulli, J.2
  • 7
    • 0002577337 scopus 로고    scopus 로고
    • Effective neighborhood functions for the flexible job shop problem
    • MASTROLILLI M, GAMBARDELLA L M. Effective neighborhood functions for the flexible job shop problem[J]. Journal of Scheduling, 2002, 3(1): 3-20.
    • (2002) Journal of Scheduling , vol.3 , Issue.1 , pp. 3-20
    • Mastrolilli, M.1    Gambardella, L.M.2
  • 8
    • 0036464279 scopus 로고    scopus 로고
    • Approach by localization and multi-objective evolutionary optimization for flexible job-shop scheduling problems
    • Piscatway, NJ, USA: IEEE
    • KACEM I, HAMMADI S, BORNE P. Approach by localization and multi-objective evolutionary optimization for flexible job-shop scheduling problems[A]. IEEE Transactions on Systems, Man and Cybernetics, Part C[C]. Piscatway, NJ, USA: IEEE, 2002, 32(1): 408-419.
    • (2002) IEEE Transactions on Systems, Man and Cybernetics, Part C , vol.32 , Issue.1 , pp. 408-419
    • Kacem, I.1    Hammadi, S.2    Borne, P.3
  • 9
    • 0004055749 scopus 로고    scopus 로고
    • Genetic algorithm theory and applications
    • Chinese source, Beijing: National Defense Industry Publisher
    • ZHOU Ming, SUN Shudong. Genetic algorithm theory and applications[D]. Beijing: National Defense Industry Publisher, 1999. 133-134(in Chinese)
    • (1999) , pp. 133-134
    • Zhou, M.1    Sun, S.2
  • 10
    • 0032120699 scopus 로고    scopus 로고
    • A genetic algorithm for multiple objective sequencing problems in mixed model assembly lines
    • HYUN C J, KIM Y, KIM Y K. A genetic algorithm for multiple objective sequencing problems in mixed model assembly lines[J]. Computers and Operations Research, 1998, 25(7/8): 675-690.
    • (1998) Computers and Operations Research , vol.25 , Issue.7-8 , pp. 675-690
    • Hyun, C.J.1    Kim, Y.2    Kim, Y.K.3


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