Advanced Search
Volume 24 Issue 1
Jan.  1998
Turn off MathJax
Article Contents
Journal of Beijing University of Aeronautics and Astronautics  > 1998  >  24(1): 75-78.
Han Limin, Huang Hongxuan, Feng Yunchenget al. Job Shop Scheduling by Simulated AnnealingAlgorithm Combined with Tabu Search[J]. Journal of Beijing University of Aeronautics and Astronautics, 1998, 24(1): 75-78. (in Chinese)
Citation: Han Limin, Huang Hongxuan, Feng Yunchenget al. Job Shop Scheduling by Simulated AnnealingAlgorithm Combined with Tabu Search[J]. Journal of Beijing University of Aeronautics and Astronautics, 1998, 24(1): 75-78. (in Chinese)
shu

Job Shop Scheduling by Simulated AnnealingAlgorithm Combined with Tabu Search

  • Beijing University of Aeronautics and Astronautics,School of Management

  • Received Date: 20 Dec 1996
  • Publish Date: 31 Jan 1998
    Abstract
  • This paper describes an approximation algorithm for the problem of finding the minimum makespan in a job shop.The algorithm is based on simulated annealing algorithm and tabu search,two generalizations of the well known iterative improvement approach to combinatorial optimization problems.First a start solution is found by the simulated annealing algorithm,then tabu search is used to seek the better solution in order to compensate the disadvantage of large running times by single simulated annealing algorithm.The algorithm in this paper is proved effective and efficient both in computation and convergence by analyzing the results of some experiments on it.

     

    • FullText(HTML)
  • loading
    • References(1)
  • 1. Simon French B A,Phil D.Sequence and scheduling: An introduction to the mathematics of the Job Shop.Chichester:Ellis Horwood Limited,1982 2. 刘 勇,康立山,陈毓屏.非数值并行算法——模拟退火算法.北京: 科学出版社,1995 3. Glover F.Future paths for integer programming and links to artificial intelligence.Computers Ops Res,1986,13(5): 533~549 4. Reeves C.Modern heuristic techniques for combinatorial problems.Oxford:Blackwell Scientific,1993 5. Laarhover R J,Aarts E H ,Lenstra J K.Job shop scheduling by simulated annealing.Operation Research,1992,40(1): 113~125 6. Adams J,Balas E ,Zawack D.The shifting bottleneck procedure for job shop scheduling.Management Sci,1988,34(3):391~401 7. Glover F,Kelly J P,Laguna M.Genetic algorithms and tabu search hybrids for optimization.Computers Ops Res,1995,22(1): 111~134
    • Relative Articles
    • Supplements(0)
    • Cited By
  • 加载中

Catalog

    通讯作者: 陈斌, bchen63@163.com
    • 1. 

      沈阳化工大学材料科学与工程学院 沈阳 110142

    1. 本站搜索
    2. 百度学术搜索
    3. 万方数据库搜索
    4. CNKI搜索
    Get Citation
    PDF
    XML

    Article Metrics

    Article views(2448) PDF downloads(878) Cited by()
    Proportional views
    Related

    Copyright © Journal of Beijing University of Aeronautics and Astronautics

    Address: Editorial Department of Journal of Beijing University of Aeronautics and Astronautics, 37 Xueyuan Road, Haidian District, Beijing Post Code: 100191 Email: jbuaa@buaa.edu.cn

    Supported by: Beijing Renhe Information Technology Co., Ltd.    

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return