期刊文献+

A Fast Method for Heuristics in Large-Scale Flow Shop Scheduling 被引量:2

A Fast Method for Heuristics in Large-Scale Flow Shop Scheduling
原文传递
导出
摘要 Fast computation methods are needed for the heuristics of flow shop scheduling problems in practical manufacturing environments. This paper describes a generalized flow shop model, which is an extension of the classical model, in which not all machines are available at time zero. The general completiontime computing method is used to compute completion time of generalized flow shops. The transform classical flow shop to generalized shop (TCG) method is used to transform classical schedules into generalized schedules with less jobs. INSERT and SWAP, extended from job-insertion and pair-wise exchange which are fundamental procedures used in most heuristics for classical flow shops, reduce the CPU time by 1/2 and 1/3, respectively. The CPU time of 14 job-insertion and pair-wise exchange-based heuristics are analyzed with and without the TCG method. The results show that TCG considerably reduces the CPU time Fast computation methods are needed for the heuristics of flow shop scheduling problems in practical manufacturing environments. This paper describes a generalized flow shop model, which is an extension of the classical model, in which not all machines are available at time zero. The general completiontime computing method is used to compute completion time of generalized flow shops. The transform classical flow shop to generalized shop (TCG) method is used to transform classical schedules into generalized schedules with less jobs. INSERT and SWAP, extended from job-insertion and pair-wise exchange which are fundamental procedures used in most heuristics for classical flow shops, reduce the CPU time by 1/2 and 1/3, respectively. The CPU time of 14 job-insertion and pair-wise exchange-based heuristics are analyzed with and without the TCG method. The results show that TCG considerably reduces the CPU time
出处 《Tsinghua Science and Technology》 SCIE EI CAS 2006年第1期12-18,共7页 清华大学学报(自然科学版(英文版)
基金 Supported by the National Key Basic Research and Development Program (973) of China (No. 2002CB312205), the China Postdoctoral Science Foundation (No. 2003033150), the Natural Science Foundation of Heilongjiang Province (No. F0207), the Youth Foundation of Harbin City (No. 2002AFQXJ033), and the Science and Technology Foundation of Heilongjiang Education Bureau (No. 10531056)
关键词 scheduling HEURISTIC flow shop total completion-time scheduling heuristic flow shop total completion-time
  • 相关文献

参考文献9

  • 1Baker K R.Introduction to Sequencing and Scheduling[]..1974
  • 2Nawaz M,Enscore E E,Ham I.A heuristic algorithm for the m-machine n-job flow-shop sequencing problem[].Omega.1983
  • 3French S.Sequencing and Scheduling: An Introduction to the Mathematics of the Job-Shop[]..1982
  • 4Framinan J M,Leisten R,Ruiz-Usano R.Efficient heuris- tics for flowshop sequencing with the objectives of makespan and flowtime minimization[].European Journal of Operational Research.2002
  • 5Tailard E.Benchmarks for basic scheduling problems[].European Journal of Operational Research.1993
  • 6Framinan J M,Leisten R,Rajendran C.Different initial se- quences for the heuristic of Nawaz, Enscore and Ham to minimize makespan, idletime or flowtime in the static permutation flowshop sequencing problem[].International Journal of Production Research.2003
  • 7Rajendran C,Chaudhuri D.An efficient heuristic approach to the scheduling of jobs in a flowshop[].European Journal of Operational Research.1991
  • 8Rajendran C,Ziegler H.An efficient heuristic for schedul- ing in a flowshop to minimize total weighted flowtime of jobs[].European Journal of Operational Research.1997
  • 9Framinan J M,Leisten R.An efficient constructive heuris- tic for flowtime minimisation in permutation flow shops[].Omega.2003

同被引文献17

引证文献2

二级引证文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部