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) |
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
|