Advanced Search
Volume 24 Issue 1
Jan.  1998
Turn off MathJax
Article Contents
Journal of Beijing University of Aeronautics and Astronautics  > 1998  >  24(1): 83-87.
Shen Yingjun, Huang Haijun, Wu Sa, et al. New Scheduling Heuristic for the Permutation Flowshop Problem[J]. Journal of Beijing University of Aeronautics and Astronautics, 1998, 24(1): 83-87. (in Chinese)
Citation: Shen Yingjun, Huang Haijun, Wu Sa, et al. New Scheduling Heuristic for the Permutation Flowshop Problem[J]. Journal of Beijing University of Aeronautics and Astronautics, 1998, 24(1): 83-87. (in Chinese)
shu

New Scheduling Heuristic for the Permutation Flowshop Problem

  • 1.

    Beijing University of Aeronautics and Astronautics,Dept. of School of Management

  • 2. Beijing University of Aeronautics and Astronautics,System Engineering of Engineering Technology

  • 3. Beijing University of Aeronautics and Astronautics,Dept. of School of Astronautics

  • Received Date: 29 Mar 1996
  • Publish Date: 31 Jan 1998
    Abstract
  • The permutation flowshop problem,which is a class of NP problems that are often encountered in scheduling of manufacturing systems,has not been completely solved either in theory or in application. A new heuristic method,named WSH,is proposed in this paper to solve the permutation flowshop problem. This heuristic aims to minimize the total process time of all jobs. The comparison between this method and others reported in literature until now,is presented on the basis of results from many numerical examples. The results show that WSH,simple in structure and excellent in computational efficiency,is a good method to solve small-size and medium-size problems.

     

    • FullText(HTML)
  • loading
    • References(1)
  • 1. 陈荣秋.排序的理论与方法.武汉:华中理工大学出版社,1987 2. Sarin S,Lefoka M.Scheduling heuristic for the n job m machine flowshop.Omega,1993,21(2):229-234 3. Germain R,Sriskan D C.A heuristic for job shop scheduling.IFAC Proceeding Series,1985 4. Palmer D S.Sequencing jobs through a multi stage process in the minimum total time——a quick method of obtaining a near optimum.Ops Res Q,1965,16:101~107 5. Dannenbring D G.An evaluation of flowshop sequencing heuristics.Mgmt Sci,1977,23:1174~1182 6. Campbell H G,Dudek R A,Smith M L.A heuristics algorithm for the n-job m-machine flowshop sequencing problem.Mgmt Sci,1970,16:B630~B637 7. 沈英俊.同顺序Flowshop排序问题的启发式算法研究:[学位论文].北京:北京航空航天大学管理学院,1996
    • 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(2903) PDF downloads(955) 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